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

Effects of cueing in cooperative search

Author

Listed:
  • David E. Jeffcoat
  • Pavlo A. Krokhmal
  • Olesya I. Zhupanska

Abstract

We consider the effects of cueing in a cooperative search mission that involves several autonomous agents. Two scenarios are discussed: one in which the search is conducted by a number of identical search‐and‐engage vehicles and one where these vehicles are assisted by a search‐only (reconnaissance) asset. The cooperation between the autonomous agents is facilitated via cueing, i.e., the information transmitted to the agents by a searcher that has just detected a target. The effect of cueing on the target detection probability is derived from first principles using a Markov chain analysis. In particular, it is demonstrated that the benefit of cueing on the system's effectiveness is bounded. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006

Suggested Citation

  • David E. Jeffcoat & Pavlo A. Krokhmal & Olesya I. Zhupanska, 2006. "Effects of cueing in cooperative search," Naval Research Logistics (NRL), John Wiley & Sons, vol. 53(8), pages 814-821, December.
    • Handle: RePEc:wly:navres:v:53:y:2006:i:8:p:814-821
    DOI: 10.1002/nav.20172
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nav.20172
    Download Restriction: no
    File URL: https://libkey.io/10.1002/nav.20172?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. B. O. Koopman, 1956. "The Theory of Search. II. Target Detection," Operations Research, INFORMS, vol. 4(5), pages 503-531, October.
    2. Lyn C. Thomas & Alan R. Washburn, 1991. "Dynamic Search Games," Operations Research, INFORMS, vol. 39(3), pages 415-422, June.
    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. Laan, Corine M. & van der Mijden, Tom & Barros, Ana Isabel & Boucherie, Richard J. & Monsuur, Herman, 2017. "An interdiction game on a queueing network with multiple intruders," European Journal of Operational Research, Elsevier, vol. 260(3), pages 1069-1080.
    2. Elina Stengård & Ronald van den Berg, 2019. "Imperfect Bayesian inference in visual perception," PLOS Computational Biology, Public Library of Science, vol. 15(4), pages 1-27, April.
    3. 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.
    4. Gordon McCormick & Guillermo Owen, 2019. "A composite game of hide and seek," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 27(1), pages 1-14, March.
    5. 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.
    6. Kompas, Tom & Chu, Long & Nguyen, Hoa Thi Minh, 2016. "A practical optimal surveillance policy for invasive weeds: An application to Hawkweed in Australia," Ecological Economics, Elsevier, vol. 130(C), pages 156-165.
    7. Manisha Bhardwaj & Ronald van den Berg & Wei Ji Ma & Krešimir Josić, 2016. "Do People Take Stimulus Correlations into Account in Visual Search?," PLOS ONE, Public Library of Science, vol. 11(3), pages 1-16, March.
    8. Peter Kolesar & Kellen Leister & Daniel Stimpson & Ronald Woodaman, 2013. "A simple model of optimal clearance of improvised explosive devices," Annals of Operations Research, Springer, vol. 208(1), pages 451-468, September.
    9. Garrec, Tristan, 2019. "Continuous patrolling and hiding games," European Journal of Operational Research, Elsevier, vol. 277(1), pages 42-51.
    10. Hohzaki, Ryusuke, 2006. "Search allocation game," European Journal of Operational Research, Elsevier, vol. 172(1), pages 101-119, July.
    11. Kompas, Tom & Chu, Long & McKirdy, Simon & Thomas, Melissa & Van Der Merwe, Johann, 2023. "Optimal post-border surveillance against invasive pests to protect a valuable nature reserve and island asset," Ecological Economics, Elsevier, vol. 208(C).
    12. Timothy H. Chung & Rachel T. Silvestrini, 2014. "Modeling and analysis of exhaustive probabilistic search," Naval Research Logistics (NRL), John Wiley & Sons, vol. 61(2), pages 164-178, March.
    13. Oléron Evans, Thomas P. & Bishop, Steven R., 2013. "Static search games played over graphs and general metric spaces," European Journal of Operational Research, Elsevier, vol. 231(3), pages 667-689.
    14. Corine M Laan & Ana Isabel Barros & Richard J Boucherie & Herman Monsuur & Wouter Noordkamp, 2020. "Optimal deployment for anti-submarine operations with time-dependent strategies," The Journal of Defense Modeling and Simulation, , vol. 17(4), pages 419-434, October.
    15. 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.
    16. 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.
    17. Kyle Y. Lin & Michael P. Atkinson & Timothy H. Chung & Kevin D. Glazebrook, 2013. "A Graph Patrol Problem with Random Attack Times," Operations Research, INFORMS, vol. 61(3), pages 694-710, June.

    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:53:y:2006:i:8:p:814-821. 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.