Search for a Moving Target: Upper Bound on Detection Probability

Abstract

Existing algorithms for computing the optimal distribution of effort in search for a moving target operate by producing a sequence of progressively better distributions. This report shows how to compute an upper bound on the detection probability for each of those effort distributions in the case where the detection function is concave.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Oct 01, 1978
Accession Number
ADA063219

Entities

People

  • Alan R. Washburn

Organizations

  • Naval Postgraduate School

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Computations
  • Detection
  • Mathematics
  • Military Research
  • Moving Targets
  • Naval Air Stations
  • Operations Research
  • Probability
  • Security
  • Sequences
  • Stochastic Processes
  • Targets

Readers

  • Graph Algorithms and Convex Optimization.
  • Sensor Fusion and Tracking Systems.