Maneuver Decision-making Through Proximal Policy Optimization And Monte Carlo Tree Search

Abstract

Maneuver decision-making can be regarded as a Markov decision process and can be address by reinforcement learning. However, original reinforcement learning algorithms can hardly solve the maneuvering decision-making problem. One reason is that agents use random actions in the early stages of training, which makes it difficult to get rewards and learn how to make effective decisions. To address this issue, a method based on proximal policy optimization and Monte Carlo tree search is proposed. The method uses proximal policy optimization to train the agent, and regards the results of air combat as targets to train the value network. Then, based on the value network and the visit count of each node, Monte Carlo tree search is used to find the actions with more expected returns than random actions, which can improve the training performance. The ablation studies and simulation experiments indicate that agents trained by the proposed method can make different decisions according to differe

Stats

• citations0
• S2 citations—
• github stars0
• HF likes0
• heat score0.00
• arxiv keyhongpeng2023maneuver

Related papers

• Decision Making In Non-stationary Environments With Policy-augmented Monte Carlo Tree Search (2022)0.00
• Decision Making In Non-stationary Environments With Policy-augmented Search (2024)0.00
• Hierarchical Multi-agent Reinforcement Learning For Air Combat Maneuvering (2023)8.82
• Policy Optimization With Model-based Explorations (2018)5.84
• Research On Multi-agent Communication And Collaborative Decision-making Based On Deep Reinforcement Learning (2023)0.00
• Combining Off And On-policy Training In Model-based Reinforcement Learning (2021)0.00
• Ordinal Monte Carlo Tree Search (2019)0.00
• Act As You Learn: Adaptive Decision-making In Non-stationary Markov Decision Processes (2024)0.00