A correct and complete algorithm for the generation of mechanical assembly sequences

The authors present an algorithm for the generation of mechanical assembly sequences and a proof of its correctness and completeness. The algorithm uses a relational model which describes the geometry of the assembly and the attachments that bind one part to another. The problem of generating the assembly sequences is transformed into the problem of generating disassembly sequences, in which the disassembly tasks are the reverse of feasible assembly tasks. This transformation leads to a decomposition approach in which the problem of disassembling one assembly is decomposed into distinct subproblems, each involving the disassembly of one subassembly. It is assumed that at each assembly task exactly two subassemblies are mated and that all contacts between the parts in the two subassemblies are established. The algorithm yields an AND/OR graph representation of assembly sequences. The correctness of the algorithm is based on the assumption that it is always possible to decide correctly whether two subassemblies can be joined based on geometrical and physical criteria. An approach to compute this decision is given, and bounds for the amount of computation required are presented. >

[1]  Ann Patricia Fothergill,et al.  An Interpreter for a Language for Describing Assemblies , 1980, Artif. Intell..

[2]  Daniel Flanagan Baldwin.  Algorithmic methods and software tools for the generation of mechanical assembly sequences , 1990 .

[3]  Russell H. Taylor,et al.  The synthesis of manipulator control programs from task-level specifications , 1976 .

[4]  Robin J. Popplestone,et al.  RAPT, A Language for Describing Assemblies , 1978 .

[5]  Narsingh Deo,et al.  Graph Theory with Applications to Engineering and Computer Science , 1975, Networks.

[6]  Arthur C. Sanderson,et al.  Evaluation and selection of assembly plans , 1990, Proceedings., IEEE International Conference on Robotics and Automation.

[7]  Tomás Lozano-Pérez,et al.  A Geometric Modeling System for Automated Mechanical Assembly , 1980, IBM J. Res. Dev..

[8]  C. L. Liu,et al.  Introduction to Combinatorial Mathematics. , 1971 .

[9]  Man-Cheung Max Lui.  Generation and evaluation of mechanical assembly sequences using the liaison-sequence method , 1988 .

[10]  Arthur C. Sanderson,et al.  AND/OR graph representation of assembly plans , 1986, IEEE Trans. Robotics Autom..

[11]  Arthur C. Sanderson,et al.  Task planning for robotic manipulation in space applications , 1988 .

[12]  David Chapman,et al.  Planning for Conjunctive Goals , 1987, Artif. Intell..

[13]  Arthur C. Sanderson,et al.  Planning Assembly/Disassembly Operations For Space Telerobotics , 1987, Other Conferences.

[14]  Ann Patricia Fothergill,et al.  Inferring the Positions of Bodies from Specified Spatial Relationships , 1974, Artif. Intell..

[15]  K. G. Swift,et al.  Design for assembly , 1983 .

[16]  A. Sanderson,et al.  Task planning and control synthesis for flexible assembly systems , 1987 .

[17]  J. M. Henrioud,et al.  Détermination des arbres d'assemblage , 1990 .

[18]  Thomas L. DeFazio,et al.  Simplified generation of all mechanical assembly sequences , 1987, IEEE Journal on Robotics and Automation.

[19]  Randall H. Wilson,et al.  Maintaining geometric dependencies in an assembly planner , 1990, Proceedings., IEEE International Conference on Robotics and Automation.

[20]  Karl G. Kempf,et al.  Opportunistic scheduling for robotic assembly , 1985, Proceedings. 1985 IEEE International Conference on Robotics and Automation.