A game of optimal pursuit of one non-inertial object by two inertial objects (Q1086181)

A game in which one controlled object is pursued by two others is studied. The pursuing objects are inertial, and the pursued object is not. The duration of the game is fixed. The payoff functional is the distance between the pursued object and the closest pursuer at the instant when the game ends. An algorithm for determining the payoff function for all possible positions is constructed. It is shown that the game space consists of several domains in which the payoff is expressed analytically, or is determined by solving a certain non-linear equation. Strategies of the pursuers which guarantee them a result as close to the game payoof as desired are indicated.