Transfinite version of the program iteration method in a convergence game problem for an abstract dynamical system

被引:0
|
作者
Serkov, D. A. [1 ]
机构
[1] Russian Acad Sci, Krasovskii Inst Math & Mech, Ural Branch, Ekaterinburg 620108, Russia
来源
关键词
convergence game problem; program iterations; abstract dynamical system; non-anticipating strategies;
D O I
10.21538/0134-4889-2022-28-3-176-187
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
The game problem of convergence of motions is considered for an abstract dynamical system with a given target set inside the phase constraints. An arbitrary subset of real numbers acts as a time "interval." The target set M and the phase constraints N obey the M subset of N embedding. Nonanticipating multifunctions defined on the histories of disturbances are considered as admissible control strategies. A description of the solvability set and the construction of resolving control strategies based on the method of program iterations are given. At the same time, by increasing the " number" of iterations of the program absorption operator, it is possible to expand (compared to the original version of the method) the areas of applicability due to the weakening or complete rejection of the topological requirements to the system dynamics, the target set, and phase constraints. The proposed constructions and their justification use the technique of fixed points of monotone mappings in partially ordered sets.
引用
收藏
页码:176 / 187
页数:12
相关论文
共 50 条