Distributed Task Assignment Method for Multiple Robots Based on Dynamic Auction Rules

Jiajie Xu, Chin-Yin Chen, Si-lu Chen, Qiang Liu
{"title":"Distributed Task Assignment Method for Multiple Robots Based on Dynamic Auction Rules","authors":"Jiajie Xu, Chin-Yin Chen, Si-lu Chen, Qiang Liu","doi":"10.1109/ICCECE58074.2023.10135261","DOIUrl":null,"url":null,"abstract":"Existing researchs on multi-robots task assignment focus on improving the task assignment efficiency without considering the task execution time and ignoring the overall task completion efficiency, which leads to its low computational efficiency in dynamic task assignment scenarios. In addition, the use of a centralized control structure requires high communication quality between robots. To address the above issues, we propose a distributed task assignment method for multiple robots based on dynamic auction rules. The method uses distributed control of robot swarms to share and dynamically update each other's task sets, employs dynamic auction rules for task bidding, adds links to adjust the task execution order, and considers the overall task completion efficiency. Finally, relevant experiments are designed, and the experimental results show that the algorithm is more efficient in terms of distribution and stability, balancing higher execution efficiency and lower motion cost.","PeriodicalId":120030,"journal":{"name":"2023 3rd International Conference on Consumer Electronics and Computer Engineering (ICCECE)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2023-01-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2023 3rd International Conference on Consumer Electronics and Computer Engineering (ICCECE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCECE58074.2023.10135261","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Existing researchs on multi-robots task assignment focus on improving the task assignment efficiency without considering the task execution time and ignoring the overall task completion efficiency, which leads to its low computational efficiency in dynamic task assignment scenarios. In addition, the use of a centralized control structure requires high communication quality between robots. To address the above issues, we propose a distributed task assignment method for multiple robots based on dynamic auction rules. The method uses distributed control of robot swarms to share and dynamically update each other's task sets, employs dynamic auction rules for task bidding, adds links to adjust the task execution order, and considers the overall task completion efficiency. Finally, relevant experiments are designed, and the experimental results show that the algorithm is more efficient in terms of distribution and stability, balancing higher execution efficiency and lower motion cost.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于动态拍卖规则的多机器人分布式任务分配方法
现有的多机器人任务分配研究侧重于提高任务分配效率,没有考虑任务的执行时间,忽略了任务的整体完成效率,导致其在动态任务分配场景下的计算效率较低。此外,集中式控制结构的使用要求机器人之间的通信质量高。为了解决上述问题,我们提出了一种基于动态拍卖规则的多机器人分布式任务分配方法。该方法利用机器人群的分布式控制实现彼此任务集的共享和动态更新,采用动态拍卖规则进行任务竞价,增加环节调整任务执行顺序,并考虑整体任务完成效率。最后,设计了相关的实验,实验结果表明,该算法在分配和稳定性方面具有更高的效率,平衡了更高的执行效率和更低的运动成本。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Clutter Edge and Target Detection Method Based on Central Moment Feature Adaptive short-time Fourier transform based on reinforcement learning Design and implementation of carrier aggregation and secure communication in distribution field network Power data attribution revocation searchable encrypted cloud storage Research of Intrusion Detection Based on Neural Network Optimized by Sparrow Search Algorithm
×
引用
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