Evolving Optimal Submunition Design for Attacking Relocatable Targets

Abstract

Relocatable targets are mobile targets that will stay in a discrete location for an unknown, random length of time before moving to another location. Such targets include mobile missile launchers, air defense units, fuel trucks and other high value targets (e.g. maneuver forces). Using a combination of multiagent simulation and a multiobjective evolutionary algorithm, we evolve optimal submunition design characteristics for attacking relocatable target examined three types of target concealment, and discovered that high probability of detection, short delay times, and multiple submunitions are required for successful engagement.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Nov 15, 2004
Accession Number
ADA428145

Entities

People

  • Keith M. Sullivan
  • Sean Luke

Tags

Communities of Interest

  • Autonomy
  • Energy and Power Technologies
  • Sensors
  • Space
  • Weapons Technologies

DTIC Thesaurus Topics

  • Air Force
  • Algorithms
  • Applied Mathematics
  • Detection
  • Evolutionary Algorithms
  • Genetic Algorithms
  • Intercontinental Ballistic Missiles
  • Multiobjective Optimization
  • Munitions
  • Optimization
  • Probability
  • Simulations
  • Submunitions
  • Unmanned Systems
  • Vehicles
  • War Colleges
  • Weapons

Readers

  • Adaptive Control and Estimation with Uncertainty in Dynamic Systems.
  • Missile Defense Systems.
  • Sensor Fusion and Tracking Systems.