无人驾驶飞行器的多任务分配算法

Abd Ur Rub, Xuanmin Lu
{"title":"无人驾驶飞行器的多任务分配算法","authors":"Abd Ur Rub, Xuanmin Lu","doi":"10.9734/jerr/2024/v26i71191","DOIUrl":null,"url":null,"abstract":"To fulfill the requirement of assigning task the auction algorithm is widely used. There are many classical auction algorithms those performances not up to the mark while dealing with multi-UAVs dynamic task assignment. SWARM UAVs are made up of a large number of small UAVs with limited mission resources that can operate in an autonomous, appropriate and universal manner. Based on the in-depth research of the traditional auction algorithm CAA, this paper proposes an iterative method that can improve the task allocation efficiency of multi-UAV, namely the two-stage auction algorithm. At the same time, in order to improve the daily management of airborne computing and communication resources of UAV, this paper overcomes the difficulties caused by data coupling between task allocation and path planning, and proposes a decentralized task allocation algorithm, that is, UAV re-checks the unreasonable task allocation results within the task allocation cycle. This method has the advantages of algorithm security and unpredictability, and it can control the error of task assignment evaluation within a specific range through finite complexity calculation. Simulation results show that the algorithm is effective in computing efficiency and task execution efficiency.","PeriodicalId":508164,"journal":{"name":"Journal of Engineering Research and Reports","volume":"1 9","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Multiple Task Assignment Algorithms for Unmanned Aerial Vehicles\",\"authors\":\"Abd Ur Rub, Xuanmin Lu\",\"doi\":\"10.9734/jerr/2024/v26i71191\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"To fulfill the requirement of assigning task the auction algorithm is widely used. There are many classical auction algorithms those performances not up to the mark while dealing with multi-UAVs dynamic task assignment. SWARM UAVs are made up of a large number of small UAVs with limited mission resources that can operate in an autonomous, appropriate and universal manner. Based on the in-depth research of the traditional auction algorithm CAA, this paper proposes an iterative method that can improve the task allocation efficiency of multi-UAV, namely the two-stage auction algorithm. At the same time, in order to improve the daily management of airborne computing and communication resources of UAV, this paper overcomes the difficulties caused by data coupling between task allocation and path planning, and proposes a decentralized task allocation algorithm, that is, UAV re-checks the unreasonable task allocation results within the task allocation cycle. This method has the advantages of algorithm security and unpredictability, and it can control the error of task assignment evaluation within a specific range through finite complexity calculation. Simulation results show that the algorithm is effective in computing efficiency and task execution efficiency.\",\"PeriodicalId\":508164,\"journal\":{\"name\":\"Journal of Engineering Research and Reports\",\"volume\":\"1 9\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-06-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Engineering Research and Reports\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.9734/jerr/2024/v26i71191\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Engineering Research and Reports","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.9734/jerr/2024/v26i71191","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

为了满足分配任务的要求,拍卖算法被广泛使用。有许多经典的拍卖算法在处理多无人机动态任务分配时性能不尽如人意。SWARM 无人机由大量小型无人机组成,任务资源有限,可以以自主、适当和通用的方式运行。本文在深入研究传统拍卖算法 CAA 的基础上,提出了一种能够提高多无人机任务分配效率的迭代方法,即两阶段拍卖算法。同时,为了改善无人机机载计算和通信资源的日常管理,本文克服了任务分配和路径规划之间数据耦合带来的困难,提出了一种分散式任务分配算法,即无人机在任务分配周期内重新检查不合理的任务分配结果。该方法具有算法安全、不可预测性强等优点,通过有限复杂度计算,可将任务分配评估误差控制在特定范围内。仿真结果表明,该算法在计算效率和任务执行效率方面效果显著。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Multiple Task Assignment Algorithms for Unmanned Aerial Vehicles
To fulfill the requirement of assigning task the auction algorithm is widely used. There are many classical auction algorithms those performances not up to the mark while dealing with multi-UAVs dynamic task assignment. SWARM UAVs are made up of a large number of small UAVs with limited mission resources that can operate in an autonomous, appropriate and universal manner. Based on the in-depth research of the traditional auction algorithm CAA, this paper proposes an iterative method that can improve the task allocation efficiency of multi-UAV, namely the two-stage auction algorithm. At the same time, in order to improve the daily management of airborne computing and communication resources of UAV, this paper overcomes the difficulties caused by data coupling between task allocation and path planning, and proposes a decentralized task allocation algorithm, that is, UAV re-checks the unreasonable task allocation results within the task allocation cycle. This method has the advantages of algorithm security and unpredictability, and it can control the error of task assignment evaluation within a specific range through finite complexity calculation. Simulation results show that the algorithm is effective in computing efficiency and task execution efficiency.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信