A probabilistic roadmap approach for systems with closed kinematic chains

We present a randomized approach to path planning for articulated robots that have closed kinematic chains. The approach extends the probabilistic roadmap technique which has previously been applied to rigid and elastic objects, and articulated robots without closed chains. It provides a framework for path planning problems that must satisfy closure constraints in addition to standard collision constraints. This expands the power of the probabilistic roadmap technique to include a variety of problems such as manipulation planning using two open-chain manipulators that cooperatively grasp an object, forming a system with a closed chain, and planning for reconfigurable robots where the robot links may be rearranged in a loop to ease manipulation or locomotion. We generate the vertices and edges in our probabilistic roadmap. We focus on the problem of planning the motions for a collection of attached links in a 2D environment with obstacles. The approach has been implemented and successfully demonstrated on several examples.

[1]  Nancy M. Amato,et al.  A randomized roadmap method for path and manipulation planning , 1996, Proceedings of IEEE International Conference on Robotics and Automation.

[2]  Nancy M. Amato,et al.  A Kinematics-Based Probabilistic Roadmap Method for Closed Chain Systems , 2001 .

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

[4]  Gregory S. Chirikjian,et al.  Evaluating efficiency of self-reconfiguration in a class of modular robots , 1996, J. Field Robotics.

[5]  Dennis S. Arnon,et al.  Geometric Reasoning with Logic and Algebra , 1988, Artif. Intell..

[6]  Oussama Khatib,et al.  Real-Time Obstacle Avoidance for Manipulators and Mobile Robots , 1986 .

[7]  Oussama Khatib,et al.  Real-Time Obstacle Avoidance for Manipulators and Mobile Robots , 1985, Autonomous Robot Vehicles.

[8]  Craig D. McGray,et al.  The self-reconfiguring robotic molecule: design and control algorithms , 1998 .

[9]  John Canny,et al.  The complexity of robot motion planning , 1988 .

[10]  Gabriel Taubin,et al.  Estimation of Planar Curves, Surfaces, and Nonplanar Space Curves Defined by Implicit Equations with Applications to Edge and Range Image Segmentation , 1991, IEEE Trans. Pattern Anal. Mach. Intell..

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

[13]  Rachid Alami,et al.  A geometrical Approach to planning Manipulation Tasks in robotics , 1989 .

[14]  Jean-Claude Latombe,et al.  On multi-arm manipulation planning , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.

[15]  J. Denavit,et al.  A kinematic notation for lower pair mechanisms based on matrices , 1955 .

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

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

[18]  Mark H. Yim,et al.  Locomotion With A Unit-Modular Reconfigurable Robot , 1995 .

[19]  Gareth Jones,et al.  Pharmacophoric pattern matching in files of three-dimensional chemical structures: Comparison of conformational-searching algorithms for flexible searching , 1994, J. Chem. Inf. Comput. Sci..

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

[21]  C. S. G. Lee,et al.  Robotics: Control, Sensing, Vision, and Intelligence , 1987 .

[22]  S. Basu,et al.  COMPUTING ROADMAPS OF SEMI-ALGEBRAIC SETS ON A VARIETY , 1999 .