Path planning for planar articulated robots using configuration spaces and compliant motion

This paper presents a path-planning algorithm for an articulated planar robot with a static obstacle. The algorithm selects a robot part, finds a path to its goal configuration by systematic configuration space search, drags the entire robot along the path using compliant motion, and repeats the cycle until every robot part reaches its goal. The planner is tested on 11 000 random problems, which span dozens of robot/obstacle geometries with up to 43 moving parts and with narrow channels. It solves every problem in seconds, whereas randomized algorithms appear to fail on all of them.

[1]  J. Schwartz,et al.  On the “piano movers” problem. II. General techniques for computing topological properties of real algebraic manifolds , 1983 .

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

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

[4]  Elisha Sacks.  Configuration Space Computations for Polyhedra With Planar Motions , 2001 .

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

[6]  Russell H. Taylor,et al.  Automatic Synthesis of Fine-Motion Strategies for Robots , 1984 .

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

[8]  Daniel Vallejo,et al.  OBPRM: an obstacle-based PRM for 3D workspaces , 1998 .

[9]  Jean-Paul Laumond,et al.  Guidelines in nonholonomic motion planning for mobile robots , 1998 .

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

[11]  Jing Xiao,et al.  Planning motion compliant to complex contact states , 2001, Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (Cat. No.01CH37164).

[12]  William H. Press,et al.  Numerical recipes in C , 2002 .

[13]  Jean-Daniel Boissonnat,et al.  A practical exact motion planning algorithm for polygonal object amidst polygonal obstacles , 1988, Geometry and Robotics.

[14]  Bruce Randall Donald,et al.  A Search Algorithm for Motion Planning with Six Degrees of Freedom , 1987, Artif. Intell..

[15]  Randy C. Brost,et al.  Analysis and planning of planar manipulation tasks , 1992 .

[16]  Michael A. Erdmann,et al.  Using Backprojections for Fine Motion Planning with Uncertainty , 1985, Proceedings. 1985 IEEE International Conference on Robotics and Automation.

[17]  Elisha Sacks,et al.  Practical Sliced Configuration Spaces for Curved Planar Pairs , 1999, Int. J. Robotics Res..

[18]  Jing Xiao,et al.  Planning Motions Compliant to Complex Contact States , 2001, Int. J. Robotics Res..

[19]  Lydia E. Kavraki,et al.  On finding narrow passages with probabilistic roadmap planners , 1998 .

[20]  Rodney A. Brooks,et al.  A subdivision algorithm in configuration space for findpath with rotation , 1983, IEEE Transactions on Systems, Man, and Cybernetics.

[21]  Jeffrey C. Trinkle,et al.  A framework for planning dexterous manipulation , 1991, Proceedings. 1991 IEEE International Conference on Robotics and Automation.

[22]  Jean Latombe.  Motion Planning with Uncertainty: The Preimage Backchaining Approach , 1988 .

[23]  Leo Joskowicz,et al.  Computational Kinematics , 1991, Artif. Intell..

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

[25]  Lydia E. Kavraki,et al.  A Random Sampling Scheme for Path Planning , 1997, Int. J. Robotics Res..

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

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

[28]  Leo Joskowicz,et al.  Parametric kinematic tolerance analysis of general planar systems , 1998, Comput. Aided Des..

[29]  Osamu Takahashi,et al.  Motion planning in a plane using generalized Voronoi diagrams , 1989, IEEE Trans. Robotics Autom..

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

[31]  Christoph M. Hoffmann,et al.  Robustness in Geometric Computations , 2001, J. Comput. Inf. Sci. Eng..

[32]  Leo Joskowicz,et al.  Dynamical simulation of planar systems with changing contacts using configuration spaces , 1998 .

[33]  Mark H. Overmars,et al.  The Gaussian sampling strategy for probabilistic roadmap planners , 1999, Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C).

[34]  Jean-Claude Latombe,et al.  Motion Planning: A Journey of Robots, Molecules, Digital Actors, and Other Artifacts , 1999, Int. J. Robotics Res..

[35]  Steven Dubowsky,et al.  On computing the global time-optimal motions of robotic manipulators in the presence of obstacles , 1991, IEEE Trans. Robotics Autom..

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

[37]  Russell H. Taylor,et al.  Interference-Free Insertion of a Solid Body Into a Cavity: An Algorithm and a Medical Application , 1996, Int. J. Robotics Res..

[38]  Steven M. LaValle,et al.  RRT-connect: An efficient approach to single-query path planning , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).

[39]  Pierre Bessière,et al.  The Ariadne's Clew Algorithm , 1993, J. Artif. Intell. Res..