|
This article is cited in 35 scientific papers (total in 36 papers)
An algorithm for the numerical solution of linear differential games
E. S. Polovinkin, G. E. Ivanov, M. V. Balashov, R. V. Konstantinov, A. V. Khorev Moscow Institute of Physics and Technology
Abstract:
A numerical algorithm for the construction of stable Krasovskii bridges, Pontryagin alternating sets, and also of piecewise program strategies solving two-person linear differential (pursuit or evasion) games on a fixed time interval is developed on the basis of a general theory.
The aim of the first player (the pursuer) is to hit a prescribed target (terminal) set by the phase vector of the control system at the prescribed time. The aim of the second player (the evader) is the opposite. A description of numerical algorithms used in the solution of differential games of the type under consideration is presented and estimates of the errors resulting from the approximation of the game sets by polyhedra are presented.
Received: 19.01.2001
Citation:
E. S. Polovinkin, G. E. Ivanov, M. V. Balashov, R. V. Konstantinov, A. V. Khorev, “An algorithm for the numerical solution of linear differential games”, Mat. Sb., 192:10 (2001), 95–122; Sb. Math., 192:10 (2001), 1515–1542
Linking options:
https://www.mathnet.ru/eng/sm604https://doi.org/10.1070/SM2001v192n10ABEH000604 https://www.mathnet.ru/eng/sm/v192/i10/p95
|
Statistics & downloads: |
Abstract page: | 1229 | Russian version PDF: | 425 | English version PDF: | 26 | References: | 81 | First page: | 1 |
|