Iterations of stability and the evasion problem with a constraint on the number of switchings of the formed control

A. G. Chentsov

Izvestiya Instituta Matematiki i Informatiki Udmurtskogo Gosudarstvennogo Universiteta, Tome 49 (2017), pp. 17-54.

Résumé

This paper is concerned with one variant of the programmed iterations method used for solving the differential game of guidance-evasion. The proposed procedure is connected with iterations on the basis of the property of stability of sets introduced by N.N. Krasovskii. A relationship is established between the resulting iteration procedure and the solution to the evasion problem under a constraint on the switching number of the formed control: the stability iterations define the set of successful solvability of the above-mentioned problem. It is proved that the guaranteed realization of evasion is possible if and only if (guaranteed) strong evasion (namely, the evasion with respect to neighborhoods of sets defining the guidance-evasion game) is realizable. A representation of strategies guaranteeing the evasion with constraints on the switching number is presented. The concrete operation of every such strategy consists in the formation of constant control extruding the trajectory from the set corresponding to the next iteration on the basis of the stability operator. The duration of operation of the above-mentioned control is defined in terms of the result of the multifunctional employment defined on the trajectory space; the values of this multifunctional are nonempty subsets of the remaining time interval. Attention is given to problems involved in the convergence, in the sense of Hausdorff metric, of fragments of sets which are realized by the iteration procedure. On this basis, conditions for convergence (in the Hausdorff metric) for the sets-iterations themselves are obtained.

Détail

Keywords: method of programmed iterations, nonanticipating multifunctional, stability operator, correction strategy.

Bibliographie

[1] Isaacs R., Differential games: a mathematical theory with applications to warfare and pursuit, control and optimization, John Wiley and Sons, Inc., New York, 1965, 384 pp. | MR | Zbl

[2] Krasovskii N.N., Subbotin A.I., Game-theoretical control problems, Springer, New York, 1987, 517 pp. | MR

[3] Krasovskii N.N., Control of dynamic systems. Problem of the minimum of guaranteed result, Nauka, M., 1985, 518 pp.

[4] Chentsov A.G., “On the structure of a game problem of convergence”, Sov. Math. Dokl., 16:5 (1975), 1404–1408 | MR | Zbl

[5] Chentsov A.G., “On a game problem of guidance”, Sov. Math., Dokl., 17 (1976), 73–77 | Zbl

[6] Chistiakov S.V., “On solving pursuit game problems”, J. Appl. Math. Mech., 41:5 (1977), 845–852 | DOI | MR

[7] Ukhobotov V.I., “Construction of a stable bridge for a class of linear games”, J. Appl. Math. Mech., 41:2 (1977), 350–354 | DOI | MR

[8] Chentsov A.G., The programmed iterations method for a differential pursuit-evasion game, Deposited in VINITI 04.06.1979, No 1933-79, Institute of Mathematics and Mechanics, Ural Research Center of the Academy of Sciences of the USSR, Sverdlovsk, 1979, 103 pp. (in Russian)

[9] Subbotin A.I., Chentsov A.G., Optimization of guarantee in control problems, Nauka, M., 1981, 288 pp.

[10] Krasovskii N.N., Subbotin A.I., “An alternative for the game problem of convergence”, J. Appl. Math. Mech., 34:6 (1970), 948–965 | DOI | MR | Zbl

[11] Chentsov A.G., On the problem of control with a limited number of switching, Deposited in VINITI, No 4942-B 87, Ural Polytechnic Institute, Sverdlovsk, 1987, 45 pp. (in Russian)

[12] Chentsov A.G., About differential games with a restriction on the number of corrections. 2, Deposited in VINITI, No 5406-80, Institute of Mathematics and Mechanics, Ural Research Center of the Academy of Sciences of the USSR, Sverdlovsk, 1980, 55 pp. (in Russian)

[13] Dyatlov V.P., Chentsov A.G., “A class of linear differential games with a limited number of corrections”, Upravlenie i otsenivanie v dinamicheskikh sistemakh, Ural Research Center of the Academy of Sciences of the USSR, Sverdlovsk, 1982, 9–16 (in Russian)

[14] Chentsov A.G., “Iterations of stability and evasion problem with a restriction on the number of switching”, Tr. Inst. Mat. Mekh. Ural. Otd. Ross. Akad. Nauk, 23, no. 2, 2017, 285–302 (in Russian) | DOI

[15] Kryazhimskii A.V., “On the theory of positional differential games of convergence-evasion”, Sov. Math., Dokl., 19 (1978), 405–412 | MR | Zbl

[16] Kuratowski K., Mostowski A., Set theory, North-Holland, Amsterdam, 1967, xii+417 pp. | MR

[17] Dieudonne J., Foundations of modern analysis, Academic Press, New York–London, 1960, 361 pp. | MR | Zbl

[18] Billingsley P., Convergence of probability measures, John Willey and Sons, Inc., New York, 1968, xii+253 pp. | MR | Zbl

[19] Dunford N.J., Schwartz J.T., Linear operators, v. I, General theory, Interscience Publ., New York–London, 1958, xiv+858 pp. | MR | Zbl

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

[21] Chentsov A.G., Elements of finitely additive measure theory, v. I, Ural State Technical University, Yekaterinburg, 2008, 389 pp.

[22] Neveu J., Bases mathematiques du calcul des probabilites, Masson et Cie, Paris, 1964, 203 pp. | MR | Zbl

[23] Chentsov A.G., “The program iteration method in a game problem of guidance”, Tr. Inst. Mat. Mekh. Ural. Otd. Ross. Akad. Nauk, 22, no. 2, 2016, 304–321 (in Russian) | DOI

[24] Engelking R., General topology, Polish Scientific Publishers, Warszawa, 1977, 626 pp. | MR | Zbl