Probabilistic Completeness of RRT for Geometric and Kinodynamic Planning with Forward Propagation

Michal Kleinbort, Kiril Solovey, Zakary Littlefield, Kostas E. Bekris, Dan Halperin

Research output: Contribution to conferencePaperpeer-review

Abstract

The Rapidly-exploring Random Tree (RRT) algorithm has been one of the most prevalent and popular motion-planning techniques for two decades now. Surprisingly, in spite of its centrality, there has been an active debate under which conditions RRT is probabilistically complete. We provide two new proofs of probabilistic completeness (PC) of RRT with a reduced set of assumptions. The first one for the purely geometric setting, where we only require that the solution path has a certain clearance from the obstacles. For the kinodynamic case with forward propagation of random controls and duration, we only consider in addition mild Lipschitz-continuity conditions. These proofs fill a gap in the study of RRT itself. They also lay sound foundations for a variety of more recent and alternative sampling-based methods, whose PC property relies on that of RRT.
Original languageAmerican English
StatePublished - 2019
Externally publishedYes
Event2019 International Conference on Robotics and Automation, ICRA 2019 - Montreal, Canada
Duration: 20 May 201924 May 2019

Conference

Conference2019 International Conference on Robotics and Automation, ICRA 2019
Country/TerritoryCanada
CityMontreal
Period20/05/1924/05/19

Fingerprint

Dive into the research topics of 'Probabilistic Completeness of RRT for Geometric and Kinodynamic Planning with Forward Propagation'. Together they form a unique fingerprint.

Cite this