Probabilistic Roadmaps for Robot Path Planning

The ProbabilisticRoadMap planner (PRM) has been applied with success to multiple planning problems involving robots with 3 to 16 degrees of freedom (dof) operating in known static environments. This paper describes the planner and reports on experimental and theoretical results related to its performance. PRM computation consists of a preprocessing and a query phase. Preprocessing, which is done only once for a given environment, generates a roadmap of randomly, but properly selected, collision-free configurations (nodes). Planning then connects any given initial and final configurations of the robot to two nodes of the roadmap and computes a path through the roadmap between these two nodes. The planner is able to find paths involving robots with 10 dof in a fraction of a second after relatively short times for preprocessing (a few dozen seconds). Theoretical analysis of the PRM algorithm provides bounds on the number of roadmap nodes needed for solving planning problems in spaces with certain geometric properties. A number of theoretical results are presented in this paper under a unified framework.

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

[2]  Pang C. Chen.  Improving Path Planning with Learning , 1992, ML.

[3]  Lydia E. Kavraki.  Computation of configuration-space obstacles using the fast Fourier transform , 1995, IEEE Trans. Robotics Autom..

[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]  Florent Lamiraux,et al.  On the expected complexity of random path planning , 1996, Proceedings of IEEE International Conference on Robotics and Automation.

[6]  H OvermarsMark,et al.  Motion planning for carlike robots using a probabilistic learning approach , 1997 .

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

[8]  Yong K. Hwang,et al.  SANDROS: a motion planner with performance proportional to task difficulty , 1992, Proceedings 1992 IEEE International Conference on Robotics and Automation.

[9]  S. Cameron,et al.  Towards efficient motion planning for manipulators with complex geometry , 1995, Proceedings. IEEE International Symposium on Assembly and Task Planning.

[10]  Dinesh Manocha,et al.  Collision Detection: Algorithms and Applications , 1996 .

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

[12]  Lydia E. Kavraki,et al.  Randomized preprocessing of configuration space for path planning: articulated robots , 1994, Proceedings of IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS'94).

[13]  Kamal K. Gupta,et al.  Motion planning for many degrees of freedom: sequential search with backtracking , 1995, IEEE Trans. Robotics Autom..

[14]  Chee-Keng Yap,et al.  A "Retraction" Method for Planning the Motion of a Disc , 1985, J. Algorithms.

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

[16]  Lydia E. Kavraki,et al.  Analysis of probabilistic roadmaps for path planning , 1998, IEEE Trans. Robotics Autom..

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

[18]  Stefan Berchtold,et al.  A scalable optimizer for automatically generated manipulator motions , 1994, Proceedings of IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS'94).

[19]  Tomás Lozano-Pérez,et al.  An algorithm for planning collision-free paths among polyhedral obstacles , 1979, CACM.

[20]  Jean-Claude Latombe,et al.  Numerical potential field techniques for robot path planning , 1991, Fifth International Conference on Advanced Robotics 'Robots in Unstructured Environments.

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

[22]  B. Faverjon,et al.  A practical approach to motion-planning for manipulators with many degrees of freedom , 1991 .

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

[24]  Daniel E. Koditschek,et al.  Exact robot navigation by means of potential functions: Some topological considerations , 1987, Proceedings. 1987 IEEE International Conference on Robotics and Automation.

[25]  Jean-Paul Laumond,et al.  A motion planner for car-like robots based on a mixed global/local approach , 1990, EEE International Workshop on Intelligent Robots and Systems, Towards a New Frontier of Applications.

[26]  El-Ghazali Talbi,et al.  Using Genetic Algorithms for Robot Motion Planning , 1991, Geometric Reasoning for Perception and Action.

[27]  Jean-Claude Latombe,et al.  Planning motions with intentions , 1994, SIGGRAPH.

[28]  Daniel E. Koditschek,et al.  Exact robot navigation using artificial potential functions , 1992, IEEE Trans. Robotics Autom..

[29]  Mark H. Overmars,et al.  A random approach to motion planning , 1992 .

[30]  John H. Reif,et al.  Complexity of the mover's problem and generalizations , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[31]  Howie Choset,et al.  Sensor based planning and nonsmooth analysis , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.

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

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

[34]  L. Graux,et al.  Integration of a Path Generation Algorithm into Off-line Programming of AIRBUS Panels , 1992 .

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

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

[37]  Lydia E. Kavraki,et al.  Geometry and the Discovery of New Ligands , 1996 .