{'fraction_non_alphanumeric': 0.020210896309314587, 'fraction_numerical': 0.0, 'mean_word_length': 4.666666666666667, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Optimal Aircraft Routing in a Constrained Path-Dependent Environment

Abstract : In this thesis, we present a method of automatically generating a route of flight for an aircraft, or a group of aircraft flying in formation, from an origin to a destination in the presence of threats. The threats encountered at a point of the route are a function of the route used to arrive there. The route is constrained by limits on one or more resources, such as fuel and time, expended over the course of the route. We use a C++ program to implement the method for two scenarios. In the first scenario, we generate optimal routes for a path-dependent radar threat environment. We then compare these results with routes generated for a path-independent radar threat. In a second scenario, we generate a route for a three-dimensional airspace over terrain in the presence of two constraints and multiple threats that vary dependent upon the route taken. The computing time required to generate a route is sufficiently short for use of the method in mission planning tools. Recommendations for future research and model improvement conclude the thesis.