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. Hence, 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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Alonso, L., Goldstein, A.S., Reingold, E.M.: Lion and Man: Upper and lower bounds. INFORMS Journal on Computing 4(4), 447 (1992)
Bhadauria, D., Isler, V.: Capturing an evader in a polygonal environment with obstacles. In: Proc. International Joint Conference on Artificial Intelligence (2011)
Chung, T., Hollinger, G., Isler, V.: Search and pursuit-evasion in mobile robotics. Autonomous Robots (3) (2011)
De Berg, M., Cheong, O., van Kreveld, M.: Computational geometry: algorithms and applications. Springer (2008)
Guibas, L., Hershberger, J., Leven, D., Sharir, M., Tarjan, R.: Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons. Algorithmica 2, 209–233 (1987)
Guibas, L.J., Claude Latombe, J., Lavalle, S.M., Lin, D., Motwani, R.: Visibility-based Pursuit-Evasion in a Polygonal Environment. In: Rau-Chaplin, A., Dehne, F., Sack, J.-R., Tamassia, R. (eds.) WADS 1997. LNCS, vol. 1272, pp. 17–30. Springer, Heidelberg (1997)
Isler, V., Kannan, S., Khanna, S.: Randomized pursuit-evasion in a polygonal environment. IEEE Transactions on Robotics 21(5), 875–884 (2005)
Klein, K., Suri, S.: Complete information pursuit evasion in polygonal environments. In: Proceedings of the 25th Conference on Artificial Intelligence (AAAI), pp. 1120–1125 (2011)
Littlewood, J.E.: A mathematician’s miscellany / J. E. Littlewood. Methuen, London (1953)
Noori, N., Isler, V.: Lion and man with visibility in monotone polygons. Technical Report 12-005, University of Minnesota - Computer Science and Engineering (2012), http://www.cs.umn.edu/research/technical_reports.php?page=report&report_id=12-005
Sgall, J.: Solution of david gale’s lion and man problem. Theor. Comput. Sci. 259, 663–670 (2001)
Suzuki, I., Yamashita, M.: Searching for a mobile intruder in a polygonal region. SIAM Journal on Computing 21(5), 863–888 (1992)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Noori, N., Isler, V. (2013). Lion and Man with Visibility in Monotone Polygons. In: Frazzoli, E., Lozano-Perez, T., Roy, N., Rus, D. (eds) Algorithmic Foundations of Robotics X. Springer Tracts in Advanced Robotics, vol 86. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-36279-8_16
Download citation
DOI: https://doi.org/10.1007/978-3-642-36279-8_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-36278-1
Online ISBN: 978-3-642-36279-8
eBook Packages: EngineeringEngineering (R0)