arrow
返回

Multi-UAV Objective Assignment Using Hungarian Fusion Genetic Algorithm

delete2022-01-01
delete15
delete
OA
AI
J
Jiang Yan *
D
Daobo Wang
T
Tingting Bai
Y
Yan Zongyuan
DOI:10.1109/ACCESS.2022.3168359delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
In the background of air combat, the situation between multiple unmanned aerial vehicle (multi-UAV) and objectives has a certain impact on the task assignment. In order to improve the efficiency of assignment and obtain the best assignment scheme during the process of performing tasks, this paper proposes a method to evaluate the situation at a certain time. This method is the basis for establishing a multi-UAV objective assignment model. For solving the model, this paper presents the Hungarian fusion Genetic Algorithm. It first uses the feasible solutions solved by the Hungarian algorithm as the elite individuals in the initial population of the genetic algorithm, and then uses the objective function in the assignment model as the fitness function to optimize the results. The algorithm solves the problem that the assignment result of the Hungarian algorithm is not unique, and optimizes the drawback that the traditional Genetic Algorithm is prone to fall into local optimum. The simulation verified the effectiveness of the situational assessment method and the improved algorithm.
Keyword:
Missiles
Genetic algorithms
Autonomous aerial vehicles
Azimuth
Task analysis
Atmospheric modeling
Aircraft
Situational assessment method
objective assignment model
Hungarian algorithm
genetic algorithm

期刊

IEEE Access 封面图
IEEE Access
IF:
3.6
论文数:
9.8W
被引数:
29.4W

机构

暂无机构信息
引用论文

引用论文

err分享
err收藏
err分享
err收藏
Addressing robustness in time-critical, distributed, task allocation algorithms
err2018-04-18
err21
errOAAI
errWhitbrook, Amanda; Meng, Qinggang; Chung, Paul W. H.
err分享
err收藏
学者 查看更多内容