IDEAS home Printed from https://ideas.repec.org/a/spr/mathme/v60y2004i1p1-13.html
   My bibliography  Save this article

Discrete search with multiple sensors

Author

Listed:
  • Nah-Oak Song
  • Demosthenis Teneketzis

Abstract

A stationary object is hidden in location i, i=1,2,...,K, with probability p i . There are M sensors available and each location can be searched by at most one sensor at each instant of time. Each search of a location takes one unit of time and is conducted independently of previous searches, so that a search of location i finds the object, if it is in that location, with probability α i . After each search of a location a sensor may either continue to search the same location or switch without any delay to another location. We determine optimal search strategies that maximize the total probability of successful search in N units of time, discuss an implementation of an optimal search strategy, and specify conditions under which the solution can be obtained by a forward induction argument. Finally, we discuss the relationship to multi-armed bandits with multiple plays. Copyright Springer-Verlag 2004

Suggested Citation

  • Nah-Oak Song & Demosthenis Teneketzis, 2004. "Discrete search with multiple sensors," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 60(1), pages 1-13, September.
    • Handle: RePEc:spr:mathme:v:60:y:2004:i:1:p:1-13
    DOI: 10.1007/s001860400360
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s001860400360
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s001860400360?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
    ---><---

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

    Citations

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


    Cited by:

    1. 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.
    2. Wilson, Kurt E. & Szechtman, Roberto & Atkinson, Michael P., 2011. "A sequential perspective on searching for static targets," European Journal of Operational Research, Elsevier, vol. 215(1), pages 218-226, November.
    3. 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.
    4. Moshe Kress & Kyle Lin & Roberto Szechtman, 2008. "Optimal discrete search with imperfect specificity," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 68(3), pages 539-549, December.
    5. Mohamed Abd Allah El-Hadidy, 2016. "On Maximum Discounted Effort Reward Search Problem," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 33(03), pages 1-30, June.

    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:spr:mathme:v:60:y:2004:i:1:p:1-13. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.