提高产品装配联接图分解效率的算法研究

Approach to Efficiency Improvement in Assembly Liaison Graph Decomposition

割集生成算法和子图过滤算法是基于割集的装配序列规划的基础,本文通过分析不同基本割集组合之间的关系,设计了更合理的割集生成算法,同时还引进了有序二叉决策图OBDD表示子图集合,设计了更高效的算法以过滤已分解的子图,从而提高了装配联接图的分解效率.

Algorithms of generating cut-sets and filtering sub-graph of a graph are the base of assembly planning based on cut-set. An algorithm is designed to generate the cut-sets of a graph in a more logical way after an analysis of the relationships between combinations of basic cut-sets. In addition, Ordered Binary Decision Diagrams （OBDD） is employed to represent sub-graph set. A more efficient algorithm is designed to implement the filter of the decomposed sub-graphs. In this way, we improve the efficiency of assembly liaison graph decomposition.