期刊文献+

苹果采摘路径规划最优化算法与仿真实现 被引量:20

Algorithm for optimization of apple harvesting path and simulation
下载PDF
导出
摘要 采摘路径规划对苹果采摘机器人的工作效率有很大的影响,为了提高苹果采摘机器人采摘效率,研究了采摘路径规划最优化方法。将苹果采摘的路径规划问题转化为三维的旅行商问题进行求解,结合图像识别得到的苹果位置特征,提出了有限域信息素自适应更新的改进蚁群算法,避免了基本蚁群算法求解过程中的早熟和局部收敛的问题,研究了三维模型的建模和驱动方法。试验结果表明将蚁群算法用于解决苹果采摘路径规划问题,当苹果数量达到250个时,改进蚁群算法迭代次数是基本算法的25.3%,而搜索到的最优路径是其94.3%,可见改进算法在搜索次数和最优结果上都有明显的优势。本研究为苹果采摘机器人采摘路径规划的提供理论参考。 Path planning is pivotal to the working efficiency of apple harvesting robot, in order to improve the picking efficiency of harvesting robot, the algorithm for optimization of apple harvesting path was studied. In this study, path planning is translated into three dimensional Travel Salesman Problem. According to the apple position obtained through image processing, an improved ant colony algorithm was studied in the optimization of apple-picking path, which can overcome premature convergence and local convergence of the search. Three-dimensional model building and driving methods were studied. Experimental results show that when there are 250 apples, the improved ant colony algorithm can reduce alternate times to 25.3% of basic algorithm, while the total distance is 94.3%, therefore, the improved ant colony algorithm cannot only reduce algorithm times, but also can obtain better values. This study is of great importance to the optimization of apple-picking path.
出处 《农业工程学报》 EI CAS CSCD 北大核心 2009年第4期141-144,共4页 Transactions of the Chinese Society of Agricultural Engineering
基金 国家 863 项目(2006AA10A305) 863 项目(2006AA10Z254) "十一五"科技攻关项目(2006BAD11A01)
关键词 苹果采摘机器人 路径规划 改进蚁群算法 仿真 apple harvesting robot, path optimization, improved ant colony algorithm, simulation
  • 相关文献

参考文献16

  • 1方建军.移动式采摘机器人研究现状与进展[J].农业工程学报,2004,20(2):273-278. 被引量:111
  • 2李磊,叶涛,谭民,陈细军.移动机器人技术研究现状与未来[J].机器人,2002,24(5):475-480. 被引量:339
  • 3欧锦军,朱枫.一种多移动机器人避碰规划方法[J].机器人,2000,22(6):474-481. 被引量:12
  • 4Oksanen T,Visala A.Optimal control of tractor-trailer system in headlands[A].ASAE International Conference on Automation Technology for Off-road Equipment[C].Kyoto,Japan,2004:255-263.
  • 5Johnson R,Qu Z,Jayaram S,et al.Autonomous spacecraft vehicle health monitoring and control system based on real-time model-based simulation[A].Intelligence System & ControlConference (IASTED)[C].Clearwarer,FL,November,2001:152-157.
  • 6陈靖波,赵猛,张珩.空间机械臂在线实时避障路径规划研究[J].控制工程,2007,14(4):445-447. 被引量:24
  • 7Chen P C,Hang Y K.SANDROS:a dynamic graph search algorithm for motion planning[Y].IEEE Transactions on Robotics andAutomation,1998,14(3):390-403.
  • 8Kavraki L E,Latombe J C.Randomized preprocessing of configurations space for fast path planning[A].Proceedings IEEEInternationalConferenceonRoboticsand Automation[C].San Diego,CA,USA,1994:2138-2145.
  • 9李梅娟,陈雪波,张梅凤.基于群集智能算法的路径规划问题[J].清华大学学报(自然科学版),2007,47(z2):1770-1773. 被引量:8
  • 10Donigo M,Maniezzo V,Colorni A.The ant system:optimization by a colony of cooperating agents[J].IEEE Trans on Systems,Man,and Cybernetics-part B,1996,26(1):1-13.

二级参考文献62

  • 1蒋新松.未来机器人技术发展方向的探讨[J].机器人,1996,18(5):285-291. 被引量:45
  • 2王越超.多机器人协作系统研究:博士论文[M].哈尔滨工业大学,1999..
  • 3[1]Dorigo M, Gambardella L M. Ant colony system: A cooperative learning approach to the travelling salesman problem[J]. IEEE Trans Evol Comp,1997,1(1):53-66.
  • 4[2]Dorigo M, Maniezzo V, Colorni A. Ant system: Optimization by a colony of cooperating agents[J]. IEEE Trans SMC: Part B,1996,26(1):29-41.
  • 5[3]Gambardella L M, Dorigo M. Solving symmetric and asymmetric TSPs by ant colonies[A]. Proc IEEE Int Conf Evol Comp[C]. Piscataway, 1996.622-627.
  • 6[4]Boryczka U, Boryczka M. Generative policies in ant systems for scheduling[A]. 6th European Congr Intell Tech Soft Comp[C]. Bruxelles,1998.1:382-386.
  • 7[5]Boryczka U. Learning with delayed rewards in ant sys-tems for the job-shop scheduling problem[A]. First Int Conf Rough Sets Current Trends Comp[C]. Bruxelles,1998.271-274.
  • 8[6]Gambardella L M, Taillard E D, Dorigo M. Ant colonies for the quadratic assignment problem[J]. J Oper Res Soci,1999,50(2):167-176.
  • 9[7]Maniezzo V,Dorigo M,Colorni A.Algodesk:An experimental comparison of eight evolutionary heuristics applied to the quadratic assignment problem[J]. European J Oper Res,1995,81(1):188-204.
  • 10[8]Maniezzo V. Exact and approximate nondeterministic tree-search procedures for the quadratic assignment problem[J]. Infor J Comp,1999,11(4):358-369.

共引文献631

同被引文献224

引证文献20

二级引证文献95

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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