Solving Relay Task Allocation of Unmanned Aerial Vehicles: A Solution Using Group Multirole Assignment

Anling Lao, Haibin Zhu, Dongning Liu
{"title":"Solving Relay Task Allocation of Unmanned Aerial Vehicles: A Solution Using Group Multirole Assignment","authors":"Anling Lao, Haibin Zhu, Dongning Liu","doi":"10.1109/MSMC.2023.3323778","DOIUrl":null,"url":null,"abstract":"When multiple unmanned aerial vehicles (UAVs) perform tasks collaboratively, a relay dispatching method has a beneficial effect on the continuity of the task execution; i.e., the UAVs can take off and land using shared base stations. However, an increase of the number of demands and base stations can lead to a rapid increase of the number of involved UAVs. Such conditions may cause frequent conflicts when assigning dispatching base stations according to their stocks and capacity. For this concern, this article formalizes the relay task allocation problem of multiple UAVs (RTAPMU) based on group multirole assignment (GMRA), which is a submodel of E-CARGO, i.e., the general model of role-based collaboration (RBC). Through the revised GMRA model, we linearly constrain the capacity and dynamic inventory of the base station to ensure that there are sufficient UAVs to perform the mission. The proposed method is verified by simulation experiments on real-world problems. Since GMRA is a hard optimization model, the results show that the proposed method can obtain the global optimal solution of a one-day relay task assignment in 6.97 s. Furthermore, large-scale random experiments show that the proposed method is practicable and reasonable.","PeriodicalId":516814,"journal":{"name":"IEEE Systems, Man, and Cybernetics Magazine","volume":"11 5","pages":"41-52"},"PeriodicalIF":0.0000,"publicationDate":"2024-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Systems, Man, and Cybernetics Magazine","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MSMC.2023.3323778","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

When multiple unmanned aerial vehicles (UAVs) perform tasks collaboratively, a relay dispatching method has a beneficial effect on the continuity of the task execution; i.e., the UAVs can take off and land using shared base stations. However, an increase of the number of demands and base stations can lead to a rapid increase of the number of involved UAVs. Such conditions may cause frequent conflicts when assigning dispatching base stations according to their stocks and capacity. For this concern, this article formalizes the relay task allocation problem of multiple UAVs (RTAPMU) based on group multirole assignment (GMRA), which is a submodel of E-CARGO, i.e., the general model of role-based collaboration (RBC). Through the revised GMRA model, we linearly constrain the capacity and dynamic inventory of the base station to ensure that there are sufficient UAVs to perform the mission. The proposed method is verified by simulation experiments on real-world problems. Since GMRA is a hard optimization model, the results show that the proposed method can obtain the global optimal solution of a one-day relay task assignment in 6.97 s. Furthermore, large-scale random experiments show that the proposed method is practicable and reasonable.
解决无人驾驶飞行器的中继任务分配问题:使用群组多任务分配的解决方案
当多个无人飞行器(UAV)协同执行任务时,中继调度方法对任务执行的连续性有好处,即无人飞行器可以使用共享基站起飞和降落。但是,需求和基站数量的增加会导致参与的无人机数量迅速增加。在这种情况下,根据基站的存量和容量分配调度基站时可能会经常出现冲突。针对这一问题,本文正式提出了基于群组多角色分配(GMRA)的多无人机中继任务分配问题(RTAPMU),该问题是 E-CARGO 的子模型,即基于角色的协作(RBC)的一般模型。通过修订后的 GMRA 模型,我们对基站的容量和动态库存进行线性约束,以确保有足够的无人机执行任务。我们通过对实际问题的模拟实验验证了所提出的方法。由于 GMRA 是一个硬优化模型,结果表明所提出的方法可以在 6.97 s 内获得一天中继任务分配的全局最优解。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信