Capturing an Evader in a Polygonal Environment with Obstacles

Abstract

We study a pursuit-evasion game in which one or more cops try to capture a robber by moving onto the robber's current location. All players have equal maximum velocities. They can observe each other at all times. We show that three cops can capture the robber in any polygonal environment (which can contain any finite number of holes).

Cite

Text

Bhadauria and Isler. "Capturing an Evader in a Polygonal Environment with Obstacles." International Joint Conference on Artificial Intelligence, 2011. doi:10.5591/978-1-57735-516-8/IJCAI11-343

Markdown

[Bhadauria and Isler. "Capturing an Evader in a Polygonal Environment with Obstacles." International Joint Conference on Artificial Intelligence, 2011.](https://mlanthology.org/ijcai/2011/bhadauria2011ijcai-capturing/) doi:10.5591/978-1-57735-516-8/IJCAI11-343

BibTeX

@inproceedings{bhadauria2011ijcai-capturing,
  title     = {{Capturing an Evader in a Polygonal Environment with Obstacles}},
  author    = {Bhadauria, Deepak and Isler, Volkan},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {2011},
  pages     = {2054-2059},
  doi       = {10.5591/978-1-57735-516-8/IJCAI11-343},
  url       = {https://mlanthology.org/ijcai/2011/bhadauria2011ijcai-capturing/}
}