基于子装配识别和有向割集的装配序列研究

Assembly Sequence Based on Sub-assembly Identification and Cut Sets of Directed Graph

基于图论和子装配识别,提出了装配序列规划方法。把有向图理论运用到装配建模,提出了用有向装配关联图来表示装配关系。通过对装配体的结构分析,定义了子装配体,并且将子装配体进行分类。然后通过子装配识别和有向图割集,实现了装配序列规划的生成。此方法比单独的有向割集计算量少、产生的序列少。最后将该算法运用到阀门装配体中,验证了其有效性。

A novel method for assembly sequence planning is proposed based on the theory of graph and sub-assembly identification. By introducing the directed graph into assembly modeling, a new model of product representation, directed assembly connection graph, is constructed. Through analyzing the structure of assembly, the sub-assembly is defined and classified. Then sub-assembly identification and the directed cut sets is brought forward to generate assembly sequences. Compared with cut sets of the directed graph, the new method generates less invalid sequences, and has less computational complexity. Finally, experimental results are presented to verify the effectiveness of the algorithm.