| 基于干涉矩阵的装配序列规划 |
| |
| 引用本文： | 陈天凡,汤文成. 基于干涉矩阵的装配序列规划[J]. 机械制造与自动化, 2007, 36(1): 36-38,41 |
| |
| 作者姓名： | 陈天凡 汤文成 |
| |
| 作者单位： | 福建信息职业技术学院,福建,福州,350003;东南大学机械系,江苏,南京,210096 |
| |
| 摘 要： | 阐述了利用干涉矩阵进行装配方向可行性判断和应用遗传算法进行装配序列规划的方法.干涉矩阵可从三维CAD系统中得到,为减少搜索空间和更快得到能满足装配工艺性的最佳装配序列,可结合装配工艺性和装配的特点对干涉矩阵适当进行处理.该方法有利于实现从三维CAD系统到装配序列的自动规划,最后以实例通过MATLAB编程说明该方法的可行性.
|
| 关 键 词： | 干涉矩阵 装配方向 遗传算法 装配序列规划 |
| 文章编号： | 1671-5276（2007）01-0036-03 |
| 修稿时间： | 2006-07-11 |
Assembly Sequence Planning Based on Clashes Matrix |
| |
| CHEN Tian-fan,TANG Wen-cheng. Assembly Sequence Planning Based on Clashes Matrix[J]. Machine Building & Automation, 2007, 36(1): 36-38,41 |
| |
| Authors: | CHEN Tian-fan TANG Wen-cheng |
| |
| Affiliation: | 1. Fujian Polytechnic of Information Technology, Fuzhou 350003, China; 2. Mechanics Dept; Southeast University, Nanjing 210096, China |
| |
| Abstract: | The method of judging by feasibility about assembly direction with clashes matrix and assembly sequence planning using genetic algorithms was explained. Clashes matrix can be obtained from the three-dimensional CAD system, and dealed with properly in order to reduce the search space and find optimal assembly sequence faster. This method was favorable to realize the automatic planning from the three-dimensional CAD system to assembly sequence. The feasibility of the method was explained by MATLAB program. |
| |
| Keywords: | clashes matrix assembly direction genetic algorithms assembly sequence planning |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
