Representations of Assembly Sequences

This paper analyses four representations for assembly sequences which are based on directed graphs, on AND/OR graphs, on establishment conditions, and on precedence relationships. The latter includes two types: precedence relationships between the establishment of one connection between parts and the establishment of another connection, and precedence relatioships between the establishment of one connection and states of the assembly process. The paper discusses how each representation is related to the others. The correctness and completeness of these representations are also addressed. The results presented are needed to prove the correctness and completeness of algorithms for the generation of mechanical assembly sequences.

[1]  Manuel Blum,et al.  A Stability Test for Configurations of Blocks , 1970 .

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

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

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

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

[6]  Jörg Flum,et al.  Mathematical logic , 1985, Undergraduate texts in mathematics.

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

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

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