Geodesic
Quasistrategies in an abstract guidance control problem
Izvestiâ vysših učebnyh zavedenij. Matematika, no. 10 (2008), pp. 55-69.

Voir la notice de l'article provenant de la source Math-Net.Ru

We consider an abstract guidance control problem with elements of uncertainty, where the control procedures are identified with set-valued quasistrategies. The goal of the control consists in the guidance to the goal set under phase constraints. We construct the solvability set by the method of programmed iterations which is well known in the theory of differential games. We prove that the limit of the iterative procedure has the sense of the set of positional absorption (the stable bridge) introduced by N. N. Krasovskii. This limit coincides with the solvability set in the class of quasistrategies.
Keywords: set-valued quasistrategy, method of programmed iterations, the problem of confinement, operator of programmed absorption. 
@article{IVM_2008_10_a6,
     author = {A. G. Chentsov},
     title = {Quasistrategies in an abstract guidance control problem},
     journal = {Izvesti\^a vys\v{s}ih u\v{c}ebnyh zavedenij. Matematika},
     pages = {55--69},
     publisher = {mathdoc},
     number = {10},
     year = {2008},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/IVM_2008_10_a6/}
}
TY  - JOUR
AU  - A. G. Chentsov
TI  - Quasistrategies in an abstract guidance control problem
JO  - Izvestiâ vysših učebnyh zavedenij. Matematika
PY  - 2008
SP  - 55
EP  - 69
IS  - 10
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/IVM_2008_10_a6/
LA  - ru
ID  - IVM_2008_10_a6
ER  - 
%0 Journal Article
%A A. G. Chentsov
%T Quasistrategies in an abstract guidance control problem
%J Izvestiâ vysših učebnyh zavedenij. Matematika
%D 2008
%P 55-69
%N 10
%I mathdoc
%U http://geodesic.mathdoc.fr/item/IVM_2008_10_a6/
%G ru
%F IVM_2008_10_a6
A. G. Chentsov. Quasistrategies in an abstract guidance control problem. Izvestiâ vysših učebnyh zavedenij. Matematika, no. 10 (2008), pp. 55-69. http://geodesic.mathdoc.fr/item/IVM_2008_10_a6/

[1] Aizeks R., Differentsialnye igry, Mir, M., 1967, 479 pp. | MR

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

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

[4] Krasovskii N. N., Upravlenie dinamicheskoi sistemoi. Zadacha o minimume garantirovannogo rezultata, Nauka, M., 1985, 518 pp. | MR

[5] Subbotin A. I., Chentsov A. G., Optimizatsiya garantii v zadachakh upravleniya, Nauka, M., 1981, 287 pp.

[6] Subbotin A. I., Minimaksnye neravenstva i uravneniya Gamiltona–Yakobi, Nauka, M., 1991, 215 pp. | MR

[7] Krasovskii N. N., “Differentsialnye igry. Approksimatsionnye i formalnye modeli”, Matem. sb., 107:4 (1978), 541–571 | MR | Zbl

[8] Roxin E., “Axiomatic approach in differential games”, J. Optimiz. Theory and Appl., 3:3 (1969), 153–163 | DOI | MR | Zbl

[9] Elliott R. J., Kalton N. J., The existence of value in differential games, Memoirs of the Amer. Math. Soc., 126, 1972, 67 pp. | MR | Zbl

[10] Fleming W. H., A note on differential games of prescribed duration. Contributions to the theory of games, V. 3, Princeton Univ. Press, 1957, 126 pp. | MR

[11] Friedman A., Differential games, New York, 1971, 350 pp. | MR

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

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

[14] Chentsov A. G., “K igrovoi zadache navedeniya s informatsionnoi pamyatyu”, DAN SSSR, 227:2 (1976), 306–308 | MR | Zbl

[15] Chentsov A. G., “Ob igrovoi zadache sblizheniya v zadannyi moment vremeni”, Matem. sb., 99:3 (1976), 394–420 | MR | Zbl

[16] Chistyakov S. V., “K resheniyu igrovykh zadach presledovaniya”, PMM, 41:5 (1977), 825–832 | MR | Zbl

[17] Chentsov A. G., “Ob igrovoi zadache navedeniya k zadannomu momentu vremeni”, Izv. AN SSSR. Ser. Matem., 42:2 (1978), 455–467 | MR | Zbl

[18] Chentsov A. G., “Iteratsionnaya programmnaya konstruktsiya dlya differentsialnoi igry s fiksirovannym momentom okonchaniya”, DAN SSSR, 240:1 (1978), 36–39 | MR | Zbl

