Analysis of Maritime Air Defence Scenarios

Abstract

In this paper, we examine scenarios of maritime air defence where the threats can be of different types i.e., characterizedby varying different single shot probabilities of hit. We develop a methodology that integrates constrained optimization calculus, dynamic programming and a genetic algorithm to determine the optimal allocation of interceptors that globally maximize the probability of raid annihilation. We call this strategy the Heterogeneous tactic. We show that the improvement in the probability of raid annihilation could exceed thirty percent for one scenario examined, relative to a Shoot-Look-Shoot tactic with fixed size salvos.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jun 01, 2014
Accession Number
AD1017594

Entities

People

  • Bao Nguyen
  • Suruz Miah

Organizations

  • Defence Research and Development Canada

Tags

Communities of Interest

  • Ground and Sea Platforms
  • Sensors
  • Weapons Technologies

DTIC Thesaurus Topics

  • Air Defense
  • Algorithms
  • Chromosomes
  • Computer Programming
  • Computers
  • Defense Systems
  • Demographic Cohorts
  • Dynamic Programming
  • Genetic Algorithms
  • Intervals
  • Iterations
  • Operations Research
  • Optimization
  • Personal Computers
  • Perturbation Theory
  • Probability
  • Weapons

Readers

  • Computational Modeling and Simulation
  • Marksmanship and Weaponry.
  • Operations Research

Technology Areas

  • AI & ML
  • AI & ML - Bayesian Inference
  • AI & ML - DoD AI Strategy
  • AI & ML - Machine Learning Algorithms
  • Biotechnology