IDEAS home Printed from https://ideas.repec.org/a/ids/ijores/v20y2014i1p1-20.html
   My bibliography  Save this article

Discrete search allocation with object uncertainty

Author

Listed:
  • Thomas A. Wettergren
  • John G. Baylog

Abstract

We develop a new approach for assigning the optimal allocation of multiple searchers/sensors to a discrete set of search cells to find a hidden object. In contrast to existing formulations of the discrete search problem, we consider the situation in which the object is of uncertain type. Such formulations are practical for problems where a group of searchers is sent to look for an object of uncertain disposition, which is commonplace in search and rescue as well as many military search applications. We formulate a new mathematical model for this problem in which the object uncertainty is accounted for as an additive perturbation to the traditional Bayesian formulation of discrete search. This modelling approach is then proven to be amenable to optimisation with a greedy algorithm. Numerical examples illustrate the improved search performance gained from these improved allocations.

Suggested Citation

  • Thomas A. Wettergren & John G. Baylog, 2014. "Discrete search allocation with object uncertainty," International Journal of Operational Research, Inderscience Enterprises Ltd, vol. 20(1), pages 1-20.
    • Handle: RePEc:ids:ijores:v:20:y:2014:i:1:p:1-20
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=60513
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    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. Wettergren, Thomas A., 2021. "Game-based modeling of independent searchers who share a common goal," Applied Mathematics and Computation, Elsevier, vol. 391(C).

    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:ids:ijores:v:20:y:2014:i:1:p:1-20. 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: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=170 .

    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.