Randomized preprocessing of configuration for fast path planning

This paper presents a new approach to path planning for robots with many degrees of freedom (DOF) operating in known static environments. The approach consists of a preprocessing and a planning stage. Preprocessing, which is done only once for a given environment, generates a network 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 network and computes a path through the network between these two nodes. Experiments show that after paying the preprocessing cost (on the order of hundreds of seconds), planning is extremely fast (on the order of a fraction of a second for many difficult examples involving a 10-DOF robot). The approach is particularly attractive for many-DOF robots which have to perform many successive point-to-point motions in the same environment.<<ETX>>

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

[2]  Bruce Randall Donald,et al.  Real-time robot motion planning using rasterizing computer graphics hardware , 1990, SIGGRAPH.

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

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

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

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

[7]  Narendra Ahuja,et al.  A potential field approach to path planning , 1992, IEEE Trans. Robotics Autom..

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

[9]  El-Ghazali Talbi,et al.  The Ariadne's clew algorithm; From Animal to Animats , 1992 .

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

[11]  El-Ghazali Talbi,et al.  Parallel Robot Motion Planning in a Dynamic Environment , 1992, CONPAR.

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

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

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

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

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

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