Skip to main content
SpringerLink
Log in

An Abstract Confinement Problem: A Programmed Iterations Method of Solution

  • Published:
Automation and Remote Control Aims and scope Submit manuscript

Abstract

The game problem of confinement of the trajectories of a dynamic system in a system of closed sets of a topological space using multivalued quasi-strategies as controls is studied. The solvability set is constructed by programmed iterations on a space of subsets of the position set. A unified scheme is applied to study confinement on finite, infinite and discrete time intervals.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

REFERENCES

  1. Isaaks, R., Differential Games.A Mathematical Theory with Applications to Warfare and Pursuit, Control, and Optimization, New York: Wiley, 1952. Translated under the title Differentsial'nye igry, Moscow: Mir, 1967.

    Google Scholar 

  2. Krasovskii, N.N., Igrovye zadachi o vstreche dvizhenii (Game Problems of Counter Motions), Moscow: Nauka, 1970.

    Google Scholar 

  3. Krasovskii, N.N. and Subbotin, A.I., Pozitsionnye differentsial'nye igry (Positional Differential Games), Moscow: Nauka, 1984.

    Google Scholar 

  4. Krasovskii, N.N., Upravlenie dynamicheskoi sistemoi.Zadacha o minimume garantirovannogo resul'tata (Control for a Dynamic System. Minimum Guaranteed Result), Moscow: Nauka, 1985.

    Google Scholar 

  5. Subbotin, A.I. and Chentsov, A.G., Optimizatsiya garantii v zadachakh upravleniya (Optimization of the Guarantee in Control Problems), Moscow: Nauka, 1981.

    Google Scholar 

  6. Subbotin, A.I., Minimaksnye neravenstva i uravneniya Gamil'tona-Yakobi (Minimax Inequalities and the Hamilton-Jacobi Equations), Moscow: Nauka, 1991.

    Google Scholar 

  7. Pontryagin, L.S., Theory of Differential Games, Uspekh.Mat.Nauk, 1966, vol. 21, no. 4.

  8. Pshenichnyi, B.N., The Structure of Differential Games, Dokl.Akad.Nauk SSSR, vol. 184, no. 2.

  9. Roxin, E., Axiomatic Approach in Differential Games, J.Optimiz.Theory Appl., 1969, vol. 3, no. 3, pp. 153-163.

    Google Scholar 

  10. Elliott, R.J. and Kalton, N.J., The Existence of Value in Differential Games, Memoirs Am.Math.Soc., 1972, no. 126, p. 67.

  11. Varaiya, P. and Lin, J., Existence of Saddle Points in Differential Games, SIAM J.Control, 1969, vol. 7, no. 1, pp. 141-157.

    Google Scholar 

  12. Fleming, W.H., The Convergence Problem for Differential Games, II, Adv.Game Theory.Ann.Math.Stud., 1964, no. 52, pp. 195-210.

  13. Friedman, A., Differential Games, New York: Wiley-Interscience, 1974.

    Google Scholar 

  14. Chentsov, A.G., Alternatives in the Class of Quasi-Strategies for Approach-Evasion Differential Games, Diff.Uravn., 1980, vol. 16, no. 10, pp. 1801-1808.

    Google Scholar 

  15. Chentsov, A.G., The Structure of an Approach Game Problem, Dokl.Akad.Nauk SSSR, 1975, vol. 224, no. 6, pp. 1272-1275.

    Google Scholar 

  16. Chentsov, A.G., An Aiming Game Problem, Dokl.Akad.Nauk SSSR, 1976, vol. 226, no. 1, pp. 73-76.

    Google Scholar 

  17. Chentsov, A.G., An Aiming Game Problem with Information Memory, Dokl.Akad.Nauk SSSR, 1976, vol. 227, no. 2, pp. 306-308.

    Google Scholar 

  18. Chentsov, A.G., A Game Problem on the Approach at a Given Instant, Mat.Sb., 1976, vol. 99, no. 3, pp. 394-420.

    Google Scholar 

  19. Chistyakov, S.V., Solution of Pursuit Game Problems, Prikl.Mat.Mekh., 1977, vol. 41, no. 5, pp. 825-832.

    Google Scholar 

  20. Chentsov, A.G., A Game Problem of Aiming at a Given Instant, Izv.Akad.Nauk SSSR, Ser.Mat., 1978, vol. 42, no. 2, pp. 455-467.

    Google Scholar 

  21. Chentsov, A.G., An Iterative Programmed Construction for a Differential Game with a Fixed Instant, Dokl.Akad.Nauk SSSR, 1978, vol. 240, no. 1.

  22. Chentsov, A.G., Metod programmnykh iteratsii dlya di_erentsial'noi igry sblizheniya-ukloneniya (The Method of Programmed Iterations for the Approach-Evasion Differential Game), Available from VINITI, 1979, Moscow, no. 1933-79.

  23. Melikyan, A.A., Minimal Observations for an Approach Game, Prikl.Mat.Mekh., 1973, vol. 37, no. 3, pp. 426-433.

    Google Scholar 

  24. Melikyan, A.A., Game Cost in a Linear Approach Differential Game, Dokl.Akad.Nauk SSSR, 1977, vol. 237, no. 3, pp. 521-524.

    Google Scholar 

  25. Dyatlov, V.P. and Chentsov, A.G., Monotonic Iterations of Sets and Their Application to Game Control Problems, Kibernetika, 1987, no 2, pp. 92-99.

  26. Ivanov, V.M. and Chentsov, A.G., Control for Discrete Systems on an Infinite Time Interval, Zh.Vychisl.Mat.Mat.Fiz., 1987, vol. 27, no 12, pp. 1780-1789.

    Google Scholar 

  27. Aubin, J.P., Viability Theory, Boston: Birkhäuser, 1992.

    Google Scholar 

  28. Francowska, H. and Quincampoix, M., Viability Kernels of Differential Inclusions with Constraints: Algorithm and Applications, J.Math.Syst.Estimation Control, 1991, vol. 1, no. 3, pp. 371-388.

    Google Scholar 

  29. Cardaliaguet, P., Quincampoix, M., and Saint-Piarre, P., Some Algorithms for Differential Games with Two Players and One Target, Cahiers Math.Decision, 1993, no. 9343, p. 19.

  30. Saint-Pierre, P., Approximation of the Viability Kernel, Appl.Math.Optimiz., 1992, no. 29, pp. 187-209.

  31. Kuratowski, K. and Mostowski, A., Set Theory, Amsterdam: North-Holland, 1967. Translated under the title Teoriya Mnozhestv, Moscow: Mir, 1970.

    Google Scholar 

  32. Dunford, N. and Schwartz, J.T., Linear Operators, New York: Interscience, 1958. Translated under the title Lineinye operatory.Obshchaya teoriya, Moscow: Inostrannaya Litetatura, 1962.

    Google Scholar 

  33. Chentsov, A.G., Relationship between Different Variants of the Programmed Iterations Method: The Positional Variant, Kibern.Sist.Analiz, 2002, no. 3, pp. 130-149.

  34. Berge, C., Théorié général des jeux a n personnes, Paris: Gauthier-Villars, 1957. Translated under the title Obshchaya teoriya igr neskol'kikh lits, Moscow: Izd. Fiz. Mat. Lit., 1961.

    Google Scholar 

  35. Chentsov, A.G., Duality of Different Variants of the Programmed Iteration Method, Izv.Vuzov, Mat., 2001, no. 12, pp. 77-88.

  36. Subbotin, A.I. and Chentsov, A.G., An Iterative Procedure for Constructing Minimax and Viscous Solutions of the Hamilton-Jacobi Equations and Its Generalization, Trudy MIAN, 1999, vol. 224, pp. 311-334.

    Google Scholar 

  37. Kelley, J.L., General Topology, New York: Van Nostrand, 1957. Translated under the title Obshchaya topologiya, Moscow: Nauka, 1981.

    Google Scholar 

  38. Engelking, R., General Topology, Warszawa: PWN, 1985. Translated under the title Obshchaya topologiya, Moscow: Mir, 1986.

    Google Scholar 

  39. Chentsov, A.G., An Iterative Realization of Nonanticipating Set-Valued Mappings, Izv.Vuzov, Mat., 2000, no. 3, pp. 66-76.

  40. Chentsov, A.G., Nonanticipating Selectors of Set-Valued Mappings and Iterated Procedures, Funct.Differ.Equat., 1999, vol. 6, no. 3-4, pp. 249-274.

    Google Scholar 

  41. Chentsov, A.G., Nonanticipating Set-Valued Mappings and Their Construction by the Iterated Procedure. I, Diff.Uravn., 2001, vol. 37, no. 4, pp. 470-480.

    Google Scholar 

  42. Chentsov, A.G., Nonanticipating Set-Valued Mappings and Their Construction by the Iterated Procedure. II, Diff.Uravn., 2001, vol. 37, no. 5, pp. 679-688.

    Google Scholar 

  43. Krasovskii, N.N., and Chentsov, A.G., On the Design of Differential Games. I, Probl.Control Inf.Theory, 1977, vol. 6, no. 5-6, pp. 381-395.

    Google Scholar 

  44. Krasovskii, N.N. and Chentsov, A.G., On the Design of Differential Games. II, Probl.Control Inf.Theory, 1979, vol. 9, no. 1, pp. 3-11.

    Google Scholar 

  45. Chentsov, A.G. and Morina, S.I., Extensions and Relaxations, London: Kluwer Academic, 2002.

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics and Mechanics, Ural Branch, Russian Academy of Sciences, Yekaterinburg, Russia

    A. G. Chentsov

Authors
  1. A. G. Chentsov
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chentsov, A.G. An Abstract Confinement Problem: A Programmed Iterations Method of Solution. Automation and Remote Control 65, 299–310 (2004). https://doi.org/10.1023/B:AURC.0000014727.63912.45

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/B:AURC.0000014727.63912.45

Keywords

Search

Navigation