{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,28]],"date-time":"2026-08-28T23:38:52Z","timestamp":1787960332596,"version":"build-2784847793"},"reference-count":146,"publisher":"Annual Reviews","issue":"1","license":[{"start":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T00:00:00Z","timestamp":1720569600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024,7,10]]},"abstract":"<jats:p>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 guide and reference manual for the use of sampling-based motion planning algorithms. It includes a history of motion planning, an overview of the most successful planners, and a discussion of their properties. It also shows 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 highlights their respective differences from sampling-based motion planning. Finally, a set of sampling-based motion planners are compared on 24 challenging planning problems in order to provide 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 guide for practitioners to make informed algorithmic decisions.<\/jats:p>","DOI":"10.1146\/annurev-control-061623-094742","type":"journal-article","created":{"date-parts":[[2023,11,21]],"date-time":"2023-11-21T15:45:20Z","timestamp":1700581520000},"page":"285-310","source":"Crossref","is-referenced-by-count":137,"title":["Sampling-Based Motion Planning: A Comparative Review"],"prefix":"10.1146","volume":"7","author":[{"given":"Andreas","family":"Orthey","sequence":"first","affiliation":[{"name":"1Realtime Robotics, Boston, Massachusetts, USA; email: aorthey@rtr.ai"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Constantinos","family":"Chamzas","sequence":"additional","affiliation":[{"name":"2Department of Computer Science, Rice University, Houston, Texas, USA; email: chamzas@rice.edu, kavraki@rice.edu"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lydia E.","family":"Kavraki","sequence":"additional","affiliation":[{"name":"2Department of Computer Science, Rice University, Houston, Texas, USA; email: chamzas@rice.edu, kavraki@rice.edu"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"22","reference":[{"issue":"4","key":"B1","doi-asserted-by":"crossref","first-page":"566","DOI":"10.1109\/70.508439","article-title":"Probabilistic roadmaps for path planning in high-dimensional configuration spaces","volume":"12","year":"1996","journal-title":"IEEE Trans. Robot."},{"issue":"4\u20135","key":"B2","first-page":"495","article-title":"Path planning in expansive configuration spaces","volume":"9","year":"1999","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"B3","first-page":"995","article-title":"RRT-Connect: an efficient approach to single-query path planning","volume-title":"2000 IEEE International Conference on Robotics and Automation","volume":"2","year":"2000"},{"issue":"7","key":"B4","doi-asserted-by":"crossref","first-page":"846","DOI":"10.1177\/0278364911406761","article-title":"Sampling-based algorithms for optimal motion planning","volume":"30","year":"2011","journal-title":"Int. J. Robot. Res."},{"issue":"1","key":"B5","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1109\/TRO.2022.3198020","article-title":"Long-horizon multi-robot rearrangement planning for construction assembly","volume":"39","year":"2023","journal-title":"IEEE Trans. Robot."},{"issue":"4","key":"B6","doi-asserted-by":"crossref","first-page":"856","DOI":"10.1109\/TRO.2018.2853613","article-title":"Trajectory planning for quadrotor swarms","volume":"34","year":"2018","journal-title":"IEEE Trans. Robot."},{"issue":"5","key":"B7","first-page":"1826","article-title":"A review of motion planning for highway autonomous driving","volume":"21","year":"2019","journal-title":"IEEE Trans. Intell. Transp. Syst."},{"key":"B8","article-title":"Robot motion planning on a chip","volume-title":"Robotics: Science and Systems XII","year":"2016"},{"issue":"4","key":"B9","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/j.cosrev.2012.07.002","article-title":"Motion planning algorithms for molecular simulations: a survey","volume":"6","year":"2012","journal-title":"Comput. Sci. Rev."},{"issue":"2","key":"B10","doi-asserted-by":"crossref","first-page":"882","DOI":"10.1109\/LRA.2021.3133603","article-title":"MotionBenchMaker: a tool to generate and benchmark motion planning datasets","volume":"7","year":"2022","journal-title":"IEEE Robot. Autom. Lett."},{"key":"B11","doi-asserted-by":"crossref","first-page":"2902","DOI":"10.1109\/ROBOT.2010.5509685","article-title":"Search-based planning for manipulation with motion primitives","volume-title":"2010 IEEE International Conference on Robotics and Automation","year":"2010"},{"key":"B12","first-page":"361","article-title":"A tutorial on Newton methods for constrained trajectory optimization and relations to SLAM, Gaussian process smoothing, optimal control, and probabilistic inference","volume-title":"Geometric and Numerical Foundations of Movements","year":"2017"},{"issue":"3","key":"B13","doi-asserted-by":"crossref","first-page":"968","DOI":"10.1109\/TASE.2021.3053422","article-title":"RMPflow: a geometric framework for generation of multitask motion policies","volume":"18","year":"2021","journal-title":"IEEE Trans. Autom. Sci. Eng."},{"issue":"11","key":"B14","doi-asserted-by":"crossref","first-page":"1238","DOI":"10.1177\/0278364913495721","article-title":"Reinforcement learning in robotics: a survey","volume":"32","year":"2013","journal-title":"Int. J. Robot. Res."},{"issue":"10","key":"B15","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1145\/359156.359164","article-title":"An algorithm for planning collision-free paths among polyhedral obstacles","volume":"22","year":"1979","journal-title":"Commun. ACM"},{"issue":"2","key":"B16","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1109\/TC.1983.1676196","article-title":"Spatial planning: a configuration space approach","volume":"C-32","year":"1983","journal-title":"IEEE Trans. Comput."},{"issue":"3","key":"B17","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1016\/0196-8858(83)90014-3","article-title":"On the ``piano movers'' problem. II. General techniques for computing topological properties of real algebraic manifolds","volume":"4","year":"1983","journal-title":"Adv. Appl. Math."},{"key":"B18","first-page":"421","article-title":"Complexity of the mover's problem and generalizations","volume-title":"20th Annual Symposium on Foundations of Computer Science","year":"1979"},{"key":"B19","first-page":"49","article-title":"New lower bound techniques for robot motion planning problems","volume-title":"28th Annual Symposium on Foundations of Computer Science","year":"1987"},{"key":"B20","volume-title":"The Complexity of Robot Motion Planning","year":"1988"},{"key":"B21","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1007\/978-1-4613-8997-2_29","article-title":"Real-time obstacle avoidance for manipulators and mobile robots","volume-title":"Autonomous Robot Vehicles","year":"1986"},{"issue":"5","key":"B22","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1163\/156855393X00285","article-title":"Deadlock-free motion planning using the laplace potential field","volume":"7","year":"1992","journal-title":"Adv. Robot."},{"key":"B23","first-page":"1","article-title":"Exact robot navigation by means of potential functions: some topological considerations","volume-title":"1987 IEEE International Conference on Robotics and Automation","volume":"1","year":"1987"},{"issue":"4","key":"B24","doi-asserted-by":"crossref","first-page":"412","DOI":"10.1016\/0196-8858(90)90017-S","article-title":"Robot navigation functions on manifolds with boundary","volume":"11","year":"1990","journal-title":"Adv. Appl. Math."},{"issue":"2","key":"B25","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1109\/21.148426","article-title":"Numerical potential field techniques for robot path planning","volume":"22","year":"1992","journal-title":"IEEE Trans. Syst. Man Cybernet."},{"issue":"11","key":"B26","doi-asserted-by":"crossref","first-page":"1119","DOI":"10.1177\/02783649922067753","article-title":"Motion planning: a journey of robots, molecules, digital actors, and other artifacts","volume":"18","year":"1999","journal-title":"Int. J. Robot. Res."},{"issue":"6","key":"B27","doi-asserted-by":"crossref","first-page":"628","DOI":"10.1177\/027836499101000604","article-title":"Robot motion planning: a distributed representation approach","volume":"10","year":"1991","journal-title":"Int. J. Robot. Res."},{"key":"B28","first-page":"403","article-title":"A single-query bi-directional probabilistic roadmap planner with lazy collision checking","volume-title":"Robotics Research: The Tenth International Symposium","year":"2003"},{"key":"B29","volume-title":"Rapidly-exploring random trees: a new tool for path planning","year":"1998"},{"key":"B30","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/978-1-4471-1021-7_28","article-title":"A random sampling scheme for path planning","volume-title":"Robotics Research: The Seventh International Symposium","year":"1996"},{"key":"B31","first-page":"155","article-title":"OBPRM: an obstacle-based PRM for 3D workspaces","volume-title":"Robotics: The Algorithmic Perspective","year":"1998"},{"key":"B32","first-page":"141","article-title":"On finding narrow passages with probabilistic roadmap planners","volume-title":"Robotics: The Algorithmic Perspective","year":"1998"},{"key":"B33","first-page":"4420","article-title":"The bridge test for sampling narrow passages with probabilistic roadmap planners","volume-title":"2003 IEEE International Conference on Robotics and Automation","volume":"3","year":"2003"},{"key":"B34","first-page":"1018","article-title":"The Gaussian sampling strategy for probabilistic roadmap planners","volume-title":"1999 IEEE International Conference on Robotics and Automation","volume":"2","year":"1999"},{"issue":"12","key":"B35","doi-asserted-by":"crossref","first-page":"1055","DOI":"10.1177\/0278364905060132","article-title":"Using workspace information as a guide to non-uniform sampling in probabilistic roadmap planners","volume":"24","year":"2005","journal-title":"Int. J. Robot. Res."},{"key":"B36","first-page":"97","article-title":"Efficient motion planning based on disassembly","volume-title":"Robotics: Science and Systems I","year":"2005"},{"key":"B37","first-page":"1618","article-title":"Workspace importance sampling for probabilistic roadmap planning","volume-title":"IEEE International Conference on Intelligent Robots and Systems","volume":"2","year":"2004"},{"key":"B38","first-page":"1024","article-title":"MAPRM: a probabilistic roadmap planner with sampling on the medial axis of the free space","volume-title":"1999 IEEE International Conference on Robotics and Automation","volume":"2","year":"1999"},{"key":"B39","first-page":"105","article-title":"Toward optimal configuration space sampling","volume-title":"Robotics: Science and Systems I","year":"2005"},{"key":"B40","first-page":"3856","article-title":"Dynamic-domain RRTs: efficient exploration by controlling the sampling domain","volume-title":"2005 IEEE International Conference on Robotics and Automation","year":"2005"},{"key":"B41","first-page":"297","article-title":"Motion planning for highly constrained spaces","volume-title":"Robot Motion and Control 2009","year":"2009"},{"issue":"8","key":"B42","doi-asserted-by":"crossref","first-page":"845","DOI":"10.1177\/0278364907079280","article-title":"Creating high-quality paths for motion planning","volume":"26","year":"2007","journal-title":"Int. J. Robot. Res."},{"issue":"11\u201312","key":"B43","first-page":"1274","article-title":"Planning time-minimal safe paths amidst unpredictably moving obstacles","volume":"27","year":"2008","journal-title":"Int. J. Robot. Res."},{"issue":"2","key":"B44","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1109\/TRO.2010.2098622","article-title":"A little more, a lot better: improving path quality by a path-merging algorithm","volume":"27","year":"2011","journal-title":"IEEE Trans. Robot."},{"key":"B45","doi-asserted-by":"crossref","first-page":"5068","DOI":"10.1109\/ICRA.2013.6631301","article-title":"Anytime solution optimization for sampling-based motion planning","volume-title":"2013 IEEE International Conference on Robotics and Automation","year":"2013"},{"issue":"2\u20133","key":"B46","first-page":"266","article-title":"The critical radius in sampling-based motion planning","volume":"39","year":"2020","journal-title":"Int. J. Robot. Res."},{"key":"B47","doi-asserted-by":"crossref","first-page":"3671","DOI":"10.1109\/ICRA.2012.6224742","article-title":"A robot path planning framework that learns from experience","volume-title":"2012 IEEE International Conference on Robotics and Automation","year":"2012"},{"key":"B48","first-page":"900","article-title":"Experience-based planning with sparse roadmap spanners","volume-title":"2015 IEEE International Conference on Robotics and Automation","year":"2015"},{"key":"B49","doi-asserted-by":"crossref","first-page":"89","DOI":"10.7551\/mitpress\/8727.003.0013","article-title":"Planning motion in environments with similar obstacles","volume-title":"Robotics: Science and Systems V","year":"2010"},{"issue":"3","key":"B50","first-page":"3884","article-title":"The repetition roadmap for repetitive constrained motion planning","volume":"3","year":"2018","journal-title":"IEEE Robot. Autom. Lett."},{"key":"B51","first-page":"1283","article-title":"Learning sampling distributions using local 3D workspace decompositions for motion planning in high dimensions","volume-title":"2021 IEEE International Conference on Robotics and Automation","year":"2021"},{"key":"B52","first-page":"7087","article-title":"Learning sampling distributions for robot motion planning","volume-title":"2018 IEEE International Conference on Robotics and Automation","year":"2018"},{"key":"B53","first-page":"7233","article-title":"Learning to retrieve relevant experiences for motion planning","volume-title":"2022 IEEE International Conference on Robotics and Automation","year":"2022"},{"issue":"4","key":"B54","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1561\/2300000063","article-title":"A survey on the integration of machine learning with sampling-based motion planning","volume":"9","year":"2022","journal-title":"Found. Trends Robot."},{"key":"B55","volume-title":"Principles of Robot Motion: Theory, Algorithms, and Implementations","year":"2005"},{"key":"B56","volume-title":"Planning Algorithms","year":"2006"},{"key":"B57","volume-title":"Modern Robotics","year":"2017"},{"issue":"2","key":"B58","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/s00454-002-0760-9","article-title":"Topological complexity of motion planning","volume":"29","year":"2003","journal-title":"Discrete Comput. Geom."},{"key":"B59","volume-title":"Introduction to Smooth Manifolds","year":"2003"},{"key":"B60","volume-title":"Topological Spaces","year":"1966"},{"issue":"3","key":"B61","doi-asserted-by":"crossref","first-page":"675","DOI":"10.2307\/2371174","article-title":"On quasi-metric spaces","volume":"53","year":"1931","journal-title":"Am. J. Math."},{"key":"B62","first-page":"3314","article-title":"ST-RRT*: asymptotically-optimal bidirectional motion planning through space-time","volume-title":"2022 IEEE International Conference on Robotics and Automation","year":"2022"},{"issue":"2","key":"B63","doi-asserted-by":"crossref","first-page":"361","DOI":"10.2307\/2370790","article-title":"On semi-metric spaces","volume":"53","year":"1931","journal-title":"Am. J. Math."},{"key":"B64","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1145\/1298306.1298331","article-title":"Towards network triangle inequality violation aware distributed systems","volume-title":"IMC '07: Proceedings of the 7th ACM SIGCOMM Conference on Internet Measurement","year":"2007"},{"key":"B65","first-page":"297","article-title":"Fast tree-based exploration of state space for robots with dynamics","volume-title":"Algorithmic Foundations of Robotics VI","year":"2004"},{"key":"B66","volume-title":"Introduction to Probability","volume":"1","year":"2008"},{"issue":"1","key":"B67","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1177\/0278364917714338","article-title":"Deterministic sampling-based motion planning: optimality, complexity, and performance","volume":"37","year":"2018","journal-title":"Int. J. Robot. Res."},{"issue":"2","key":"B68","first-page":"362","article-title":"Dispertio: optimal sampling for safe deterministic motion planning","volume":"5","year":"2019","journal-title":"IEEE Robot. Autom. Lett."},{"issue":"2","key":"B69","doi-asserted-by":"crossref","first-page":"978","DOI":"10.1109\/TRO.2022.3208502","article-title":"KDF: kinodynamic motion planning via geometric sampling-based algorithms and funnel control","volume":"39","year":"2023","journal-title":"IEEE Trans. Robot."},{"key":"B70","first-page":"4207","article-title":"Regionally accelerated batch informed trees (RABIT*): a framework to integrate local information into optimal path planning","volume-title":"2016 IEEE International Conference on Robotics and Automation","year":"2016"},{"key":"B71","first-page":"5113","article-title":"PRM-RL: long-range robotic navigation tasks by combining reinforcement learning and sampling-based planning","volume-title":"2018 IEEE International Conference on Robotics and Automation","year":"2018"},{"issue":"1","key":"B72","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1177\/0278364913498292","article-title":"Sparse roadmap spanners for asymptotically near-optimal motion planning","volume":"33","year":"2014","journal-title":"Int. J. Robot. Res."},{"issue":"3","key":"B73","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1109\/TRO.2016.2539377","article-title":"Asymptotically near-optimal RRT for fast, high-quality motion planning","volume":"32","year":"2016","journal-title":"IEEE Trans. Robot."},{"issue":"7","key":"B74","doi-asserted-by":"crossref","first-page":"883","DOI":"10.1177\/0278364915577958","article-title":"Fast marching tree: a fast marching sampling-based method for optimal motion planning in many dimensions","volume":"34","year":"2015","journal-title":"Int. J. Robot. Res."},{"key":"B75","first-page":"521","article-title":"Path planning using lazy PRM","volume-title":"2000 IEEE International Conference on Robotics and Automation","volume":"1","year":"2000"},{"key":"B76","first-page":"2951","article-title":"Lazy collision checking in asymptotically-optimal motion planning","volume-title":"2015 IEEE International Conference on Robotics and Automation","year":"2015"},{"key":"B77","first-page":"745","article-title":"Generalized lazy search for robot motion planning: interleaving search and edge evaluation via event-based toggles","volume-title":"Proceedings of the Twenty-Ninth International Conference on Automated Planning and Scheduling","year":"2019"},{"key":"B78","first-page":"52","article-title":"Rapidly-exploring quotient-space trees: motion planning using sequential simplifications","volume-title":"Robotics Research: The 19th International Symposium ISRR","year":"2019"},{"key":"B79","doi-asserted-by":"crossref","first-page":"1670","DOI":"10.1109\/ROBIO.2015.7419012","article-title":"RRT*-Connect: faster, asymptotically optimal motion planning","volume-title":"2015 IEEE International Conference on Robotics and Biomimetics (ROBIO)","year":"2015"},{"issue":"6","key":"B80","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1163\/156855300741960","article-title":"Visibility-based probabilistic roadmaps for motion planning","volume":"14","year":"2000","journal-title":"Adv. Robot."},{"issue":"5","key":"B81","doi-asserted-by":"crossref","first-page":"528","DOI":"10.1177\/0278364915614386","article-title":"Asymptotically optimal sampling-based kinodynamic planning","volume":"35","year":"2016","journal-title":"Int. J. Robot. Res."},{"key":"B82","volume-title":"Heuristics: Intelligent Search Strategies for Computer Problem Solving","year":"1984"},{"key":"B83","doi-asserted-by":"crossref","first-page":"2997","DOI":"10.1109\/IROS.2014.6942976","article-title":"Informed RRT*: optimal sampling-based path planning focused via direct sampling of an admissible ellipsoidal heuristic","volume-title":"2014 IEEE\/RSJ International Conference on Intelligent Robots and Systems","year":"2014"},{"issue":"5","key":"B84","doi-asserted-by":"crossref","first-page":"543","DOI":"10.1177\/0278364919890396","article-title":"Batch informed trees (BIT*): informed asymptotically optimal anytime search","volume":"39","year":"2020","journal-title":"Int. J. Robot. Res."},{"key":"B85","first-page":"130","article-title":"Advanced BIT* (ABIT*): sampling-based planning with advanced graph-search techniques","volume-title":"2020 IEEE International Conference on Robotics and Automation","year":"2020"},{"key":"B86","first-page":"449","article-title":"Kinodynamic motion planning by interior-exterior cell exploration","volume-title":"Algorithmic Foundation of Robotics VIII","year":"2009"},{"issue":"1","key":"B87","first-page":"116","article-title":"A sampling-based tree planner for systems with complex dynamics","volume":"28","year":"2011","journal-title":"IEEE Trans. Robot."},{"issue":"5","key":"B88","first-page":"786","article-title":"Sampling-based hierarchical motion planning for a reconfigurable wheel-on-leg planetary analogue exploration rover","volume":"37","year":"2019","journal-title":"J. Field Robot."},{"issue":"4","key":"B89","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1109\/MRA.2012.2205651","article-title":"The Open Motion Planning Library","volume":"19","year":"2012","journal-title":"IEEE Robot. Autom. Mag."},{"key":"B90","first-page":"2511","article-title":"HyperPlan: a framework for motion planning algorithm selection and parameter optimization","volume-title":"2021 IEEE\/RSJ International Conference on Intelligent Robots and Systems","year":"2021"},{"key":"B91","first-page":"8103","article-title":"Automatic parameter tuning of motion planning algorithms","volume-title":"2018 IEEE\/RSJ International Conference on Intelligent Robots and Systems","year":"2018"},{"key":"B92","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1146\/annurev-control-061920-093753","article-title":"A survey of asymptotically optimal sampling-based motion planning methods","volume":"4","year":"2021","journal-title":"Annu. Rev. Control Robot. Auton. Syst."},{"issue":"4","key":"B93","doi-asserted-by":"crossref","first-page":"966","DOI":"10.1109\/TRO.2018.2830331","article-title":"Informed sampling for asymptotically optimal path planning","volume":"34","year":"2018","journal-title":"IEEE Trans. Robot."},{"key":"B94","first-page":"7851","article-title":"Sparse multilevel roadmaps for high-dimensional robot motion planning","volume-title":"2021 IEEE International Conference on Robotics and Automation","year":"2021"},{"key":"B95","doi-asserted-by":"crossref","first-page":"2563","DOI":"10.1109\/ICRA.2012.6225300","article-title":"Proving path non-existence using sampling and alpha shapes","volume-title":"2012 IEEE International Conference on Robotics and Automation","year":"2012"},{"issue":"10\u201311","key":"B96","first-page":"1049","article-title":"Free space of rigid objects: caging, path non-existence, and narrow passage detection","volume":"40","year":"2021","journal-title":"Int. J. Robot. Res."},{"key":"B97","article-title":"Learning proofs of motion planning infeasibility","volume-title":"Robotics: Science and Systems XVII","year":"2021"},{"issue":"3","key":"B98","doi-asserted-by":"crossref","first-page":"497","DOI":"10.2307\/2372560","article-title":"On curves of minimal length with a constraint on average curvature, and with prescribed initial and terminal positions and tangents","volume":"79","year":"1957","journal-title":"Am. J. Math."},{"issue":"2","key":"B99","doi-asserted-by":"crossref","first-page":"367","DOI":"10.2140\/pjm.1990.145.367","article-title":"Optimal paths for a car that goes both forwards and backwards","volume":"145","year":"1990","journal-title":"Pac. J. Math."},{"issue":"5","key":"B100","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1177\/02783640122067453","article-title":"Randomized kinodynamic planning","volume":"20","year":"2001","journal-title":"Int. J. Robot. Res."},{"issue":"6","key":"B101","doi-asserted-by":"crossref","first-page":"1431","DOI":"10.1109\/TRO.2016.2602363","article-title":"Asymptotically optimal planning by feasible kinodynamic planning in a state\u2013cost space","volume":"32","year":"2016","journal-title":"IEEE Trans. Robot."},{"issue":"11","key":"B102","doi-asserted-by":"crossref","first-page":"1319","DOI":"10.1177\/0278364918790369","article-title":"Continuous-time Gaussian process motion planning via probabilistic inference","volume":"37","year":"2018","journal-title":"Int. J. Robot. Res."},{"key":"B103","first-page":"4492","article-title":"BITKOMO: combining sampling and optimization for fast convergence in optimal motion planning","volume-title":"2022 IEEE\/RSJ International Conference on Intelligent Robots and Systems","year":"2022"},{"key":"B104","first-page":"4700","article-title":"Joint sampling and trajectory optimization over graphs for online motion planning","volume-title":"2021 IEEE\/RSJ International Conference on Intelligent Robots and Systems","year":"2021"},{"key":"B105","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1146\/annurev-control-060117-105226","article-title":"Sampling-based methods for motion planning with constraints","volume":"1","year":"2018","journal-title":"Annu. Rev. Control Robot. Auton. Syst."},{"issue":"12","key":"B106","doi-asserted-by":"crossref","first-page":"1435","DOI":"10.1177\/0278364910396389","article-title":"Task space regions: a framework for pose-constrained manipulation planning","volume":"30","year":"2011","journal-title":"Int. J. Robot. Res."},{"key":"B107","doi-asserted-by":"crossref","first-page":"5628","DOI":"10.1109\/ICRA.2011.5980306","article-title":"SIPP: safe interval path planning for dynamic environments","volume-title":"2011 IEEE International Conference on Robotics and Automation","year":"2011"},{"issue":"7","key":"B108","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1177\/0278364915594679","article-title":"RRTX: asymptotically optimal single-query sampling-based motion planning with quick replanning","volume":"35","year":"2016","journal-title":"Int. J. Robot. Res."},{"key":"B109","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1146\/annurev-control-042920-092451","article-title":"Partially observable Markov decision processes and robotics","volume":"5","year":"2022","journal-title":"Annu. Rev. Control Robot. Auton. Syst."},{"issue":"4","key":"B110","doi-asserted-by":"crossref","first-page":"10160","DOI":"10.1109\/LRA.2022.3191944","article-title":"Path-tree optimization in discrete partially observable environments using rapidly-exploring belief-space graphs","volume":"7","year":"2022","journal-title":"IEEE Robot. Autom. Lett."},{"issue":"5","key":"B111","doi-asserted-by":"crossref","first-page":"470","DOI":"10.1177\/02783649221076381","article-title":"Simplified decision making in the belief space using belief sparsification","volume":"41","year":"2022","journal-title":"Int. J. Robot. Res."},{"issue":"13","key":"B112","doi-asserted-by":"crossref","first-page":"1664","DOI":"10.1177\/0278364914545812","article-title":"Randomized path planning on vector fields","volume":"33","year":"2014","journal-title":"Int. J. Robot. Res."},{"key":"B113","doi-asserted-by":"crossref","first-page":"1325","DOI":"10.1007\/s10846-020-01231-y","article-title":"Vector field guided RRT* based on motion primitives for quadrotor kinodynamic planning","volume":"100","year":"2020","journal-title":"J. Intell. Robot. Syst."},{"issue":"2","key":"B114","doi-asserted-by":"crossref","first-page":"370","DOI":"10.1002\/rob.21827","article-title":"Online motion planning for unexplored underwater environments using autonomous underwater vehicles","volume":"36","year":"2019","journal-title":"J. Field Robot."},{"key":"B115","first-page":"8936","article-title":"Online multilayered motion planning with dynamic constraints for autonomous underwater vehicles","volume-title":"2019 IEEE International Conference on Robotics and Automation","year":"2019"},{"key":"B116","volume-title":"Convex Optimization","year":"2004"},{"issue":"9","key":"B117","doi-asserted-by":"crossref","first-page":"1231","DOI":"10.1177\/0278364914527855","article-title":"Fast interpolation and time-optimization with contact","volume":"33","year":"2014","journal-title":"Int. J. Robot. Res."},{"issue":"9\u201310","key":"B118","first-page":"1164","article-title":"CHOMP: covariant Hamiltonian optimization for motion planning","volume":"32","year":"2013","journal-title":"Int. J. Robot. Res."},{"issue":"9","key":"B119","doi-asserted-by":"crossref","first-page":"1251","DOI":"10.1177\/0278364914528132","article-title":"Motion planning with sequential convex optimization and convex collision checking","volume":"33","year":"2014","journal-title":"Int. J. Robot. Res."},{"key":"B120","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/4-431-31381-8_23","article-title":"Dynamic movement primitives\u2014a framework for motor control in humans and humanoid robotics","volume-title":"Adaptive Motion of Animals and Machines","year":"2006"},{"issue":"1\u20132","key":"B121","first-page":"171","article-title":"Policy search for motor primitives in robotics","volume":"84","year":"2011","journal-title":"Mach. Learn."},{"issue":"11","key":"B122","doi-asserted-by":"crossref","first-page":"1238","DOI":"10.1177\/0278364913495721","article-title":"Reinforcement learning in robotics: a survey","volume":"32","year":"2013","journal-title":"Int. J. Robot. Res."},{"key":"B123","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1007\/s10514-017-9648-7","article-title":"Using probabilistic movement primitives in robotics","volume":"42","year":"2018","journal-title":"Auton. Robots"},{"key":"B124","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1016\/j.conb.2015.04.004","article-title":"Motor primitives\u2014new data and future questions","volume":"33","year":"2015","journal-title":"Curr. Opin. Neurobiol."},{"key":"B125","volume-title":"The Intelligent Movement Machine: An Ethological Perspective on the Primate Motor System","year":"2008"},{"key":"B126","first-page":"750","article-title":"STORM: an integrated framework for fast joint-space model-predictive control for reactive manipulation","volume-title":"Proceedings of the 5th Conference on Robot Learning","year":"2022"},{"issue":"1\u20132","key":"B127","first-page":"93","article-title":"Lifelong planning A*","volume":"155","year":"2004","journal-title":"Artif. Intell."},{"issue":"2","key":"B128","doi-asserted-by":"crossref","first-page":"3318","DOI":"10.1109\/LRA.2022.3146918","article-title":"Multi-objective path-based D* lite","volume":"7","year":"2022","journal-title":"IEEE Robot. Autom. Lett."},{"issue":"2","key":"B129","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","article-title":"A formal basis for the heuristic determination of minimum cost paths","volume":"4","year":"1968","journal-title":"IEEE Trans. Syst. Sci. Cybernet."},{"issue":"3","key":"B130","doi-asserted-by":"crossref","first-page":"2439","DOI":"10.1109\/LRA.2018.2795654","article-title":"Search-based motion planning for aggressive flight in SE(3)","volume":"3","year":"2018","journal-title":"IEEE Robot. Autom. Lett."},{"key":"B131","first-page":"58","article-title":"PID control","volume-title":"Control Systems, Robotics, and Automation","volume":"2","year":"2010"},{"issue":"2","key":"B132","doi-asserted-by":"crossref","first-page":"3745","DOI":"10.1109\/LRA.2020.2979625","article-title":"LQR-assisted whole-body control of a wheeled bipedal robot with kinematic loops","volume":"5","year":"2020","journal-title":"IEEE Robot. Autom. Lett."},{"key":"B133","first-page":"4730","article-title":"Feedback MPC for torque-controlled legged robots","volume-title":"2019 IEEE\/RSJ International Conference on Intelligent Robots and Systems","year":"2019"},{"issue":"8","key":"B134","doi-asserted-by":"crossref","first-page":"947","DOI":"10.1177\/0278364917712421","article-title":"Funnel libraries for real-time robust feedback motion planning","volume":"36","year":"2017","journal-title":"Int. J. Robot. Res."},{"key":"B135","volume-title":"Reinforcement Learning: An Introduction","year":"2018"},{"key":"B136","volume-title":"Learning from delayed rewards","year":"1989"},{"issue":"3","key":"B137","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1109\/MRA.2015.2448276","article-title":"Benchmarking motion planning algorithms: an extensible infrastructure for analysis and visualization","volume":"22","year":"2015","journal-title":"IEEE Robot. Autom. Mag."},{"issue":"7","key":"B138","doi-asserted-by":"crossref","first-page":"627","DOI":"10.1177\/0278364906067174","article-title":"On the probabilistic foundations of probabilistic roadmap planning","volume":"25","year":"2006","journal-title":"Int. J. Robot. Res."},{"issue":"10\u201311","key":"B139","first-page":"1151","article-title":"Exploring implicit spaces for constrained sampling-based planning","volume":"38","year":"2019","journal-title":"Int. J. Robot. Res."},{"issue":"1","key":"B140","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/j.cosrev.2007.08.002","article-title":"Sampling-based robot motion planning: towards realistic applications","volume":"1","year":"2007","journal-title":"Comput. Sci. Rev."},{"key":"B141","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1109\/ACCESS.2014.2302442","article-title":"Sampling-based robot motion planning: a review","volume":"2","year":"2014","journal-title":"IEEE Access"},{"key":"B142","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/j.robot.2016.08.001","article-title":"Heuristic approaches in robot path planning: a survey","volume":"86","year":"2016","journal-title":"Robot. Auton. Syst."},{"key":"B143","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1146\/annurev-anchem-062011-143024","article-title":"Computational models of protein kinematics and dynamics: beyond simulation","volume":"5","year":"2012","journal-title":"Annu. Rev. Anal. Chem."},{"issue":"4","key":"B144","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/j.cosrev.2012.07.002","article-title":"Motion planning algorithms for molecular simulations: a survey","volume":"6","year":"2012","journal-title":"Comput. Sci. Rev."},{"issue":"1","key":"B145","first-page":"65","article-title":"A survey of motion planning algorithms from the perspective of autonomous UAV guidance","volume":"57","year":"2010","journal-title":"J. Intell. Robot. Syst."},{"key":"B146","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1146\/annurev-control-091420-084139","article-title":"Integrated task and motion planning","volume":"4","year":"2021","journal-title":"Annu. Rev. Control Robot. Auton. Syst."}],"container-title":["Annual Review of Control, Robotics, and Autonomous Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.annualreviews.org\/content\/journals\/10.1146\/annurev-control-061623-094742?crawler=true&mimetype=application\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,3]],"date-time":"2025-10-03T04:07:46Z","timestamp":1759464466000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.annualreviews.org\/content\/journals\/10.1146\/annurev-control-061623-094742"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,10]]},"references-count":146,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,7,10]]}},"URL":"https:\/\/doi.org\/10.1146\/annurev-control-061623-094742","relation":{},"ISSN":["2573-5144"],"issn-type":[{"value":"2573-5144","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,7,10]]}}}