A Sub-assembly Identification Algorithm for Assembly Sequence Planning

DOI

10.2991/iiicec-15.2015.127How to use a DOI?

Keywords

Sub-assembly; Identification; Assembly sequence planning; Weighted undirected connected graph; Matlab.

Abstract

In order to simplify assembly sequences, reduce assembly difficulty and costs, and guide product assembling process, a sub-assembly identification algorithm is presented and applied to assembly sequence planning problems in the field of intelligent planning. It is used to identify sub-assemblies in the assemblies of different sizes. Through establishing a weighted undirected connected graph, the relations between the parts in an assembly is represented and base parts are determined. The algorithm is designed and realized in Matlab. Its feasibility is verified by a motorcycle assembly instance. It is proved that the sub-assembly identification algorithm can be used to optimize assembly sequences and shorten assembly sequence planning time.

Copyright

© 2015, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Yan Cao
AU  - Xiaoxi Kou
AU  - Sen Cao
PY  - 2015/03
DA  - 2015/03
TI  - A Sub-assembly Identification Algorithm for Assembly Sequence Planning
BT  - Proceedings of the 2015 International Industrial Informatics and Computer Engineering Conference
PB  - Atlantis Press
SP  - 555
EP  - 558
SN  - 2352-538X
UR  - https://doi.org/10.2991/iiicec-15.2015.127
DO  - 10.2991/iiicec-15.2015.127
ID  - Cao2015/03
ER  -