IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v29y1981i2p309-323.html
   My bibliography  Save this article

Optimal Survivor Search with Multiple States

Author

Listed:
  • Joseph H. Discenza

    (United States Coast Guard, Springfield, Virginia)

  • Lawrence D. Stone

    (Daniel H. Wagner, Associates, Paoli, Pennsylvania)

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.

Suggested Citation

  • Joseph H. Discenza & Lawrence D. Stone, 1981. "Optimal Survivor Search with Multiple States," Operations Research, INFORMS, vol. 29(2), pages 309-323, April.
    • Handle: RePEc:inm:oropre:v:29:y:1981:i:2:p:309-323
    DOI: 10.1287/opre.29.2.309
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.29.2.309
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.29.2.309?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:oropre:v:29:y:1981:i:2:p:309-323. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.