LAUSR

In this paper, a new cooperative occupancy decision-making problem for multiple unmanned aerial vehicles (UAVs) in beyond-visual-range (BVR) air combat is proposed; that is, UAV formation on each side first decides the occupancy positions of their own UAVs, then decides the target that each UAV will confront, so that each side can occupy the greatest predominance and be subject to the smallest threat possible. By analyzing the influence of the occupancy positions of the UAVs on the predominance gained by both sides and the threat against them, the problem is described as a zero-sum matrix game. Because the strategy combinations of this game are very numerous, as the best algorithm for the zero-sum matrix game, the Double Oracle (DO) algorithm still has difficulty solving the game model effectively. Therefore, we propose a DO combined with neighborhood search (DO-NS) algorithm to deal with the large-scale zero-sum matrix game. The results show that compared with the DO algorithm, the DO-NS algorithm can ensure the effectiveness of the computational time and solution quality.