期刊文献+

面向多轮廓的机器人加工路径优化研究 被引量:1

Research on Robot Processing Path Optimization for Multi-contour
下载PDF
导出
摘要 针对多轮廓零件机器人加工的路径优化问题,提出了一种基于改进遗传算法和最小外接三角形法的机器人加工路径规划新方法。采用基于改良圈的遗传算法优化任意选择的走刀路径,得到轮廓加工序列,而最小外接三角形法对该轮廓序列动态寻找各轮廓入刀节点,构建走刀路径,经过反复迭代,得到了一条优化的走刀路径。仿真结果表明,所提算法可有效构建机器人走刀路径,缩短空行程。 The problem of robot processing path optimization for multi-contour parts was studied, and a new path planning algorithm based on the improved genetic algorithm and the minimum external triangle method was proposed. The genetic algorithm based on modified circle was applied to optimize the cutting path which selected arbitrarily, and an optimal contour sequence was found. The minimum external triangle method was used to seek the node as the tool entrance on each adjacent contour dynamically, and an optimal cutting path was constructed through several iterations in this way. Simulation results show that the cutting path for robot can be constructed effectively and the non-cutting path can be shortened by using the proposed algorithm.
作者 王宪伦 喻洋 崔玉霞 Wang Xianlun Yu Yang Cui Yuxia(College of Eleetromeehanieal Engineering, Qingdao University of Science & Technology, Qingdao 266061, China)
出处 《系统仿真学报》 CAS CSCD 北大核心 2017年第2期355-359,367,共6页 Journal of System Simulation
基金 国家自然科学基金(51105213) 青岛市科技计划基础研究项目(13-1-4-208-jch)
关键词 机器人加工 多轮廓 路径优化 改进遗传算法 最小外接三角形法 robot processing multi-contour path optimization the improved genetic algorithm the minimum external triangle method
  • 相关文献

参考文献3

二级参考文献42

  • 1叶志伟,郑肇葆.蚁群算法中参数α、β、ρ设置的研究——以TSP问题为例[J].武汉大学学报(信息科学版),2004,29(7):597-601. 被引量:155
  • 2费中强,高飞,张克旺,胡晓华.从VCT到DXF数据格式转换[J].合肥工业大学学报(自然科学版),2006,29(8):1008-1012. 被引量:4
  • 3郑宗汉,郑晓明.算法设计与分析[M].北京:清华大学出版社,2006.
  • 4Tsait C F,Tsai C W,Tseng C. A new hybrid heuristic approach for solving large traveling problem [J]. Information Sciences 2004,166(1-4):67-81.
  • 5Kenneth R,D'Souza P K W. Tool Path Optimization for Minimizing Airtime During Machining [J]. Journal of Manufacturing Systems, 2002,22 (3) : 173-180.
  • 6Vladimir D, Zoran S. An efficient transformation of the generalized traveling salesman problem into the traveling salesman problem on digraphs [J]. Informatics and Computer Science, 1997,102:105-110.
  • 7Snyder L V, Daskin M S. A random key genetic algorithm for the generalized traveling salesman problem [J]. European Journal of Operational Research, 2006,174 (1) : 38-53.
  • 8Wu C G,Liang Y C,Lee H P,et al. Generalized chromosome genetic algorithm for generalized traveling salesman problems and its applications for machining [J]. Physical Review, 2004, 70 (1):1-13.
  • 9Huang H. Hybrid chromosome genetic algorithm for generalized traveling salesman problems[J]. LECT Notes Comput SC, 2005,3612 : 137-140.
  • 10Renaud J, Boctor F F. An efficient composite heuristic for the symmetric generalized traveling salesman problem[J]. European Journal of Operation Research, 1998,108 : 571-584.

共引文献12

同被引文献5

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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