Criteria and approximate methods for path-constrained moving-target search problems

Criteria and approximate methods for path-constrained moving-target search problems

0.00 Avg rating0 Votes
Article ID: iaor19951408
Country: United States
Volume: 42
Issue: 1
Start Page Number: 27
End Page Number: 38
Publication Date: Feb 1995
Journal: Naval Research Logistics
Authors: ,
Keywords: search
Abstract:

A search is conducted for a target moving in discrete time among a finite number of cells according to a known Markov process. The searcher must choose one cell in which to search in each time period. The set of cells available for search depends upon the cell chosen in the last time period. The problem is to find a search path, i.e., a sequence of search cells, that either maximizes the probability of detection or minimizes the mean number of time periods required for detection. The search problem is modelled as a partially observable Markov decision process and several approximate solutions procedures are proposed.

Reviews

Required fields are marked *. Your email address will not be published.