Capture pursuit games on unbounded domains

We introduce simple tools from geometric convexity to analyze capturetype (or “Lion and Man”) pursuit problems in unbounded domains. The main result is a necessary and sufficient condition for eventual capture in equal-speed discrete-time multi-pursuer capture games on convex Euclidean domains of arbitrary dimension and shape. This condition is presented in terms of recession sets in unit tangent spheres. The chief difficulties lie in utilizing the boundary of the domain as a constraint on the evader’s escape route. We also show that these convex-geometric techniques provide sufficient criteria for pursuit problems in non-convex domains with a convex decomposition.

[1]  T. D. Parsons,et al.  Pursuit-evasion in a graph , 1978 .

[2]  Luc Moreau,et al.  Stability of multiagent systems with time-dependent communication links , 2005, IEEE Transactions on Automatic Control.

[3]  Leonidas J. Guibas,et al.  A Visibility-Based Pursuit-Evasion Problem , 1999, Int. J. Comput. Geom. Appl..

[4]  Stephen R. Tate,et al.  Continuous alternation: The complexity of pursuit in continuous domains , 1993, Algorithmica.

[5]  Rufus Isaacs,et al.  Differential Games , 1965 .

[6]  Naira Hovakimyan,et al.  Geometry of Pursuit-Evasion on Second Order Rotation Surfaces , 2000 .

[7]  V. Klee,et al.  Helly's theorem and its relatives , 1963 .

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

[9]  J. Lewin,et al.  The lion and man problem revisited , 1986 .

[10]  丸山 徹.  Convex Analysisの二,三の進展について , 1977 .

[11]  Günter Rote,et al.  Pursuit-evasion with imprecise target location , 2003, SODA '03.

[12]  Francesco Bullo,et al.  Coordination and Geometric Optimization via Distributed Dynamical Systems , 2003, SIAM J. Control. Optim..

[13]  George J. Pappas,et al.  Flocking in Fixed and Switching Networks , 2007, IEEE Transactions on Automatic Control.

[14]  H. Wu.  The spherical images of convex hypersurfaces , 1974 .

[15]  Arik Melikyan,et al.  Generalized characteristics of first order PDEs , 1998 .

[16]  P. V. Prokopovich,et al.  Simple pursuit of one evader by a group , 1992 .

[17]  F. Morley,et al.  A Curve of Pursuit , 1921 .

[18]  S. Shankar Sastry,et al.  Probabilistic pursuit-evasion games: theory, implementation, and experimental evaluation , 2002, IEEE Trans. Robotics Autom..

[19]  H. T. Croft.  “Lion and Man”: A Postscript , 1964 .

[20]  Sampath Kannan,et al.  Locating and Capturing an Evader in a Polygonal Environment , 2004, WAFR.

[21]  Richard Bishop,et al.  Pursuit and Evasion in Non-convex Domains of Arbitrary Dimensions , 2006, Robotics: Science and Systems.

[22]  J. C. Burkill,et al.  A mathematician's miscellany , 1954 .

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

[24]  James Flynn,et al.  Lion and Man: The General Case , 1974 .

[25]  S. Shankar Sastry,et al.  Roadmap Based Pursuit-Evasion and Collision Avoidance , 2005, Robotics: Science and Systems.

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

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