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

Technical Note—The Complexity of the Optimal Searcher Path Problem

Author

Listed:
  • K. E. Trummel

    (Daniel H. Wagner, Associates, Sunnyvale, California)

  • J. R. Weisinger

    (Daniel H. Wagner, Associates, Sunnyvale, California)

Abstract

In this note we show that the problem of finding an optimal searcher path that maximizes the probability of detecting a stationary target by the end of a fixed time is NP-complete. We also demonstrate that the problem of finding a path that minimizes mean time to detection is NP-hard.

Suggested Citation

  • K. E. Trummel & J. R. Weisinger, 1986. "Technical Note—The Complexity of the Optimal Searcher Path Problem," Operations Research, INFORMS, vol. 34(2), pages 324-327, April.
    • Handle: RePEc:inm:oropre:v:34:y:1986:i:2:p:324-327
    DOI: 10.1287/opre.34.2.324
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.34.2.324
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.34.2.324?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. Ben Hermans & Roel Leus & Jannik Matuschke, 2022. "Exact and Approximation Algorithms for the Expanding Search Problem," INFORMS Journal on Computing, INFORMS, vol. 34(1), pages 281-296, January.
    2. Steven M. Shechter & Farhad Ghassemi & Yasin Gocgun & Martin L. Puterman, 2015. "Technical Note—Trading Off Quick versus Slow Actions in Optimal Search," Operations Research, INFORMS, vol. 63(2), pages 353-362, April.
    3. Bourque, François-Alex, 2019. "Solving the moving target search problem using indistinguishable searchers," European Journal of Operational Research, Elsevier, vol. 275(1), pages 45-52.
    4. Jesse Pietz & Johannes O. Royset, 2013. "Generalized orienteering problem with resource dependent rewards," Naval Research Logistics (NRL), John Wiley & Sons, vol. 60(4), pages 294-312, June.
    5. 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.
    6. Nikolai Stein & Jan Meller & Christoph M. Flath, 2018. "Big data on the shop-floor: sensor-based decision-support for manual processes," Journal of Business Economics, Springer, vol. 88(5), pages 593-616, July.
    7. T. C. E. Cheng & B. Kriheli & E. Levner & C. T. Ng, 2021. "Scheduling an autonomous robot searching for hidden targets," Annals of Operations Research, Springer, vol. 298(1), pages 95-109, March.
    8. Morin, Michael & Abi-Zeid, Irène & Quimper, Claude-Guy, 2023. "Ant colony optimization for path planning in search and rescue operations," European Journal of Operational Research, Elsevier, vol. 305(1), pages 53-63.
    9. Jean Berger & Nassirou Lo & Mohamed Barkaoui, 2016. "Static target search path planning optimization with heterogeneous agents," Annals of Operations Research, Springer, vol. 244(2), pages 295-312, September.

    More about this item

    Keywords

    751 optimal searcher path problem;

    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:34:y:1986:i:2:p:324-327. 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.