多无人机群协调任务规划与任务分配框架

Johannes Autenrieb, Natalia Strawa, Hyo-Sang Shin, Ju-Hyeon Hong
{"title":"多无人机群协调任务规划与任务分配框架","authors":"Johannes Autenrieb, Natalia Strawa, Hyo-Sang Shin, Ju-Hyeon Hong","doi":"10.1109/REDUAS47371.2019.8999708","DOIUrl":null,"url":null,"abstract":"This paper presents a multi-agent mission planning and task allocation framework designed to coordinate autonomous aerial vehicles engaged in a competition scenario. The development was a part of an inter-university UAV Swarm competition that was supported by BAE Systems. The proposed centralised system was developed with the main objectives of robustness and scalability. The system consists of a general mission planning module which decomposes the overall mission into identified sub-stages to achieve the overall mission goal. In order to enable autonomous defence actions a dynamic task allocation approach is proposed. The dynamic task allocation is using received information of detected enemies and utilises the information for a further combinatorial optimisation problem. In this work, we discuss the structure of the framework and present results obtained in a high-fidelity simulation environment. Moreover, a comparative study of the performance of three different optimization algorithms for the given combinatorial problem, namely Kuhn-Munkres, Jonker-Volgenant and Gale-Shapley, implemented in the system is included. The results demonstrate that the best allocation result performances, in terms of minimal costs, are obtained with utilising, both Kuhn-Munkres or Jonker-Volgenant methods, while the Gale-Shapley algorithms have benefits in terms of time efficiency for cases in which minimal costs are not the highest priority.","PeriodicalId":351115,"journal":{"name":"2019 Workshop on Research, Education and Development of Unmanned Aerial Systems (RED UAS)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"A Mission Planning and Task Allocation Framework For Multi-UAV Swarm Coordination\",\"authors\":\"Johannes Autenrieb, Natalia Strawa, Hyo-Sang Shin, Ju-Hyeon Hong\",\"doi\":\"10.1109/REDUAS47371.2019.8999708\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents a multi-agent mission planning and task allocation framework designed to coordinate autonomous aerial vehicles engaged in a competition scenario. The development was a part of an inter-university UAV Swarm competition that was supported by BAE Systems. The proposed centralised system was developed with the main objectives of robustness and scalability. The system consists of a general mission planning module which decomposes the overall mission into identified sub-stages to achieve the overall mission goal. In order to enable autonomous defence actions a dynamic task allocation approach is proposed. The dynamic task allocation is using received information of detected enemies and utilises the information for a further combinatorial optimisation problem. In this work, we discuss the structure of the framework and present results obtained in a high-fidelity simulation environment. Moreover, a comparative study of the performance of three different optimization algorithms for the given combinatorial problem, namely Kuhn-Munkres, Jonker-Volgenant and Gale-Shapley, implemented in the system is included. The results demonstrate that the best allocation result performances, in terms of minimal costs, are obtained with utilising, both Kuhn-Munkres or Jonker-Volgenant methods, while the Gale-Shapley algorithms have benefits in terms of time efficiency for cases in which minimal costs are not the highest priority.\",\"PeriodicalId\":351115,\"journal\":{\"name\":\"2019 Workshop on Research, Education and Development of Unmanned Aerial Systems (RED UAS)\",\"volume\":\"22 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 Workshop on Research, Education and Development of Unmanned Aerial Systems (RED UAS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/REDUAS47371.2019.8999708\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 Workshop on Research, Education and Development of Unmanned Aerial Systems (RED UAS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/REDUAS47371.2019.8999708","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

本文提出了一种多智能体任务规划和任务分配框架,旨在协调参与竞争场景的自主飞行器。该开发是由BAE系统公司支持的大学间无人机群竞赛的一部分。所提出的集中式系统的主要目标是鲁棒性和可扩展性。该系统由总体任务规划模块组成,该模块将总体任务分解为可识别的子阶段,以实现总体任务目标。为了实现自主防御行动,提出了一种动态任务分配方法。动态任务分配是利用接收到的检测到的敌人信息,并利用这些信息进行进一步的组合优化问题。在这项工作中,我们讨论了框架的结构,并给出了在高保真仿真环境中获得的结果。此外,对给定组合问题的三种不同优化算法(Kuhn-Munkres、Jonker-Volgenant和Gale-Shapley)在系统中的性能进行了比较研究。结果表明,在最小成本方面,使用Kuhn-Munkres或Jonker-Volgenant方法均可获得最佳的分配结果性能,而在最小成本不是最高优先级的情况下,Gale-Shapley算法在时间效率方面具有优势。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Mission Planning and Task Allocation Framework For Multi-UAV Swarm Coordination
This paper presents a multi-agent mission planning and task allocation framework designed to coordinate autonomous aerial vehicles engaged in a competition scenario. The development was a part of an inter-university UAV Swarm competition that was supported by BAE Systems. The proposed centralised system was developed with the main objectives of robustness and scalability. The system consists of a general mission planning module which decomposes the overall mission into identified sub-stages to achieve the overall mission goal. In order to enable autonomous defence actions a dynamic task allocation approach is proposed. The dynamic task allocation is using received information of detected enemies and utilises the information for a further combinatorial optimisation problem. In this work, we discuss the structure of the framework and present results obtained in a high-fidelity simulation environment. Moreover, a comparative study of the performance of three different optimization algorithms for the given combinatorial problem, namely Kuhn-Munkres, Jonker-Volgenant and Gale-Shapley, implemented in the system is included. The results demonstrate that the best allocation result performances, in terms of minimal costs, are obtained with utilising, both Kuhn-Munkres or Jonker-Volgenant methods, while the Gale-Shapley algorithms have benefits in terms of time efficiency for cases in which minimal costs are not the highest priority.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信