Abstract
A variant of the program iteration method called stability iterations is used for a differential game of pursuit–evasion. The successful solvability set of one of the problems generating the game is found as a limit of the iterative procedure in the space of sets whose elements are positions of the game. The game is defined by a pair of closed sets, one of the which is the target set in the pursuit problem (the first player’s problem) and the other specifies the state constraints in this problem. For the positions not belonging to the solvability set of the pursuit problem, it is interesting to determine the smallest “size” of a neighborhood of the two mentioned sets for which the first player can implement the guidance to the neighborhood of the target set corresponding to this “size” within the similar neighborhood of the second set, i.e., the set specifying the state constraints. Similar constructions are considered for the sets realized at each stage of the iterative procedure. We use the connection of these constructions with the mentioned smallest “size” of neighborhoods of the sets that are parameters of the differential game in the sense of guaranteed realizability of guidance under the replacement of the original sets by these neighborhoods.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
N. N. Krasovskii and A. I. Subbotin, “An alternative for the game problem of convergence,” J. Appl. Math. Mech. 34 (6), 948–965 (1970).
N. N. Krasovskii and A. I. Subbotin, Positional Differential Games (Nauka, Moscow, 1974) [in Russian].
R. Isaacs, Differential Games (Wiley, New York, 1965).
L. D. Berkovitz, “Differential games of generalized pursuit and evasion,” Appl. Math. Optim. 17 (1), 177–183 (1988). doi 10.1007/BF01448365
R. J. Elliott and N. J. Kalton, “Values in differential games,” Bull. Amer. Math. Soc. 78 (3), 427–431 (1972). doi 10.1090/S0002-9904-1972-12929-X
A. G. Chentsov, “On a game problem of guidance with information memory,” Soviet Math. Dokl. 17, 411–414 (1976).
A. G. Chentsov, “On a game problem of converging at a given instant of time,” Math. USSR-Sb. 28 (3), 353–376 (1976).
A. I. Subbotin and A. G. Chentsov, Guarantee Optimization in Control Problems (Nauka, Moscow, 1981) [in Russian].
V. N. Ushakov and A. A. Ershov, “On the solution of control problems with fixed terminal time,” Vestn. Udmurt. Univ., Ser. Mat. Mekh. Comp. Nauki 26 (4), 543–564 (2016). doi 10.20537/vm160409
V. N. Ushakov and A. R. Matviichuk, “On the solution of control problems of nonlinear systems on a finite time interval,” Izv. IMI UdGU, No. 2(46), 202–215 (2015).
V. N. Ushakov, V. I. Ukhobotov, A. V. Ushakov, and G. V. Parshikov, “On solving approach problems for control systems,” Proc. Steklov Inst. Math. 291 (1), 263–278 (2015).
N. N. Krasovskii, “A differential game of approach and evasion. I,” Engrg. Cybernetics 11 (2), 189–203 (1973).
N. N. Krasovskii, “A differential game of approach and evasion. II,” Engrg. Cybernetics 11 (3), 376–394 (1973).
A. G. Chentsov, “On the structure of a game problem of convergence,” Soviet Math. Dokl. 16 (5), 1404–1408 (1975).
S. V. Chistyakov, “On solving pursuit game problems,” J. Appl. Math. Mech. 41 (5), 845–852 (1977).
V. I. Ukhobotov, “Construction of a stable bridge for a class of linear games,” J. Appl. Math. Mech. 41 (2), 358–361 (1977).
A. G. Chentsov, The Method of Program Iterations for an Approach–Evasion Differential Game (Sverdlovsk, 1979), Available from VINITI, No. 1933–79 [in Russian].
A. G. Chentsov, “Stability iterations and an evasion problem with a constraint on the number of switchings,” Trudy Inst. Mat. Mekh. UrO RAN 23 (2), 285–302 (2017). doi 10.21538/0134-4889-2017-23-2-285-302
A. G. Chentsov, On a Control Problem with Bounded Number of Switchings (Sverdlovsk, 1987), Available from VINITI, No. 4942-V87 [in Russian].
A. G. Chentsov, On Differential Games with a Constraint on the Number of Corrections (Sverdlovsk, 1980), Available from VINITI, No. 5406–80 [in Russian].
J. Neveu, Mathematical Foundations of the Calculus of Probability (Holden Day, London, 1965; Mir, Moscow, 1969).
P. Billingsley, Convergence of Probability Measures (Wiley, New York, 1968; Nauka, Moscow, 1977).
J. Dieudonne, Foundations of Modern Analysis (Academic, New York, 1960; Mir, Moscow, 1964).
A. V. Kryazhimskii, “On the theory of positional differential games of approach–evasion,” Dokl. Akad. Nauk SSSR 239 (4), 779–782 (1978).
A. G. Chentsov, “The program iteration method in a game problem of guidance,” Proc. Steklov Inst. Math. 297 (Suppl. 1), S43–S61 (2017). doi 10.1134/S0081543817050066
A. G. Chentsov, “On the game problem of convergence at a given moment of time,” Math. USSR-Izv. 12 (2), 426–437 (1978).
S. V. Chistyakov and F. F. Nikitin, “On zero-sum two-person differential games of infinite duration,” Vest. SPbGU, Ser. 1, No. 3, 38–44 (2004).
S. V. Chistyakov, “Programmed iterations and universal ε-optimal strategies in a positional differential game,” Soviet Math. Dokl. 44 (1), 354–357 (1992).
S. V. Chistyakov, “On functional equations in games of encounter at a prescribed instant,” J. Appl. Math. Mech. 46 (5), 704–706 (1982).
A. G. Chentsov, “Stability iterations and the evasion problem with a constraint on the number of switchings of the formed control,” Izv. IMI UdGU 49, 17–54 (2017).
Funding
This work was supported by the Russian Foundation for Basic Research (project no. 16-01-00505).
Author information
Authors and Affiliations
Corresponding authors
Additional information
Russian Text © The Author(s), 2018, published in Trudy Instituta Matematiki i Mekhaniki UrO RAN, 2018, Vol. 24, No. 4, pp. 246-269.
Rights and permissions
About this article
Cite this article
Chentsov, A.G., Khachay, D.M. Relaxation of the Pursuit–Evasion Differential Game and Iterative Methods. Proc. Steklov Inst. Math. 308 (Suppl 1), 35–57 (2020). https://doi.org/10.1134/S0081543820020042
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S0081543820020042