Myopic Search Plans.

Abstract

Different strategies can be used to search for a moving object. If the searcher's action at each time unit maximizes his chances of immediate detection, his strategy is said to be myopic. If, however, the searcher seeks to allocate search effort to maximize the probability of detecting the target within a preset amount of time, his strategy is called optimal. This thesis documents interactive computer programs that are useful for testing search strategies against the myopic strategy, and shows examples where the myopic strategy is not optimal.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Sep 01, 1978
Accession Number
ADA061419

Entities

People

  • Antonio Francisco De Paula Neto

Organizations

  • Naval Postgraduate School

Tags

Communities of Interest

  • Sensors

DTIC Thesaurus Topics

  • Algorithms
  • Bayes Theorem
  • Boundaries
  • California
  • Cells
  • Computer Programs
  • Computers
  • Detection
  • Instructions
  • Intellectual Property
  • Network Protocols
  • Operations Research
  • Probability
  • Probability Distributions
  • Random Walk
  • Schools

Readers

  • Civilian Systems Systems Program Capability Development and Upgrade Support Activity Expense and Pay Management.
  • Computer Science/Computer Engineering/Data Science/Digital Signal Processing.
  • Defense Acquisition Program Management