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.
Optimal Aircraft Routing in a Constrained Path-Dependent Environment
2007
57 pages
Report
No indication
English
Aeronautics , Avionics , Computer Software , Military aircraft , Threats , Routing , Radar , Flight paths , Computer programs , Models , Problem solving , Fuels , Network flows , Computer applications , Scheduling , Three dimensional , Theses , Mission profiles , Networks , Optimization , Path dependent environments , Flight planning , Lagrangian relaxation , Shortest path , Pcsp(Path dependent constrained shortest path problem)
Path-finder: an heuristic approach to aircraft routing
Tema Archive | 1985
|Optimal Aircraft Routing in General Wind Fields
Online Contents | 2009
|Optimal Aircraft Routing in General Wind Fields
AIAA | 2009
|