Scientific publications

А.А. Азамов, Т.Т. Ибайдуллаев.

Дифференциальная игра сближения-уклонения с медленными преследователями на графе ребер симплекса. I

// Математическая Теория Игр и ее Приложения, т. 12, в. 4. 2020. C. 7-23

Abdulla A. Azamov, Tolanbay T. Ibaydullayev. A pursuit-evasion differential game with slow pursuers on the edge graph of simplexes. I // Mathematical Game Theory and Applications. Vol 12, No 4. 2020. Pp. 7-23

Keywords: differential game, game on a graph, pursuit problem, evasion problem, П-strategy, coefficient of regularity of a simplex, full graph

We consider the differential game between several pursuing points and one evading point moving along the graph of edges of a simplex when maximal quantities of velocities are given. The normalization of the game in the sense of J. von Neumann including the description of classes of admissible strategies is exposed. In the present part of the paper the qualitative problem for the full graph of three dimensional simplex is solved using the strategy of parallel pursuit for a slower pursuer and some numerical coefficient of a simplex characterizing its proximity to the regular one. Next part will be devoted to higher dimensional cases.

DOI: 10.17076/mgta_2020_4_23

Indexed at RSCI, RSCI (WS)

vol_12_4_07-23_azamov.pdf (427 Kb, total downloads: 64)

Last modified: December 23, 2020