Lion and man with visibility in monotone polygons

Authors:
Narges Noori;Volkan Isler
Affiliations:
Department of Computer Science and Engineering, University of Minnesota, Minneapolis, MN, USA;Department of Computer Science and Engineering, University of Minnesota, Minneapolis, MN, USA
Venue:
International Journal of Robotics Research
Year:
2014

Citing 7
Cited 0

Searching for a mobile intruder in a polygonal region

SIAM Journal on Computing
Linear-time algorithms for weakly-monotone polygons

Computational Geometry: Theory and Applications
Solution of David Gale's lion and man problem

Theoretical Computer Science
Computational Geometry: Algorithms and Applications

Computational Geometry: Algorithms and Applications
Search and pursuit-evasion in mobile robotics

Autonomous Robots
Randomized pursuit-evasion in a polygonal environment

IEEE Transactions on Robotics
Capturing an evader in a polygonal environment with obstacles

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the original version of the lion and man game, a lion tries to capture a man who is trying to escape in a circular arena. The players have equal speeds. They can observe each other at all times. We study a new variant of the game in which the lion has only line-of-sight visibility. That is it can observe the man's position only if the line segment connecting them does not intersect the boundary. We show that despite this limitation, the lion can capture the man in any monotone polygon in finite time.