Air combat manoeuvre strategy algorithm based on two-layer game decision-making and the distributed MCTS method with double game trees

2Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In view of the huge strategy space and high real-time requirement for multi-fighter air combat maneouvre decisions, the target allocation and the manoeuvre decision model are established, respectively and the air combat strategy solving algorithm is proposed based on two-layer game decision-making and the distributed Monte Carlo strategy search method with double game trees. Moreover, the two-layer game decision-making method can precut the huge game tree strategy space, which improves the efficiency of strategy search. The distributed Monte Carlo strategy search method with double game trees can quickly search out the optimal decision scheme of an air combat game based on the opponent’s strategy. The experiment results show that the designed algorithm is effective and improves the efficiency of the decision compared with the Monte Carlo search algorithm of single-layer decision-making.

Cite

CITATION STYLE

APA

Li, Q., Wang, F., Liu, Z., & Li, Y. (2022). Air combat manoeuvre strategy algorithm based on two-layer game decision-making and the distributed MCTS method with double game trees. Systems Science and Control Engineering, 10(1), 811–821. https://doi.org/10.1080/21642583.2022.2123058

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free