Analysis of probabilistic roadmaps for path planning

Provides an analysis of a 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 /spl gamma/ exists between two configurations a and b of the robot, we study the dependence of the failure probability to connect a and b on (i) the length of /spl gamma/, (ii) the distance function of /spl gamma/ from the obstacles, and (iii) the number of nodes N 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 for N, 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]  Tomás Lozano-Pérez,et al.  Spatial Planning: A Configuration Space Approach , 1983, IEEE Transactions on Computers.

[2]  S.E. Underwood,et al.  Research on anticipatory route guidance , 1991, Vehicle Navigation and Information Systems Conference, 1991.

[3]  Jean-Claude Latombe,et al.  Robot motion planning , 1970, The Kluwer international series in engineering and computer science.

[4]  Koichi Kondo,et al.  Motion planning with six degrees of freedom by multistrategic bidirectional heuristic free-space enumeration , 1991, IEEE Trans. Robotics Autom..

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

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

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

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

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

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

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

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

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

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

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