No abstract

No abstract

Public reporting burden tor this collection Ot intormation is estimated to average 1 hour per response, including the time for reviewing instructions, searching existing data sources, gathering and maintaining the data needed, and completing and reviewing the collection of information. This paper describes two methods used for producing trajectories, which enable an interceptor aircraft to perform a visual identification on a suspected aircraft. A trajectory typically used by fighter pilots is referred to as a beam intercept. The main goal for the maneuver is to put the interceptor in a relative position and heading with respect to the target such that it is in the best configuration to view the target aircraft's markings. Optimal trajectories complete this maneuver in minimum time and avoid detection. The first approach is formulated as a mixed integer linear programming problem which can be solved in real time. The linear cost function and constraints are adjusted to enable the interceptor to avoid radar detection. However, there are limitations to the accuracy of a radar detection model formed with only linear equations, which might justify using a nonlinear programming formulation. With this approach the interceptor's radar cross section and range between the suspected aircraft and interceptor can be incorporated into the problem formulation.