Hybrid genetic ant colony optimization algorithm for full-coverage path planning of gardening pruning robots

IF 2.3 4区 计算机科学 Q3 ROBOTICS
Xiaolin Xie, Zixiang Yan, Zhihong Zhang, Yibo Qin, Hang Jin, Man Xu
{"title":"Hybrid genetic ant colony optimization algorithm for full-coverage path planning of gardening pruning robots","authors":"Xiaolin Xie, Zixiang Yan, Zhihong Zhang, Yibo Qin, Hang Jin, Man Xu","doi":"10.1007/s11370-024-00525-6","DOIUrl":null,"url":null,"abstract":"<p>Gardening pruning robots are widely applied in green space construction. However, increase of green space environment complexity and obstacle number affect the coverage range and work efficiency of robots. To solve this problem, this research proposed a full-coverage path planning algorithm integrating hybrid genetic ant colony and A* algorithm. Specifically tailored to the lawn working environments of horticultural pruning robots, we initially employed visual simultaneous localization and mapping to create a 3D point cloud map, converting it into an occupancy grid map for future path planning. The obtained grid map was partitioned into multiple subareas on the basis of the locations of obstacles. The optimal traversal order of sub-regions was determined using hybrid genetic ant colony method and a new update strategy of heuristic and pheromone factors was developed for improving the ability of global search and probability of jumping out of local optimal solution. Boustrophedon method was applied to fully cover each sub-region, A* algorithm was adopted to connect various sub-regions, and connection strategy was optimized. Simulation results showed that compared with traditional ant colony algorithm and other full-coverage planning algorithms, the algorithm developed in this research presented superior performance in terms of traversal path length, starting distance, coverage rate and turning times on maps with various sizes and complexities.</p>","PeriodicalId":48813,"journal":{"name":"Intelligent Service Robotics","volume":"19 1","pages":""},"PeriodicalIF":2.3000,"publicationDate":"2024-02-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Intelligent Service Robotics","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1007/s11370-024-00525-6","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"ROBOTICS","Score":null,"Total":0}
引用次数: 0

Abstract

Gardening pruning robots are widely applied in green space construction. However, increase of green space environment complexity and obstacle number affect the coverage range and work efficiency of robots. To solve this problem, this research proposed a full-coverage path planning algorithm integrating hybrid genetic ant colony and A* algorithm. Specifically tailored to the lawn working environments of horticultural pruning robots, we initially employed visual simultaneous localization and mapping to create a 3D point cloud map, converting it into an occupancy grid map for future path planning. The obtained grid map was partitioned into multiple subareas on the basis of the locations of obstacles. The optimal traversal order of sub-regions was determined using hybrid genetic ant colony method and a new update strategy of heuristic and pheromone factors was developed for improving the ability of global search and probability of jumping out of local optimal solution. Boustrophedon method was applied to fully cover each sub-region, A* algorithm was adopted to connect various sub-regions, and connection strategy was optimized. Simulation results showed that compared with traditional ant colony algorithm and other full-coverage planning algorithms, the algorithm developed in this research presented superior performance in terms of traversal path length, starting distance, coverage rate and turning times on maps with various sizes and complexities.

Abstract Image

用于园艺修剪机器人全覆盖路径规划的混合遗传蚁群优化算法
园艺修剪机器人广泛应用于绿地建设。然而,绿地环境复杂度和障碍物数量的增加会影响机器人的覆盖范围和工作效率。为解决这一问题,本研究提出了一种融合了混合遗传蚁群和 A* 算法的全覆盖路径规划算法。针对园艺修剪机器人的草坪工作环境,我们首先采用视觉同步定位和绘图技术创建三维点云图,并将其转换为占位网格图,用于未来的路径规划。根据障碍物的位置,将获得的网格图划分为多个子区域。利用混合遗传蚁群方法确定了子区域的最佳遍历顺序,并开发了一种新的启发式和信息素更新策略,以提高全局搜索能力和跳出局部最优解的概率。应用 Boustrophedon 方法全面覆盖各个子区域,采用 A* 算法连接各个子区域,并优化了连接策略。仿真结果表明,与传统的蚁群算法和其他全覆盖规划算法相比,本研究开发的算法在不同大小和复杂程度的地图上,在遍历路径长度、起始距离、覆盖率和转弯时间等方面都表现优异。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
5.70
自引率
4.00%
发文量
46
期刊介绍: The journal directs special attention to the emerging significance of integrating robotics with information technology and cognitive science (such as ubiquitous and adaptive computing,information integration in a distributed environment, and cognitive modelling for human-robot interaction), which spurs innovation toward a new multi-dimensional robotic service to humans. The journal intends to capture and archive this emerging yet significant advancement in the field of intelligent service robotics. The journal will publish original papers of innovative ideas and concepts, new discoveries and improvements, as well as novel applications and business models which are related to the field of intelligent service robotics described above and are proven to be of high quality. The areas that the Journal will cover include, but are not limited to: Intelligent robots serving humans in daily life or in a hazardous environment, such as home or personal service robots, entertainment robots, education robots, medical robots, healthcare and rehabilitation robots, and rescue robots (Service Robotics); Intelligent robotic functions in the form of embedded systems for applications to, for example, intelligent space, intelligent vehicles and transportation systems, intelligent manufacturing systems, and intelligent medical facilities (Embedded Robotics); The integration of robotics with network technologies, generating such services and solutions as distributed robots, distance robotic education-aides, and virtual laboratories or museums (Networked Robotics).
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信