J Shanghai Jiaotong Univ Sci ›› 2022, Vol. 27 ›› Issue (6): 799-805.doi: 10.1007/s12204-021-2270-z

• Aeronautics and Astronautics • Previous Articles     Next Articles

Air Combat Assignment Problem Based on Bayesian Optimization Algorithm

FU Lia (傅 莉), LONG Xia∗ (龙 洗), HE Wenbinb (何文斌)   

  1. (a. School of Automation; b. School of Aero-Engine, Shenyang Aerospace University, Shenyang 110136, China)
  • Received:2019-05-01 Online:2022-11-28 Published:2022-10-13

Abstract: 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.

Key words: air combat, task assignment, first in first serviced criteria, Bayesian optimization algorithm (BOA)

CLC Number: