Capturing an evader in a polygonal environment with obstacles

Authors:
Deepak Bhadauria;Volkan Isler
Affiliations:
Department of Computer Science and Engineering, University of Minnesota;Department of Computer Science and Engineering, University of Minnesota
Venue:
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
Year:
2011

Citing 3
Cited 4

Searching for a mobile intruder in a polygonal region

SIAM Journal on Computing
Solution of David Gale's lion and man problem

Theoretical Computer Science
Randomized pursuit-evasion in a polygonal environment

IEEE Transactions on Robotics

Search and pursuit-evasion in mobile robotics

Autonomous Robots
Capturing an evader in polygonal environments with obstacles: The full visibility case

International Journal of Robotics Research
Capture bounds for visibility-based pursuit evasion

Proceedings of the twenty-ninth annual symposium on Computational geometry
Lion and man with visibility in monotone polygons

International Journal of Robotics Research

Quantified Score

Hi-index	0.00

Visualization

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