| 基于消除交叉点的蚁群算法锡焊机器人路径优化 |
| |
| 引用本文： | 陈立,谢富强,张亮. 基于消除交叉点的蚁群算法锡焊机器人路径优化[J]. 计算机系统应用, 2015, 24(7): 254-258 |
| |
| 作者姓名： | 陈立 谢富强 张亮 |
| |
| 作者单位： | 南华大学电气工程学院,衡阳,421001 |
| |
| 基金项目： | 湖南省科技厅项目(2013FJ3154);航天支撑基金项目(2013ZGDZDX) |
| |
| 摘 要： | 针对基本蚁群算法在锡焊机器人路径优化存在交叉点的不足，提出了一种自动消除焊接路径中交叉点的算法，将其与蚁群算法融合，通过增加消除交叉环节，可以得到更优的焊接路径，减少焊接电路板的时间消耗。还针对消除交叉会增加时间代价这一不足，对消除交叉点算法与蚁群算法融合的方式进行分析研究，得出时间代价较小，优化结果较好的融合方式。通过200个焊点的仿真结果表明该算法有较好的效果。
|
| 关 键 词： | 蚁群算法 消除交叉 路径优化 |
| 收稿时间： | 2014-10-24 |
| 修稿时间： | 2014-12-01 |
Soldering Robot Path Optimization Based on Removed Cross Point Ant Colony Algorithm |
| |
| CHEN Li,XIE Fu-Qiang and ZHANG Liang. Soldering Robot Path Optimization Based on Removed Cross Point Ant Colony Algorithm[J]. Computer Systems& Applications, 2015, 24(7): 254-258 |
| |
| Authors: | CHEN Li XIE Fu-Qiang ZHANG Liang |
| |
| Affiliation: | College of Electric Engineering, University of South China, Hengyang 421001, China;College of Electric Engineering, University of South China, Hengyang 421001, China;College of Electric Engineering, University of South China, Hengyang 421001, China |
| |
| Abstract: | Concerning the short comings of ant colony algorithm on soldering robot path optimization,we propose an algorithm to remove cross point on the welding path automaticly and fusion it with the ant colony algorithm. By increasing the link in removing cross point, we can get a better welding path, reduce the time consumption of welding circuit board. Because the link in removing cross point will increase the time cost, this paper is to analysis and research the method for fusion of remove cross point algorithm and ant colony algorithm, hoping to find a less time's cost and a fusion method of better optimization results.Simulation of the 200 solder joints, results show that the algorithm has a better effect. |
| |
| Keywords: | ant colony algorithm remove the cross point path optimization |
| 本文献已被 万方数据 等数据库收录！ |
| 点击此处可从《计算机系统应用》浏览原始摘要信息 |
|
点击此处可从《计算机系统应用》下载全文 |
|
