Air Combat Assignment Problem Based on Bayesian Optimization Algorithm  

作　　者：FU LI LONG XI HE WENBIN 傅莉;龙洗;何文斌(School of Automation,Shenyang Aerospace University,Shenyang 110136,China;School of Aero-Engine,Shenyang Aerospace University,Shenyang 110136,China)

机构地区：[1]School of Automation,Shenyang Aerospace University,Shenyang 110136,China [2]School of Aero-Engine,Shenyang Aerospace University,Shenyang 110136,China

出　　处：《Journal of Shanghai Jiaotong university(Science)》2022年第6期799-805,共7页上海交通大学学报（英文版）

基　　金：the National Natural Science Foundation of China(No.61074090)。

摘　　要：In order to adapt to the changing battlefield situation and improve the combat effectiveness of air combat,the problem of air battle allocation based on Bayesian optimization algorithm(BOA)is studied.First,we discuss the number of fighters on both sides,and apply cluster analysis to divide our fighter into the same number of groups as the enemy.On this basis,we sort each of our fighters'different advantages to the enemy fighters,and obtain a series of target allocation schemes for enemy attacks by first in first serviced criteria.Finally,the maximum advantage function is used as the target,and the BOA is used to optimize the model.The simulation results show that the established model has certain decision-making ability,and the BOA can converge to the global optimal solution at a faster speed,which can effectively solve the air combat task assignment problem.

关 键 词：air combat task assignment first in first serviced criteria Bayesian optimization algorithm(BOA) 

分 类 号：V271.4[航空宇航科学与技术—飞行器设计]