Multi-Robot Directed Coverage Path Planning in Row-based Environments

Tingjun Lei, Pradeep Chintam, C. Luo, Shahram Rahimi
{"title":"Multi-Robot Directed Coverage Path Planning in Row-based Environments","authors":"Tingjun Lei, Pradeep Chintam, C. Luo, Shahram Rahimi","doi":"10.1109/AIKE55402.2022.00025","DOIUrl":null,"url":null,"abstract":"Multiple autonomous robots are deployed to fulfill tasks collaboratively in real-world applications with row-based settings as found in precision agriculture, warehouses, factory inspections, and wind farms. One batch of robots are assigned to explore, search and localize objects in large-scale row-based environments, while the other batch of robots move directly to the detected targets to retrieve the objects. In this paper, a multi-robot collaborative navigation framework with two different batches of robots is proposed to explore the environment and achieve the obtained targets, respectively. The first batch of robots act as detection robots, which are driven by a proposed informative-based directed coverage path planning (DCPP) through a multi-robot minimum spanning tree algorithm. It refines and optimizes the coverage path based on the information gained from the environment. The second batch of robot reaches the multiple targets by guidance from a hub-based multi-target routing (HMTR) scheme, which is applicable to row-based environments. The feasibility and effectiveness of the proposed methods are validated by simulation and comparison studies.","PeriodicalId":441077,"journal":{"name":"2022 IEEE Fifth International Conference on Artificial Intelligence and Knowledge Engineering (AIKE)","volume":"2015 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE Fifth International Conference on Artificial Intelligence and Knowledge Engineering (AIKE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AIKE55402.2022.00025","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

Multiple autonomous robots are deployed to fulfill tasks collaboratively in real-world applications with row-based settings as found in precision agriculture, warehouses, factory inspections, and wind farms. One batch of robots are assigned to explore, search and localize objects in large-scale row-based environments, while the other batch of robots move directly to the detected targets to retrieve the objects. In this paper, a multi-robot collaborative navigation framework with two different batches of robots is proposed to explore the environment and achieve the obtained targets, respectively. The first batch of robots act as detection robots, which are driven by a proposed informative-based directed coverage path planning (DCPP) through a multi-robot minimum spanning tree algorithm. It refines and optimizes the coverage path based on the information gained from the environment. The second batch of robot reaches the multiple targets by guidance from a hub-based multi-target routing (HMTR) scheme, which is applicable to row-based environments. The feasibility and effectiveness of the proposed methods are validated by simulation and comparison studies.
基于行环境的多机器人定向覆盖路径规划
在精确农业、仓库、工厂检查和风力发电场等现实应用中,多个自主机器人被部署来协同完成任务。其中一批机器人被分配用于在大规模的基于行的环境中探索、搜索和定位物体,而另一批机器人则直接移动到检测到的目标处检索物体。本文提出了一种由两批不同机器人组成的多机器人协同导航框架,分别对环境进行探索并实现所获得的目标。第一批机器人作为检测机器人,通过多机器人最小生成树算法实现基于信息的定向覆盖路径规划(DCPP)。它根据从环境中获得的信息对覆盖路径进行细化和优化。第二批机器人通过基于枢纽的多目标路由(HMTR)方案制导到达多个目标,该方案适用于基于行的环境。仿真和对比研究验证了所提方法的可行性和有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信