A decomposition technique for pursuit evasion games with many pursuers

Memory storage constraints impose ultimate limits on the complexity of differential games for which optimal strategies can be computed via direct solution of the associated Hamilton-Jacobi-Isaacs equations. It is of interest therefore to explore whether, for certain specially structured differential games of interest, it is possible to decompose the original problem into a family of simpler differential games. In this paper we exhibit a class of single evader-multiple pursuers games for which a reduction in complexity of this nature is possible. The target set is expressed as a union of smaller, sub-target sets. The individual differential games are obtained by substituting a sub-target set in place of the original target and are simpler because of geometric features of the dynamics and constraints. We give conditions under which the value function of the original problem can be characterized as the lower envelope of the value functions for the simpler problems and show how optimal strategies can be constructed from those for the simpler problems. The methodology is illustrated by several examples.

[1]  A. I. Subbotin,et al.  Game-Theoretical Control Problems , 1987 .

[2]  Naira Hovakimyan,et al.  Guaranteed Strategies for nonlinear Multi-Player Pursuit-Evasion Games , 2010, IGTR.

[3]  Martino Bardi,et al.  Stochastic and Differential Games , 1999 .

[4]  Gafurjan Ibragimov.  Optimal Pursuit with Countably Many Pursuers and One Evader , 2005 .

[5]  P. Cannarsa,et al.  Semiconcave Functions, Hamilton-Jacobi Equations, and Optimal Control , 2004 .

[6]  Richard B. Vinter,et al.  Differential Games Controllers That Confine a System to a Safe Region in the State Space, With Applications to Surge Tank Control , 2012, IEEE Transactions on Automatic Control.

[7]  Gary M. Erickson,et al.  A differential game model of the marketing-operations interface , 2011, Eur. J. Oper. Res..

[8]  Robert J. Elliott,et al.  Values in differential games , 1972 .

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

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

[11]  B. N. Pshenichnyi,et al.  Simple pursuit by several objects , 1976, Cybernetics.

[12]  S. Jørgensen.  Optimal production, purchasing and pricing: A differential game approach , 1986 .

[13]  Waldemar Chodun.  Differential games of evasion with many pursuers , 1989 .

[14]  M. Bardi,et al.  Optimal Control and Viscosity Solutions of Hamilton-Jacobi-Bellman Equations , 1997 .

[15]  T. Başar,et al.  Stochastic and differential games : theory and numerical methods , 1999 .

[16]  Michael P. Wellman,et al.  Multiagent Reinforcement Learning: Theoretical Framework and an Algorithm , 1998, ICML.