Visibility Optimization for Surveillance-Evasion Games
We consider surveillance-evasion differential games, where a pursuer must try to constantly maintain visibility of a moving evader. The pursuer loses as soon as the evader becomes occluded. Optimal controls for game can be formulated as a Hamilton-Jacobi-Isaac equation. We use an upwind scheme to compute the feedback value function, corresponding to the end-game time of the differential game. Although the value function enables optimal controls, it is prohibitively expensive to compute, even for a single pursuer and single evader on a small grid. We consider a discrete variant of the surveillance-game. We propose two locally optimal strategies based on the static value function for the surveillance-evasion game with multiple pursuers and evaders. We show that Monte Carlo tree search and self-play reinforcement learning can train a deep neural network to generate reasonable strategies for on-line game play. Given enough computational resources and offline training time, the proposed model can continue to improve its policies and efficiently scale to higher resolutions.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Prying Pedestrian Surveillance-Evasion: Minumum-Time Evasion from an Agile Pursuer
A new surveillance-evasion differential game is posed and solved in which an agile pursuer (the prying pedestrian) seeks to remain within a given surveillance range of a less agile evader that aims to escape. In contrast…
A Dynamics Perspective of Pursuit-Evasion Games of Intelligent Agents with the Ability to Learn
Pursuit-evasion games are ubiquitous in nature and in an artificial world. In nature, pursuer(s) and evader(s) are intelligent agents that can learn from experience, and dynamics (i.e., Newtonian or Lagrangian) is vital …
reinforcement-learningReinforcement LearningReinforcement Learning (RL)A Generative Machine Learning Approach to Policy Optimization in Pursuit-Evasion Games
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$ a…
BIG-bench Machine LearningDecision MakingSequential Decision MakingDiffusion-Reinforcement Learning Hierarchical Motion Planning in Multi-agent Adversarial Games
Reinforcement Learning (RL)-based motion planning has recently shown the potential to outperform traditional approaches from autonomous navigation to robot manipulation. In this work, we focus on a motion planning task f…
Autonomous NavigationEfficient ExplorationMotion Planningreinforcement-learning+2Fast and the Furious: Hot Starts in Pursuit-Evasion Games
Effectively positioning pursuers in pursuit-evasion games without prior knowledge of evader locations remains a significant challenge. A novel approach that combines game-theoretic control theory with Graph Neural Networ…