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

Optimal Search Density for a Stationary Target Among Stationary False Targets

Author

Listed:
  • D. V. Kalbaugh

    (Johns Hopkins University Applied Physics Laboratory, Laurel, Maryland)

Abstract

This paper considers rational methods for the design of search densities when the intended target is stationary among stationary, Poisson-distributed false contacts. Attention is restricted to situations in which the searcher must immediately decide, based on sensed information, whether a contact is the intended target and, if the answer is yes, end the search and commit to the contact. Discrimination of false contact from target is modeled as reliable only with given probabilities. We seek to allocate search effort to maximize the probability of finding the intended target in a fixed time. Modeling space and time as discrete, we apply the Kuhn-Tucker theorem to obtain a set of necessary conditions for an optimum. For the particular case of a discrete space and time approximation of search for a normally distributed target in R 2 and a uniform density of false contacts, we develop a computer algorithm that converges to a solution of the necessary conditions. Numerical results are presented.

Suggested Citation

  • D. V. Kalbaugh, 1993. "Optimal Search Density for a Stationary Target Among Stationary False Targets," Operations Research, INFORMS, vol. 41(2), pages 310-318, April.
    • Handle: RePEc:inm:oropre:v:41:y:1993:i:2:p:310-318
    DOI: 10.1287/opre.41.2.310
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.41.2.310
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.41.2.310?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
    ---><---

    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:41:y:1993:i:2:p:310-318. 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.