Simultaneous allocations of multiple tightly-coupled multi-robot tasks to coalitions of heterogeneous robots

Gautham P. Das, T. Mcginnity, S. Coleman
{"title":"Simultaneous allocations of multiple tightly-coupled multi-robot tasks to coalitions of heterogeneous robots","authors":"Gautham P. Das, T. Mcginnity, S. Coleman","doi":"10.1109/ROBIO.2014.7090496","DOIUrl":null,"url":null,"abstract":"Most multi-robot task allocation algorithms are concerned with the allocation of individual tasks to single robots. However certain types of tasks require a team of robots for their execution, and for the allocation of such tasks non-conflicting robot teams have to be formed. Most of the existing allocation algorithms for such tasks mainly address the robot-team formation and the tasks are allocated sequentially. However, allocating multiple tasks simultaneously will result in a more balanced distribution of robots into teams. A market based algorithm for simultaneous allocation of multiple tightly couple multi-robot tasks to coalitions of heterogeneous robots are proposed in this paper. The simultaneous allocations are deadlock-free and significant improvement in overall execution time is achieved as demonstrated by empirical evaluations.","PeriodicalId":289829,"journal":{"name":"2014 IEEE International Conference on Robotics and Biomimetics (ROBIO 2014)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 IEEE International Conference on Robotics and Biomimetics (ROBIO 2014)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ROBIO.2014.7090496","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 12

Abstract

Most multi-robot task allocation algorithms are concerned with the allocation of individual tasks to single robots. However certain types of tasks require a team of robots for their execution, and for the allocation of such tasks non-conflicting robot teams have to be formed. Most of the existing allocation algorithms for such tasks mainly address the robot-team formation and the tasks are allocated sequentially. However, allocating multiple tasks simultaneously will result in a more balanced distribution of robots into teams. A market based algorithm for simultaneous allocation of multiple tightly couple multi-robot tasks to coalitions of heterogeneous robots are proposed in this paper. The simultaneous allocations are deadlock-free and significant improvement in overall execution time is achieved as demonstrated by empirical evaluations.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
多个紧密耦合的多机器人任务同时分配给异构机器人联盟
大多数多机器人任务分配算法关注的是将单个任务分配给单个机器人。然而,某些类型的任务需要一个机器人团队来执行,并且为了分配这些任务,必须组建不冲突的机器人团队。现有的任务分配算法主要是解决机器人团队的组成问题,任务是顺序分配的。然而,同时分配多个任务将导致机器人更均衡地分配到团队中。提出了一种基于市场的多机器人任务同步分配算法,用于将多个紧密耦合的多机器人任务分配给异构机器人联盟。同时分配是无死锁的,并且总体执行时间得到了显著改善。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Velocity field control with energy compensation toward therapeutic exercise A control-oriented model of underwater snake robots Quadrupedal locomotion based on a muscular activation pattern with stretch-reflex Novelty detection in user behavioural models within ambient assisted living applications: An experimental evaluation Simultaneous allocations of multiple tightly-coupled multi-robot tasks to coalitions of heterogeneous robots
×
引用
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