摘要
以问题规约的求解策略，以分解法规划产生的装配序列，提出与或图表达装配体拆卸序列解空间。通过求解拆卸序列与或图的解空间得到装配体的拆卸序列，将拆卸序列反向得到装配序列。为降低装配体拓扑联接图的复杂度，对作业组件做识别，文中提出判断零件拆卸性的 ３ 个条件，大部分零件无需进行干涉检验，而由逻辑推理即可判断是否满足拆卸条件，每一成功拆卸操作对应于一个拆卸或装配序列，避免了多次试凑，有更高求解效率，可更广泛地用于装配序列求解上。
In this paper, we discuss on assembly process planning problem using decomposition method ,put forward union graph to represent disassemble process planning space. we will get disassemble process planning by disassemble union graph space, then generate assembly process planning. In order to degrade complexity of Connectivity Graph, work components are determined. This paper give three promotions to determine the component's disassemblity, most component have not to be tested to know its disassemblity. It is more efficient to be used in assembly process planning problem.
出处
《机械与电子》
1999年第5期41-43,共3页
Machinery & Electronics
