A group pursuit problem of rigidly connected evaders
Izvestiya Instituta Matematiki i Informatiki Udmurtskogo Gosudarstvennogo Universiteta, no. 2 (2002), pp. 31-34
Cet article a éte moissonné depuis la source Math-Net.Ru
The decision condition of one pursuit problem of the hardunited evader group are derived.
@article{IIMI_2002_2_a6,
author = {D. A. Vagin},
title = {A group pursuit problem of rigidly connected evaders},
journal = {Izvestiya Instituta Matematiki i Informatiki Udmurtskogo Gosudarstvennogo Universiteta},
pages = {31--34},
year = {2002},
number = {2},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/IIMI_2002_2_a6/}
}
D. A. Vagin. A group pursuit problem of rigidly connected evaders. Izvestiya Instituta Matematiki i Informatiki Udmurtskogo Gosudarstvennogo Universiteta, no. 2 (2002), pp. 31-34. http://geodesic.mathdoc.fr/item/IIMI_2002_2_a6/
[1] Pshenichnyi B. N., “Prostoe presledovanie neskolkimi ob'ektami”, Kibernetika, 1976, no. 3, 145–146
[2] Petrov N. N., Teoriya igr, Izd-vo Udmurtsk. un-ta, Izhevsk, 1997, 192 pp. | MR | Zbl
[3] Vagin D. A., Petrov N. N., “Prostoe presledovanie zhestkoskoordinirovannykh ubegayuschikh”, Izv. RAN. Teoriya i sistemy upravleniya, 2001, no. 5, 75–79 | MR | Zbl