Representations of mechanical assembly sequences

Author

De Mello, Luiz S Homem ; Sanderson, Arthur C.

Author_Institution

Jet Propulsion Lab., California Inst. of Technol., Pasadena, CA, USA

Volume

7

Issue

2

fYear

1991

fDate

4/1/1991 12:00:00 AM

Firstpage

211

Lastpage

227

Abstract

Five types of representations for assembly sequences are reviewed: the directed graph of feasible assembly sequences; the AND/OR graph of feasible assembly sequences; the set of establishment conditions, and two types of precedence relationships namely those between the establishment of one connection between parts and the establishment of another connection, and those between the establishment of one connection and states of the assembly process. The mappings of one representation into the others are established. The correctness and completeness of these representations are established. The results presented are needed in the proof of correctness and completeness of algorithms for the generation of mechanical assembly sequences

Keywords

assembling; graph theory; scheduling; AND/OR graph; assembly sequence representation; directed graph; establishment conditions; mechanical assembly sequences; precedence relationships; Artificial intelligence; Assembly systems; Intelligent control; Intelligent robots; Laboratories; Orbital robotics; Propulsion; Robotic assembly; Robotics and automation; Space technology;

fLanguage

English

Journal_Title

Robotics and Automation, IEEE Transactions on

Publisher

ieee

ISSN

1042-296X

Type

jour

DOI

10.1109/70.75904

Filename

75904