期刊文献+

水切割机器人路径规划方法 被引量:6

Path planning method of water-jet cutting robot
下载PDF
导出
摘要 以汽车内饰件切割路径优化为研究对象,提出了一种改进禁忌表蚁群算法,实现优化排序.根据水切割过程特点和工艺要求,进行了水切割路径规划问题分析与建模,设计了改进的禁忌表,利用分层思想将禁忌表划分为3段:内部小环段、内部大环段和外部轮廓段,各段的优先级依次降低,并确定了与此相应的禁忌表的更新规则.在此基础上,给出了基于改进禁忌表蚁群算法的水切割路径优化排序方法,对轮廓切割顺序和各轮廓起始点选择同时进行优化.仿真与实验结果表明,改进禁忌表蚁群算法是可行、有效的,可大大缩短水切割机器人的示教编程时间,显著提高水切割作业的效率和质量. Taking the optimization of path planning of cutting automotive interior ornament as the re search object, an improved tabu list based ant colony algorithm is presented to achieve cutting se quence optimization. According to the characteristics and technology demands of the waterjet cut ting process, waterjet cutting path planning problem was analyzed and modeled. Taking advantage of the hierarchy principle, an improved tabu list was designed, which was divided into three sec tions: interior small loop, interior large loop, exterior outline section, and their priority reduces suc cessively. Corresponding updating rules of the tabu list were proposed. The waterjet cutting path planning method based on the improved ant colony algorithm was proposed with which the cutting sequence of outlines and selection of starting point for cutting every outline are optimized simultane ously. Simulation and experimental results show that the improved tabu list based ant colony algo rithm is feasible and effective. The teaching programming time of waterjet cutting robots can be shorten greatly, efficiency and quality of waterjet cutting jobs can be raised evidently.
作者 王玫 孟正大
出处 《东南大学学报(自然科学版)》 EI CAS CSCD 北大核心 2012年第A01期212-216,共5页 Journal of Southeast University:Natural Science Edition
基金 国家高档数控机床与基础制造装备重大专项资助项目(2010zx04008-041) 江苏省科技成果转化专项资金资助项目(BA2009001)
关键词 水切割 机器人 路径优化 蚁群算法 water-jet cutting robot path optimization ant colony algorithm
  • 相关文献

参考文献8

  • 1李妮妮,陈章位,陈世泽.基于局部搜索和遗传算法的激光切割路径优化[J].计算机工程与应用,2010,46(2):234-236. 被引量:16
  • 2何汉武..数控等离子切割机的路径优化[D].上海交通大学,2008:
  • 3刘会霞,王霄,蔡兰.钣金件数控激光切割割嘴路径的优化[J].计算机辅助设计与图形学学报,2004,16(5):660-665. 被引量:25
  • 4高海昌,冯博琴,朱利b.智能优化算法求解TSP问题[J].控制与决策,2006,21(3):241-247. 被引量:120
  • 5Lee Moon-Kyu, Kwon Ki-Bum. Cutting path optimiza- tion in CNC cutting processes using a two-step genetic algorithm [ J ]. International Journal of Production Re- search,2006,44 (24) :5307 - 5326. 被引量:1
  • 6Chen J C, Zhong T X. A hybrid-code genetic algorithm based optimization of non-productive paths in CNC machining [ J ]. The International Journal of Advanced Manufacturing Technology ,2002,20( 3 ) : 163 - 168. 被引量:1
  • 7陈金城.多轴联动高性能数控加工的运动优化与复杂轨迹实时控制策略[D].上海:上海交通大学机械与动力工程学院,2001. 被引量:1
  • 8段海滨著..蚁群算法原理及其应用[M].北京:科学出版社,2005:447.

二级参考文献68

  • 1俞武嘉,傅建中,陈子辰.基于遗传算法的刀具路径优化排布方法[J].浙江大学学报(工学版),2006,40(12):2117-2121. 被引量:9
  • 2李飞,白艳萍.用遗传算法求解旅行商问题[J].中北大学学报(自然科学版),2007,28(1):49-52. 被引量:9
  • 3杨平,郑金华.遗传选择算子的比较与研究[J].计算机工程与应用,2007,43(15):59-62. 被引量:46
  • 4Garey M, Johnson D.Computers and intractability[M].San Franeiso: Freeman W H, 1979. 被引量:1
  • 5Cbatterjee S,Carrera C,Lynch L A.C, enetic algorithms and traveling problems[J].European Journal of Operational Research,1996,93 (3):490-510. 被引量:1
  • 6Piszcz A,Soule T.Genetic programming:Optimal population sizes for varying complexity problems[C]//Proceedings of the 8th Annual Genetic and Evolutionary Computation Conference.USA: [s.n.],2006:953-954. 被引量:1
  • 7Koumousis V K,Katsara C P.A saw-tooth genetic algorithm combining the effects of variable population size and re-initialization to enhance performance[J].IEEE Transactions on Evolationary, Computation ,2006,10( 1 ) : 19-28. 被引量:1
  • 8Garey M R,Johnson D S.Computers and Intractability:A Guide to the Theory of NP-Completeness[M].San Francisco:Freeman W H,1979. 被引量:1
  • 9Lawer E,Lenstra J,Ronnooy K A,et al.The Traveling Salesman Problem[M].New York:Wiley-International Publication,1985. 被引量:1
  • 10Hopfield J J,Tank D W.Neural Computation of Decision in Optimization Problem[J].Biol Cybern,1985,52(1):141-152. 被引量:1

共引文献152

同被引文献32

引证文献6

二级引证文献13

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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