We consider a class of pursuit-evasion differential games in which the evader has continuous access to pursuer’s location, but not vice-versa. There is remote sensor (e.g., radar station) that can sense evader’s location upon request from pursuer and communicate sensed pursuer. The budget on total number sensing requests. outcome game determined by players’ motion strategies. obtain equilibrium...

In this work, we describe an approach for modeling and simulating group behaviors for pursuit-evasion that uses a graph-based representation of the environment and integrates multi-agent simulation with roadmap-based path planning. We demonstrate the utility of this approach for a variety of scenarios including pursuit-evasion on terrains, in multi-level buildings, and in crowds.

In this paper, we study the vertex pursuit game of Cops and Robbers where cops try to capture a robber on the vertices of the graph. The minimum number of cops required to win on a given graph G is the cop number of G. We present asymptotic results for the game of Cops and Robber played on a random graph G(n, p) for a wide range of p = p(n). It has been shown that the cop number as a function o...

We consider the following differential game of pursuit and evasion involving two participating players: an evader, which has limited maneuverability, and an agile pursuer. The agents move on the Euclidean plane with different but constant speeds. Whereas the pursuer can change the orientation of its velocity vector arbitrarily fast, that is, he is a “pedestrian” á la Isaacs, the evader cannot m...

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...