Optimal Whereabouts Search for a Moving Target

Abstract

This paper shows that solving the optimal whereabouts search problem for a moving target is equivalent to solving a finite number of optimal detection problems for moving targets. This generalizes the result of Kadane (5) for stationary targets.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Nov 15, 1979
Accession Number
ADA079802

Entities

People

  • Joseph B. Kadane
  • Lawrence D. Stone

Organizations

  • Stanford University

Tags

Communities of Interest

  • Materials and Manufacturing Processes
  • Weapons Technologies

DTIC Thesaurus Topics

  • Abstracts
  • Algorithms
  • Classification
  • Computer Programs
  • Detection
  • False Targets
  • Identities
  • Iterations
  • Markov Processes
  • Military Research
  • Moving Targets
  • Probability
  • Probability Distributions
  • Security
  • Stationary
  • Stochastic Processes
  • Targets

Readers

  • Operations Research
  • Sensor Fusion and Tracking Systems.