Dynamic-Domain RRTs: Efficient Exploration by Controlling the Sampling Domain

Sampling-based planners have solved difficult problems in many applications of motion planning in recent years. In particular, techniques based on the Rapidly-exploring Random Trees (RRTs) have generated highly successful single-query planners. Even though RRTs work well on many problems, they have weaknesses which cause them to explore slowly when the sampling domain is not well adapted to the problem. In this paper we characterize these issues and propose a general framework for minimizing their effect. We develop and implement a simple new planner which shows significant improvement over existing RRT-based planners. In the worst cases, the performance appears to be only slightly worse in comparison to the original RRT, and for many problems it performs orders of magnitude better.

[1]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[2]  Bernhard Glavina,et al.  Solving findpath by combination of goal-directed and randomized search , 1990, Proceedings., IEEE International Conference on Robotics and Automation.

[3]  Mark H. Overmars,et al.  Coordinated motion planning for multiple car-like robots using probabilistic roadmaps , 1995, Proceedings of 1995 IEEE International Conference on Robotics and Automation.

[4]  B. Faverjon,et al.  Probabilistic Roadmaps for Path Planning in High-Dimensional Con(cid:12)guration Spaces , 1996 .

[5]  Rajeev Motwani,et al.  Path planning in expansive configuration spaces , 1997, Proceedings of International Conference on Robotics and Automation.

[6]  Lydia E. Kavraki,et al.  On finding narrow passages with probabilistic roadmap planners , 1998 .

[7]  Pierre Bessière,et al.  The Ariadne's Clew Algorithm , 1993, J. Artif. Intell. Res..

[8]  Mark H. Overmars,et al.  Multilevel Path Planning for Nonholonomic Robots Using Semiholonomic Subsystems , 1998, Int. J. Robotics Res..

[9]  Daniel Vallejo,et al.  OBPRM: an obstacle-based PRM for 3D workspaces , 1998 .

[10]  S. LaValle.  Rapidly-exploring random trees : a new tool for path planning , 1998 .

[11]  Dinesh Manocha,et al.  Randomized Path Planning for a Rigid Body Based on Hardware Accelerated Voronoi Sampling , 1999 .

[12]  Mark H. Overmars,et al.  The Gaussian sampling strategy for probabilistic roadmap planners , 1999, Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C).

[13]  Nancy M. Amato,et al.  MAPRM: a probabilistic roadmap planner with sampling on the medial axis of the free space , 1999, Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C).

[14]  Steven M. LaValle,et al.  Rapidly-Exploring Random Trees: Progress and Prospects , 2000 .

[15]  Steven M. LaValle,et al.  RRT-connect: An efficient approach to single-query path planning , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).

[16]  Lydia E. Kavraki,et al.  A framework for using the workspace medial axis in PRM planners , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).

[17]  Lydia E. Kavraki,et al.  Path planning using lazy PRM , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).

[18]  Thierry Siméon,et al.  Visibility-based probabilistic roadmaps for motion planning , 2000, Adv. Robotics.

[19]  Thierry Siméon,et al.  Computer aided motion: Move3D within MOLOG , 2001, Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (Cat. No.01CH37164).

[20]  Jean-Claude Latombe,et al.  A Single-Query Bi-Directional Probabilistic Roadmap Planner with Lazy Collision Checking , 2001, ISRR.

[21]  E. Feron,et al.  Real-time motion planning for agile autonomous vehicles , 2000, Proceedings of the 2001 American Control Conference. (Cat. No.01CH37148).

[22]  Lydia E. Kavraki,et al.  Randomized path planning for linkages with closed kinematic chains , 2001, IEEE Trans. Robotics Autom..

[23]  Thierry Siméon,et al.  A random loop generator for planning the motions of closed kinematic chains using PRM methods , 2002, Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292).

[24]  Steven M. LaValle,et al.  Efficient nearest neighbor searching for motion planning , 2002, Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292).

[25]  Steven M. LaValle,et al.  Resolution complete rapidly-exploring random trees , 2002, Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292).

[26]  Michael S. Branicky,et al.  Nonlinear and Hybrid Control Via RRTs , 2002 .

[27]  James P. Ostrowski,et al.  Motion planning a aerial robot using rapidly-exploring random trees with dynamic constraints , 2003, 2003 IEEE International Conference on Robotics and Automation (Cat. No.03CH37422).

[28]  Masayuki Inaba,et al.  Humanoid arm motion planning using stereo vision and RRT search , 2003, Proceedings 2003 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2003) (Cat. No.03CH37453).

[29]  Daniel Thalmann,et al.  Planning Collision‐Free Reaching Motions for Interactive Object Manipulation and Grasping , 2003, Comput. Graph. Forum.

[30]  Florent Lamiraux,et al.  Kinodynamic motion planning: connecting exploration trees using trajectory optimization Methods , 2004, IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004.

[31]  Thierry Siméon,et al.  Sampling-Based Motion Planning under Kinematic Loop-Closure Constraints , 2004, WAFR.

[32]  Steven M. LaValle,et al.  Incrementally reducing dispersion by increasing Voronoi bias in RRTs , 2004, IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004.

[33]  Thierry Siméon,et al.  Manipulation Planning with Probabilistic Roadmaps , 2004, Int. J. Robotics Res..

[34]  Steven M. LaValle,et al.  Planning algorithms , 2006 .