多机器人任务分配和多机器人区域覆盖的多智能体协调技术

P. Dasgupta
{"title":"多机器人任务分配和多机器人区域覆盖的多智能体协调技术","authors":"P. Dasgupta","doi":"10.1109/CTS.2012.6261030","DOIUrl":null,"url":null,"abstract":"Multi-robot systems have emerged as a central research theme within robotics with applications in several domains that require automated robotic assistants such as unmanned search and rescue, automated surveillance and reconnaissance operations, automated civilian transportation, extra-terrestrial exploration, and even domestic applications such as agriculture, lawn mowing, vacuum cleaning, etc. One of the major computational challenges in multi-robot systems is to design appropriate coordination techniques between the robots that enable them to perform operations efficiently in terms of time, cost and energy expended while keeping the system robust to individual robot failures as well as scalable in the number of robots. Coordination technologies from the field of multi-agent systems offer a rich array of solutions that can be adapted to multi-robot sytems. In this talk, we will summarize our research on two operations that are frequently encountered in many multi-robot domains, namely, multi-robot area coverage [1] and multi-robot task allocation [2]. First, we will describe a coalition game theory based technique for dynamically reconfiguring multi-robot teams by splitting or merging them, when they encounter obstacles while covering an initially unknown environment. We will introduce two heuristics that, given the set of robots requiring reconfiguration, guarantee rapid convergence to the appropriate partition of the set of robots while taking into consideration the physical characteristics of the robots and the environment [3]. Secondly, I will describe a distributed, auction-based multirobot task allocation algorithm called DynamicBids [4] that improves the performance of tasks and significantly reduces the communication overhead between robots by allowing a bidder robot to selectively revise its bids on tasks if that improves the cost of the schedule of the tasks to the bidder robot. For both techniques, we will describe analytical results, and, experimental results from simulations on the Webots simulator as well as on physical robots. Finally, we will demonstrate our ongoing work on autonomous, multi-robot landmine detection that uses the techniques mentioned above to coordinate a set of robots, fitted with different types of landmine detection sensors, to potentially improve the accuracy with which landmines can be detected [5].","PeriodicalId":200122,"journal":{"name":"2012 International Conference on Collaboration Technologies and Systems (CTS)","volume":"69 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"16","resultStr":"{\"title\":\"Multi-agent coordination techniques for multi-robot task allocation and multi-robot area coverage\",\"authors\":\"P. Dasgupta\",\"doi\":\"10.1109/CTS.2012.6261030\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Multi-robot systems have emerged as a central research theme within robotics with applications in several domains that require automated robotic assistants such as unmanned search and rescue, automated surveillance and reconnaissance operations, automated civilian transportation, extra-terrestrial exploration, and even domestic applications such as agriculture, lawn mowing, vacuum cleaning, etc. One of the major computational challenges in multi-robot systems is to design appropriate coordination techniques between the robots that enable them to perform operations efficiently in terms of time, cost and energy expended while keeping the system robust to individual robot failures as well as scalable in the number of robots. Coordination technologies from the field of multi-agent systems offer a rich array of solutions that can be adapted to multi-robot sytems. In this talk, we will summarize our research on two operations that are frequently encountered in many multi-robot domains, namely, multi-robot area coverage [1] and multi-robot task allocation [2]. First, we will describe a coalition game theory based technique for dynamically reconfiguring multi-robot teams by splitting or merging them, when they encounter obstacles while covering an initially unknown environment. We will introduce two heuristics that, given the set of robots requiring reconfiguration, guarantee rapid convergence to the appropriate partition of the set of robots while taking into consideration the physical characteristics of the robots and the environment [3]. Secondly, I will describe a distributed, auction-based multirobot task allocation algorithm called DynamicBids [4] that improves the performance of tasks and significantly reduces the communication overhead between robots by allowing a bidder robot to selectively revise its bids on tasks if that improves the cost of the schedule of the tasks to the bidder robot. For both techniques, we will describe analytical results, and, experimental results from simulations on the Webots simulator as well as on physical robots. Finally, we will demonstrate our ongoing work on autonomous, multi-robot landmine detection that uses the techniques mentioned above to coordinate a set of robots, fitted with different types of landmine detection sensors, to potentially improve the accuracy with which landmines can be detected [5].\",\"PeriodicalId\":200122,\"journal\":{\"name\":\"2012 International Conference on Collaboration Technologies and Systems (CTS)\",\"volume\":\"69 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-05-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"16\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 International Conference on Collaboration Technologies and Systems (CTS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CTS.2012.6261030\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 International Conference on Collaboration Technologies and Systems (CTS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CTS.2012.6261030","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 16

摘要

多机器人系统已经成为机器人领域的一个核心研究主题,在几个需要自动机器人助手的领域得到应用,如无人搜索和救援,自动监视和侦察行动,自动化民用运输,地外探索,甚至国内应用,如农业,草坪修剪,真空清洁等。多机器人系统的主要计算挑战之一是在机器人之间设计适当的协调技术,使它们能够在时间、成本和能量消耗方面有效地执行操作,同时保持系统对单个机器人故障的鲁棒性以及机器人数量的可扩展性。多智能体系统领域的协调技术为多机器人系统提供了丰富的解决方案。在这次演讲中,我们将总结我们对多机器人领域中经常遇到的两种操作的研究,即多机器人区域覆盖[1]和多机器人任务分配[2]。首先,我们将描述一种基于联盟博弈论的技术,当多机器人团队在覆盖最初未知的环境时遇到障碍时,通过分裂或合并它们来动态地重新配置多机器人团队。我们将引入两种启发式算法,在给定需要重新配置的机器人集合的情况下,保证快速收敛到机器人集合的适当分区,同时考虑到机器人和环境的物理特性[3]。其次,我将描述一种名为DynamicBids的分布式、基于拍卖的多机器人任务分配算法[4],该算法通过允许投标机器人有选择地修改其对任务的出价,从而提高任务的性能,并显着降低机器人之间的通信开销,如果这提高了投标机器人的任务进度成本的话。对于这两种技术,我们将描述分析结果,以及在Webots模拟器和物理机器人上模拟的实验结果。最后,我们将展示我们正在进行的自主多机器人地雷探测工作,该工作使用上述技术来协调一组机器人,配备不同类型的地雷探测传感器,以潜在地提高探测地雷的准确性[5]。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Multi-agent coordination techniques for multi-robot task allocation and multi-robot area coverage
Multi-robot systems have emerged as a central research theme within robotics with applications in several domains that require automated robotic assistants such as unmanned search and rescue, automated surveillance and reconnaissance operations, automated civilian transportation, extra-terrestrial exploration, and even domestic applications such as agriculture, lawn mowing, vacuum cleaning, etc. One of the major computational challenges in multi-robot systems is to design appropriate coordination techniques between the robots that enable them to perform operations efficiently in terms of time, cost and energy expended while keeping the system robust to individual robot failures as well as scalable in the number of robots. Coordination technologies from the field of multi-agent systems offer a rich array of solutions that can be adapted to multi-robot sytems. In this talk, we will summarize our research on two operations that are frequently encountered in many multi-robot domains, namely, multi-robot area coverage [1] and multi-robot task allocation [2]. First, we will describe a coalition game theory based technique for dynamically reconfiguring multi-robot teams by splitting or merging them, when they encounter obstacles while covering an initially unknown environment. We will introduce two heuristics that, given the set of robots requiring reconfiguration, guarantee rapid convergence to the appropriate partition of the set of robots while taking into consideration the physical characteristics of the robots and the environment [3]. Secondly, I will describe a distributed, auction-based multirobot task allocation algorithm called DynamicBids [4] that improves the performance of tasks and significantly reduces the communication overhead between robots by allowing a bidder robot to selectively revise its bids on tasks if that improves the cost of the schedule of the tasks to the bidder robot. For both techniques, we will describe analytical results, and, experimental results from simulations on the Webots simulator as well as on physical robots. Finally, we will demonstrate our ongoing work on autonomous, multi-robot landmine detection that uses the techniques mentioned above to coordinate a set of robots, fitted with different types of landmine detection sensors, to potentially improve the accuracy with which landmines can be detected [5].
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信