期刊文献+

基于GA-PSO算法焊接机器人路径规划研究 被引量:9

Research on Path Planning of Welding Robot Based on GA-PSO Algorithm
下载PDF
导出
摘要 焊接机器人在制造业中有广泛的应用。在焊接任务中通常有许多焊接接头,合理地规划焊接路径使其穿过这些焊接接头,对焊接效率的提高有积极的影响。传统的手工路径规划技术可以有效地处理少量焊接接头,但当焊接节点数目较大时,很难获得最优路径。传统的手工路径规划方法耗时长、效率低,不能保证最优。遗传-粒子群优化算法(GA-PSO)基于遗传算法(GA)和粒子群优化算法(PSO)的优点来解决焊接机器人的路径规划问题。仿真结果表明,该算法具有较强的搜索能力和实用性,适用于焊接机器人路径规划。 Welding robots have a wide range of applications in manufacturing industries.There are usually many welded joints in the welding task,and a reasonable welding path passes through these welded joints has a significant impact on the welding efficiency.Traditional manual path planning techniques can handle a small number of welded joints effectively,but when the number of welded joints is large,it is difficult to obtain the optimal path.The traditional manual path planning method is also time consuming and inefficient,and cannot guarantee optimality.Genetic algorithm-particle swarm optimization(GA-PSO)is based on the advantages of genetic algorithm(GA)and particle swarm optimization(PSO)to solve the welding robot path planning problem.The simulation results indicate that the algorithm has strong searching ability and practicality and is suitable for welding robot path planning.
作者 尤田 张威 葛琳琳 You Tian;Zhang Wei;Ge Linlin(School of Computer and Communication Engineering,Liaoning Shihua University,Fushun Liaoning 113001,China)
出处 《辽宁石油化工大学学报》 CAS 2018年第2期85-89,共5页 Journal of Liaoning Petrochemical University
基金 抚顺市科学技术发展资金计划项目(FSKJHT201548) 辽宁省大学生创新创业项目(201410148060 201510148068)
关键词 焊接机器人 路径规划 遗传算法 粒子群优化算法 全局最优 Welding Robot Path planning Genetic algorithm Particle swarm optimization Global optimum
  • 相关文献

参考文献7

二级参考文献42

  • 1韩建华.皮带卸料小车自动布料的改进[J].中国矿山工程,2005,34(4):38-40. 被引量:4
  • 2陈文兰,戴树贵.旅行商问题算法研究综述[J].滁州学院学报,2006,8(3):1-6. 被引量:26
  • 3刘金琨.机器人控制系统的设计与MATLAB仿真[M].北京:清华大学出版社,2008.
  • 4陈阳.白车身焊接机器人工位规划的仿真及优化[D].上海:同济大学机械工程学院,2006.
  • 5Dantzig G B.Solution of a large scale traveling salesman problem[J].Operations Research,1954,2(4):393.
  • 6Bellman R.Dynamic programming treatment of the traveling salesman problem[J].Journal of The Association for Computing Machinery,1962(8):61.
  • 7Carpaneto G,Toth P.Some new branching and bounding criteria for the asymmetric traveling salesman problem[J].Management Science,1980 (26):736.
  • 8Zitar Raed Abu,Hanandeh Esaam,Shehabat Essa.Genetic algorithm with neighbor solution approach for traveling salesman problem[J].Neural Network World,2007,17(5):497.
  • 9Maekawa Keijil,Mori Naokil,Tamaki Hisashil,et al.A Genetic solution for the traveling salesman problem by means of a thermo dynamical selection rule[C] //Proceedings of the IEEE Conference on Evolutionary Computation.Nagoya:Nagoya University,1996:529-534.
  • 10Chatterjee Sangitl,Carrera Cecilial,Lynch Lucy A.Genetic algorithms and traveling salesman problems[J].European Journal of Operational Research,1996,93(3):490.

共引文献34

同被引文献52

引证文献9

二级引证文献52

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部