Lion and man with visibility in monotone polygons

Narges Noori, Volkan I Isler

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

5 Scopus citations

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.

Original languageEnglish (US)
Title of host publicationSpringer Tracts in Advanced Robotics
EditorsEmilio Frazzoli, Nicholas Roy, Tomas Lozano-Perez, Daniela Rus
PublisherSpringer Verlag
Pages263-278
Number of pages16
ISBN (Print)9783642362781
DOIs
StatePublished - 2013
Event10th International Workshop on the Algorithmic Foundations of Robotics, WAFR 2012 - Cambridge, United States
Duration: Jun 13 2012Jun 15 2012

Publication series

NameSpringer Tracts in Advanced Robotics
Volume86
ISSN (Print)1610-7438
ISSN (Electronic)1610-742X

Other

Other10th International Workshop on the Algorithmic Foundations of Robotics, WAFR 2012
Country/TerritoryUnited States
CityCambridge
Period6/13/126/15/12

Bibliographical note

Funding Information:
This work was supported in part by NSF Awards #0916209, and #0917676.

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 2013.

Fingerprint

Dive into the research topics of 'Lion and man with visibility in monotone polygons'. Together they form a unique fingerprint.

Cite this