More on a Class of Optimal Search Problems

Abstract

Optimal strategies are investigated for a class of one-dimensional search processes in which the objective is to find a point which is near, but not beyond, a boundary of uncertain location. Problems of this type are encountered in the analysis of mining operations. Upper and lower bounds for the optimal expected payoff are derived, and the optimal search strategies are described explicitly for a large subclass of these processes. Results are obtained by formulating the search as a multistage decision process and using a dynamic programming approach.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Dec 01, 1972
Accession Number
AD0753809

Entities

People

  • Warren W. Willman

Organizations

  • United States Naval Research Laboratory

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Boundaries
  • Classification
  • Degradation
  • Dynamic Programming
  • Equations
  • Information Science
  • Mathematical Analysis
  • Mathematics
  • Military Research
  • Operations Research
  • Probability
  • Probability Distributions
  • Random Variables
  • Search Theory
  • Statistics

Fields of Study

  • Mathematics

Readers

  • Adaptive Control and Estimation with Uncertainty in Dynamic Systems.