Distributed Sampling-Based Roadmap of Trees for Large-Scale Motion Planning

High-dimensional problems arising from complex robotic systems test the limits of current motion planners and require the development of efficient distributed motion planners that take full advantage of all the available resources. This paper shows how to effectively distribute the computation of the Sampling-based Roadmap of Trees (SRT) algorithm using a decentralized master-client scheme. The distributed SRT algorithm allows us to solve very high-dimensional problems that cannot be efficiently addressed with existing planners. Our experiments show nearly linear speedups with eighty processors and indicate that similar speedups can be obtained with several hundred processors.

[1]  Jean-Claude Latombe,et al.  Robot Motion Planning: A Distributed Representation Approach , 1991, Int. J. Robotics Res..

[2]  Tomás Lozano-Pérez,et al.  Parallel robot motion planning , 1991, Proceedings. 1991 IEEE International Conference on Robotics and Automation.

[3]  Vipin Kumar,et al.  Parallel search algorithms for robot motion planning , 1993, [1993] Proceedings IEEE International Conference on Robotics and Automation.

[4]  Vipin Kumar,et al.  A parallel formulation of informed randomized search for robot motion planning problems , 1995, Proceedings of 1995 IEEE International Conference on Robotics and Automation.

[5]  Lydia E. Kavraki,et al.  Probabilistic roadmaps for path planning in high-dimensional configuration spaces , 1996, IEEE Trans. Robotics Autom..

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

[7]  Heinz Wörn,et al.  Multi-Directional Search with Goal Switching for Robot Path Planning , 1998, IEA/AIE.

[8]  Nancy M. Amato,et al.  Probabilistic roadmap methods are embarrassingly parallel , 1999, Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C).

[9]  Mark Yim,et al.  PolyBot: a modular reconfigurable robot , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).

[10]  Ming C. Lin,et al.  Accurate and Fast Proximity Queries Between Polyhedra Using Convex Surface Decomposition , 2001, Comput. Graph. Forum.

[11]  Lydia E. Kavraki,et al.  Planning Paths for Elastic Objects under Manipulation Constraints , 2001, Int. J. Robotics Res..

[12]  S. LaValle,et al.  Randomized Kinodynamic Planning , 2001 .

[13]  Nancy M. Amato,et al.  Using motion planning to map protein folding landscapes and analyze folding kinetics of known native structures , 2002, RECOMB '02.

[14]  Enrico Pagello,et al.  On Parallel RRTs for Multi-robot Systems , 2002 .

[15]  Carlos Guestrin,et al.  Stoc hastic Roadma p Simulation : An Efficient Repres entation and Algorithm for Anal yzing Molecula r Motion , 2002 .

[16]  Jean-Claude Latombe,et al.  Randomized Kinodynamic Motion Planning with Moving Obstacles , 2002, Int. J. Robotics Res..

[17]  Jean-Claude Latombe,et al.  On Delaying Collision Checking in PRM Planning: Application to Multi-Robot Coordination , 2002, Int. J. Robotics Res..

[18]  Kostas E. Bekris,et al.  Probabilistic Roadmaps of Trees for Parallel Computation of Multiple Query Roadmaps , 2003, ISRR.

[19]  Jean-Claude Latombe,et al.  Stochastic Roadmap Simulation: An Efficient Representation and Algorithm for Analyzing Molecular Motion , 2003, J. Comput. Biol..

[20]  Nancy M. Amato,et al.  Using Motion Planning to Map Protein Folding Landscapes and Analyze Folding Kinetics of Known Native Structures , 2003, J. Comput. Biol..

[21]  Kostas E. Bekris,et al.  Multiple query probabilistic roadmap planning using single query planning primitives , 2003, Proceedings 2003 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2003) (Cat. No.03CH37453).

[22]  Lydia E. Kavraki,et al.  Using Motion Planning for Knot Untangling , 2004, Int. J. Robotics Res..

[23]  Lydia E. Kavraki,et al.  Path planning for minimal energy curves of constant length , 2004, IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004.