Differential game an conventional ways to solve the pursuit problem

Puruit on a plane of targets whose maneuverability is limited is viewed as a differential game with time as payoff. Analysis of this game suggests an algorithm for solving this problem for a target which maneuvers unpredictably. The efficiencies of this and conventional ways to solve the pursuit problem are compared and the potential of developing an optimal strategy for a differential game with a square payoff functional is evaluated; the expected lines of further research are outlined.