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

Optimal search plan minimizing the expected risk of the search for a target with conditionally deterministic motion

Author

Listed:
  • Köji Iida

Abstract

This article deals with a search problem for a moving target with a rather simple type of motion called factorable conditionally deterministic. A search plan is characterized by (ϕ, T), the elements of which specify how to search and when to stop the search, respectively. The problem is to find the optimal search plan which minimizes the expected risk (the expected search cost minus the expected reward). We obtain conditions for the optimal search plan, and applying the theorems, we derive the optimal search plan in a closed form for the case in which the target moves straight from a fixed point selecting his course and speed randomly.

Suggested Citation

  • 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.
    • Handle: RePEc:wly:navres:v:36:y:1989:i:5:p:597-613
    DOI: 10.1002/1520-6750(198910)36:53.0.CO;2-7
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/1520-6750(198910)36:53.0.CO;2-7
    Download Restriction: no
    File URL: https://libkey.io/10.1002/1520-6750(198910)36:53.0.CO;2-7?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. John M. Danskin, 1968. "A Helicopter Versus Submarine Search Game," Operations Research, INFORMS, vol. 16(3), pages 509-517, June.
    3. Lawrence D. Stone, 1979. "Necessary and Sufficient Conditions for Optimal Search Plans for Moving Targets," Mathematics of Operations Research, INFORMS, vol. 4(4), pages 431-440, November.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Joseph Foraker & Johannes O. Royset & Isaac Kaminer, 2016. "Search-Trajectory Optimization: Part I, Formulation and Theory," Journal of Optimization Theory and Applications, Springer, vol. 169(2), pages 530-549, May.

    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. 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.
    2. Ryusuke Hohzaki, 2008. "A search game taking account of attributes of searching resources," Naval Research Logistics (NRL), John Wiley & Sons, vol. 55(1), pages 76-90, February.
    3. Hohzaki, Ryusuke, 2006. "Search allocation game," European Journal of Operational Research, Elsevier, vol. 172(1), pages 101-119, July.
    4. Ryusuke Hohzaki, 2009. "A cooperative game in search theory," Naval Research Logistics (NRL), John Wiley & Sons, vol. 56(3), pages 264-278, April.
    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. Lyn C. Thomas & James N. Eagle, 1995. "Criteria and approximate methods for path‐constrained moving‐target search problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 42(1), pages 27-38, February.
    8. J F J Vermeulen & M van den Brink, 2005. "The search for an alerted moving target," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(5), pages 514-525, May.
    9. J. R. Weisinger & S. J. Benkoski, 1989. "Optimal layered search," Naval Research Logistics (NRL), John Wiley & Sons, vol. 36(1), pages 43-60, February.
    10. Delavernhe, Florian & Jaillet, Patrick & Rossi, André & Sevaux, Marc, 2021. "Planning a multi-sensors search for a moving target considering traveling costs," European Journal of Operational Research, Elsevier, vol. 292(2), pages 469-482.
    11. 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.
    12. Hohzaki, Ryusuke & Iida, Koji, 2000. "A search game when a search path is given," European Journal of Operational Research, Elsevier, vol. 124(1), pages 114-124, July.
    13. 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.
    14. 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.
    15. Robert F. Dell & James N. Eagle & Gustavo Henrique Alves Martins & Almir Garnier Santos, 1996. "Using multiple searchers in constrained‐path, moving‐target search problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 43(4), pages 463-480, June.
    16. Ryusuke Hohzaki, 2007. "Discrete search allocation game with false contacts," Naval Research Logistics (NRL), John Wiley & Sons, vol. 54(1), pages 46-58, February.

    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:5:p:597-613. 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.