 Discrete search allocation with object uncertaintyThomas A. Wettergren and John G. Baylog International Journal of Operational Research, 2014, vol. 20, issue 1, 1-20 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. Keywords: search theory; discrete search; cooperative search; greedy algorithms; optimal allocation; asset allocation; search evaluation; distribution of effort; object type dependency; utility function; object uncertainty; modelling; optimisation; search and rescue; military search; mathematical modelling. (search for similar items in EconPapers) Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:ids:ijores:v:20:y:2014:i:1:p:1-20 Access Statistics for this article More articles in International Journal of Operational Research from Inderscience Enterprises Ltd |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.