We study the lion-and-man game in which a group of lions (the pursuers) try to capture a man (the evader). The players have equal speed. They can observe each other at all times. While the game is well-studied in planar domains such as polygons, very little is known about its properties in higher dimensions. In this paper, we study the lion and man game when played on the surface of a genus-zero polyhedron with boundary. We show that three lions with non-zero capture distance δ can capture the man in time equation where A is the area of the surface, and L is the total edge length of the surface.
|Original language||English (US)|
|Title of host publication||IROS 2014 Conference Digest - IEEE/RSJ International Conference on Intelligent Robots and Systems|
|Publisher||Institute of Electrical and Electronics Engineers Inc.|
|Number of pages||6|
|State||Published - Oct 31 2014|
|Event||2014 IEEE/RSJ International Conference on Intelligent Robots and Systems, IROS 2014 - Chicago, United States|
Duration: Sep 14 2014 → Sep 18 2014
|Name||IEEE International Conference on Intelligent Robots and Systems|
|Other||2014 IEEE/RSJ International Conference on Intelligent Robots and Systems, IROS 2014|
|Period||9/14/14 → 9/18/14|
Bibliographical notePublisher Copyright:
© 2014 IEEE.