Sampling-based motion planning with reachable volumes for high-degree-of-freedom manipulators

Motion planning for constrained systems is a version of the motion planning problem in which the motion of a robot is limited by constraints. For example, one can require that a humanoid robot such as a PR2 remain upright by constraining its torso to be above its base or require that an object such as a bucket of water remain upright by constraining the vertices of the object to be parallel to the robot’s base. Grasping can be modeled by requiring that the end effectors of the robot be located at specified handle positions. Constraints might require that the robot remain in contact with a surface, or that certain joints of the robot remain in contact with each other (e.g., closed chains). Such problems are particularly difficult because the constraints form a manifold in C-space, and planning must be restricted to this manifold. High-degree-of-freedom motion planning and motion planning for constrained systems has applications in parallel robotics, grasping and manipulation, computational biology and molecular simulations, and animation. We introduce a new concept, reachable volumes, that are a geometric representation of the regions the joints and end effectors of a robot can reach, and use it to define a new planning space called RV-space where all points automatically satisfy a problem’s constraints. Visualizations of reachable volumes can enable operators to see the regions of workspace that different parts of the robot can reach. Samples and paths generated in RV-space naturally conform to constraints, making planning for constrained systems no more difficult than planning for unconstrained systems. Consequently, constrained motion planning problems that were previously difficult or unsolvable become manageable and in many cases trivial. We introduce tools and techniques to extend the state-of-the-art sampling-based motion planning algorithms to RV-space. We define a reachable volumes sampler, a reachable volumes local planner, and a reachable volumes distance metric. We showcase the effectiveness of RV-space by applying these tools to motion planning problems for robots with constraints on the end effectors and/or internal joints of the robot. We show that RV-based planners are more efficient than existing methods, particularly for higher-dimensional problems, solving problems with 1000 or more degrees of freedom for multi-loop and tree-like linkages.

[1]  D. Thalmann,et al.  Planning collision-free reaching motions for interactive object manipulation and grasping , 2008, SIGGRAPH '08.

[2]  Ming C. Lin,et al.  Constraint-Based Motion Planning Using Voronoi Diagrams , 2002, WAFR.

[3]  Thierry Siméon,et al.  Dynamic-Domain RRTs: Efficient Exploration by Controlling the Sampling Domain , 2005, Proceedings of the 2005 IEEE International Conference on Robotics and Automation.

[4]  Troy McMahon,et al.  Sampling-based motion planning with reachable volumes: Theoretical foundations , 2014, 2014 IEEE International Conference on Robotics and Automation (ICRA).

[5]  Nancy M. Amato,et al.  Choosing good distance metrics and local planners for probabilistic roadmap methods , 2000, IEEE Trans. Robotics Autom..

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

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

[8]  Nancy M. Amato,et al.  The STAPL parallel container framework , 2011, PPoPP '11.

[9]  Li Han,et al.  Convexly Stratified Deformation Spaces and Efficient Path Planning for Planar Closed Chains with Revolute Joints , 2008, Int. J. Robotics Res..

[10]  Kamal K. Gupta,et al.  Path planning with general end-effector constraints: using task space to guide configuration space search , 2005, 2005 IEEE/RSJ International Conference on Intelligent Robots and Systems.

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

[12]  K. Ball CONVEX BODIES: THE BRUNN–MINKOWSKI THEORY , 1994 .

[13]  Troy McMahon,et al.  Reachable volume RRT , 2015, 2015 IEEE International Conference on Robotics and Automation (ICRA).

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

[15]  Siddhartha S. Srinivasa,et al.  CHOMP: Covariant Hamiltonian optimization for motion planning , 2013, Int. J. Robotics Res..

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

[17]  Li Han,et al.  A Unified Geometric Approach for Inverse Kinematics of a Spatial Chain with Spherical Joints , 2007, Proceedings 2007 IEEE International Conference on Robotics and Automation.

[18]  John J. Craig Zhu,et al.  Introduction to robotics mechanics and control , 1991 .

[19]  Li Han,et al.  Bending and kissing: Computing self-contact configurations of planar loops with revolute joints , 2009, 2009 IEEE International Conference on Robotics and Automation.

[20]  Li Han,et al.  Configurations and Path Planning of Convex Planar Polygonal Loops , 2012, WAFR.

[21]  Kris K. Hauser,et al.  Unbiased, scalable sampling of closed kinematic chains , 2013, 2013 IEEE International Conference on Robotics and Automation.

[22]  Chih-Cheng Chen,et al.  A combined optimization method for solving the inverse kinematics problems of mechanical manipulators , 1991, IEEE Trans. Robotics Autom..

[23]  Steven M. LaValle,et al.  Motion Planning for Highly Constrained Spaces , 2009 .

[24]  Nancy M. Amato,et al.  Reachable Distance Space: Efficient Sampling-Based Planning for Spatially Constrained Systems , 2010, Int. J. Robotics Res..

[25]  Dinesh Manocha,et al.  OBBTree: a hierarchical structure for rapid interference detection , 1996, SIGGRAPH.

[26]  Marilena Vendittelli,et al.  Probabilistic motion planning for redundant robots along given end-effector paths , 2002, IEEE/RSJ International Conference on Intelligent Robots and Systems.

[27]  Giuseppe Oriolo,et al.  Motion Planning for Mobile Manipulators along Given End-effector Paths , 2005, Proceedings of the 2005 IEEE International Conference on Robotics and Automation.

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

[29]  Oliver Brock,et al.  Hybrid Motion Planning Using Minkowski Sums , 2009 .

[30]  Thierry Siméon,et al.  Probabilistic motion planning for parallel mechanisms , 2003, 2003 IEEE International Conference on Robotics and Automation (Cat. No.03CH37422).

[31]  S. LaValle,et al.  Randomized Kinodynamic Planning , 2001 .

[32]  Li Han Hybrid probabilistic RoadMap - Monte Carlo motion planning for closed chain systems with spherical joints , 2004, IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004.

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

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

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

[36]  Léonard Jaillet,et al.  Path Planning with Loop Closure Constraints Using an Atlas-Based RRT , 2011, ISRR.

[37]  Nancy M. Amato,et al.  VIZMO++: a visualization, authoring, and educational tool for motion planning , 2006, Proceedings 2006 IEEE International Conference on Robotics and Automation, 2006. ICRA 2006..

[38]  Li Han,et al.  Simplex-Tree Based Kinematics of Foldable Objects as Multi-body Systems Involving Loops , 2008, Robotics: Science and Systems.

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

[40]  H. Whitney Non-Separable and Planar Graphs. , 1931, Proceedings of the National Academy of Sciences of the United States of America.

[41]  Li Han,et al.  Inverse Kinematics for a Serial Chain with Joints Under Distance Constraints , 2006, Robotics: Science and Systems.

[42]  Thierry Siméon,et al.  Sampling-Based Motion Planning under Kinematic Loop-Closure Constraints , 2004, WAFR.

[43]  H. Whitney 2-Isomorphic Graphs , 1933 .

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

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

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

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

[48]  Troy McMahon,et al.  Sampling based motion planning with reachable volumes: Application to manipulators and closed chain systems , 2014, 2014 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[49]  John J. Craig,et al.  Introduction to Robotics Mechanics and Control , 1986 .

[50]  Reid G. Simmons,et al.  Voxel-based motion bounding and workspace estimation for robotic manipulators , 2012, 2012 IEEE International Conference on Robotics and Automation.

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