Problems of Linear Discrete Games of Pursuit
Matematičeskie zametki, Tome 77 (2005) no. 5, pp. 707-718
Voir la notice de l'article provenant de la source Math-Net.Ru
In this paper, we consider two problems of linear discrete games of pursuit. In each of them, the terms of the sequence defining the pursuer's control are bounded by some positive number. In the first problem, the terms of the sequence defining the quarry's control are bounded by some positive number and, in the second problem, the sum of the $p$th powers of the terms of this sequence is bounded by a given number. For each problem, we obtain a necessary and sufficient condition for the termination of pursuit from all points in space.
@article{MZM_2005_77_5_a4,
author = {G. I. Ibragimov},
title = {Problems of {Linear} {Discrete} {Games} of {Pursuit}},
journal = {Matemati\v{c}eskie zametki},
pages = {707--718},
publisher = {mathdoc},
volume = {77},
number = {5},
year = {2005},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/MZM_2005_77_5_a4/}
}
G. I. Ibragimov. Problems of Linear Discrete Games of Pursuit. Matematičeskie zametki, Tome 77 (2005) no. 5, pp. 707-718. http://geodesic.mathdoc.fr/item/MZM_2005_77_5_a4/