Capturing an evader in a polygonal environment with obstacles

Deepak Bhadauria, Volkan I Isler

Research output: Chapter in Book/Report/Conference proceedingConference contribution

14 Scopus citations

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

Original languageEnglish (US)
Title of host publicationIJCAI 2011 - 22nd International Joint Conference on Artificial Intelligence
Pages2054-2059
Number of pages6
DOIs
StatePublished - Dec 1 2011
Event22nd International Joint Conference on Artificial Intelligence, IJCAI 2011 - Barcelona, Catalonia, Spain
Duration: Jul 16 2011Jul 22 2011

Publication series

NameIJCAI International Joint Conference on Artificial Intelligence
ISSN (Print)1045-0823

Other

Other22nd International Joint Conference on Artificial Intelligence, IJCAI 2011
CountrySpain
CityBarcelona, Catalonia
Period7/16/117/22/11

Cite this