|
Trudy Instituta Matematiki i Mekhaniki UrO RAN, 2005, Volume 11, Number 1, Pages 17–25
(Mi timm165)
|
|
|
|
This article is cited in 1 scientific paper (total in 1 paper)
Search under counteraction
V. Yu. Andrianov, N. N. Petrov
Abstract:
In this paper, new problems of guaranteed graph searching are considered. The issue of finding a least
number of pursuers, which are able (in some sense) to complete the search of an “nvisible” evader, is stated.
Received: 01.03.2004
Citation:
V. Yu. Andrianov, N. N. Petrov, “Search under counteraction”, Dynamical systems and control problems, Trudy Inst. Mat. i Mekh. UrO RAN, 11, no. 1, 2005, 17–25; Proc. Steklov Inst. Math. (Suppl.), 2005no. , suppl. 1, S16–S24
Linking options:
https://www.mathnet.ru/eng/timm165 https://www.mathnet.ru/eng/timm/v11/i1/p17
|
Statistics & downloads: |
Abstract page: | 333 | Full-text PDF : | 122 | References: | 61 |
|