Date of Award

12-13-1994

Document Type

Thesis

Degree Name

Master of Science

Department

Department of Electrical and Computer Engineering

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.

AFIT Designator

AFIT-GCS-ENG-94D-05

DTIC Accession Number

ADA289284

Share

COinS