DeepAI AI Chat
Log In Sign Up

Perimeter-defense Game between Aerial Defender and Ground Intruder

by   Elijah S. Lee, et al.
University of Pennsylvania

We study a variant of pursuit-evasion game in the context of perimeter defense. In this problem, the intruder aims to reach the base plane of a hemisphere without being captured by the defender, while the defender tries to capture the intruder. The perimeter-defense game was previously studied under the assumption that the defender moves on a circle. We extend the problem to the case where the defender moves on a hemisphere. To solve this problem, we analyze the strategies based on the breaching point at which the intruder tries to reach the target and predict the goal position, defined as optimal breaching point, that is achieved by the optimal strategies on both players. We provide the barrier that divides the state space into defender-winning and intruder-winning regions and prove that the optimal strategies for both players are to move towards the optimal breaching point. Simulation results are presented to demonstrate that the optimality of the game is given as a Nash equilibrium.


page 1

page 2

page 3

page 4


Defending a Perimeter from a Ground Intruder Using an Aerial Defender: Theory and Practice

The perimeter defense game has received interest in recent years as a va...

Target Defense against Sequentially Arriving Intruders

We consider a variant of the target defense problem where a single defen...

Target Defense against Periodically Arriving Intruders

We consider a variant of pursuit-evasion games where a single defender i...

Sequencing Chess

We analyze the structure of the state space of chess by means of transit...

Forced Capture Hnefatafl

We define a new, partizan, loopy combinatorial game, Forced-Capture Hnef...

A Reverse Hex Solver

We present Solrex,an automated solver for the game of Reverse Hex.Revers...