A Genetic Algorithm for Search Route Planning

Abstract

Planning an airborne search for a relocatable target involves minimizing the risk to the crew while maximizing the estimated likelihood of finding targets. When the number of potential sites is small, the problem reduces to finding the best (usually the shortest) route connecting them. When the number of sites is larger, however, the planner must also decide which of them are to be visited. This report presents a genetic algorithm f or selecting both an appropriate set of sites to visit and an appropriate routing pattern. The procedure also accounts for the finite turning radius of the aircraft.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jul 01, 1992
Accession Number
ADA254894

Entities

People

  • James R. Van Zandt

Organizations

  • MITRE Corporation

Tags

Communities of Interest

  • Air Platforms
  • Sensors

DTIC Thesaurus Topics

  • Adaptive Filters
  • Adaptive Systems
  • Air Force
  • Algorithms
  • Computations
  • Coverings
  • Filters
  • Flight Paths
  • Genetic Algorithms
  • Geometry
  • Massachusetts
  • Michigan
  • Plastic Explosives
  • Probability
  • Signal Processing
  • Two Dimensional
  • United States

Readers

  • Applied Combinatorial Optimization and Logic Circuit Design.
  • Sensor Fusion and Tracking Systems.
  • Systems Analysis and Design

Technology Areas

  • AI & ML
  • AI & ML - Autonomous Systems
  • AI & ML - Machine Learning Algorithms
  • Biotechnology