Sampling-Based Motion Planning: A Comparative Review (2309.13119v1)
Abstract: Sampling-based motion planning is one of the fundamental paradigms to generate robot motions, and a cornerstone of robotics research. This comparative review provides an up-to-date guideline and reference manual for the use of sampling-based motion planning algorithms. This includes a history of motion planning, an overview about the most successful planners, and a discussion on their properties. It is also shown how planners can handle special cases and how extensions of motion planning can be accommodated. To put sampling-based motion planning into a larger context, a discussion of alternative motion generation frameworks is presented which highlights their respective differences to sampling-based motion planning. Finally, a set of sampling-based motion planners are compared on 24 challenging planning problems. This evaluation gives insights into which planners perform well in which situations and where future research would be required. This comparative review thereby provides not only a useful reference manual for researchers in the field, but also a guideline for practitioners to make informed algorithmic decisions.
- Karaman S, Frazzoli E. 2011. Sampling-based algorithms for optimal motion planning. International Journal of Robotics Research 30(7):846–894
- Lozano-Pérez T, Wesley MA. 1979. An algorithm for planning collision-free paths among polyhedral obstacles. Communications of the ACM 22(10):560–570
- Lozano-Perez T. 1983. Spatial planning: A configuration space approach. IEEE Transactions on Computers 2(C-32):108–120
- Schwartz JT, Sharir M. 1983. On the “piano movers” problem. II. General techniques for computing topological properties of real algebraic manifolds. Advances in Applied Mathematics 4(3):298–351
- Reif JH. 1979. Complexity of the mover’s problem and generalizations. In Conference on Foundations of Computer Science, pp. 421–427
- Canny J. 1988. The complexity of robot motion planning. MIT press
- Khatib O. 1986. Real-time obstacle avoidance for manipulators and mobile robots. In Autonomous Robot Vehicles. Springer
- Sato K. 1992. Deadlock-free motion planning using the laplace potential field. Advanced Robotics 7(5):449–461
- Koditschek DE, Rimon E. 1990. Robot navigation functions on manifolds with boundary. Advances in Applied Mathematics 11(4):412–442
- Barraquand J, Latombe JC. 1991. Robot motion planning: A distributed representation approach. International Journal of Robotics Research 10(6):628–649
- Sánchez G, Latombe JC. 2003. A single-query bi-directional probabilistic roadmap planner with lazy collision checking. In International Journal of Robotics Research. Springer
- Lavalle SM. 1998. Rapidly-exploring random trees: A new tool for path planning. Tech. rep., Iowa State University
- Van den Berg JP, Overmars MH. 2005. Using workspace information as a guide to non-uniform sampling in probabilistic roadmap planners. International Journal of Robotics Research 24(12):1055–1071
- Geraerts R, Overmars MH. 2007. Creating high-quality paths for motion planning. International Journal of Robotics Research 26(8):845–863
- Van den Berg J, Overmars M. 2008. Planning time-minimal safe paths amidst unpredictably moving obstacles. International Journal of Robotics Research 27(11-12):1274–1294
- Solovey K, Kleinbort M. 2020. The critical radius in sampling-based motion planning. International Journal of Robotics Research 39(2-3):266–285
- Lien JM, Lu Y. 2009. Planning motion in environments with similar obstacles. Robotics: Science and Systems
- Lehner P, Albu-Schaeffer A. 2018. The repetition roadmap for repetitive constrained motion planning. IEEE Robotics and Automation Letters 3(3):3884–3891
- LaValle SM. 2006. Planning Algorithms. Cambridge University Press
- Lynch KM, Park FC. 2017. Modern robotics. Cambridge University Press
- Farber M. 2003. Topological complexity of motion planning. Discrete and Computational Geometry 29(2):211–221
- Lee JM. 2003. Introduction to Smooth Manifolds. New York, NY: Springer New York
- Wilson WA. 1931a. On quasi-metric spaces. American Journal of Mathematics 53(3):675–684
- Wilson WA. 1931b. On semi-metric spaces. American Journal of Mathematics 53(2):361–373
- Dobson A, Bekris KE. 2014. Sparse roadmap spanners for asymptotically near-optimal motion planning. International Journal of Robotics Research 33(1):18–47
- Hauser K. 2015. Lazy collision checking in asymptotically-optimal motion planning. In IEEE International Conference on Robotics and Automation, pp. 2951–2957
- Pearl J. 1984. Heuristics: intelligent search strategies for computer problem solving. Addison-Wesley Longman Publishing Co., Inc.
- Şucan IA, Kavraki LE. 2011. A sampling-based tree planner for systems with complex dynamics. IEEE Transactions on Robotics 28(1):116–131
- Li S, Dantam N. 2021. Learning Proofs of Motion Planning Infeasibility. In Robotics: Science and Systems
- Dubins LE. 1957. On curves of minimal length with a constraint on average curvature, and with prescribed initial and terminal positions and tangents. American Journal of mathematics 79(3):497–516
- Reeds J, Shepp L. 1990. Optimal paths for a car that goes both forwards and backwards. Pacific Journal of Mathematics 145(2):367–393
- Hauser K, Zhou Y. 2016. Asymptotically optimal planning by feasible kinodynamic planning in a state–cost space. IEEE Transactions on Robotics 32(6):1431–1443
- Otte M, Frazzoli E. 2016. RRTX: Asymptotically optimal single-query sampling-based motion planning with quick replanning. International Journal of Robotics Research 35(7):797–822
- Elimelech K, Indelman V. 2022. Simplified decision making in the belief space using belief sparsification. International Journal of Robotics Research 41(5):470–496
- Boyd S, Vandenberghe L. 2004. Convex Optimization. Cambridge University Press
- Hauser K. 2014. Fast interpolation and time-optimization with contact. International Journal of Robotics Research 33(9):1231–1250
- Schaal S. 2006. Dynamic movement primitives-a framework for motor control in humans and humanoid robotics. In Adaptive motion of animals and machines. Springer
- Kober J, Peters J. 2011. Policy search for motor primitives in robotics. Machine Learning 84(1-2):171–203
- Giszter SF. 2015. Motor primitives—new data and future questions. Current Opinion in Neurobiology 33:156–165
- Graziano M. 2008. The intelligent movement machine: An ethological perspective on the primate motor system. Oxford University Press
- Majumdar A, Tedrake R. 2017. Funnel libraries for real-time robust feedback motion planning. International Journal of Robotics Research 36(8):947–982
- Sutton RS, Barto AG. 2018. Reinforcement learning: An introduction. MIT press
- Elbanhawi M, Simic M. 2014. Sampling-based robot motion planning: A review. IEEE Access 2:56–77