Optimal Intermittent Sensing for Pursuit-Evasion Games

Pursuit- Evasion Games

Two players, Red and Blue, each independently choose a vertex of a connected graph G. Red must then pay Blue an amount equal to the distance between the vertices chosen. In this note, w e investigate the value v(G) of this pursuit-evasion game for various classes of graphs G, as well as those optimal mixed strategies for achieving v(G). It is shown that some rather counterintuitive behavior can...

The Role of Sensing Information in Pursuit-evasion Games

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ix

How Pursuit-evasion Games help

Game Theory Models for Pursuit Evasion Games

In a pursuit evasion game, the pursuer tries to capture the evader while the evader tries to prevent this capture. A classical approach is to model this game as an infinite differential game. In this report, we model a pursuit-evasion game as a finite extensive form game, and show that the differential game is a generalization of this game. We prove that a pure-strategy Nash equilibrium always ...

Visibility Induction for Discretized Pursuit-Evasion Games

We study a two-player pursuit-evasion game, in which an agent moving amongst obstacles is to be maintained within “sight” of a pursuing robot. Using a discretization of the environment, our main contribution is to design an efficient algorithm that decides, given initial positions of both pursuer and evader, if the evader can take any moving strategy to go out of sight of the pursuer at any tim...