Assembly sequence planning based on graph reduction

Author

Tao Lu ; Bo Zhang ; Peifa Jia

Author_Institution

Dept. of Comput. Sci. & Technol., Tsinghua Univ., Beijing, China

Volume

4

fYear

1993

fDate

19-21 Oct. 1993

Firstpage

119

Abstract

A new algorithm for assembly sequence planning is presented. Based on the quotient space model for problem solving, the algorithm can automatically generate multiple assembly sequences represented by a Hidag tree, which can be further translated into a set of linear sequences. The computational complexity of the algorithm is (1) O(N) for a weakly connected assembly and (2) O(N/sup 2/) for a strongly connected assembly, where N is the number of parts in the assembly.<>

Keywords

assembling; computational complexity; directed graphs; production control; production engineering computing; Hidag tree; assembly sequence planning; computational complexity; graph reduction; linear sequences; problem solving; quotient space model; strongly connected assembly; weakly connected assembly; Application specific processors; Artificial intelligence; Assembly systems; Computational complexity; Computer science; Problem-solving; Product design; Robotic assembly; Robotics and automation; Space technology;

fLanguage

English

Publisher

ieee

Conference_Titel

TENCON '93. Proceedings. Computer, Communication, Control and Power Engineering.1993 IEEE Region 10 Conference on

Conference_Location

Beijing, China

Print_ISBN

0-7803-1233-3

Type

conf

DOI

10.1109/TENCON.1993.320448

Filename

320448