Optimal Discrete Search with Imperfect Specificity

Abstract

A target is hidden in one of several possible locations, and the objective is to find the target as fast as possible. One common measure of effectiveness for the search process is the expected time of the search. This type of search optimization problem has been addressed and solved in the literature for the case where the searcher has imperfect sensitivity (possible false negative results), but perfect specificity (no false positive detections). In this paper, which is motivated by recent military and homeland security search situations, we extend the results to the case where the search is subject to false positive detections.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Apr 16, 2007
Accession Number
ADA598899

Entities

People

  • Kyle Y. Lin
  • Moshe Kress
  • Roberto Szechtman

Organizations

  • Naval Postgraduate School

Tags

Communities of Interest

  • Counter IED
  • Materials and Manufacturing Processes
  • Sensors

DTIC Thesaurus Topics

  • Aircrafts
  • Algorithms
  • Detection
  • Detectors
  • Dynamic Programming
  • Equations
  • Explosive Devices
  • Homeland Security
  • Ied Detection
  • Improvised Explosive Devices
  • Numerical Analysis
  • Operations Research
  • Probability
  • Probability Distributions
  • Search Theory
  • Security
  • Sequences

Readers

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