Assembly Sequence Planning

The sequence of mating operations that can be carried out to assemble a group of parts is constrained by the geometric and mechanical properties of the parts, their assembled configuration, and the stability of the resulting subassemblies. An approach to representation and reasoning about these sequences is described here and leads to several alternative explicit and implicit plan representations. The Pleiades system will provide an interactive software environment for designers to evaluate alternative systems and product designs through their impact on the feasibility and complexity of the resulting assembly sequences.

[1]  Earl D. Sacerdott.  Planning in a hierarchy of abstraction spaces , 1973, IJCAI 1973.

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

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

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

[5]  Arthur C. Sanderson,et al.  Automatic Generation of Mechanical Assembly Sequences , 1988 .

[6]  A. C. Sanderson,et al.  Precedence relationship representations of mechanical assembly sequences , 1989 .

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

[8]  Kunwoo Lee,et al.  A hierarchical data structure for representing assemblies: part I , 1985 .

[9]  David E. Wilkins,et al.  Domain-Independent Planning: Representation and Plan Generation , 1984, Artif. Intell..

[10]  Arthur C. Sanderson,et al.  Representations of Assembly Sequences , 1989, IJCAI.

[11]  Hui Zhang,et al.  Generation of precedence relations for mechanical assemblies , 1989 .

[12]  Earl D. Sacerdoti,et al.  Planning in a Hierarchy of Abstraction Spaces , 1974, IJCAI.

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

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

[15]  C. Cordell Green,et al.  Application of Theorem Proving to Problem Solving , 1969, IJCAI.

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

[17]  Russell H. Taylor,et al.  Subassembly Stability , 1988, AAAI.

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

[19]  Richard E. Korf,et al.  Planning as Search: A Quantitative Approach , 1987, Artif. Intell..

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

[21]  Michael A. Wesley,et al.  AUTOPASS: An Automatic Programming System for Computer Controlled Mechanical Assembly , 1977, IBM J. Res. Dev..

[22]  Andrew K. C. Wong,et al.  Machine Intelligence and Knowledge Engineering for Robotic Applications , 1987, NATO ASI Series.

[23]  Charles M. Eastman.  The Design of Assemblies , 1981 .