Motion Planning for Robotics: A Review for Sampling-based Planners
arXiv:2410.19414 · doi:10.1016/j.birob.2024.100207
Abstract
Recent advancements in robotics have transformed industries such as manufacturing, logistics, surgery, and planetary exploration. A key challenge is developing efficient motion planning algorithms that allow robots to navigate complex environments while avoiding collisions and optimizing metrics like path length, sweep area, execution time, and energy consumption. Among the available algorithms, sampling-based methods have gained the most traction in both research and industry due to their ability to handle complex environments, explore free space, and offer probabilistic completeness along with other formal guarantees. Despite their widespread application, significant challenges still remain. To advance future planning algorithms, it is essential to review the current state-of-the-art solutions and their limitations. In this context, this work aims to shed light on these challenges and assess the development and applicability of sampling-based methods. Furthermore, we aim to provide an in-depth analysis of the design and evaluation of ten of the most popular planners across various scenarios. Our findings highlight the strides made in sampling-based methods while underscoring persistent challenges. This work offers an overview of the important ongoing research in robotic motion planning.
20 pages, 11 figures
References in corpus (17)
- Batch Informed Trees (BIT*): Sampling-based Optimal Planning via the Heuristically Guided Search of Implicit Random Geometric Graphs
- Intelligent bidirectional rapidly-exploring random trees for optimal motion planning in complex cluttered environments
- Potential Functions based Sampling Heuristic For Optimal Path Planning
- Batch Informed Trees (BIT*): Informed Asymptotically Optimal Anytime Search
- Potentially Guided Bidirectionalized RRT* for Fast Optimal Path Planning in Cluttered Environments
- An Extensible Benchmarking Infrastructure for Motion Planning Algorithms
- dRRT*: Scalable and Informed Asymptotically-Optimal Multi-Robot Motion Planning
- Asymptotically Optimal Sampling-Based Motion Planning Methods
- AIT* and EIT*: Asymmetric bidirectional sampling-based path planning
- Kinodynamic RRT*: Optimal Motion Planning for Systems with Linear Differential Constraints
- Sampling-based optimal kinodynamic planning with motion primitives
- Newton methods for k-order Markov Constrained Motion Problems
- A Tree-based Next-best-trajectory Method for 3D UAV Exploration
- The Surface Edge Explorer (SEE): A measurement-direct approach to next best view planning
- Flexible Informed Trees (FIT*): Adaptive Batch-Size Approach in Informed Sampling-Based Path Planning
- Elliptical K-Nearest Neighbors -- Path Optimization via Coulomb's Law and Invalid Vertices in C-space Obstacles
- Safe Interval RRT* for Scalable Multi-Robot Path Planning in Continuous Space
Cited by in corpus (5)
- Estimated Informed Anytime Search for Sampling-Based Planning via Adaptive Sampler
- Tree-Based Grafting Approach for Bidirectional Motion Planning with Local Subsets Optimization
- Genetic Informed Trees (GIT*): Path Planning via Reinforced Genetic Programming Heuristics
- APT*: Asymptotically Optimal Motion Planning via Adaptively Prolated Elliptical R-Nearest Neighbors
- Toward Generalist Neural Motion Planners for Robotic Manipulators: Challenges and Opportunities