On a dynamic and decentralized energy-aware technique for multi-robot task allocation

IF 4.3 2区 计算机科学 Q1 AUTOMATION & CONTROL SYSTEMS Robotics and Autonomous Systems Pub Date : 2024-07-23 DOI:10.1016/j.robot.2024.104762
Menaxi J. Bagchi, Shivashankar B. Nair, Pradip K. Das
{"title":"On a dynamic and decentralized energy-aware technique for multi-robot task allocation","authors":"Menaxi J. Bagchi,&nbsp;Shivashankar B. Nair,&nbsp;Pradip K. Das","doi":"10.1016/j.robot.2024.104762","DOIUrl":null,"url":null,"abstract":"<div><p>In the real world, multi-robot systems need to deal with <em>on-the-fly</em> (runtime) arrivals of new sets of tasks. This entails repeated adjustments of their current task allocations to include the newer ones while also ensuring that the overall performance does not degrade. This paper proposes a decentralized and distributed dynamic task allocation algorithm to handle this issue in a multi-robot scenario. The proposed work provides a conflict-free allocation of a set of tasks constituting a job to robots and minimizes the <em>total execution time</em>. These jobs can comprise multiple independent and/or dependent tasks or a combination thereof, which are injected <em>on-the-fly</em> into a network of robots. The dependent tasks of a job are related by precedence constraints that specify the ordering or dependencies between pairs of tasks. The work also describes a decentralized adaptive energy threshold mechanism for determining whether or not a robot needs to visit a battery stockpile after the execution of a task. Conflicting task selections among the robots in this decentralized set-up are resolved using mobile agents during runtime. Apart from allocating tasks to the robots, these mobile agents exploit the benefits of centralized and decentralized systems and provide an advantage over auction-based task allocation algorithms. The <em>proposed</em> algorithm takes into consideration the energy requirements, both during the task allocation process and actual execution. The <em>proposed</em> algorithm also caters to strategies to deal with delays caused by obstacles and congestion during the actual execution of the tasks. Experiments conducted using <em>Webots</em>, an open-source robot simulator, and <em>Tartarus</em>, a multi-agent platform, authenticate the efficacy of the <em>proposed</em> algorithm compared to other prominent task allocation algorithms in terms of minimization of <em>average waiting time</em>, <em>total task allocation time</em>, <em>total job allocation time</em>, and <em>total execution time</em> of an experiment.</p></div>","PeriodicalId":49592,"journal":{"name":"Robotics and Autonomous Systems","volume":"180 ","pages":"Article 104762"},"PeriodicalIF":4.3000,"publicationDate":"2024-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Robotics and Autonomous Systems","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0921889024001465","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"AUTOMATION & CONTROL SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

In the real world, multi-robot systems need to deal with on-the-fly (runtime) arrivals of new sets of tasks. This entails repeated adjustments of their current task allocations to include the newer ones while also ensuring that the overall performance does not degrade. This paper proposes a decentralized and distributed dynamic task allocation algorithm to handle this issue in a multi-robot scenario. The proposed work provides a conflict-free allocation of a set of tasks constituting a job to robots and minimizes the total execution time. These jobs can comprise multiple independent and/or dependent tasks or a combination thereof, which are injected on-the-fly into a network of robots. The dependent tasks of a job are related by precedence constraints that specify the ordering or dependencies between pairs of tasks. The work also describes a decentralized adaptive energy threshold mechanism for determining whether or not a robot needs to visit a battery stockpile after the execution of a task. Conflicting task selections among the robots in this decentralized set-up are resolved using mobile agents during runtime. Apart from allocating tasks to the robots, these mobile agents exploit the benefits of centralized and decentralized systems and provide an advantage over auction-based task allocation algorithms. The proposed algorithm takes into consideration the energy requirements, both during the task allocation process and actual execution. The proposed algorithm also caters to strategies to deal with delays caused by obstacles and congestion during the actual execution of the tasks. Experiments conducted using Webots, an open-source robot simulator, and Tartarus, a multi-agent platform, authenticate the efficacy of the proposed algorithm compared to other prominent task allocation algorithms in terms of minimization of average waiting time, total task allocation time, total job allocation time, and total execution time of an experiment.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
多机器人任务分配的动态分散能源感知技术
在现实世界中,多机器人系统需要处理即时(运行时)到达的新任务集。这就需要反复调整当前的任务分配,将新任务纳入其中,同时确保整体性能不下降。本文提出了一种分散的分布式动态任务分配算法,以处理多机器人场景中的这一问题。所提出的工作可将构成作业的一系列任务无冲突地分配给机器人,并最大限度地减少总执行时间。这些工作可以由多个独立任务和/或从属任务组成,也可以是它们的组合,这些任务会被即时注入机器人网络。作业的从属任务通过优先级约束相互关联,优先级约束规定了任务对之间的排序或依赖关系。该作品还描述了一种分散式自适应能量阈值机制,用于确定机器人在执行任务后是否需要访问电池库存。在这种分散式设置中,机器人之间的任务选择冲突可在运行期间通过移动代理来解决。除了为机器人分配任务外,这些移动代理还利用了集中式和分散式系统的优点,与基于拍卖的任务分配算法相比更具优势。所提出的算法在任务分配过程和实际执行过程中都考虑到了能源需求。提议的算法还考虑了在实际执行任务过程中处理障碍和拥堵造成的延迟的策略。使用开源机器人模拟器 Webots 和多机器人平台 Tartarus 进行的实验证明,与其他著名的任务分配算法相比,所提出的算法在平均等待时间、总任务分配时间、总工作分配时间和实验总执行时间的最小化方面都非常有效。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Robotics and Autonomous Systems
Robotics and Autonomous Systems 工程技术-机器人学
CiteScore
9.00
自引率
7.00%
发文量
164
审稿时长
4.5 months
期刊介绍: Robotics and Autonomous Systems will carry articles describing fundamental developments in the field of robotics, with special emphasis on autonomous systems. An important goal of this journal is to extend the state of the art in both symbolic and sensory based robot control and learning in the context of autonomous systems. Robotics and Autonomous Systems will carry articles on the theoretical, computational and experimental aspects of autonomous systems, or modules of such systems.
期刊最新文献
Editorial Board A sensorless approach for cable failure detection and identification in cable-driven parallel robots Learning latent causal factors from the intricate sensor feedback of contact-rich robotic assembly tasks GPS-free autonomous navigation in cluttered tree rows with deep semantic segmentation Robust trajectory tracking for omnidirectional robots by means of anti-peaking linear active disturbance rejection
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1