The Multi-pursuer Single-Evader Game

We consider a general pursuit-evasion differential game with three or more pursuers and a single evader, all with simple motion (fixed-speed, infinite turn rate). It is shown that traditional means of differential game analysis is difficult for this scenario. But simple motion and min-max time to capture plus the two-person extension to Pontryagin’s maximum principle imply straight-line motion at maximum speed which forms the basis of the solution using a geometric approach. Safe evader paths and policies are defined which guarantee the evader can reach its destination without getting captured by any of the pursuers, provided its destination satisfies some constraints. A linear program is used to characterize the solution and subsequently the saddle-point is computed numerically. We replace the numerical procedure with a more analytical geometric approach based on Voronoi diagrams after observing a pattern in the numerical results. The solutions derived are open-loop optimal, meaning the strategies are a saddle-point equilibrium in the open-loop sense.

[1]  Zhengyuan Zhou,et al.  Evasion as a team against a faster pursuer , 2013, 2013 American Control Conference.

[2]  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.

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

[4]  Kevin Q. Brown Geometric transforms for fast geometric algorithms , 1979 .

[5]  Efstathios Bakolas,et al.  Relay pursuit of a maneuvering target using dynamic Voronoi diagrams , 2012, Autom..

[6]  P. Hagedorn,et al.  Point capture of two evaders in succession , 1979 .

[7]  Dave W. Oyler Contributions To Pursuit-Evasion Game Theory. , 2016 .

[8]  Stéphane Le Ménec,et al.  Model Problem in a Line with Two Pursuers and One Evader , 2012, Dynamic Games and Applications.

[9]  Pramod P. Khargonekar,et al.  Cooperative defense within a single-pursuer, two-evader pursuit evasion differential game , 2010, 49th IEEE Conference on Decision and Control (CDC).

[10]  Eloy Garcia,et al.  Pursuit-evasion of an Evader by Multiple Pursuers , 2018, 2018 International Conference on Unmanned Aircraft Systems (ICUAS).

[11]  Mac Schwager,et al.  Intercepting Rogue Robots: An Algorithm for Capturing Multiple Evaders With Multiple Pursuers , 2017, IEEE Robotics and Automation Letters.

[12]  Steven Fortune,et al.  A sweepline algorithm for Voronoi diagrams , 1986, SCG '86.

[13]  Eloy Garcia,et al.  A Geometric Approach for the Cooperative Two-Pursuer One-Evader Differential Game , 2017 .

[14]  Pierre T. Kabamba,et al.  Pursuit-evasion games in the presence of obstacles , 2016, Autom..

[15]  Jaime F. Fisac,et al.  The pursuit-evasion-defense differential game in dynamic constrained environments , 2015, 2015 54th IEEE Conference on Decision and Control (CDC).

[16]  Raffaello D'Andrea,et al.  A decomposition approach to multi-vehicle cooperative control , 2005, Robotics Auton. Syst..

[17]  Franz Aurenhammer,et al.  An optimal algorithm for constructing the weighted voronoi diagram in the plane , 1984, Pattern Recognit..

[18]  Richard B. Vinter,et al.  Decomposition of Differential Games with Multiple Targets , 2016, J. Optim. Theory Appl..

[19]  Panagiotis Tsiotras,et al.  Multiple-Pursuer/One-Evader Pursuit–Evasion Game in Dynamic Flowfields , 2017 .

[20]  Richard B. Vinter,et al.  A decomposition technique for pursuit evasion games with many pursuers , 2013, 52nd IEEE Conference on Decision and Control.