Geometric properties of successful solvability sets in pursuit game problems

被引:0
|
作者
Yu. V. Averbukh
机构
[1] Ural Branch of the Russian Academy of Sciences,Institute of Mathematics and Mechanics
关键词
STEKLOV Institute; Game Problem; Position Strategy; Stable Path; Pursuit Problem;
D O I
暂无
中图分类号
学科分类号
摘要
This paper is devoted to the study of the properties of solutions to pursuit-evasion game problems. We study such properties as the connectedness and continuous time dependence of the sections of the successful solvability set. We obtain a sufficient condition for the connectedness and continuous time dependence of sections.
引用
收藏
页码:2 / 9
页数:7
相关论文
共 50 条