Informational sets in dynamic search problem with several pursuers

被引：0
|
作者：
Berezin, S.B. [1 ]
机构：
[1] MGU im. M.V. Lomonosova, Moscow, Russia
来源：
Vestnik Moskovskogo Universiteta. Ser. 15 Vychislitel'naya Matematika i Kibernetika | 2001年 / 03期
关键词：
Approximation theory - Game theory - Iterative methods - Theorem proving - Visualization;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Visualization of informational sets in the problem of dynamic search is an effective technique of control of search run and pursuers behaviour. The use of the numerical iterative method is expedient for construction of informational sets. A method is suggested for development of approximations for some classes of informational sets in the problem of dynamic search on a plane. Some theorems about properties of the developed approximations are given.
引用
收藏
页码：14 / 18
相关论文
共 50 条
12345