华南理工大学学报(自然科学版) ›› 2017, Vol. 45 ›› Issue (10): 93-99.doi: 10.3969/j.issn.1000-565X.2017.10.013

• 电子、通信与自动控制 • 上一篇    下一篇

基于改进遗传算法的并联机器人分拣路径优化

张好剑 苏婷婷 吴少泓郑军 王云宽   

  1. 中国科学院 自动化研究所∥中国科学院大学,北京 100190
  • 收稿日期:2016-11-23 修回日期:2017-02-09 出版日期:2017-10-25 发布日期:2017-09-01
  • 通信作者: 吴少泓(1986-) ,女,博士,副研究员,主要从事机器视觉研究. E-mail:shaohong.wu@ia.ac.cn
  • 作者简介:张好剑(1982-),男,博士生,主要从事机器人技术与智能控制研究. E-mail:zhanghaojian2014@ia.ac.cn
  • 基金资助:
    河南省重大科技专项(161100210300)

Sorting Route Optimization of Parallel Robot Based on Improved Genetic Algorithm

ZHANG Hao-jian SU Ting-ting WU Shao-hong ZHENG Jun WANG Yun-kuan   

  1. Institute of Automation∥University of Chinese Academy of Sciences,Chinese Academy of Sciences,Beijing 100190,China
  • Received:2016-11-23 Revised:2017-02-09 Online:2017-10-25 Published:2017-09-01
  • Contact: 吴少泓(1986-) ,女,博士,副研究员,主要从事机器视觉研究. E-mail:shaohong.wu@ia.ac.cn
  • About author:张好剑(1982-),男,博士生,主要从事机器人技术与智能控制研究. E-mail:zhanghaojian2014@ia.ac.cn
  • Supported by:
    Supported by the Major Science and Technology in Henan Province(161100210300)

摘要: 通过分析包装流水线的生产流程,针对复杂的多约束条件下的 Delta 并联机器人分拣动态变化的多目标问题,提出了分节拍的基于改进遗传算法的并联机器人分拣拾取路径优化方法. 经过分析分拣策略,把实际问题转换为类似旅行商问题( TSP) ,并结合其工艺的特殊性提出一种改进遗传算法; 引入分节拍的处理思想,通过将约束条件变成一种染色体裂变和合并操作结合的遗传算子,对每个节拍内的分拣路径进行优化. 试验结果表明,该方法与传统方法相比能够有效缩短分拣行程,平均提高效率 14. 76%.

关键词: 分拣路径, 分节拍, 路径规划, 改进遗传算法, 旅行商问题, 并联机器人

Abstract: By analyzing the production process of packaging lines and aiming at the multiple-target problem of the Delta parallel robot sorting with dynamically changing positions under complex multi-constraint conditions,a me- thod to optimize the sorting trajectories of the parallel robot is proposed based on an improved genetic algorithm and the thought of beats.By analyzing the sorting strategy,the practical problem is transformed into a similar traveling salesman problem (TSP),and an improved genetic algorithm is put forward according to the particularity of the sorting process.Moreover,the thought of beats is introduced,and the sorting trajectories in every beat are opti- mized by transforming the constraint conditions into a genetic operator combining the fission and merge operations of chromosomes.The test results show that,as compared with the traditional methods,the proposed method can ef- fectively shorten the average sorting stroke,with an average efficiency increase of 14. 76%.

Key words: sorting path, thought of beats, trajectory optimization, improved genetic algorithm, traveling sales- man problem, parallel robot

中图分类号: