基于拆卸约束图的产品可行拆卸序列生成算法

Feasible Disassembly Sequence Generation Algorithm Based on Disassembly Constraint

拆卸序列生成是拆卸工艺及规划的重要内容之一。针对拆卸序列规划过程中的可行拆卸序列遗漏问题,首先阐述了拆卸约束图(disassembly constraint graph,DCG)理论,提出了一种基于干涉矩阵的邻接点判断方法,结合拆卸约束图,建立拆卸模型,给出了生成产品所有可行拆卸序列的算法。最后,给出了一个生成可行拆卸序列实例,验证了这一方法的可行性及其有效性。关键词:拆卸;拆卸序列规划;拆卸约束图;

Disassembly sequence generation is vital for disassembly planning, but some feasible disassembly sequences are omitted during the disassembly sequence planning. To solve the problem, we explain the disassembly constraint graph （DCG） and then propose the adjacent point judgment method based on interference matrix. Combining the method with the DCG, we establish disassembly models and present all the feasible disassembly sequence generation algorithm. Finally we give an instance of feasible disassembly sequence generation to verify the feasibility and effectiveness of the method.