IDEAS home Printed from https://ideas.repec.org/a/taf/uiiexx/v48y2016i6p489-500.html
   My bibliography  Save this article

Optimal pinging frequencies in the search for an immobile beacon

Author

Listed:
  • David J. Eckman
  • Lisa M. Maillart
  • Andrew J. Schaefer

Abstract

We consider a search for an immobile object that can only be detected if the searcher is within a given range of the object during one of a finite number of instantaneous detection opportunities; i.e., “pings.” More specifically, motivated by naval searches for battery-powered flight data recorders of missing aircraft, we consider the trade-off between the frequency of pings for an underwater locator beacon and the duration of the search. First, assuming that the search speed is known, we formulate a mathematical model to determine the pinging period that maximizes the probability that the searcher detects the beacon before it stops pinging. Next, we consider generalizations to discrete search speed distributions under a uniform beacon location distribution. Lastly, we present a case study based on the search for Malaysia Airlines Flight 370 that suggests that the industry-standard beacon pinging period—roughly 1 second between pings—is too short.

Suggested Citation

  • David J. Eckman & Lisa M. Maillart & Andrew J. Schaefer, 2016. "Optimal pinging frequencies in the search for an immobile beacon," IISE Transactions, Taylor & Francis Journals, vol. 48(6), pages 489-500, June.
    • Handle: RePEc:taf:uiiexx:v:48:y:2016:i:6:p:489-500
    DOI: 10.1080/0740817X.2015.1110270
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/0740817X.2015.1110270
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/0740817X.2015.1110270?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. Steve Alpern & Thomas Lidbetter, 2019. "Approximate solutions for expanding search games on general networks," Annals of Operations Research, Springer, vol. 275(2), pages 259-279, April.

    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:taf:uiiexx:v:48:y:2016:i:6:p:489-500. 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 Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/uiie .

    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.