装配体可行拆卸操作生成

Assembly Feasible Disassembly Operations Construction

为了高效地规划装配体的拆卸序列,利用1维拆卸回溯分析算法生成所有可行子装配体和1维拆卸操作,并在此基础上提出了m维拆卸分析算法来构造所有m维可行的拆卸操作,以算法生成的可行子装配体为顶点和以可行拆卸操作为有向边便可构建拆卸与或图。对算法在C++Builder平台中进行编程实现,并以一个装配体为例验证算法的可行性。

To plan product disassembly sequence efficiently,all feasible 1-dimension disassembly operations and all feasible sub-assemblies were constructed by 1-dimension disassembly trace-back analysis algorithm,and then all m-dimension disassembly operations were created by m-dimension disassembly analysis algorithm.The disassembly And/Or graph was constructed,which vertices were sub-assemblies and directed edges were disassembly operations got from the algorithms.Finally,the algorithm was realized by a C＋＋ Builder program,and the feasibility of the algorithm was validated by a case study.