Guarding a subgraph as a tool in 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...

How Pursuit-evasion Games help

Model Checking Knowledge in Pursuit Evasion Games

In a pursuit-evasion game, one or more pursuers aim to discover the existence of, and then capture, an evader. The paper studies pursuit-evasion games in which players may have incomplete information concerning the game state. A methodology is presented for the application of a model checker for the logic of knowledge and time to verify epistemic properties in such games. Experimental results a...

Pursuit - Evasion Games in Mobile Networks

In the last two decades, there has been an enormous effort to deploy a network of autonomous mobile platforms in various scenarios related to military as well as civilian applications. Interesting research problems related to security range from the development of secure communication protocols for a network of autonomous mobile agents to the development of novel deployment algorithms for a gro...

A Framework for Pursuit Evasion Games in R

We present a framework for solving pursuit evasion games in Rn for the case of N pursuers and a single evader. We give two algorithms that capture the evader in a number of steps linear in the original pursuer-evader distances. We also show how to generalize our results to a convex playing field with finitely many hyperplane boundaries that serve as obstacles.