Optimization of fighter aircraft evasive trajectories for radar threats avoidance

The problem of optimal evasive trajectories of fighter aircraft for radar threats avoidance is studied. At the core of the function is the tactical level trajectory planner that is highly integrated with the mission level planning system. The trajectory planner is described that can find an optimal or sub-optimal trajectory to penetrate through hostile enemy radar threats with a high survivable probability. Calculus of Variations is introduced to deal with the flight constraints and an analytic solution for monostatic radar avoidance has been obtained [1]. Based on the analytic solution, the concept of solution space has been proposed to generate evasive policy sets to cover the characteristic constraints. In the solution space, the Bayesian Decision Theory Combined Dynamic Programming Algorithm is adopted to get the global optimal solution to problem of multiple radars avoidance. The results are compared to other path planning methods, especially the methods of Voronoi diagrams and A*.