2-Modem Pursuit-Evasion Problem

A Visibility-Based Pursuit-Evasion Problem

This paper addresses the problem of planning the motion of one or more pursuers in a polygonal environment to eventually \see" an evader that is unpredictable, has unknown initial position, and is capable of moving arbitrarily fast. A visibility region is associated with each pursuer, and the goal is to guarantee that the evader will ultimately lie in at least one visibility region. The study o...

Finding a Princess in a Palace: a Pursuit-Evasion Problem

This paper solves a pursuit–evasion problem in which a prince must find a princess who is constrained to move on each day from one vertex of a finite graph to another. Unlike the related and much studied ‘Cops and Robbers Game’, the prince has no knowledge of the position of the princess; he may, however, visit any single room he wishes on each day. We characterize the graphs for which the prin...

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

Pursuit/Evasion Voronoi Diagrams∗

In typical 2D Voronoi diagrams, the distance from a site to a point in the plane is unaffected by the existance of other sites. In 2D pursuit/evasion Voronoi diagrams, the distance from an evader to a point is the length of the shortest path to that point that avoids all pursuers. Since pursuers can move, the paths that evaders follow to reach certain points in the plane can be quite complicate...

Pursuit - Evasion Using Beam