Optimal Whereabouts Search for a Moving Target

Lawrence D. Stone and Joseph B. Kadane
Additional contact information
Lawrence D. Stone: Daniel H. Wagner, Associates, Paoli, Pennsylvania
Joseph B. Kadane: Carnegie-Mellon University, Pittsburgh, Pennsylvania

Operations Research, 1981, vol. 29, issue 6, 1154-1166

Abstract: This paper shows that solving the optimal whereabouts search problem for a moving target is equivalent to solving a finite number of optimal detection problems for moving targets. This generalizes the result of Kadane (Kadane, J. B. 1971. Optimal whereabouts search. Opns. Res. 19 894–904.) for stationary targets.

Keywords: 649 optimal search algorithms; 751 whereabouts search for moving targets (search for similar items in EconPapers)
Date: 1981
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.29.6.1154 (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:29:y:1981:i:6:p:1154-1166

Access Statistics for this article

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