Soldering Robot Path Optimization Based on Removed Cross Point Ant Colony Algorithm
DOI:
CSTR:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    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.

    Reference
    Related
    Cited by
Get Citation

陈立,谢富强,张亮.基于消除交叉点的蚁群算法锡焊机器人路径优化.计算机系统应用,2015,24(7):254-258

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:October 24,2014
  • Revised:December 01,2014
  • Adopted:
  • Online: July 17,2015
  • Published:
Article QR Code
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-3
Address:4# South Fourth Street, Zhongguancun,Haidian, Beijing,Postal Code:100190
Phone:010-62661041 Fax: Email:csa (a) iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063