Optimal Survivor Search with Multiple States

Joseph H. Discenza and Lawrence D. Stone
Additional contact information
Joseph H. Discenza: United States Coast Guard, Springfield, Virginia
Lawrence D. Stone: Daniel H. Wagner, Associates, Paoli, Pennsylvania

Operations Research, 1981, vol. 29, issue 2, 309-323

Abstract: The optimal survivor search problem is to maximize the probability of finding a moving target alive. The target may be a person missing at sea or lost in a wilderness area. In a multistate target problem, the target is moving and changing states stochastically. Each state may imply different motion and detectability assumptions. We find necessary and sufficient conditions for optimal detection plans for multistate targets. Using these conditions, we extend the algoritnms of Brown and Stone for finding optimal detection search plans for moving targets to multistate target problems, and show that the optimal survivor search problem may be solved as a special case of the multistate target problem.

Date: 1981
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.29.2.309 (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:2:p:309-323

Access Statistics for this article

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