基于多轮次分布式拍卖的异构多任务分配算法  

A heterogeneous multi-task assignment algorithm based on multi-round distributed auction

作　　者：吕晔 周锐[1] 李兴 刘志恒 邸斌 LYU Ye;ZHOU Rui;LI Xing;LIU Zhiheng;DI Bin(School of Automation Science and Electrical Engineering,Beihang University,Beijing 100191,China;Nanjing Research Institute of Electronics Technology,Nanjing 210039,China;Unit 32806 of the PLA,Beijing 100091,China)

机构地区：[1]北京航空航天大学自动化科学与电气工程学院,北京100191 [2]南京电子技术研究所,南京210039 [3]中国人民解放军32806部队,北京100091

出　　处：《北京航空航天大学学报》2025年第3期1018-1027,共10页Journal of Beijing University of Aeronautics and Astronautics

基　　金：国家自然科学基金(62003365)。

摘　　要：针对多机协同探测、攻击、评估等不同作战任务的分布式决策需要,建立了一种面向异构且具有时序约束任务的多轮次分布式拍卖算法。所提算法较为灵活地解决了不同能力无人机(UAV)之间具有复杂约束的分布式协同任务分配问题。在分布式任务分配框架中,每架无人机可实现分布式异步计算和异步通信,且能确保较好的求解效率和准确性。任务分配原则以就近分配为主,同时兼顾目标价值和时序约束,实现了在有限资源情况下对重要目标的优先分配,且使总的行程最短。仿真结果表明:在给定任意无人机和目标数量及无人机作战能力配置的情况下,所提算法均能得到较好的分配结果。The algorithm solves the distributed cooperative task assignment problem with complex constraints among unmanned aerial vehicles(UAVs)with different capabilities in a more flexible way.Better solution accuracy and efficiency can be ensured by each UAV in the distributed task allocation framework by enabling distributed asynchronous computation and asynchronous communication.In order to prioritize significant targets with limited resources and the quickest total journey time,the task assignment principle is based on proximity assignment while taking the target value and schedule limitations into consideration.Simulation results show that this heterogeneous multi-round distributed auction algorithm can obtain good assignment results for any given number of UAVs and targets and UAV combat capability configuration.

关 键 词：多机协同 异构任务分配 分布式拍卖算法 任务规划 时序约束 

分 类 号：V219[航空宇航科学与技术—航空宇航推进理论与工程]