A group pursuit problem of rigidly connected evaders
Izvestiya Instituta Matematiki i Informatiki Udmurtskogo Gosudarstvennogo Universiteta, Tome 25 (2002) no. 2, pp. 31-34.

Voir la notice de l'article provenant de la source Math-Net.Ru

The decision condition of one pursuit problem of the hardunited evader group are derived.
@article{IIMI_2002_25_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},
     publisher = {mathdoc},
     volume = {25},
     number = {2},
     year = {2002},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/IIMI_2002_25_2_a6/}
}
TY  - JOUR
AU  - D. A. Vagin
TI  - A group pursuit problem of rigidly connected evaders
JO  - Izvestiya Instituta Matematiki i Informatiki Udmurtskogo Gosudarstvennogo Universiteta
PY  - 2002
SP  - 31
EP  - 34
VL  - 25
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/IIMI_2002_25_2_a6/
LA  - ru
ID  - IIMI_2002_25_2_a6
ER  - 
%0 Journal Article
%A D. A. Vagin
%T A group pursuit problem of rigidly connected evaders
%J Izvestiya Instituta Matematiki i Informatiki Udmurtskogo Gosudarstvennogo Universiteta
%D 2002
%P 31-34
%V 25
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/IIMI_2002_25_2_a6/
%G ru
%F IIMI_2002_25_2_a6
D. A. Vagin. A group pursuit problem of rigidly connected evaders. Izvestiya Instituta Matematiki i Informatiki Udmurtskogo Gosudarstvennogo Universiteta, Tome 25 (2002) no. 2, pp. 31-34. http://geodesic.mathdoc.fr/item/IIMI_2002_25_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