摘要
基于割集的拆卸序列求解算法是拆卸序列自动规划的主要方法,基于割集的拆卸序列求解算法要解决的关键问题是组合复杂性问题。从降低算法的时间复杂度出发,在前人研究的基础上提出一种直接生成符合优先关系要求的割集的算法,减少了不必要的割集的生成,进一步降低了算法的时间复杂度。
The algorithm for generation of mechanical disassembly sequences base on cut-set is the main technique for disassembly planning automatically. The problem is how to avoid combinations explosion when the algorithm is adopted. In order to reduce the cost of time,presents an algorithm to generate straightway those cut-set accorded with the precedence ralationship. This algorithm avoids to generate those cut-set unaccorded with the precedence ralationship, reduces uheriorly the cost of time.
出处
《现代制造工程》
CSCD
2005年第11期37-40,共4页
Modern Manufacturing Engineering
关键词
拆卸序列
割集
优先关系
Disassembly sequences
Cut-set
Precedence relationship
