Minimax range/Barrier trajectories and their application to pursuit-evasion combat problems

This paper discusses the modeling of combat problems as minimax range, free final time and state, zero-sum perfect information differential games. The advantages of this formulation are 1) it is a more realistic representation of the combat problem, 2) no barriers occur in the resulting game, and 3) the problem is amenable to solution by a recently developed technique for generating near optimal closed-loop solutions to differential games. Two simple examples of combat problems using this formulation are presented.