IDEAS home Printed from https://ideas.repec.org/a/wly/navres/v36y1989i1p43-60.html
   My bibliography  Save this article

Optimal layered search

Author

Listed:
  • J. R. Weisinger
  • S. J. Benkoski

Abstract

This article investigates the problem of planning an optimal layered search for a stationary target. A search is layered if it assigns each point in the search space an integer number of glimpses or looks. General necessary and sufficient conditions and an existence theorem are obtained. The special case in which the initial target distribution is bivariate normal is considered in detail.

Suggested Citation

  • J. R. Weisinger & S. J. Benkoski, 1989. "Optimal layered search," Naval Research Logistics (NRL), John Wiley & Sons, vol. 36(1), pages 43-60, February.
    • Handle: RePEc:wly:navres:v:36:y:1989:i:1:p:43-60
    DOI: 10.1002/1520-6750(198902)36:13.0.CO;2-W
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/1520-6750(198902)36:13.0.CO;2-W
    Download Restriction: no
    File URL: https://libkey.io/10.1002/1520-6750(198902)36:13.0.CO;2-W?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
    ---><---

    References listed on IDEAS

    as
    1. Walter R. Stromquist & Lawrence D. Stone, 1981. "Constrained Optimization of Functionals with Search Theory Applications," Mathematics of Operations Research, INFORMS, vol. 6(4), pages 518-529, November.
    2. Lawrence D. Stone, 1983. "Feature Article—The Process of Search Planning: Current Approaches and Continuing Problems," Operations Research, INFORMS, vol. 31(2), pages 207-233, April.
    3. Henry R. Richardson & Joseph H. Discenza, 1980. "The United States Coast Guard Computer‐Assisted Search Planning system (CASP)," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 27(4), pages 659-680, December.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Köji Iida, 1989. "Optimal search plan minimizing the expected risk of the search for a target with conditionally deterministic motion," Naval Research Logistics (NRL), John Wiley & Sons, vol. 36(5), pages 597-613, October.
    2. Frédéric Dambreville & Jean‐Pierre Le Cadre, 2002. "Detection of a Markovian target with optimization of the search efforts under generalized linear constraints," Naval Research Logistics (NRL), John Wiley & Sons, vol. 49(2), pages 117-142, March.
    3. Hohzaki, Ryusuke & Iida, Koji, 2001. "Optimal ambushing search for a moving target," European Journal of Operational Research, Elsevier, vol. 133(1), pages 120-129, August.
    4. Lawrence D. Stone & Alan R. Washburn, 1991. "Introduction special issue on search theory," Naval Research Logistics (NRL), John Wiley & Sons, vol. 38(4), pages 465-468, August.
    5. Robert J. Lipshutz & Lawrence D. Stone, 1992. "Optimal resource extraction with uncertain reserves," Naval Research Logistics (NRL), John Wiley & Sons, vol. 39(2), pages 153-173, March.
    6. Alan R. Washburn, 1998. "Branch and bound methods for a search problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 45(3), pages 243-257, April.
    7. Stanley J. Benkoski & Michael G. Monticino & James R. Weisinger, 1991. "A survey of the search theory literature," Naval Research Logistics (NRL), John Wiley & Sons, vol. 38(4), pages 469-494, August.
    8. Frédéric Dambreville & Jean‐Pierre Le Cadre, 2007. "Constrained minimax optimization of continuous search efforts for the detection of a stationary target," Naval Research Logistics (NRL), John Wiley & Sons, vol. 54(6), pages 589-601, September.
    9. Donatien Agbissoh OTOTE & Benshuai Li & Bo Ai & Song Gao & Jing Xu & Xiaoying Chen & Guannan Lv, 2019. "A Decision-Making Algorithm for Maritime Search and Rescue Plan," Sustainability, MDPI, vol. 11(7), pages 1-16, April.

    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:wly:navres:v:36:y:1989:i:1:p:43-60. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1520-6750 .

    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.