<div class="description">
<p>This thesis develops a method for quickly selecting a good flight path for an aircraft flying from its base to its mission objective when the flight path must be over a geographic area containing hostile radar installations. Several models are developed in detail and then integrated permitting a shortest path algorithm to be used to find a route from a starting location to a goal that approximately minimizes probability of detection. Fuel, time and distance constraints are incorporated indirectly, but one strong assumption is made: Detections are assumed independent across network edges and among different radars. A test program is written in FORTRAN and run on a desktop PC using a battery of tests to validate the model. Problems designed with predictable paths having zero probability of detection are solved in a few hundred or thousand seconds for the predicted, optimal paths. Results on problems having non-zero probabilities of detection are less conclusive, but indicate that the method has promise. Errors due to computations and assumptions, as well as their bounds, are discussed, as are recommendations for further model development.
</p>
<br>Subjects:</div>
<div class="fn value">
Leary, John J.</div>
Internet Archive identifier