Evasion problem in a differential game with geometric constraints

In this paper, we study the evasion game of high speed evader involving two pursuers and a single evader with geometric constraints on the control parameters of the players in the plane. The game is described by linear equations. Evasion is said to be possible if the state of the evader doesn't coincide with the state of any pursuer for all time. We construct an evasion strategy for the evader which ensure completion the evasion game for any initial positions of players. In addition, we introduce a new concept of approach times and demonstrate that the number of approach times does not exceed 3.