装配序列规划中子装配体自动生成的算法

A Subassembly Automatic Generation Aalgorithm in Assembly Sequence Planning

机械产品的子装配体划分是减小装配序列规划问题求解空间规模的有效途径之一。针对产品的子装配体识别的问题，提出了一种基于图搜索策略的子装配体识别方法。首先给出了产品子装配体的定义和性质，建立了表达装配体联接关系与零件空间位向关系的联接关系图与有向阻碍图模型；然后通过对联接关系图的极大连通子图的搜索，对有向阻碍图结点的合并与边的动态调整来生成子装配体，给出了算法详细的实现步骤，并利用一个实例验证了所提出方法的正确性和可行性。

Subassembly partition for the mechanical product is one of the effective ways to reduce the scale of assembly sequence planning problem. Aimed at the product＇ s subassembly identification and generation problem, a subassembly generation approach was proposed based on the strategy of graph search. Firstly, the definition and properties of the subassembly was given, the product＇ s graph model of connectivity relationship graph and directional blocking graph were established; Secondly, a subassembly is generated according to search the maximal connected subgraph of the connectivity relationship graph, merging nodes and dynamically adjusting the directed edges of the directional blocking graph. The detailed steps of the algorithm were given and an illustrative case study was taken to testify the validity of the presented methodology.