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

Search for a Moving Target: The FAB Algorithm

Author

Listed:
  • Alan R. Washburn

    (Naval Postgraduate School, Monterey, California)

Abstract

We propose and study an iterative Forward And Backward (FAB) algorithm applicable to the problem of computing optimal search plans when the target's motion is modeled by a discrete space and time Markov chain. This paper generalizes the class of objective functions to which the method applies.

Suggested Citation

  • Alan R. Washburn, 1983. "Search for a Moving Target: The FAB Algorithm," Operations Research, INFORMS, vol. 31(4), pages 739-751, August.
    • Handle: RePEc:inm:oropre:v:31:y:1983:i:4:p:739-751
    DOI: 10.1287/opre.31.4.739
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.31.4.739
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.31.4.739?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
    ---><---

    Citations

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


    Cited by:

    1. Baycik, N. Orkun & Sharkey, Thomas C. & Rainwater, Chase E., 2020. "A Markov Decision Process approach for balancing intelligence and interdiction operations in city-level drug trafficking enforcement," Socio-Economic Planning Sciences, Elsevier, vol. 69(C).
    2. 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.
    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. 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.
    5. 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.
    6. Hiroyuki Sato & Johannes O. Royset, 2010. "Path optimization for the resource‐constrained searcher," Naval Research Logistics (NRL), John Wiley & Sons, vol. 57(5), pages 422-440, August.
    7. 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.
    8. 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.
    9. Hohzaki, Ryusuke, 2006. "Search allocation game," European Journal of Operational Research, Elsevier, vol. 172(1), pages 101-119, July.
    10. 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.
    11. Velarde, Luis Guillermo C. & Migon, Helio S. & Alcoforado, David A., 2008. "Hierarchical Bayesian models applied to air surveillance radars," European Journal of Operational Research, Elsevier, vol. 184(3), pages 1155-1162, February.
    12. 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.

    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:31:y:1983:i:4:p:739-751. 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.