Coplanar tail-chase aerial combat as a differential game

Abstract

A reduced-order version of the one-on-one aerial combat problem is studied as a pursuit-evasion differential game. The coplanar motion takes place at given speeds and given maximum available turn rates, and is described by three state equations which are equivalent to the range, bearing, and heading of one aircraft relative to the other. The purpose of the study is to determine those relative geometries from which either aircraft can be guaranteed a win, regardless of the maneuver strategies of the other. Termination is specified by the tail-chase geometry, at which time the roles of pursuer and evader are known. The roles are found in general, together with the associated optimal turn maneuvers, by solution of the differential game of kind. For the numerical parameters chosen, neither aircraft can win from the majority of possible initial conditions if the other turns optimally in certain critical geometries.