This thesis examines the use of an artificial intelligence technique, hierarchical planning, to solve the problem of generating an aircraft route and finding a path through various hostile environments. A route or path, is evaluated by the number and type of threats the aircraft encounters on the route and the route length. An algorithm using hierarchical planning is presented and tested against several hostile environments. Specifically, the algorithms will divide the problem space or grid, into smaller spaces or boxes. These boxes are then assigned values based upon the input hostile environment. Block paths are then constructed and evaluated based on the values in the boxes. An exhaustive search is performed on the two best block paths to find a flight path for the aircraft. Test results are compared to previous results obtained using heuristic search and indicate an improvement in solution quality. Although specific plans are incorporated into the algorithm to obtain test results, many other plans within the realm of hierarchical planning certainly exist and could be used to solve this problem.
Generation of Flight Paths Using Hierarchical Planning
1985
265 pages
Report
Keine Angabe
Englisch
Aeronautics , Routing , Flight paths , Threat evaluation , Hierarchies , Problem solving , Searching , Aircraft , Algorithms , Value , Grids , Enemy , Quality , Solutions(General) , Theses , Artificial intelligence , Paths , Planning , Environments , Input , Threats , Hierachical planning , Hostile environments
Planning Flight Paths of Autonomous Aerobots
NTRS | 2009
|Generation of Flight Paths Using Heuristic Search
NTIS | 1984
|Circular flight paths using DME
Engineering Index Backfile | 1968
|Optimal flight paths for soaring flight
AIAA | 1974
|Optimal Flight Paths for Soaring Flight
AIAA | 1975
|