The Ideal Search Theorem

Abstract

It is frequently desired to find the best search plan to detect a given target, in the sense of that plan of a given total track length which gives the maximum probability of detection. It is usually impossible to find an analytic solution to this problem. The usual method of attack is to construct a number of plans, and compute the value of P for varying parameters to maximize P. This method is hampered by a lack of knowledge of any upper bound to P, and even if the optimum plan were found, it would be difficult to establish the fact that there is no better plan. The ideal search theorem furnishes such an upper bound. It many cases, it will be found that a trial plan yields a value of P which is not very much below (P sub I). In such cases one knows immediately that not much improvement is possible, and no further efforts need be made.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Oct 23, 1946
Accession Number
ADA006824

Entities

Organizations

  • Center for Naval Analyses

Tags

DTIC Thesaurus Topics

  • Commerce
  • Detection
  • Equations
  • Mathematics
  • Naval Operations
  • Operations Research
  • Personality
  • Probability
  • Test And Evaluation
  • Virginia

Fields of Study

  • Mathematics

Readers

  • Applied Combinatorial Optimization and Logic Circuit Design.
  • Linear Algebra
  • Systems Analysis and Design