Solvability sets in a pursuit game with two pursuers and one evader

We consider a differential game with two pursuers and one evader. The dynamics of each object is described by a linear stationary system in general form with a scalar control. The payoff is the minimum of two one-dimensional misses between the first pursuer and the evader and between the second pursuer and the evader. Misses are counted at fixed times. An algorithm for constructing level sets of the value function (solvability sets of the game problem) is described. For the case of “strong” pursuers we give methods for the construction of optimal strategies. Numerical results are presented. This zero-sum game can be useful for studying the concluding stage of a space pursuit involving two pursuing objects and one evading object.