Planning with Reachable Distances: Fast Enforcement of Closure Constraints

Motion planning for closed-chain systems is particularly difficult due to additional closure constraints placed on the system. In fact, the probability of randomly selecting a set of joint angles that satisfy the closure constraints is zero. We propose planning with reachable distance (PRD) to overcome this challenge by first precomputing the subspace satisfying the closure constraints, then directly sampling in it. To do so, we represent the chain as a hierarchy of sub-chains. Then we calculate the "closure" sub-space as appropriate reachable distance ranges of sub-chains satisfying the closure constraints. This provides two distinct advantages over traditional approaches: (1) configurations are quickly sampled and converted to joint angles using basic trigonometry functions instead of more expensive inverse kinematics solvers, and (2) configurations are guaranteed to be closed. In this paper, we describe this hierarchical chain representation and give a sampling algorithm with complexity linear in the number of links. We provide the necessary motion planning primitives for most sampling-based motion planners. Our experimental results show our method is fast, making sampling closed configurations comparable to sampling open chain configurations that ignore closure constraints. Our method is general, easy to implement, and also extends to other distance-related constraints besides the ones demonstrated here

[1]  J-P. Merlet,et al.  Still a long way to go on the road for parallel mechanisms , 2009 .

[2]  D. Stewart,et al.  A Platform with Six Degrees of Freedom , 1965 .

[3]  Li Han,et al.  Stratified Deformation Space and Path Planning for a Planar Closed Chain with Revolute Joints , 2006, WAFR.

[4]  J. Trinkle,et al.  THE GEOMETRY OF CONFIGURATION SPACES FOR CLOSED CHAINS IN TWO AND THREE DIMENSIONS , 2004 .

[5]  Lydia E. Kavraki,et al.  A probabilistic roadmap approach for systems with closed kinematic chains , 1999, Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C).

[6]  Leonidas J. Guibas.  Controlled Module Density Helps Reconfiguration Planning , 2000 .

[7]  Oussama Khatib,et al.  Vehicle/arm coordination and multiple mobile manipulator decentralized cooperation , 1996, Proceedings of IEEE/RSJ International Conference on Intelligent Robots and Systems. IROS '96.

[8]  Nancy M. Amato,et al.  Solving motion planning problems by iterative relaxation of constraints , 2003 .

[9]  Nancy M. Amato,et al.  A kinematics-based probabilistic roadmap method for high DOF closed chain systems , 2004, IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004.

[10]  Jeffrey C. Trinkle,et al.  Complete Path Planning for Closed Kinematic Chains with Spherical Joints , 2002, Int. J. Robotics Res..

[11]  Daniel Thalmann,et al.  Planning Collision‐Free Reaching Motions for Interactive Object Manipulation and Grasping , 2003, Comput. Graph. Forum.

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

[13]  Steven M. LaValle,et al.  Randomized Kinodynamic Planning , 1999, Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C).

[14]  Steven M. LaValle,et al.  Rapidly-Exploring Random Trees: Progress and Prospects , 2000 .

[15]  G. Swaminathan.  Robot Motion Planning , 2006 .

[16]  Craig D. McGray,et al.  The self-reconfiguring robotic molecule , 1998, Proceedings. 1998 IEEE International Conference on Robotics and Automation (Cat. No.98CH36146).

[17]  Jean-Claude Latombe,et al.  A Motion Planning Approach to Flexible Ligand Binding , 1999, ISMB.

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

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

[20]  Thierry Siméon,et al.  A random loop generator for planning the motions of closed kinematic chains using PRM methods , 2002, Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292).

[21]  Lydia E. Kavraki,et al.  Randomized path planning for linkages with closed kinematic chains , 2001, IEEE Trans. Robotics Autom..

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