DocumentCode :
137795
Title :
The lion and man game on polyhedral surfaces with boundary
Author :
Noori, Narges ; Isler, Volkan
Author_Institution :
Dept. of Comput. Sci. & Eng., Univ. of Minnesota, Minneapolis, MN, USA
fYear :
2014
fDate :
14-18 Sept. 2014
Firstpage :
1769
Lastpage :
1774
Abstract :
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 O((A/δ2 + L/δ)2 δ/2) where A is the area of the surface, and L is the total edge length of the surface.
Keywords :
game theory; surface fitting; genus-zero polyhedron; lion-and-man game; non-zero capture distance; planar domain; polyhedral surface; surface total edge length; Abstracts; Conferences; Games; Intelligent robots; Partitioning algorithms; Silicon;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Intelligent Robots and Systems (IROS 2014), 2014 IEEE/RSJ International Conference on
Conference_Location :
Chicago, IL
Type :
conf
DOI :
10.1109/IROS.2014.6942794
Filename :
6942794
Link To Document :
بازگشت