Analysis of probabilistic roadmaps for path planning

We provide an analysis of a recent path planning method which uses probabilistic roadmaps. This method has proven very successful in practice, but the theoretical understanding of its performance is still limited. Assuming that a path exists between two configurations a and b of the robot, we study the dependence of the failure probability to connect a and b on: 1) the length of ; 2) the distance function of from the obstacles; 3) the number of nodesN of the probabilistic roadmap constructed. Importantly, our results do not depend strongly on local irregularities of the configuration space, as was the case with previous analysis. These results are illustrated with a simple but illuminating example. In this example, we provide estimates forN , the principal parameter of the method, in order to achieve failure probability within prescribed bounds. We also compare, through this example, the different approaches to the analysis of the planning method.

[1]  B. Donald.  Motion Planning with Six Degrees of Freedom , 1984 .

[2]  Tomás Lozano-Pérez,et al.  Spatial Planning: A Configuration Space Approach , 1983, IEEE Transactions on Computers.

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

[4]  Juan Manuel Ahuactzin-Larios.  Le fil d'ariane : une méthode de planification générale. Application à la planification automatique de trajectoires , 1994 .

[5]  S. LaValle,et al.  Motion Planning , 2008, Springer Handbook of Robotics.

[6]  Henning Tolle,et al.  Motion planning with many degrees of freedom-random reflections at C-space obstacles , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.

[7]  Lydia E. Kavraki,et al.  Randomized preprocessing of configuration for fast path planning , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.

[8]  Jérôme Barraquand,et al.  Path planning through variational dynamic programming , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.

[9]  Kamal K. Gupta,et al.  Practical global motion planning for many degrees of freedom: a novel approach within sequential framework , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.

[10]  Juan-Manuel Ahuactzin Larios.  Le fil d'ariane : une méthode de planification générale. Application à la planification automatique de trajectoires , 1994 .

[11]  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.

[12]  P. C. Chen,et al.  Learning to improve path planning performance , 1995 .

[13]  Mark H. Overmars,et al.  A probabilistic learning approach to motion planning , 1995 .

[14]  Yong K. Hwang,et al.  A heuristic and complete planner for the classical mover's problem , 1995, Proceedings of 1995 IEEE International Conference on Robotics and Automation.

[15]  Tsai-Yen Li,et al.  Assembly maintainability study with motion planning , 1995, Proceedings of 1995 IEEE International Conference on Robotics and Automation.

[16]  Lydia E. Kavraki,et al.  Random networks in configuration space for fast path planning , 1994 .

[17]  Lydia E. Kavraki,et al.  Randomized query processing in robot path planning , 1995, STOC '95.

[18]  Pang C. Chen.  Adaptive path planning: algorithm and analysis , 1995, Proceedings of 1995 IEEE International Conference on Robotics and Automation.

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

[20]  Florent Lamiraux,et al.  On the expected complexity of random path planning , 1996, Proceedings of IEEE International Conference on Robotics and Automation.

[21]  Jean-Claude Latombelatombe.  Ing of Connguration Space for Fast Path Planning , 2007 .