DMCA
Randomized Pursuit-Evasion with Local Visibility (2006)
Cached
Download Links
- [www.cis.upenn.edu]
- [www.cs.rpi.edu]
- [www-users.cs.umn.edu]
- [www-users.cs.umn.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | SIAM Journal on Discrete Mathematics |
| Citations: | 40 - 2 self |
BibTeX
@ARTICLE{Isler06randomizedpursuit-evasion,
author = {Volkan Isler and Sampath Kannan and Sanjeev Khanna},
title = {Randomized Pursuit-Evasion with Local Visibility},
journal = {SIAM Journal on Discrete Mathematics},
year = {2006},
volume = {1},
pages = {26--41}
}
Share
 |
 |
 |
 |
||
OpenURL
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 location of the hunters but it can see them only if they are located on adjacent nodes. We show that two hunters su#ce for catching rabbits with such local visibility with high probability. We distinguish between reactive rabbits who move only when a hunter is visible and general rabbits who 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.
