Accession Number : ADA289284

Title :   Multicriteria Mission Route Planning Using A Parallel A* Search.

Descriptive Note : Master's thesis,

Corporate Author : AIR FORCE INST OF TECH WRIGHT-PATTERSON AFB OH SCHOOL OF ENGINEERING

Personal Author(s) : Gudaitis, Michael S.

PDF Url : ADA289284

Report Date : 13 DEC 1994

Pagination or Media Count : 146

Abstract : The Mission Route Planning (MRP) Problem falls into the general class of multicriteria path search problems. Multiple criteria are evaluated to select an optimal aircraft mission route through a hostile environment. Criteria for distance travelled and radar exposure are combined into a single cost function for route evaluation. Radar calculations are performed dynamically. The A* search algorithm is applied to the MRP problem, and a parallel implementation is developed and tested. A unique combination of distributed OPEN lists with a global CLOSED list strategy produced fast execution times on the Paragon. Test cases for scenarios with 15 radars took less than 5 minutes with 16 processors. Measured performance is far superior to previous efforts.

Descriptors :   *ROUTING, *TACTICAL ANALYSIS, *AIR FORCE PLANNING, ALGORITHMS, FUNCTIONS, COMPUTATIONS, EXPOSURE(GENERAL), MISSION PROFILES, PATHS, RADAR, COSTS, SEARCHING, ENEMY.

Subject Categories : Military Operations, Strategy and Tactics
      Military Intelligence

Distribution Statement : APPROVED FOR PUBLIC RELEASE