首页 | 本学科首页   官方微博 | 高级检索  
     检索      

基于自适应升温模拟退火算法的农业机器人全区域覆盖策略
引用本文:王伟,张彦斐,宫金良,兰玉彬.基于自适应升温模拟退火算法的农业机器人全区域覆盖策略[J].华南农业大学学报,2021,42(6):126-132.
作者姓名:王伟  张彦斐  宫金良  兰玉彬
作者单位:山东理工大学 机械工程学院,山东 淄博 255000;山东理工大学 农业工程与食品科学学院,山东 淄博 255000;山东理工大学 农业工程与食品科学学院,山东 淄博 255000;华南农业大学 电子工程学院/人工智能学院,广东 广州 510642
基金项目:国家自然科学基金(61303006);山东省重点研发计划(重大科技创新工程)(2020CXGC010804);山东省引进顶尖人才“一事一议”专项经费资助项目(鲁政办字[2018]27号);山东省重点研发计划(2019GNC106127);淄博市生态无人农场研究院项目(2019ZBXC200)
摘    要:目的 提出一种复杂农田环境下农业机器人全区域覆盖策略,以便合理规划农业机器人的工作遍历路径。方法 根据农田实际生产环境定义农业机器人复杂工作环境模型,并在此基础上建立一级分区与二级分区的概念。引入遗传算法变异操作的思想,建立基于贪婪机制的模拟退火算法优质可行解生成方法;建立解集多样性的概念,设计基于自适应升温的模拟退火算法改进方法,以此求解分区间的最佳遍历顺序问题。通过A*算法与八邻域搜索法相结合进行农业机器人跨区域衔接路径规划,依此,实现机器人覆盖全区域。结果 仿真结果表明,改进的模拟退火算法所规划的路径长度分别比传统遗传算法和模拟退火算法减少了14.7%和10.1%,收敛时的迭代次数分别减少9.8%和59.1%;农业机器人全区域覆盖仿真试验中遍历路径重复率为14.86%。高地隙喷药机器人现场遍历试验中,路径重复率为15.83%。结论 研究结果可为农业机器人在复杂农田环境中全遍历覆盖提供研究思路。

关 键 词:农业机器人  路径规划  模拟退火算法  A*算法  路径重复率
收稿时间:2021/4/21 0:00:00

Whole area coverage strategy of agricultural robot based on adaptive heating simulated annealing algorithm
WANG Wei,ZHANG Yanfei,GONG Jinliang,LAN Yubin.Whole area coverage strategy of agricultural robot based on adaptive heating simulated annealing algorithm[J].Journal of South China Agricultural University,2021,42(6):126-132.
Authors:WANG Wei  ZHANG Yanfei  GONG Jinliang  LAN Yubin
Institution:School of Mechanical Engineering, Shandong University of Technology, Zibo 255000, China;School of Agricultural Engineering and Food Science, Shandong University of Technology, Zibo 255000, China; School of Agricultural Engineering and Food Science, Shandong University of Technology, Zibo 255000, China;College of Electronic Engineering/College of Artificial Intelligence, South China Agricultural University, Guangzhou 510642, China
Abstract:Objective To propose a whole area coverage strategy of agricultural robot in complex farmland environment, and reasonably plan the working traversal path of agricultural robot.Method The complex farmland working environment model was defined according to the actual production environment of agricultural robot, and the concepts of first-level partition and second-level partition were established. The idea of genetic algorithm mutation operation was introduced to establish a high-quality feasible solution generation method of simulated annealing algorithm based on greedy mechanism. Based on the establishment of the concept of solution set diversity, an improved method of simulated annealing algorithm based on adaptive heating was designed to solve the problem of the optimal traversal sequence between partitions. The A* algorithm was combined with the eight-neighbor search method to plan the cross-regional connection path of agricultural robot. By this way, the scheme designed in this paper could achieve that the robot covered the whole working area.Result The simulation results showed that, compared with the traditional genetic algorithm and simulated annealing algorithm, the path length planned by the improved simulated annealing algorithm was reduced by 14.7% and 10.1% respectively, and the number of iterations during convergence was reduced by 9.8% and 59.1% respectively. The repeating rate of the traversal path of the agricultural robot in the simulation test of whole area coverage was 14.86%. The path repetition rate in the field traversal test of the high ground-clearance spraying robot was 15.83%.Conclusion The research results can provide a research idea for the full traversal coverage of agricultural robot in complex farmland environment.
Keywords:agricultural robot  path planning  simulated annealing algorithm  A* algorithm  path repetition rate
本文献已被 万方数据 等数据库收录!
点击此处可从《华南农业大学学报》浏览原始摘要信息
点击此处可从《华南农业大学学报》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号