Rhocop:后退地平线多机器人覆盖

S. Das, I. Saha
{"title":"Rhocop:后退地平线多机器人覆盖","authors":"S. Das, I. Saha","doi":"10.1109/ICCPS.2018.00025","DOIUrl":null,"url":null,"abstract":"Coverage of a partially known workspace for information gathering is the core problem for several applications, such as search and rescue, precision agriculture and monitoring of critical infrastructures. We propose a planning framework for the coverage of a partially known environment employing multiple robots. To cope with the limitation of having incomplete information, our planner adopts a receding horizon planning strategy where the safe trajectories of the robots are generated optimally for a short duration based on the currently available information about the workspace. Moreover, as multi-robot motion planning for coverage is a computationally complex problem, our framework clusters the robots into small groups to increase the planning efficiency dynamically. In each time horizon, the robots follow the motion plans provided by the planner, gather information about the workspace while executing their plans and update the global knowledge base about the workspace. The planning algorithm manages the activities of the robots in such a way that the energy consumption by the robots and the total time required for the complete coverage of the workspace get minimized. Simulation results show that the proposed hierarchical framework efficiently ensures the coverage quality of a partially known workspace, as well as scales up effectively with the number of robots and the size of the workspace.","PeriodicalId":199062,"journal":{"name":"2018 ACM/IEEE 9th International Conference on Cyber-Physical Systems (ICCPS)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Rhocop: Receding Horizon Multi-Robot Coverage\",\"authors\":\"S. Das, I. Saha\",\"doi\":\"10.1109/ICCPS.2018.00025\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Coverage of a partially known workspace for information gathering is the core problem for several applications, such as search and rescue, precision agriculture and monitoring of critical infrastructures. We propose a planning framework for the coverage of a partially known environment employing multiple robots. To cope with the limitation of having incomplete information, our planner adopts a receding horizon planning strategy where the safe trajectories of the robots are generated optimally for a short duration based on the currently available information about the workspace. Moreover, as multi-robot motion planning for coverage is a computationally complex problem, our framework clusters the robots into small groups to increase the planning efficiency dynamically. In each time horizon, the robots follow the motion plans provided by the planner, gather information about the workspace while executing their plans and update the global knowledge base about the workspace. The planning algorithm manages the activities of the robots in such a way that the energy consumption by the robots and the total time required for the complete coverage of the workspace get minimized. Simulation results show that the proposed hierarchical framework efficiently ensures the coverage quality of a partially known workspace, as well as scales up effectively with the number of robots and the size of the workspace.\",\"PeriodicalId\":199062,\"journal\":{\"name\":\"2018 ACM/IEEE 9th International Conference on Cyber-Physical Systems (ICCPS)\",\"volume\":\"14 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-04-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 ACM/IEEE 9th International Conference on Cyber-Physical Systems (ICCPS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCPS.2018.00025\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 ACM/IEEE 9th International Conference on Cyber-Physical Systems (ICCPS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCPS.2018.00025","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

摘要

覆盖部分已知的用于信息收集的工作空间是一些应用的核心问题,例如搜索和救援、精准农业和关键基础设施的监控。我们提出了一个规划框架,用于使用多个机器人覆盖部分已知的环境。为了应对信息不完全的限制,我们的规划器采用了一种后退视界规划策略,基于当前工作空间的可用信息,在短时间内生成机器人的最优安全轨迹。此外,由于覆盖的多机器人运动规划是一个计算复杂的问题,我们的框架将机器人聚类成小群,以动态提高规划效率。在每个时间范围内,机器人遵循规划器提供的运动计划,在执行计划的同时收集有关工作空间的信息,并更新有关工作空间的全局知识库。规划算法对机器人的活动进行管理,使机器人的能量消耗和完全覆盖工作空间所需的总时间最小化。仿真结果表明,所提出的分层框架有效地保证了部分已知工作空间的覆盖质量,并随着机器人数量和工作空间的大小而有效地扩展。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Rhocop: Receding Horizon Multi-Robot Coverage
Coverage of a partially known workspace for information gathering is the core problem for several applications, such as search and rescue, precision agriculture and monitoring of critical infrastructures. We propose a planning framework for the coverage of a partially known environment employing multiple robots. To cope with the limitation of having incomplete information, our planner adopts a receding horizon planning strategy where the safe trajectories of the robots are generated optimally for a short duration based on the currently available information about the workspace. Moreover, as multi-robot motion planning for coverage is a computationally complex problem, our framework clusters the robots into small groups to increase the planning efficiency dynamically. In each time horizon, the robots follow the motion plans provided by the planner, gather information about the workspace while executing their plans and update the global knowledge base about the workspace. The planning algorithm manages the activities of the robots in such a way that the energy consumption by the robots and the total time required for the complete coverage of the workspace get minimized. Simulation results show that the proposed hierarchical framework efficiently ensures the coverage quality of a partially known workspace, as well as scales up effectively with the number of robots and the size of the workspace.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信