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 language||English (US)|
|Title of host publication||Springer Tracts in Advanced Robotics|
|Editors||Emilio Frazzoli, Nicholas Roy, Tomas Lozano-Perez, Daniela Rus|
|Number of pages||16|
|State||Published - 2013|
|Event||10th International Workshop on the Algorithmic Foundations of Robotics, WAFR 2012 - Cambridge, United States|
Duration: Jun 13 2012 → Jun 15 2012
|Name||Springer Tracts in Advanced Robotics|
|Other||10th International Workshop on the Algorithmic Foundations of Robotics, WAFR 2012|
|Period||6/13/12 → 6/15/12|
Bibliographical noteFunding Information:
This work was supported in part by NSF Awards #0916209, and #0917676.