Decomposition of Differential Games with Multiple Targets

This paper provides a decomposition technique for the purpose of simplifying the solution of certain zero-sum differential games. The games considered terminate when the state reaches a target, which can be expressed as the union of a collection of target subsets considered as ‘multiple targets’; the decomposition consists in replacing the original target by each of the target subsets. The value of the original game is then obtained as the lower envelope of the values of the collection of games, resulting from the decomposition, which can be much easier to solve than the original game. Criteria are given for the validity of the decomposition. The paper includes examples, illustrating the application of the technique to pursuit/evasion games and to flow control.

[1]  G. Barles.  Solutions de viscosité des équations de Hamilton-Jacobi , 1994 .

[2]  André L. Tits,et al.  Optimal averaging level control , 1986 .

[3]  A. Friedman.  Differential games , 1971 .

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

[5]  Andrei I. Subbotin,et al.  Generalized solutions of first-order PDEs - the dynamical optimization perspective , 1994, Systems and control.

[6]  Jeffrey C. Kantor.  Non-linear sliding-mode controller and objective function for surge tanks , 1989 .

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

[8]  Richard B. Vinter,et al.  Optimal Control , 2000 .

[9]  Adriano Festa,et al.  Reconstruction of Independent Sub-domains for a class of Hamilton Jacobi Equations and its Application to Parallel Computing , 2014, 1405.3521.

[10]  Manfred Morari,et al.  Model predictive optimal averaging level control , 1989 .

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

[12]  Yu. S. Ledyaev,et al.  Sub- and supergradients of envelopes, semicontinuous closures, and limits of sequences of functions , 2012 .

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

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

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

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

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

[18]  Maurizio Falcone,et al.  A Patchy Dynamic Programming Scheme for a Class of Hamilton-Jacobi-Bellman Equations , 2011, SIAM J. Sci. Comput..

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

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

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

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

[23]  Maurizio Falcone,et al.  Numerical Methods for differential Games Based on Partial differential equations , 2006, IGTR.

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