Deterministic path planning for planar assemblies

I present a deterministic path planning algorithm for an assembly of rigid planar parts connected by joints. The part boundaries are comprised of line segments and circular arcs. The algorithm is based on configuration space computation and search. It is complete for one moving part and is heuristic for multiple parts. It is the first complete algorithm that is practical for real-world applications. It is more reliable than randomized algorithms, which are inherently incomplete. It solves problems with many parts, crowded environments, tight part fits, and closed chains.

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

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

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

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

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

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

[7]  Chandrajit L. Bajaj,et al.  Sliced Configuration Spaces for Curved Planar Bodies , 1998, Int. J. Robotics Res..

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

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

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

[11]  Michael E. Caine,et al.  The Design of Shape from Motion Constraints , 1993 .

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

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

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

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

[16]  Bruce Randall Donald,et al.  The Motion of Planar, Compliantly Connected Rigid Bodies in Contact, With Applications to Automatic Fastening , 1993, Int. J. Robotics Res..

[17]  Jean-Daniel Boissonnat,et al.  A practical exact motion planning algorithm for polygonal objects amidst polygonal obstacles , 1988, Proceedings. 1988 IEEE International Conference on Robotics and Automation.

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

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

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

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