Discrete search allocation with object uncertainty
by Thomas A. Wettergren; John G. Baylog
International Journal of Operational Research (IJOR), Vol. 20, No. 1, 2014

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.

Online publication date: Sat, 21-Jun-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Operational Research (IJOR):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com