IDEAS home Printed from https://ideas.repec.org/h/spr/isochp/978-3-319-26899-6_2.html
   My bibliography  Save this book chapter

Search for a Stationary Target

In: Optimal Search for Moving Targets

Author

Listed:
  • Lawrence D. Stone

    (Metron, Inc.)

  • Johannes O. Royset

    (Naval Postgraduate School)

  • Alan R. Washburn

    (Naval Postgraduate School)

Abstract

Many algorithms for computing optimal search plans for a moving target rely on being able to compute optimal plans for a stationary target. This chapter provides an overview of the standard models and results for optimal search for a stationary target. It discusses search sensors and some basic notions of detection modeling, including lateral range curves, sweep widths, and detection functions. It defines the search space and the prior distribution on target location in discrete and continuous space. It develops methods for finding search plans that maximize the probability of detecting the target by a fixed time and explores related optimal search problems such as minimizing the mean time to find the target. It presents algorithms that may be used to compute optimal plans in most cases. Optimal search for a stationary target is covered more extensively in Stone (2007).

Suggested Citation

  • Lawrence D. Stone & Johannes O. Royset & Alan R. Washburn, 2016. "Search for a Stationary Target," International Series in Operations Research & Management Science, in: Optimal Search for Moving Targets, chapter 0, pages 9-48, Springer.
    • Handle: RePEc:spr:isochp:978-3-319-26899-6_2
    DOI: 10.1007/978-3-319-26899-6_2
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    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:isochp:978-3-319-26899-6_2. 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.