基于拆卸和拆卸约束矩阵的装配序列规划  

The assembly sequence planning based on disassembly and disassembly constraint matrix

作　　者：吕风县[1] 张桂香[1] 张庆洪[1] 

机构地区：[1]湖南大学机械与运载工程学院,长沙410082

出　　处：《现代制造工程》2014年第1期21-24,63,共5页Modern Manufacturing Engineering

摘　　要：针对虚拟装配中装配序列规划问题,构建了基于拆卸法的装配序列求解方法。引入了拆卸操作和拆卸约束矩阵,提出了以无序树作为拆卸操作的数据存储结构,并给出装配序列求解的具体算法,建立了装配序列的评价模型,并通过案例验证了算法的可行性。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.

关 键 词：装配序列规划 拆卸操作 拆卸约束矩阵 无序树 评价模型 

分 类 号：TP391.7[自动化与计算机技术—计算机应用技术]