Geodesic
Construction of the solvability set in differential games with simple motions and nonconvex terminal set
Trudy Instituta matematiki i mehaniki, Tome 23 (2017) no. 1, pp. 143-157 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice du chapitre de livre

We consider planar zero-sum differential games with simple motions, fixed terminal time, and polygonal terminal set. The geometric constraint on the control of each player is a convex polygonal set or a straight line segment. In the case of a convex terminal set, an explicit formula is known for the solvability set (the level set of the value function, maximal $u$-stable bridge, viability set). The algorithm corresponding to this formula is based on the set operations of algebraic sum and geometric difference (the Minkowski difference). We propose an algorithm for the exact construction of the solvability set in the case of a nonconvex polygonal terminal set. The algorithm does not involve the additional partition of the time interval and the recovery of intermediate solvability sets at additional instants. A list of half-spaces in the three-dimensional space of time and state coordinates is formed and processed by a finite recursion. The list is based on the polygonal terminal set with the use of normals of the polygonal constraints on the controls of the players.
Keywords: differential games with simple motions in the plane, solvability set, backward procedure. 
@article{TIMM_2017_23_1_a14,
     author = {L. V. Kamneva and V. S. Patsko},
     title = {Construction of the solvability set in differential games with simple motions and nonconvex terminal set},
     journal = {Trudy Instituta matematiki i mehaniki},
     pages = {143--157},
     year = {2017},
     volume = {23},
     number = {1},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/TIMM_2017_23_1_a14/}
}
TY  - JOUR
AU  - L. V. Kamneva
AU  - V. S. Patsko
TI  - Construction of the solvability set in differential games with simple motions and nonconvex terminal set
JO  - Trudy Instituta matematiki i mehaniki
PY  - 2017
SP  - 143
EP  - 157
VL  - 23
IS  - 1
UR  - http://geodesic.mathdoc.fr/item/TIMM_2017_23_1_a14/
LA  - ru
ID  - TIMM_2017_23_1_a14
ER  - 
%0 Journal Article
%A L. V. Kamneva
%A V. S. Patsko
%T Construction of the solvability set in differential games with simple motions and nonconvex terminal set
%J Trudy Instituta matematiki i mehaniki
%D 2017
%P 143-157
%V 23
%N 1
%U http://geodesic.mathdoc.fr/item/TIMM_2017_23_1_a14/
%G ru
%F TIMM_2017_23_1_a14
L. V. Kamneva; V. S. Patsko. Construction of the solvability set in differential games with simple motions and nonconvex terminal set. Trudy Instituta matematiki i mehaniki, Tome 23 (2017) no. 1, pp. 143-157. http://geodesic.mathdoc.fr/item/TIMM_2017_23_1_a14/

[1] Aizeks R., Differentsialnye igry, Mir, M., 1967, 480 pp.

[2] Kumkov S.S., Le Menec S., Patsko V.S., “Zero-sum Pursuit-Evasion differential games with many objects: Survey of publications”, Dyn. Games Appl., 2016, 1–25 | DOI

[3] Krasovskii N.N., Igrovye zadachi o vstreche dvizhenii, Nauka, M., 1970, 420 pp. | MR

[4] Krasovskii N.N., Subbotin A.I., Game-theoretical control problems, Springer-Verlag, New York, 1988, 518 pp. | MR | Zbl

[5] Pshenichnyi B.N., Sagaidak M.I., “O differentsialnykh igrakh s fiksirovannym vremenem”, Kibernetika, 1970, no. 2, 54–63 | Zbl

[6] Subbotin A.I., Obobschennye resheniya uravnenii v chastnykh proizvodnykh pervogo poryadka, In-t kompyuter. issled., M.; Izhevsk, 2003, 336 pp.

[7] Krasovskii N.N., Subbotin A.I., Pozitsionnye differentsialnye igry, Nauka, M., 1974, 456 pp. | MR

[8] Subbotin A.I., Minimaksnye neravenstva i uravneniya Gamiltona - Yakobi, Nauka, M., 1991, 216 pp. | MR

[9] Pontryagin L.S., “Lineinye differentsialnye igry, II”, Dokl. AN SSSR, 175:4 (1967), 764–766 | Zbl

[10] Khadviger G., Lektsii ob ob'eme, ploschadi poverkhnosti i izoperimetrii, Nauka, M., 1966, 416 pp.

[11] Kamneva L.V., Patsko V.S., “Maximal stable bridge in game with simple motions in the plane”, Advances in Dynamic and Evolutionary Games: Theory, Applications, and Numerical Methods, Ann. Internat. Soc. Dynam. Games, 14, eds. Frank Thuijsman, Florian Wagener, 2016, 139–163 | DOI | MR | Zbl