摘要
针对虚拟装配中装配序列规划问题,构建了基于拆卸法的装配序列求解方法。引入了拆卸操作和拆卸约束矩阵,提出了以无序树作为拆卸操作的数据存储结构,并给出装配序列求解的具体算法,建立了装配序列的评价模型,并通过案例验证了算法的可行性。
According to Assembly Sequence Planning（ASP） in virtual assembly, used the disassembly ideological to find the assembly sequence. Established the model based on disassembly constrain relation and defined the disassembly operation and disassembly constraint matrix. It also put forward an unordered tree as disassembly operation data storage structure and presented a feasible disassembly sequence extraction method. It established the assembly sequence evaluation model. It verifies the feasibility of the algorithm through a case.
出处
《现代制造工程》
CSCD
北大核心
2014年第1期21-24,63,共5页
Modern Manufacturing Engineering
关键词
装配序列规划
拆卸操作
拆卸约束矩阵
无序树
评价模型
assembly sequence planning
disassembly operation
disassembly constraint matrix
unordered tree
evaluation model
