Abstract
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.
Highlights
With the development of missile technology and detection technology, beyond-visual-range (BVR) air combat has become the main mode of modern air combat [1], [2]
WORK In this paper, by studying the influence of different occupancy strategies of unmanned aerial vehicles (UAVs) on the subsequent cooperative target assignment, a new cooperative occupancy decision-making problem is proposed for multi-UAV in BVR air combat
This problem is a two-stage decision-making problem; that is, the decision maker first decides the occupancy position of each UAV, decides the target of each UAV based on the occupancy of both the UAVs and targets
Summary
With the development of missile technology and detection technology, beyond-visual-range (BVR) air combat has become the main mode of modern air combat [1], [2]. An effective occupancy strategy for the UAVs before the cooperative target assignment can further improve the expected predominance of multi-UAV in cooperative target assignment For this reason, this paper focuses on a new cooperative occupancy decision making problem of multiple UAVs in BVR air combat. This paper focuses on a new cooperative occupancy decision making problem of multiple UAVs in BVR air combat This problem is a two-stage decision making problem; that is, the decision makers first decide the occupancy position of each UAV, decide the target that each UAV will confront, so that they can occupy the greatest predominance and be subject to the smallest threat possible. The main contributions of this paper are proposing a new cooperative occupancy decision-making problem for multiple UAVs in BVR air combat, formulating the problem as a zero-sum matrix game and designing an effective algorithm to solve the model.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
