On procedures for constructing solutions in differential games on a finite interval of time
- 23 Downloads
Many problems of conflict-control theory can be reduced to approach-avoidance games with a certain terminal set. One of the main approaches to solution of such problems is the approach suggested by N. N. Krasovskii, which is based on positional constructions. The basis of these constructions consists of the extremal aiming principle at stable bridges. In this connection, the problem of constructing the maximal stable bridge, the set of all positions from which the problem of approaching the terminal set (which is the main task of one of the problem) is solvable, is important. The paper considers the approach-avoidance game on a finite interval of time in which the first player must ensure the attainment by the state vector of the control system of the terminal set on this interval, and the second player must ensure the avoidance of the terminal set. The main subject of the study is the maximal stable bridge, which is the set of positional consumption in this game. The problem of exactly constructing the set of positional consumption is solvable only in simple cases, and it is more realistic to consider and solve the problem of approximate construction of this set. The paper proposes approaches to approximate construction of the set of positional consumption based on sampling the time interval of the game and the technique of backward constructions, which has been developed at the scientific school of N. N. Krasovskii since the 1980s.
KeywordsDifferential Game Multivalued Mapping Jacobi Equation Finite Interval Positional Strategy
Unable to display preview. Download preview PDF.
- 1.M. I. Alekseichik, “Further formalization of the main elements of an antagonistic differential game,” in: Mathematical Analysis and Its Applications [in Russian], 7, Rostov State University, Rostov-on-Don (1975), pp. 191–199.Google Scholar
- 3.S. V. Grigorieva, A. A. Uspenskii, and V. N. Ushakov, “Solutions of differential games and the Cauchy problem for Hamilton-Jacobi equation,” in: 10th IFAC Symposium On Dynamic Games and Applications, July 8–11, St. Petersburg, Russia, 2002 [in Russian], 1 (L. A. Petrosjan and N. A. Zenkevich, Eds.), St. Petersburg (2002), pp. 349–352.Google Scholar
- 5.N. N. Krasovskii, “Unification of differential games,” in: Game Problems of Control, Proceedings of the Institute of Mathematics and Mechanics, 24 [in Russian], UNTs, Akad. Nauk SSSR, Sverdlovsk (1977), pp. 32–45.Google Scholar
- 8.A. I. Subbotin, Generalized Solutions of First-Order Partial Differential Equations [in Russian], Moscow-Izhevsk (2000).Google Scholar
- 9.A. M. Taras’ev and V. N. Ushakov, On constructing stable bridges in a minimax approach-avoidance game [in Russian], Preprint No. 2454-83, VINITI, Moscow (1983).Google Scholar
- 11.A. M. Taras’ev, A. A. Uspenskii, and V. N. Ushakov, “A finite-difference method for constructing the optimal guaranteed result function,” in: Collection of Works “Gagarin Scientific Readings on Astronautic and Aviation [in Russian], Nauka, Moscow (1992), pp. 166–172.Google Scholar
- 12.A. M. Taras’ev, A. A. Uspenskii, and B. N. Ushakov, “Approximate operators and finite-difference schemes for constructing generalized solutions of the Hamilton-Jacobi equations,” Izv. Ross. Akad. Nauk. Tekh. Kibern., 3, 173–185 (1994).Google Scholar
- 15.A. A. Uspenskii, “Computational procedures for constructing generalized solutions of the Bellman-Isaacs equation,” Dissertation, Ross. Akad Nauk, UrO, IMM, Ekaterinburg (1993).Google Scholar