The Elements of the Operator Convexity in the Construction of the Programmed Iteration Method

The problem of retention studied here can be regarded (in the case of bounded control interval) as a variant of the approach problem within the given constraints in the phase space and the target set given by the hyperplane of the space positions corresponding to the terminal moment of the process (the retention problem on the infinite horizon also fits the problem stated in the work). The main difference of the problem from the previously considered formulation is the possibility of variation of the spaces of system trajectories and disturbance realizations depending on the initial moment of control. It is shown that the unsolvability set of the retention problem is the operator convex hull of the empty set constructed on the base of programmed absorption operator. Under some additional coherence conditions (on the spaces of system trajectories and disturbance realizations corresponding to different initial moments) the set of successful solvability is constructed as the limit of the iterative procedure in the space of sets, elements of which are positions of the game; in this case the structure of resolving quasistrategy is also given.

Keywords

programmed iterations; operator convexity; quasistrategies.

References

1. Krasovskii N.N., Subbotin A.I. An Alternative for the Game Problem of Convergence. Journal of Applied Mathematics and Mechanics, 1970, vol. 34, no. 6, pp. 948-965. DOI: 10.1016/0021-8928(70)90158-9
2. Krasovskii N.N., Subbotin A.I. Game-Theoretical Control Problems. N.Y., Springer, 1988. 517 p.
3. Krasovskii N.N. Igrovye zadachi o vstreche dvizhenii [Game Problems on Motions Encounter]. Moscow, Nauka, 1970. 420 p.
4. Kryazhimskii A.V. [On the Theory of Positional Differential Games of Approach-Evasion]. Doklady Akademii Nauk SSSR, 1978, vol. 239, no. 4, pp. 779-782. (in Russian)
5. Krasovskii N.N. [Differential Game of Pursuit-Evasion. I]. Izvestiya Akademii Nauk SSSR. Tekhnicheskaya Kibernetika, 1973, no. 2, pp. 3-18. (in Russian)
6. Krasovskii N.N. [Differential Game of Pursuit-Evasion. II]. Izvestiya Akademii Nauk SSSR. Tekhnicheskaya Kibernetika, 1973, no. 3, pp. 22-42. (in Russian)
7. Chentsov A.G. [On the Structure of an Approach Problem]. Doklady Akademii Nauk SSSR, 1975, vol. 224, no. 6, pp. 1272-1275. (in Russian)
8. Chentsov A.G. On a Game Problem of Converging at a Given Instant of Time. Mathematics of the USSR-Sbornik, 1976, vol. 28, no. 3, pp. 353-376. DOI: 10.1070/SM1976v028n03ABEH001657
9. Chentsov A.G. On a Game Problem of Guidance. Soviet Mathematics - Doklady, 1976, vol. 17, pp. 73-77.
10. Chentsov A.G. On a Game Problem of Guidance with Information Memory. Soviet Mathematics - Doklady, 1976, vol. 17, pp. 411-414.
11. Chistyakov S.V. On Solving Pursuit Game Problems. Journal of Applied Mathematics, 1977, vol. 41, no. 5, pp. 845-852. DOI: 10.1016/0021-8928(77)90167-8
12. Ukhobotov V.I. Construction of a Stable Bridge for a Class of Linear Games. Journal of Applied Mathematics, 1977, vol. 41, no. 2, pp. 350-354. DOI: 10.1016/0021-8928(77)90021-1
13. Melikyan A.A. The Value of a Game in a Linear Differential Game of Convergence. Soviet Mathematics - Doklady, 1977, vol. 18, pp. 1457-1461.
14. Chentsov A.G. The Programmed Iteration Method for a Differential Pursuit-Evasion Game. Dep. in VINITI, no. 1933-79, Sverdlovsk, 1979. (in Russian)
15. Chentsov A.G. [About Alternatives in the Class of Quasistrategies for Differential Games of Approach-Evasion], Differentsial'nye uravneniya [Differential equations], 1980, vol. 16, no. 10, pp. 1801-1808. (in Russian)
16. Soltan V.P. Vvedenie v aksiomaticheskuyu teoriyu vypuklosti [Introduction to Axiomatic Theory of Convexity]. Chisinau, Shtinnitsa, 1984. 224 p.
17. Chentsov A.G. On the Problem of Control with a Limited Number of Switching. Dep. in VINITI, no. 4942-В 87, Sverdlovsk, 1987. (in Russian)
18. Chentsov A.G. An Abstract Confinement Problem: a Programmed Iterations Method of Solution. Automation and Remote Control, 2004, vol. 65, no. 2, pp. 299-310. DOI: 10.1023/B:AURC.0000014727.63912.45
19. Chentsov A.G. On Interrelations Between Different Versions of the Method of Program Iterations: A Positional Version. Cybernetics and Systems Analysis, 2002, vol. 38, no. 3, pp. 422-438. DOI: 10.1023/A:1020368828661
20. Chentsov A.G. On the Iterative Realization of Nonanticipating Multivalued Mappings. Russian Mathematics, 2000, vol. 44, no. 3, pp. 63-73.
21. Chentsov A.G. Nonanticipating Multimappings and Their Construction by the Method of Program Iterations: I. Differential equations, 2001, vol. 37, no. 4, pp. 498-509. DOI: 10.1023/A:1019275422741
22. Chentsov A.G. Nonanticipating Multimappings and Their Construction by the Method of Program Iterations: II. Differential equations, 2001, vol. 37, no. 5, pp. 713-723. DOI: 10.1023/A:1019224800877
23. Serkov D.A., Chentsov A.G. [Programmed Iteration Method and Operator Convexity in an Abstract Retention Problem]. Vestnik Udmurtskogo Universiteta. Matematika. Mekhanika. Komp'yuternye Nauki, 2015, vol. 25, no. 3, pp. 348-366. (in Russian) DOI: 10.20537/vm150305
24. Dyatlov V.P., Chentsov A.G. Monotone Iterations of Sets and Their Applications to Game Control Problems. Kibernetika, 1987, vol. 23, no. 2, pp. 92-99.
25. Ivanov V.M., Chentsov A.G. On the Control of Discrete Systems on an Infinite Time Interval. USSR Computational Mathematics and Mathematical Physics, 1987, vol. 27, no. 6, pp. 116-121. DOI: 10.1016/0041-5553(87)90201-1
26. Kuratowski K., Mostowski A. Set Theory. Amsterdam, North-Holland Publishing Company, 1967.
27. Engelking R. General Topology. Pa'nstwowe Wydawnictwo Naukowe, Warszawa, 1977.
28. Bourbaki N. Topologie generale. Chapitre 1,2. Quatrieme edition. Paris, Hermann, 1965. (in French)
29. Aleksandrov P.S. Vvedeniye v teoriyu mnoghestv i obshchuyu topologiyu [Introduction to the Sets Theory of and General Topology]. Moscow, URSS, 2004.