Abstract
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Alvarez O, Barron E, Ishii H (1999) Hopf formulas for semicontinuous data. Indiana U Math J 48(3):993–1035
Aubin J (1991) Viability theory. Birkhäuser, Boston
Bardi M, Capuzzo-Dolcetta I (1997) Optimal control and viscosity solutions of Hamilton – Jacobi – Bellman Equations. Birkhäuser, Boston
Bardi M, Evans L (1984) On Hopf’s formulas for solutions of HJ equations. Nonlinear Anal 8:1373–1381
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)
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–247
Hadwiger H (1957) Vorlesungen uber inhalt, oberflache und isoperimetrie. Springer, Berlin
Hopf E (1965) Generalized solutions of nonlinear equations of first order. J Math Mech 14(6): 951–973
Isaacs R (1965) Differential games. Wiley, New York
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)
Krasovskii N, Subbotin A (1974) Positional differential games. Nauka, Moscow (in Russian)
Krasovskii N, Subbotin A (1988) Game-theoretical control problems. Springer, New York
Polovinkin E, Balashov M (2004) Elements of convex and strongly convex analysis. Fizmatlit, Moscow (in Russian)
Pontryagin L (1967) Linear differential games, II. Sov Math Dokl 8:910–912
Pontryagin L (1981) Linear differential games of pursuit. Math USSR Sb 40(3):285–303
Pshenichnyy B, Sagaydak M (1971) Differential games with fixed time. J Cybern 1:117–135
Rockafellar R (1970) Convex analysis. Princeton University Press, Princeton
Schwartz L (1967) Cours d’analyse, 1, 2. Hermann, Paris
Subbotin A (1991) Minimax and viscosity solutions of Hamilton – Jacobi equations. Nauka, Moscow (in Russian)
Subbotin A (1995) Generalized solutions of first-order PDEs: the dynamical optimization perspective. Birkhäuser, Boston
Acknowledgments
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.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Appendix
Appendix
Let us consider a connection between the question investigated in the present work and the well-known Hopf formula (Alvarez et al. 1999; Bardi and Evans 1984; Hopf 1965). 1) For an arbitrary proper (i.e., not identically equal to + ∞) function \(g: {\mathbb{R}}^{n} \rightarrow (-\infty,+\infty ]\), we define the Legendre transform
By co g denote the convex hull of the function g. Properties of the function g ∗ (Rockafellar 1970, Chap. 3, §16; Polovinkin and Balashov 2004) imply that if the proper function co g is continuous in \({\mathbb{R}}^{n}\), then
The support function ρ(⋅ , A) of a compact set \(A \subset {\mathbb{R}}^{n}\) is connected with the indicator function
of the set A by the relation
2) The Hopf formula
represents the generalized (viscosity (Bardi and Capuzzo-Dolcetta 1997) or minimax (Subbotin 1991, 1995)) continuous solution of the Cauchy problem for the Hamilton–Jacobi equation
with convex continuous terminal function \(\varphi\) (Bardi and Evans 1984).
3) Set
where M is a convex compact set. Consider the function \(\overline{w}\) defined formally by the Hopf formula (12.38) for these data.
Let us show that
As a preliminary, for the convex sets A and B, we establish the relation
We use the equality
It is known that the support function for the intersection of an arbitrary collection of compact convex sets coincides (Rockafellar 1970) with the convex hull of the function that is the minimum of support functions for the sets used in the intersection. In our case,
Consequently, (12.41) holds.
Applying (12.41), for the convex set M and \(\tau =\vartheta -t\), we get
where
The compactness of the sets P and Q implies that the function co h τ is continuous. Using (12.36) and (12.42), we get
On the other hand, by (12.43) and (12.37), we calculate
Since
applying (12.45), we write
Comparing (12.38), (12.44), and (12.45), we get (12.40).
4) Thus, if the compact set M is convex, then
Now, in the case of a convex set M, we have two variants of useful description of the set W 0(t), whence the guidance problem of the first player to the set M at the fixed instant \(\vartheta\) is solvable, namely, by the Pshenichnyi formula and by the Hopf formula. The Pshenichnyi formula deals with sets, while the Hopf formula uses functions.
In the paper, for the problems in the plane, we obtain sufficient conditions to describe the set W 0(t) by the Pshenichnyi formula for a non-convex set M. The Hopf formula does not work in the non-convex case.
Rights and permissions
Copyright information
© 2013 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Kamneva, L., Patsko, V. (2013). Open-Loop Solvability Operator in Differential Games with Simple Motions in the Plane. In: Křivan, V., Zaccour, G. (eds) Advances in Dynamic Games. Annals of the International Society of Dynamic Games, vol 13. Birkhäuser, Cham. https://doi.org/10.1007/978-3-319-02690-9_12
Download citation
DOI: https://doi.org/10.1007/978-3-319-02690-9_12
Published:
Publisher Name: Birkhäuser, Cham
Print ISBN: 978-3-319-02689-3
Online ISBN: 978-3-319-02690-9
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)