期刊文献+

基于双臂共轴桁架机器人的钣金件分拣顺序规划

Sheet metal part sorting sequence planning based on dual-arm co-axial truss robot
下载PDF
导出
摘要 针对双臂共轴桁架机器人在执行钣金件分拣任务需要避免机械臂自碰撞而原地等待导致的任务运行时间长、效率低等问题,提出一种考虑自避障等待时间的分拣顺序规划方案。该方案将两个机械臂分为主臂和从臂,主臂的顺序规划采用LKH(Lin-Kernighan-Helsgaun)算法,从臂的顺序规划将LKH算法与遗传算法结合,在规划时考虑两个机械臂的碰撞,以减少机械臂的等待时间,提高运行效率。在仿真验证中,该方案与双臂均以最短路径为目标,采用LKH算法进行顺序规划方案对比。仿真结果表明,所提方法较不考虑自碰撞的方法均可缩减4%以上时间,该方法可拓展应用于多臂共轴桁架机器人协同场景。 To address the problems of long operation time and low efficiency due to the need to wait in place for dual-arm co-axial truss robot to avoid self-collision between arms in the sheet metal part sorting process,a sorting sequence planning method considering self-collision was proposed.The two arms were marked master and slave arms respectively.For the master arm,the Lin-Kernighan-Helsgaun(LKH)algorithm was used;for the slave arm,the genetic algorithm combined with the LKH algorithm was used.Self-collision between the two arms was considered in the planning of the slave arm to reduce the waiting time and improve the operation efficiency of the sorting process.In the numerical simulation validation,the proposed method was compared with mere LKH algorithm for both arms.The simulation results showed that the proposed method could reduce the operation time by more than 4%compared with the method without considering self-collision.The method could also be extended to multi-arm co-axial truss robot.
作者 王育文 明伟伟 张执南 WANG Yuwen;MING Weiwei;ZHANG Zhinan(School of Mechanical Engineering,Shanghai Jiao Tong University,Shanghai 200240,China)
出处 《计算机集成制造系统》 EI CSCD 北大核心 2024年第5期1770-1778,共9页 Computer Integrated Manufacturing Systems
基金 上海市科技计划资助项目(23PJ1405700)。
关键词 钣金件 分拣顺序规划 Lin-Kernighan-Helsgaun算法 遗传算法 sheet metal part sorting sequence planning Lin-Kernighan-Helsgaun algorithm genetic algorithms
  • 相关文献

参考文献6

二级参考文献37

  • 1邹鹏,周智,江贺,陈国良,顾钧.求解旅行商问题的循环局部搜索算法的运行时间和性能分布分析[J].计算机学报,2006,29(1):92-99. 被引量:24
  • 2高海昌,冯博琴,朱利b.智能优化算法求解TSP问题[J].控制与决策,2006,21(3):241-247. 被引量:120
  • 3刘兴,贺国光.车辆路径问题的禁忌搜索算法研究[J].计算机工程与应用,2007,43(24):179-181. 被引量:14
  • 4REINELT G.The traveling salesman:computational solu-tions for TSP applications[M].Berlin,Heidelberg:Springer-Verlag,1994.
  • 5LAND A,DOIG G.An automatic method of solving dis-crete programming problems[J].Econometrica,1960,28(3):497-520.
  • 6MARTIN G,OLAF H.Solution of large-scale symmetrictravelling salesman problems[J].Mathematical Program-ming,1991,51(1):141-202.
  • 7ROSENKRANTZ D.Approximate algorithms for the trav-eling salesperson problem[C]//Proceedings of the 15thAnnual Symposium on Sw itching and Automata Theory.[S.l.]:[s.n.],1974:33-42.
  • 8CLARKE G,WRIGHt W.Scheduling of vehicles from acentral depot to a number of delivery points[J].Opera-tions Research,1964,12(4):568-581.
  • 9CHRISTOFIDES N.Worst-case analysis of a new heuris-tic for the travelling salesman problem[J].OPERA-TIONS RESEARCH,1976,21(2):112-124.
  • 10CROES G.A Method for solving traveling-salesman prob-lems[J].Operations Research,1958,6(6):791-812.

共引文献19

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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