A Simple Model of Search for a Moving Target

Stephen M. Pollock
Additional contact information
Stephen M. Pollock: University of Michigan, Ann Arbor, Michigan

Operations Research, 1970, vol. 18, issue 5, 883-903

Abstract: A target moves between two regions in a Markovian fashion, the parameters of which are known to the searcher. Discrete amounts of search effort (“looks”) may be allocated to one region at a time. This paper gives equations that characterize (a) the minimum expected number of looks to detect the target, and (b) the maximum probability of detecting the target within a given number of looks. These are solved completely for special cases, and numerical approximate solutions are described for general cases.

Date: 1970
References: Add references at CitEc
Citations: View citations in EconPapers (9)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.18.5.883 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:18:y:1970:i:5:p:883-903

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().