The Optimal Search for a Moving Target When the Search Path Is Constrained.

Abstract

A search is conducted for a target moving in discrete time between a finite number of cells according to a known Markov process. The set of cells available for search in a given time period is a function of the cell searched in the previous time period. The problem is formulated and solved as a partially observable Markov decision process (POMDP). A finite time horizon POMDP solution technique is presented which is simpler than the standard linear programming methods. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Aug 01, 1982
Accession Number
ADA119346

Entities

People

  • James N. Eagle

Organizations

  • Naval Postgraduate School

Tags

Communities of Interest

  • C4I
  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Algorithms
  • Applied Mathematics
  • Cells
  • Computer Programming
  • Detection
  • Dynamic Programming
  • Evolutionary Algorithms
  • Linear Programming
  • Markov Processes
  • Moving Targets
  • New York
  • Nonlinear Programming
  • Operations Research
  • Probability
  • Schools
  • Search Theory
  • Standards

Fields of Study

  • Mathematics

Readers

  • Adaptive Control and Estimation with Uncertainty in Dynamic Systems.