Randomized pursuit-evasion with limited visibility

Authors:
Volkan Isler;Sampath Kannan;Sanjeev Khanna
Affiliations:
University of Pennsylvania, Philadelphia, PA;University of Pennsylvania, Philadelphia, PA;University of Pennsylvania, Philadelphia, PA
Venue:
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Year:
2004

Citing 7
Cited 7

The complexity of searching a graph

Journal of the ACM (JACM)
Recontamination does not help to search a graph

Journal of the ACM (JACM)
The vertex separation and search number of a graph

Information and Computation
A game of cops and robbers played on products of graphs

Discrete Mathematics
Gibbs measures and dismantlable graphs

Journal of Combinatorial Theory Series B
An Efficient Communication Strategy for Ad-hoc Mobile Networks

DISC '01 Proceedings of the 15th International Conference on Distributed Computing
Randomized Pursuit-Evasion in Graphs

ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming

r3: Resilient Random Regular Graphs

DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Acoustic sensor network design for position estimation

ACM Transactions on Sensor Networks (TOSN)
Multi-step multi-sensor hider-seeker games

IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Detection of intelligent mobile target in a mobile sensor network

IEEE/ACM Transactions on Networking (TON)
Toward simulating realistic pursuit-evasion using a roadmap-based approach

MIG'10 Proceedings of the Third international conference on Motion in games
Roadmap-Based level clearing of buildings

MIG'11 Proceedings of the 4th international conference on Motion in Games
Exploiting Delayed and Imperfect Information for Generating Approximate UAV Target Interception Strategy

Journal of Intelligent and Robotic Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the following pursuit-evasion game: One or more hunters are seeking to capture an evading rabbit on a graph. At each round, the rabbit tries to gather information about the l ocation of the hunters but it can see them only if they are located on adjacent nodes. We show that two hunters suffice for catching rabbits with limited visibility with high probability. We distinguish between reactive rabbits who who move only when the hunter is visible and general rabbits can employ more sophisticated strategies. We present polynomial time algorithms that decide whether a graph G is hunter-win, that is, if a single hunter can capture a rabbit of either kind on G.