Skip to main content
Log in

The program iteration method in a game problem of guidance

  • Published:
Proceedings of the Steklov Institute of Mathematics Aims and scope Submit manuscript

Abstract

A variant of the program iteration method for solving a game problem of guidance to a target set under state constraints is considered. We study a procedure for the construction of a positional absorption set corresponding to N. N.Krasovskii and A. I. Subbotin’s alternative theorem, which underlies the modern theory of differential games. Important results on the alternative solvability of differential games for systems with distributed parameters and aftereffect belong to Yu. S.Osipov. These results are an essential complement to the ideas related to the alternative for dynamic problems of infinite-dimensional nature. The solution method from the present paper is intended for the “finite-dimensional” case of a differential game of approach–evasion.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. R. Isaacs, Differential Games (Wiley, New York, 1965; Mir, Moscow, 1967).

    MATH  Google Scholar 

  2. N. N. Krasovskii and A. I. Subbotin, Positional Differential Games (Nauka, Moscow, 1974) [in Russian].

    MATH  Google Scholar 

  3. N. N. Krasovskii and A. I. Subbotin, “An alternative for the game problem of convergence,” J. Appl. Math. Mech. 34 (6), 948–965 (1970).

    Article  MathSciNet  MATH  Google Scholar 

  4. N. N. Krasovskii, “A differential game of approach and evasion. I,” Engrg. Cybernetics 11 (2), 189–203 (1973).

    MathSciNet  Google Scholar 

  5. N. N. Krasovskii, “A differential game of approach and evasion. II,” Engrg. Cybernetics 11 (3), 376–394 (1973).

    MathSciNet  Google Scholar 

  6. A. V. Kryazhimskii, “On the theory of positional differential games of approach–evasion,” Dokl. Akad. Nauk SSSR 239 (4), 779–782 (1978).

    MathSciNet  Google Scholar 

  7. N. N. Krasovskii, Game Problems on the Encounter of Motions (Nauka, Moscow, 1970) [in Russian].

    MATH  Google Scholar 

  8. A. G. Chentsov, “On the structure of an approach game problem,” Dokl. AN SSSR 224 (6), 1272–1275 (1975).

    Google Scholar 

  9. A. G. Chentsov, “On a game problem of guiding,” Dokd. AN SSSR 226 (1), 73–76 (1976).

    MATH  Google Scholar 

  10. A. G. Chentsov, “On a game problem of converging at a given instant of time,” Math. USSR-Sb. 28 (3), 353–376 (1976).

    Article  MATH  Google Scholar 

  11. S. V. Chistyakov, “On solving pursuit game problems,” J. Appl. Math. Mech. 41 (5), 845–852 (1977).

    Article  MathSciNet  MATH  Google Scholar 

  12. V. I. Ukhobotov, “Construction of a stable bridge for a class of linear games,” J. Appl. Math. Mech. 41 (2), 358–361 (1977).

    Article  MathSciNet  Google Scholar 

  13. C. Ryll-Nardzewski, “A theory of pursuit and evasion,” in Advances in Game Theory (Princeton Univ. Press, Princeton, NJ, 1964), pp. 113–127.

    Google Scholar 

  14. E. Roxin, “Axiomatic approach in differential games,” J. Optim. Theory Appl. 3, 156–163 (1969).

    Article  MathSciNet  MATH  Google Scholar 

  15. A. I. Subbotin and A. G. Chentsov, Guarantee Optimization in Control Problems (Nauka, Moscow, 1981) [in Russian].

    MATH  Google Scholar 

  16. K. Kuratowski and A. Mostowski, Set Theory (North-Holland, Amsterdam, 1968; Mir, Moscow, 1970).

    MATH  Google Scholar 

  17. R. Engelking, General Topology (Heldermann, Berlin, 1989; Mir, Moscow, 1986).

    MATH  Google Scholar 

  18. A. G. Chentsov and S. I. Morina, Extensions and Relaxations (Kluwer Acad., Dordrecht, 2002).

    Book  MATH  Google Scholar 

  19. J. Warga, Optimal Control of Differential and Functional Equations (Academic, New York, 1972; Nauka, Moscow, 1977).

    MATH  Google Scholar 

  20. A. G. Chentsov, The Method of Program Iterations for an Approach–Evasion Differential Game (Sverdlovsk, 1979), Available from VINITI, No. 1933–79 [in Russian].

    Google Scholar 

  21. P. Billingsley, Convergence of Probability Measures (Wiley, New York, 1968; Nauka, Moscow, 1977).

    MATH  Google Scholar 

  22. N. Dunford and J. Schwartz, Linear Operators: General Theory (Interscience, New York, 1958; Inostrannaya Lit., Moscow, 1962).

    MATH  Google Scholar 

  23. A. G. Chentsov, Elements of the Theory of Finitely Additive Measures I (Izd. UGTU-UPI, Yekaterinburg, 2009) [in Russian].

    Google Scholar 

  24. A. V. Kryazhimskii and A. G. Chentsov, On the Structure of a Game Control in Problems of Approach and Evasion (Sverdlovsk, 1979), Available from VINITI, No. 1729–80 [in Russian].

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to A. G. Chentsov.

Additional information

Original Russian Text © A.G. Chentsov, 2016, published in Trudy Instituta Matematiki i Mekhaniki UrO RAN, 2016, Vol. 22, No. 2.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Chentsov, A.G. The program iteration method in a game problem of guidance. Proc. Steklov Inst. Math. 297 (Suppl 1), 43–61 (2017). https://doi.org/10.1134/S0081543817050066

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0081543817050066

Keywords

Navigation