Multi-Robot Task Allocation Based on Swarm Intelligence

Shuhua Liu, Tie-li Sun, C. Hung
{"title":"Multi-Robot Task Allocation Based on Swarm Intelligence","authors":"Shuhua Liu, Tie-li Sun, C. Hung","doi":"10.5772/13106","DOIUrl":null,"url":null,"abstract":"The task allocation was studied based on the swarm inteeligence for the large-scale multi-robot system with loose-and tight-coupled tasks adopting the hierarchial architecture. In the high level,the ant colony algorithm was employed to find the optimal allocation of the loose-coupled tasks,namely,based on the reverse distribution idea,taking each ant to form a task,an undertaker was chosen for every task. In the low level,the coalition formation algorithms based on the ant colony optimization(ACO) ,the particle swarm and ant colomy optimization(PSACO) ,or the quantum-inspised ant colony optimization(QACO) was proposed respectively for performin a tight-coupled task.Simulations were performed and results showed that PSACO provides the best solution,but its running time is the largest;QACO is a little inferior in solution quality to PSACO,however,it needs only a half time of the 2 other methods. Therefore,QACO appears more suitable for the task allocation of the large-scale multi-robot system.","PeriodicalId":16277,"journal":{"name":"Journal of Jilin University","volume":"341 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2011-01-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"27","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Jilin University","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5772/13106","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 27

Abstract

The task allocation was studied based on the swarm inteeligence for the large-scale multi-robot system with loose-and tight-coupled tasks adopting the hierarchial architecture. In the high level,the ant colony algorithm was employed to find the optimal allocation of the loose-coupled tasks,namely,based on the reverse distribution idea,taking each ant to form a task,an undertaker was chosen for every task. In the low level,the coalition formation algorithms based on the ant colony optimization(ACO) ,the particle swarm and ant colomy optimization(PSACO) ,or the quantum-inspised ant colony optimization(QACO) was proposed respectively for performin a tight-coupled task.Simulations were performed and results showed that PSACO provides the best solution,but its running time is the largest;QACO is a little inferior in solution quality to PSACO,however,it needs only a half time of the 2 other methods. Therefore,QACO appears more suitable for the task allocation of the large-scale multi-robot system.
基于群体智能的多机器人任务分配
采用分层结构,研究了基于群智能的大型多机器人系统任务分配问题。在高层,采用蚁群算法求解松耦合任务的最优分配,即基于逆向分配思想,让每只蚂蚁组成一个任务,为每一个任务选择一个承担者。在低层次上,分别提出了基于蚁群优化(ACO)、粒子群蚁群优化(PSACO)和量子启发蚁群优化(QACO)的联盟组建算法来执行紧密耦合任务。仿真结果表明,PSACO提供的解最好,但运行时间最长;QACO在解质量上略逊于PSACO,但运行时间仅为其他两种方法的一半。因此,QACO更适合于大型多机器人系统的任务分配。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信