基于压缩的异构多无人机分布式动态任务分配算法

Li Wang, Q. Guo
{"title":"基于压缩的异构多无人机分布式动态任务分配算法","authors":"Li Wang, Q. Guo","doi":"10.1109/ROBIO.2017.8324779","DOIUrl":null,"url":null,"abstract":"For the dynamic mission scenarios with task deadline constraints, we present two online task assignment algorithms for multiple unmanned aerial vehicles: the distributed deep compression algorithm (DDCA) and the distributed quick compression algorithm (DQCA). The two methods based on a compression strategy aim at directly optimizing the mission span as their objective by considering the long-term benefits and the current results, respectively. These algorithms all include a task calculation phase, a consensus and compression phase and a task update phase, running on each UAV in an iterative fashion. The methods are simple, efficient and anytime, which reach good solution in a relatively short time. Numerical results show that the proposed algorithms perform better in various conditions when compared with the classic SSIA algorithm.","PeriodicalId":197159,"journal":{"name":"2017 IEEE International Conference on Robotics and Biomimetics (ROBIO)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Compression based distributed dynamic task assignment algorithms for heterogeneous multiple unmanned aerial vehicles\",\"authors\":\"Li Wang, Q. Guo\",\"doi\":\"10.1109/ROBIO.2017.8324779\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"For the dynamic mission scenarios with task deadline constraints, we present two online task assignment algorithms for multiple unmanned aerial vehicles: the distributed deep compression algorithm (DDCA) and the distributed quick compression algorithm (DQCA). The two methods based on a compression strategy aim at directly optimizing the mission span as their objective by considering the long-term benefits and the current results, respectively. These algorithms all include a task calculation phase, a consensus and compression phase and a task update phase, running on each UAV in an iterative fashion. The methods are simple, efficient and anytime, which reach good solution in a relatively short time. Numerical results show that the proposed algorithms perform better in various conditions when compared with the classic SSIA algorithm.\",\"PeriodicalId\":197159,\"journal\":{\"name\":\"2017 IEEE International Conference on Robotics and Biomimetics (ROBIO)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 IEEE International Conference on Robotics and Biomimetics (ROBIO)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ROBIO.2017.8324779\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 IEEE International Conference on Robotics and Biomimetics (ROBIO)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ROBIO.2017.8324779","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

针对具有任务期限约束的动态任务场景,提出了两种多无人机在线任务分配算法:分布式深度压缩算法(DDCA)和分布式快速压缩算法(DQCA)。基于压缩策略的两种方法分别以考虑长期效益和当前结果直接优化任务跨度为目标。这些算法都包括一个任务计算阶段、一个共识和压缩阶段以及一个任务更新阶段,以迭代的方式在每个无人机上运行。该方法简便、高效、随时可用,可在较短时间内达到较好的解决效果。数值结果表明,与经典的SSIA算法相比,该算法在各种条件下都具有更好的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Compression based distributed dynamic task assignment algorithms for heterogeneous multiple unmanned aerial vehicles
For the dynamic mission scenarios with task deadline constraints, we present two online task assignment algorithms for multiple unmanned aerial vehicles: the distributed deep compression algorithm (DDCA) and the distributed quick compression algorithm (DQCA). The two methods based on a compression strategy aim at directly optimizing the mission span as their objective by considering the long-term benefits and the current results, respectively. These algorithms all include a task calculation phase, a consensus and compression phase and a task update phase, running on each UAV in an iterative fashion. The methods are simple, efficient and anytime, which reach good solution in a relatively short time. Numerical results show that the proposed algorithms perform better in various conditions when compared with the classic SSIA algorithm.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信