Cooperative pursuit with Voronoi partitions

This work considers a pursuit-evasion game in which a number of pursuers are attempting to capture a single evader. Cooperation among multiple agents can be difficult to achieve, as it may require the selection of actions in the joint input space of all agents. This work presents a decentralized, real-time algorithm for cooperative pursuit of a single evader by multiple pursuers in bounded, simply-connected planar domains. The algorithm is based on minimizing the area of the generalized Voronoi partition of the evader. The pursuers share state information but compute their inputs independently. No assumptions are made about the evader's control strategies other than requiring the evader control inputs to conform to a speed limit. Proof of guaranteed capture is shown when the domain is convex and the players' motion models are kinematic. Simulation results are presented showing the efficiency and effectiveness of this strategy.

[1]  Zhengyuan Zhou,et al.  A general, open-loop formulation for reach-avoid games , 2012, 2012 IEEE 51st IEEE Conference on Decision and Control (CDC).

[2]  Warren A. Cheung,et al.  Constrained Pursuit-Evasion Problems in the Plane , 2005 .

[3]  M. Falcone,et al.  Semi-Lagrangian schemes for Hamilton-Jacobi equations, discrete representation formulae and Godunov methods , 2002 .

[4]  Alexandre M. Bayen,et al.  A time-dependent Hamilton-Jacobi formulation of reachable sets for continuous dynamic games , 2005, IEEE Transactions on Automatic Control.

[5]  Mo Chen,et al.  A path defense approach to the multiplayer reach-avoid game , 2014, 53rd IEEE Conference on Decision and Control.

[6]  Claire J. Tomlin,et al.  A differential game approach to planning in adversarial scenarios: A case study on capture-the-flag , 2011, 2011 IEEE International Conference on Robotics and Automation.

[7]  Ron Kimmel,et al.  Fast Marching Methods , 2004 .

[8]  Andrew Beveridge,et al.  A Leapfrog Strategy for Pursuit-Evasion in a Polygonal Environment , 2014, Int. J. Comput. Geom. Appl..

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

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

[11]  Efstathios Bakolas,et al.  Optimal pursuit of moving targets using dynamic Voronoi diagrams , 2010, 49th IEEE Conference on Decision and Control (CDC).

[12]  Dusan M. Stipanovic,et al.  Guaranteed decentralized pursuit-evasion in the plane with multiple pursuers , 2011, IEEE Conference on Decision and Control and European Control Conference.

[13]  P. Varaiya,et al.  Differential games , 1971 .

[14]  T. Başar,et al.  Dynamic Noncooperative Game Theory , 1982 .

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

[16]  Ryo Takei,et al.  Optimal Trajectories of Curvature Constrained Motion in the Hamilton–Jacobi Formulation , 2013, J. Sci. Comput..

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

[18]  James A. Sethian,et al.  Level Set Methods and Fast Marching Methods , 1999 .

[19]  S. Shankar Sastry,et al.  Reachability calculations for automated aerial refueling , 2008, 2008 47th IEEE Conference on Decision and Control.

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

[21]  Martin Aigner,et al.  A game of cops and robbers , 1984, Discret. Appl. Math..

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

[23]  P. Souganidis,et al.  Differential Games and Representation Formulas for Solutions of Hamilton-Jacobi-Isaacs Equations. , 1983 .

[24]  Mo Chen,et al.  Multiplayer reach-avoid games via low dimensional solutions and maximum matching , 2014, 2014 American Control Conference.

[25]  Zhengyuan Zhou,et al.  An Efficient Algorithm for a Visibility-Based Surveillance-Evasion Game , 2014 .