A General Framework for Assembly Planning: The Motion Space Approach

Abstract. Assembly planning is the problem of finding a sequence of motions to assemble a product from its parts. We present a general framework for finding assembly motions based on the concept of motion space . Assembly motions are parameterized such that each point in motion space represents a mating motion that is independent of the moving part set. For each motion we derive blocking relations that explicitly state which parts collide with other parts; each subassembly (rigid subset of parts) that does not collide with the rest of the assembly can easily be derived from the blocking relations. Motion space is partitioned into an arrangement of cells such that the blocking relations are fixed within each cell. We apply the approach to assembly motions of several useful types, including one-step translations, multistep translations, and infinitesimal rigid motions. Several efficiency improvements are described, as well as methods to include additional assembly constraints into the framework. The resulting algorithms have been implemented and tested extensively on complex assemblies. We conclude by describing some remaining open problems.

[1]  Leonidas J. Guibas,et al.  On translating a set of rectangles , 1980, STOC '80.

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

[3]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[4]  Herbert Edelsbrunner,et al.  Algorithms in Combinatorial Geometry , 1987, EATCS Monographs in Theoretical Computer Science.

[5]  Heedong Ko,et al.  Automatic assembling procedure generation from mating conditions , 1987 .

[6]  Balas K. Natarajan On planning assemblies , 1988, SCG '88.

[7]  Richard A. Volz,et al.  On the automatic generation of plans for mechanical assembly , 1988 .

[8]  Bruce Randall Donald The complexity of planar compliant motion planning under uncertainty , 1988, SCG '88.

[9]  Arthur C. Sanderson,et al.  Task sequence planning for robotic assembly , 1989 .

[10]  Richard Hoffman Automated assembly in a CSG domain , 1989, Proceedings, 1989 International Conference on Robotics and Automation.

[11]  Arthur C. Sanderson,et al.  A correct and complete algorithm for the generation of mechanical assembly sequences , 1989, Proceedings, 1989 International Conference on Robotics and Automation.

[12]  Esther M. Arkin,et al.  On monotone paths among obstacles with applications to planning assemblies , 1989, SCG '89.

[13]  Thomas C. Henderson,et al.  A Survey of General- Purpose Manipulation , 1989, Int. J. Robotics Res..

[14]  Thomas L. DeFazio,et al.  An integrated computer aid for generating and evaluating assembly sequences for mechanical products , 1991, IEEE Trans. Robotics Autom..

[15]  D. Dutta,et al.  Automatic Disassembly and Total Ordering in Three Dimensions , 1991 .

[16]  Arthur C. Sanderson,et al.  A correct and complete algorithm for the generation of mechanical assembly sequences , 1991, IEEE Trans. Robotics Autom..

[17]  Randall H. Wilson,et al.  On geometric assembly planning , 1992 .

[18]  A. Delchambre,et al.  KBAP: an industrial prototype of knowledge-based assembly planner , 1992, Proceedings 1992 IEEE International Conference on Robotics and Automation.

[19]  Mark de Berg,et al.  Computing and verifying depth orders , 1992, SCG '92.

[20]  Randall H. Wilson,et al.  Partitioning An Assembly For Infinitesimal Motions In Translation And Rotation , 1992, Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems.

[21]  Mark de Berg Ray Shooting, Depth Orders and Hidden Surface Removal , 1993, Lecture Notes in Computer Science.

[22]  Micha Sharir,et al.  On the Zone Theorem for Hyperplane Arrangements , 1993, SIAM J. Comput..

[23]  H. Hirukawa,et al.  Automatic determination of possible velocity and applicable force of frictionless objects in contact from a geometric model , 1994, IEEE Trans. Robotics Autom..

[24]  Leonidas J. Guibas,et al.  Vertical decompositions for triangles in 3-space , 1994, SCG '94.

[25]  Jean-Claude Latombe,et al.  Geometric Reasoning About Mechanical Assembly , 1994, Artif. Intell..

[26]  Jean-Claude Latombe,et al.  Assembly sequencing with toleranced parts , 1995, SMA '95.

[27]  Lydia E. Kavraki,et al.  Two-Handed Assembly Sequencing , 1995, Int. J. Robotics Res..

[28]  Leonidas J. Guibas,et al.  A simple and efficient procedure for polyhedral assembly partitioning under infinitesimal motions , 1995, Proceedings of 1995 IEEE International Conference on Robotics and Automation.

[29]  J. Latombe,et al.  A Simple and E cient Procedure for Polyhedral Assembly Partitioning under In nitesimal Motions , 1995 .

[30]  Michael H. Goldwasser,et al.  AN EFFICIENT SYSTEM FOR GEOMETRIC ASSEMBLY SEQUENCE GENERATION AND EVALUATION , 1995 .

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

[32]  Randall H. Wilson,et al.  Assembly partitioning along simple paths: the case of multiple translations , 1995, Proceedings of 1995 IEEE International Conference on Robotics and Automation.

[33]  Lydia E. Kavraki,et al.  Partitioning a Planar Assembly Into Two Connected Parts is NP-Complete , 1995, Inf. Process. Lett..

[34]  An implementation for maintaining arrangements of polygons , 1995, SCG '95.

[35]  Micha Sharir,et al.  Efficient generation of k-directional assembly sequences , 1996, SODA '96.

[36]  Mark H. Overmars,et al.  Algorithms for fixture design , 1996 .

[37]  Randall H. Wilson A framework for geometric reasoning about tools in assembly , 1996, Proceedings of IEEE International Conference on Robotics and Automation.

[38]  Leonidas J. Guibas,et al.  Vertical decompositions for triangles in 3-space , 1996, Discret. Comput. Geom..

[39]  Randall H. Wilson,et al.  Assembly partitioning along simple paths: the case of multiple translations , 1996, Adv. Robotics.

[40]  Rajeev Motwani,et al.  On Certificates and Lookahead in Dynamic Graph Problems , 1996, SODA '96.

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

[42]  B. Faverjon,et al.  Probabilistic Roadmaps for Path Planning in High-Dimensional Configuration Spaces , 1996 .

[43]  Jean-Claude Latombe,et al.  Assembly sequencing with toleranced parts , 1997, Comput. Aided Des..

[44]  Rajeev Motwani,et al.  Intractability of Assembly Sequencing: Unit Disks in the Plane , 1997, WADS.

[45]  Bruce Romney On the concurrent design of assembly sequences and fixture , 1997 .

[46]  Gert Vegter,et al.  In handbook of discrete and computational geometry , 1997 .

[47]  Jean-Daniel Boissonnat,et al.  On Computing Four-Finger Equilibrium and Force-Closure Grasps of Polyhedral Objects , 1997, Int. J. Robotics Res..

[48]  Randall H. Wilson,et al.  Constraint-based interactive assembly planning , 1997, Proceedings of International Conference on Robotics and Automation.

[49]  J. Latombe,et al.  Probabilistic Roadm Aps for Path Planning in High-dimensional Connguration Spaces , 1997 .

[50]  Randall H. Wilson Geometric Reasoning about Assembly Tools , 1998, Artif. Intell..

[51]  Rajeev Motwani,et al.  Complexity Measures for Assembly Sequences , 1999, Int. J. Comput. Geom. Appl..