基于工程语义信息的拆卸序列规划算法研究

Research on disassembly sequence planning algorithm based on engineering semantic information

为了解决拆卸序列规划理论算法存在的求解空间过大的问题,提出一种基于工程语义信息的规划算法。该算法借助装配约束条件、拆卸干涉状况等工程信息,实施产品拆卸顺序生成和路径推理,直接排除从工程角度不可能的拆卸序列,达到缩减求解空间的目的。保证了算法同工程实际的一致性,提高了其实际应用和软件编程能力。

To solve the problem of much bigger solution space existing in the theoretic Disassembly Sequence Planning （DSP） algorithm, an approach based on engineering semantic information to generate the disassembly sequence was put forward. According to this algorithm, by using the engineering information such as the assembly restrictions and disassembly intervention status, the generation and path reasoning of product disassembly sequence planning was implemented, and the disassembly sequence was removed which was impossible from engineering viewpoint, so that the solution space was reduced. The algorithm ensured the consistence with the actual engineering situation, and the practicability and the programmable capacity were greatly improved.