A Generative Machine Learning Approach To Policy Optimization In Pursuit-evasion Games

Abstract

We consider a pursuit-evasion game [11] played between two agents, 'Blue' (the pursuer) and 'Red' (the evader), over \(T\) time steps. Red aims to attack Blue's territory. Blue's objective is to intercept Red by time \(T\) and thereby limit the success of Red's attack. Blue must plan its pursuit trajectory by choosing parameters that determine its course of movement (speed and angle in our setup) such that it intercepts Red by time \(T\). We show that Blue's path-planning problem in pursuing Red, can be posed as a sequential decision making problem under uncertainty. Blue's unawareness of Red's action policy renders the analytic dynamic programming approach intractable for finding the optimal action policy for Blue. In this work, we are interested in exploring data-driven approaches to the policy optimization problem that Blue faces. We apply generative machine learning (ML) approaches to learn optimal action policies for Blue. This highlights the ability of generative ML model to lear

Stats

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

Related papers

• A Dynamics Perspective Of Pursuit-evasion Games Of Intelligent Agents With The Ability To Learn (2021)3.58
• Equilibrium Policy Generalization: A Reinforcement Learning Framework For Cross-graph Zero-shot Generalization In Pursuit-evasion Games (2025)0.00
• Adversary Agent Reinforcement Learning For Pursuit-evasion (2021)0.00
• Policy Optimization For Continuous-time Linear-quadratic Graphon Mean Field Games (2025)0.00
• Policyevolve: Evolving Programmatic Policies By Llms For Multi-player Games Via Population-based Training (2025)0.00
• Strategic Communication Under Threat: Learning Information Trade-offs In Pursuit-evasion Games (2025)0.00
• Empirical Policy Optimization For \(n\)-player Markov Games (2021)0.00
• Policy Optimization For Markov Games: Unified Framework And Faster Convergence (2022)0.00