Capture bounds for visibility-based pursuit evasion

We investigate the following problem in the visibility-based discrete-time model of pursuit evasion in the plane: how many pursuers are needed to capture an evader in a polygonal environment with obstacles under the minimalist assumption that pursuers and the evader have the same maximum speed? When the environment is a simply-connected (hole-free) polygon of n vertices, we show that Θ (√n) pursuers are both necessary and sufficient in the worst-case. When the environment is a polygon with holes, we prove a lower bound of Ω (n2/3) and an upper bound of O(n5/6) for the number of pursuers that are needed in the worst-case, where n is the total number of vertices including the hole boundaries. More precisely, if the polygon contains h holes, our upper bound is O(n1/2 h1/4), for h ≤ n2/3, and O(n1/3 h1/2) otherwise. These bounds show that capture with minimal assumptions requires significantly more pursuers than what is possible either for visibility detection where pursuers win if one of them can see the evader [Guibas et al. 1999], or for capture when players' movement speed is small compared to "features" of the environment [Klein and Suri, 2012].

[1]  Edward M. Reingold,et al.  "Lion and Man": Upper and Lower Bounds , 1992, INFORMS J. Comput..

[2]  Sebastian Thrun,et al.  Visibility-based Pursuit-evasion with Limited Field of View , 2004, Int. J. Robotics Res..

[3]  Christos H. Papadimitriou,et al.  The complexity of searching a graph , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[4]  Kyung-Yong Chwa,et al.  Visibility-Based Pursuit-Evasion in a Polygonal Region by a Searcher , 2001, ICALP.

[5]  Sampath Kannan,et al.  Randomized pursuit-evasion in a polygonal environment , 2005, IEEE Transactions on Robotics.

[6]  Leonidas J. Guibas,et al.  Visibility-Based Pursuit-Evasion in a Polygonal Environment , 1997, WADS.

[7]  Masafumi Yamashita,et al.  Searching for a Mobile Intruder in a Polygonal Region , 1992, SIAM J. Comput..

[8]  Leonidas J. Guibas,et al.  Sweeping simple polygons with a chain of guards , 2000, SODA '00.

[9]  Volkan Isler,et al.  Lion and man game in the presence of a circular obstacle , 2009, 2009 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[10]  Petter Ögren,et al.  A Mixed Integer Linear Programming approach to pursuit evasion problems with optional connectivity constraints , 2011, Auton. Robots.

[11]  Robin Thomas,et al.  Graph Searching and a Min-Max Theorem for Tree-Width , 1993, J. Comb. Theory, Ser. B.

[12]  Jonathan Richard Shewchuk,et al.  Lecture Notes on Delaunay Mesh Generation , 2012 .

[13]  Béla Bollobás,et al.  Littlewood's Miscellany , 1986 .

[14]  Volkan Isler,et al.  Capturing an Evader in a Polygonal Environment with Obstacles , 2011, IJCAI.

[15]  Dimitrios M. Thilikos,et al.  An annotated bibliography on guaranteed graph searching , 2008, Theor. Comput. Sci..

[16]  B. Alspach.  SEARCHING AND SWEEPING GRAPHS: A BRIEF SURVEY , 2006 .

[17]  Subhash Suri,et al.  Capturing an evader in polygonal environments with obstacles: The full visibility case , 2012, Int. J. Robotics Res..

[18]  Subhash Suri,et al.  Catch Me If You Can: Pursuit and Capture in Polygonal Environments with Obstacles , 2012, AAAI.

[19]  Jirí Sgall.  Solution of David Gale's lion and man problem , 2001, Theor. Comput. Sci..

[20]  Chinya V. Ravishankar,et al.  A framework for pursuit evasion games in Rn , 2005, Inf. Process. Lett..

[21]  Subhash Suri,et al.  Complete Information Pursuit Evasion in Polygonal Environments , 2011, AAAI.

[22]  João Pedro Hespanha,et al.  On Discrete-Time Pursuit-Evasion Games With Sensing Limitations , 2008, IEEE Transactions on Robotics.

[23]  Geoffrey A. Hollinger,et al.  Search and pursuit-evasion in mobile robotics , 2011, Auton. Robots.

[24]  Subhash Suri,et al.  Capture bounds for visibility-based pursuit evasion , 2015, Comput. Geom..

[25]  H. Djidjev.  On the Problem of Partitioning Planar Graphs , 1982 .

[26]  Micah Adler,et al.  Randomized Pursuit-Evasion in Graphs , 2002, Combinatorics, Probability and Computing.