Research on aircraft target assignment decision based on improved Monte Carlo method

Modern warfare is developing towards systematic warfare. The cooperation of multiple aircraft can improve the overall combat capability, and the optimal attack effect can be obtained by optimizing the cooperative target assignment scheme. Cooperative target assignment can also be called weapon target assignment problem. To solve the problem of long search time and low search efficiency, an improved Monte Carlo Tree search algorithm is proposed. First of all, a dynamic cooperative target assignment algorithm is designed according to the optimized cooperative target assignment type, and each aircraft performs dynamic target assignment as the number of targets changes. Then aiming at the problem that the search time of Monte Carlo tree search algorithm is too long, the pruning algorithm is added to improve the search process of Monte Carlo, and the MCTS_prun algorithm with a shorter search time is designed. Finally, the original Monte Carlo tree search method and MCTS_prun algorithm in different confrontation scenarios are compared. It is verified that using the MCTS_prun algorithm to make target assignment decisions can save target assignment time while ensuring the optimal overall damage effect, and improve the search efficiency of MCTS algorithm.