Open-Loop Solvability Operator in Differential Games with Simple Motions in the Plane
The paper deals with an open-loop solvability operator in two-person zero-sum differential games with simple motions. This operator takes a given terminal set to the set defined at the initial instant whence the first player can bring the control system to the terminal set if the player is informed about the open-loop control of the second player. It is known that the operator possesses the semigroup property in the case of a convex terminal set. In the paper, sufficient conditions ensuring the semigroup property in the non-convex case are formulated and proved for problems in the plane. Examples are constructed to illustrate the relevance of the formulated conditions. The connection with the Hopf formula is analysed.
KeywordsPlanar differential games Semigroup property Simple motions Open-loop solvability operator
We are grateful to the unknown reviewer for the valuable remarks. This research was carried out in the framework of the Program by Presidium of RAS “Fundamental problems of non-linear dynamics in mathematical and physical sciences” with financial support of Ural Branch of RAS (project No. 12-\(\Pi \)-1-1012) and was also supported by RFBR, grant No. 12-01-00537.
- Botkin N (1984) Numerical construction of t-sections of a program absorption set in a linear differential game. In: Subbotin A, Patsko V (eds) Algorithms and programms of solution of linear differential games. Ural Scientific Center of the Academy of Sciences of the USSR, Sverdlovsk, pp 5–38 (in Russian)Google Scholar
- Cardaliaguet P, Quincampoix M, Saint-Pierre P (1999) Set-valued numerical analysis for optimal control and differential games. In: Bardi M, Raghavan T, Parthasarathy T (eds) Stochastic and differential games: theory and numerical methods. Annals of the International Society of Dynamic Games, vol 4. Birkhäuser, Boston, pp 177–247CrossRefGoogle Scholar
- Isakova E, Logunova G, Patsko V (1984) Construction of stable bridges in a linear differential game with fixed terminal time. In: Subbotin A, Patsko V (eds) Algorithms and programms of solution of linear differential games. Ural Scientific Center of the Academy of sciences of the USSR, Sverdlovsk, pp 127–158 (in Russian)Google Scholar
- Polovinkin E, Balashov M (2004) Elements of convex and strongly convex analysis. Fizmatlit, Moscow (in Russian)Google Scholar
- Schwartz L (1967) Cours d’analyse, 1, 2. Hermann, ParisGoogle Scholar
- Subbotin A (1991) Minimax and viscosity solutions of Hamilton – Jacobi equations. Nauka, Moscow (in Russian)Google Scholar
- Subbotin A (1995) Generalized solutions of first-order PDEs: the dynamical optimization perspective. Birkhäuser, BostonGoogle Scholar