[19] Chentsov A. G., Metod programmnykh iteratsii dlya differentsialnoi igry sblizheniya-ukloneniya, Dep. v VINITI 04.06.79, No 1933-79 Dep., AN SSSR. UNTs. IMM, Sverdlovsk, 1979, 103 pp. | MR

[20] Chentsov A. G., “Ob alternative v klasse kvazistrategii dlya differentsialnoi igry sblizheniya-ukloneniya”, Differents. uravneniya, 16:10 (1980), 1801–1808 | MR

[21] Krasovskii N. N., Chentsov A. G., “On the design of differential games, I”, Probl. Control and Inform. Theory, 6:5–6 (1977), 381–395 | MR

[22] Krasovskii N. N., Chentsov A. G., “On the design of differential games, II”, Probl. Control and Inform. Theory, 9:1 (1979), 3–11 | MR

[23] Chentsov A. G., “K voprosu o sootnoshenii razlichnykh versii metoda programmnykh iteratsii: pozitsionnyi variant”, Kibernetika i sistemn. anal., 2002, no. 3, 130–149 | MR | Zbl

[24] Chentsov A. G., “K voprosu ob iteratsionnoi realizatsii neuprezhdayuschikh mnogoznachnykh otobrazhenii”, Izv. vuzov. Matematika, 2000, no. 3, 66–76 | MR | Zbl

[25] Chentsov A. G., “Neuprezhdayuschie mnogoznachnye otobrazheniya i ikh postroenie s pomoschyu metoda programmnykh iteratsii, I”, Differents. uravneniya, 37:4 (2001), 470–480 | MR | Zbl

[26] Chentsov A. G., “Neuprezhdayuschie mnogoznachnye otobrazheniya i ikh postroenie s pomoschyu metoda programmnykh iteratsii, II”, Differents. uravneniya, 37:5 (2001), 679–688 | MR | Zbl

[27] Chentsov A. G., “K voprosu o dvoistvennosti razlichnykh versii metoda programmnykh iteratsii”, Izv. vuzov. Matematika, 2001, no. 12, 77–88 | MR | Zbl

[28] Ivanov V. M., Chentsov A. G., “Ob upravlenii diskretnymi sistemami na beskonechnom promezhutke vremeni”, Zhurn. vychisl. matem. i matem. fiz., 27:12 (1987), 1780–1789 | MR | Zbl

[29] Edvards R., Funktsionalnyi analiz, Mir, M., 1969, 1071 pp. | MR

[30] Subbotin A. I., Chentsov A. G., “Iteratsionnaya protsedura dlya postroeniya minimaksnykh i vyazkostnykh reshenii uravnenii Gamiltona–Yakobi”, Dokl. RAN, 348:6 (1996), 736–739 | MR | Zbl

[31] Subbotin A. I., Chentsov A. G., “Iteratsionnaya protsedura postroeniya minimaksnykh i vyazkostnykh reshenii uravnenii Gamiltona–Yakobi i ee obobscheniya”, Tr. MIAN, 224, 1999, 311–334 | MR | Zbl

[32] Varga Dzh., Optimalnoe upravlenie differentsialnymi i funktsionalnymi uravneniyami, Nauka, M., 1977, 624 pp. | MR

[33] Yang L., Lektsii po variatsionnomu ischisleniyu i teorii optimalnogo upravleniya, Mir, M., 1970, 488 pp. | MR

[34] Chentsov A. G., Finitely additive measures and relaxations of extremal problems, Plenum Publishing Corporation, New York–London–Moscow, 1996, 244 pp. | MR | Zbl

[35] Chentsov A. G., Asymptotic attainability, Kluwer Academic Publishers, Dordrecht–Boston–London, 1997, 322 pp. | MR | Zbl

[36] Chentsov A. G., Morina S. I., Extensions and relaxations, Kluwer Academic Publishers, Dordrecht–Boston–London, 2002, 408 pp. | MR | Zbl

[37] Danford N., Shvarts Dzh. T., Lineinye operatory. Obschaya teoriya, In. lit., M., 1962, 895 pp. | MR

[38] Neve Zh., Matematicheskie osnovy teorii veroyatnostei, Mir, M., 1969, 309 pp. | MR | Zbl

[39] Engelking R., Obschaya topologiya, Mir, M., 1986, 751 pp.

[40] Kelli Dzh. L., Obschaya topologiya, Nauka, M., 1981, 433 pp. | MR

[41] Varaiya P., Lin J., “Existence of saddle points in differential games”, SIAM J. Control, 7:1 (1969), 141–157 | DOI | MR | Zbl

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

[43] Chentsov A. G., Morina S. I., Zobnin B. B., “On some constructions of control by systems with a varying structure”, Mathematics and Computers in Simulation, 49 (1999), 319–334 | DOI | MR