A pursuit-evasion differential game with slow pursuers on the edge graph of simplexes. I

Abstract

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.

Topics

Identifiers

DOI

10.17076/mgta_2020_4_23

Citations and references