Geodesic
Transfinite Version of the Program Iteration Method in a Game Problem of Approach for an Abstract Dynamical System
Trudy Instituta matematiki i mehaniki, Trudy Instituta Matematiki i Mekhaniki UrO RAN, Tome 28 (2022) no. 3, pp. 176-187 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice du chapitre de livre

The game problem of approach of motions of an abstract dynamical system to a given target set within state constraints is considered. An arbitrary subset of real numbers acts as a time “interval.” The target set $\mathcal M$ and the state constraints $\mathcal N$ obey the inclusion $\mathcal M \subset\mathcal N$. Nonanticipative multifunctions defined on the histories of the disturbance are considered as admissible control strategies. A description of the solvability set and a construction of resolving control strategies based on the method of program iterations are given. At the same time, by increasing the “number” of iterations of the program absorption operator, it is possible to expand (compared to the original version of the method) the areas of applicability of the method due to the weakening or complete rejection of the topological requirements to the system dynamics, target set, and state constraints. The proposed constructions and their justification use the technique of fixed points of monotone mappings in partially ordered sets.
Keywords: approach game problem, program iterations, abstract dynamical system, nonanticipative strategies. 
@article{TIMM_2022_28_3_a13,
     author = {D. A. Serkov},
     title = {Transfinite {Version} of the {Program} {Iteration} {Method} in a {Game} {Problem} of {Approach} for an {Abstract} {Dynamical} {System}},
     journal = {Trudy Instituta matematiki i mehaniki},
     pages = {176--187},
     year = {2022},
     volume = {28},
     number = {3},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/TIMM_2022_28_3_a13/}
}
TY  - JOUR
AU  - D. A. Serkov
TI  - Transfinite Version of the Program Iteration Method in a Game Problem of Approach for an Abstract Dynamical System
JO  - Trudy Instituta matematiki i mehaniki
PY  - 2022
SP  - 176
EP  - 187
VL  - 28
IS  - 3
UR  - http://geodesic.mathdoc.fr/item/TIMM_2022_28_3_a13/
LA  - ru
ID  - TIMM_2022_28_3_a13
ER  - 
%0 Journal Article
%A D. A. Serkov
%T Transfinite Version of the Program Iteration Method in a Game Problem of Approach for an Abstract Dynamical System
%J Trudy Instituta matematiki i mehaniki
%D 2022
%P 176-187
%V 28
%N 3
%U http://geodesic.mathdoc.fr/item/TIMM_2022_28_3_a13/
%G ru
%F TIMM_2022_28_3_a13
D. A. Serkov. Transfinite Version of the Program Iteration Method in a Game Problem of Approach for an Abstract Dynamical System. Trudy Instituta matematiki i mehaniki, Trudy Instituta Matematiki i Mekhaniki UrO RAN, Tome 28 (2022) no. 3, pp. 176-187. http://geodesic.mathdoc.fr/item/TIMM_2022_28_3_a13/

[1] Krasovskii N.N., Subbotin A.I., “Alternativa dlya igrovoi zadachi sblizheniya”, Prikl. matematika i mekhanika, 34:6 (1970), 1005–1022 | Zbl

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

[3] Chentsov A.G., “O strukture odnoi igrovoi zadachi sblizheniya”, Dokl. AN SSSR, 224:6 (1975), 1272–1275 | MR | Zbl

[4] Chentsov A.G., “K igrovoi zadache navedeniya”, Dokl. AN SSSR, 226:1 (1976), 73–76 | MR | Zbl

[5] Dyatlov V.P., Chentsov A.G., “Monotonnye iteratsii mnozhestv i ikh prilozheniya k igrovym zadacham upravleniya”, Kibernetika, 1987, no. 2, 92–99 | Zbl

[6] Ukhobotov V.I., “Postroenie stabilnogo mosta dlya odnogo klassa lineinykh igr”, Prikl. matematika i mekhanika, 41:2 (1977), 358–364 | MR

[7] Chistyakov S.V., “K resheniyu igrovykh zadach presledovaniya”, Prikl. matematika i mekhanika, 41:5 (1977), 825–832 | MR

[8] Chentsov A.G., “Metod programmnykh iteratsii dlya resheniya abstraktnoi zadachi uderzhaniya”, Avtomatika i telemekhanika, 2004, no. 2, 157–169 | Zbl

[9] Barbashin E.A., “K teorii obobschennykh dinamicheskikh sistem”, Uch. zapiski Mosk. un-ta, 1949, 110–133

[10] Roxin E., “Stability in general control systems”, J. Diff. Eq., 1 (1965), 115–150 | DOI | MR | Zbl

[11] Baidosov V.A., “O podkhode k opredeleniyu dinamicheskikh igr na yazyke obobschennykh dinamicheskikh sistem”, Optimalnoe upravlenie sistemami s neopredelennoi informatsiei, eds. red. V. A. Baidosov, A. I. Subbotin, Izd-vo UNTs AN SSSR, Sverdlovsk, 1980, 3–11 | MR

[12] Serkov D.A., “Transfinitnye posledovatelnosti v metode programmnykh iteratsii”, Tr. In-ta matematiki i mekhaniki UrO RAN, 23:1 (2017), 228–240

[13] Kuratovskii K., Mostovskii A., Teoriya mnozhestv, Mir, M., 1970, 416 pp.

[14] Serkov D.A., Chentsov A.G., “Metod programmnykh iteratsii i operatornaya vypuklost v abstraktnoi zadache uderzhaniya”, Vestn. Udmurt. un-ta. Ser. 1: Matematika. Mekhanika. Kompyuternye nauki, 25:3 (2015), 348–366 | Zbl