Search-Based Robot Motion Planning With Distance-Based Adaptive Motion Primitives
The work proposes a motion planning algorithm for robotic manipulators that merges sampling and search methods using burs of free configuration space as adaptive motion primitives. This adaptation allows the planner to efficiently explore configuration space by dynamically generating paths, significantly reducing planning time and node expansions compared to using fixed-sized steps.