IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v133y2001i1p120-129.html
   My bibliography  Save this article

Optimal ambushing search for a moving target

Author

Listed:
  • Hohzaki, Ryusuke
  • Iida, Koji

Abstract

No abstract is available for this item.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:ejores:v:133:y:2001:i:1:p:120-129
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(00)00187-9
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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. William H. Ruckle & John R. Reay, 1981. "Ambushing Random Walks III: More Continuous Models," Operations Research, INFORMS, vol. 29(1), pages 121-129, February.
    3. William Ruckle & Robert Fennell & Paul T. Holmes & Charles Fennemore, 1976. "Ambushing Random Walks I: Finite Models," Operations Research, INFORMS, vol. 24(2), pages 314-324, April.
    4. William H. Ruckle, 1981. "Ambushing Random Walks II: Continuous Models," Operations Research, INFORMS, vol. 29(1), pages 108-120, February.
    5. Scott Shorey Brown, 1980. "Optimal Search for a Moving Target in Discrete Time and Space," Operations Research, INFORMS, vol. 28(6), pages 1275-1289, December.
    6. Alan R. Washburn, 1983. "Search for a Moving Target: The FAB Algorithm," Operations Research, INFORMS, vol. 31(4), pages 739-751, August.
    7. Alan Washburn & Kevin Wood, 1995. "Two-Person Zero-Sum Games for Network Interdiction," Operations Research, INFORMS, vol. 43(2), pages 243-251, April.
    8. Bernard O. Koopman, 1957. "The Theory of Search," Operations Research, INFORMS, vol. 5(5), pages 613-626, October.
    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. Duvocelle, Benoit & Flesch, János & Staudigl, Mathias & Vermeulen, Dries, 2022. "A competitive search game with a moving target," European Journal of Operational Research, Elsevier, vol. 303(2), pages 945-957.
    2. Alpern, Steve & Fokkink, Robbert & Simanjuntak, Martin, 2016. "Optimal search and ambush for a hider who can escape the search region," European Journal of Operational Research, Elsevier, vol. 251(3), pages 707-714.

    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. T. Lee, 1990. "On ruckle's game of ambush," Naval Research Logistics (NRL), John Wiley & Sons, vol. 37(3), pages 355-363, June.
    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. V. J. Baston & F. A. Bostock, 1987. "A continuous game of ambush," Naval Research Logistics (NRL), John Wiley & Sons, vol. 34(5), pages 645-654, October.
    4. Garrec, Tristan, 2019. "Continuous patrolling and hiding games," European Journal of Operational Research, Elsevier, vol. 277(1), pages 42-51.
    5. 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.
    6. I.D. Woodward, 2003. "Discretization of the continuous ambush game," Naval Research Logistics (NRL), John Wiley & Sons, vol. 50(5), pages 515-529, August.
    7. 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.
    8. Joseph Kadane, 2015. "Optimal discrete search with technological choice," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 81(3), pages 317-336, June.
    9. Patriksson, Michael, 2008. "A survey on the continuous nonlinear resource allocation problem," European Journal of Operational Research, Elsevier, vol. 185(1), pages 1-46, February.
    10. Vic Baston & Kensaku Kikuta, 2009. "Technical Note---An Ambush Game with a Fat Infiltrator," Operations Research, INFORMS, vol. 57(2), pages 514-519, April.
    11. V. J. Baston & F. A. Bostock, 1989. "A one‐dimensional helicopter‐submarine game," Naval Research Logistics (NRL), John Wiley & Sons, vol. 36(4), pages 479-490, August.
    12. Joseph B. Kadane, 2015. "Optimal discrete search with technological choice," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 81(3), pages 317-336, June.
    13. Hohzaki, Ryusuke, 2006. "Search allocation game," European Journal of Operational Research, Elsevier, vol. 172(1), pages 101-119, July.
    14. Vic Baston & Kensaku Kikuta, 2004. "An Ambush Game with an Unknown Number of Infiltrators," Operations Research, INFORMS, vol. 52(4), pages 597-605, August.
    15. 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.
    16. Brian Lunday & Hanif Sherali, 2012. "Network interdiction to minimize the maximum probability of evasion with synergy between applied resources," Annals of Operations Research, Springer, vol. 196(1), pages 411-442, July.
    17. 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.
    18. Duvocelle, Benoit & Flesch, János & Staudigl, Mathias & Vermeulen, Dries, 2022. "A competitive search game with a moving target," European Journal of Operational Research, Elsevier, vol. 303(2), pages 945-957.
    19. Hohzaki, Ryusuke & Iida, Koji, 1997. "Optimal strategy of route and look for the path constrained search problem with reward criterion," European Journal of Operational Research, Elsevier, vol. 100(1), pages 236-249, July.
    20. Baykal-Gürsoy, Melike & Duan, Zhe & Poor, H. Vincent & Garnaev, Andrey, 2014. "Infrastructure security games," European Journal of Operational Research, Elsevier, vol. 239(2), pages 469-478.

    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:eee:ejores:v:133:y:2001:i:1:p:120-129. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.