Abstract
A target is hidden in one of several possible locations, and the objective is to find the target as fast as possible. One common measure of effectiveness for the search process is the expected time of the search. This type of search optimization problem has been addressed and solved in the literature for the case where the searcher has imperfect sensitivity (possible false negative results), but perfect specificity (no false positive detections). In this paper, which is motivated by recent military and homeland security search situations, we extend the results to the case where the search is subject to false positive detections.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Ahlswede R, Wegener I (1987) Search problems. Wiley, New York
Black WL (2004) Discrete sequential search. Inf Control 8: 159–162
Chew MC (1967) A sequential search procedure. Ann Math Stat 38: 494–502
Chew MC (1973) Optimal stopping in a discrete search problem. Oper Res 21(3): 741–747
Danskin JM (1962) A theory of reconnaissance: I, ii. Oper Res 10(3): 285–309
Kadane JB (1971) Optimal whereabout search. Oper Res 19: 894–904
Matula D (1964) A periodic optimal search. Amer Math Mon 71: 15–21
Pollock SM (1971) Serch detection and subsequent action: some problems on the interfaces. Oper Res 19: 559–586
Ross SM (1983) Introduction to stochastic dynamic programming. Academic Press, Amsterdam
Song N-O, Teneketzis D (2004) Discrete search with multiple sensors. Math Meth Oper Res 60: 1–13
Stone LD (1975) Theory of optimal search. Academic Press, Amsterdam
Wegener I (1980) The discrete sequential search problem with nonrandom cost and overlook probabilities. Math Oper Res 5: 373–380
Wegener I (1980) Optimal search with positive switch cost is np-hard. Inf Process Lett 21: 49–52
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Kress, M., Lin, K.Y. & Szechtman, R. Optimal discrete search with imperfect specificity. Math Meth Oper Res 68, 539–549 (2008). https://doi.org/10.1007/s00186-007-0197-2
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00186-007-0197-2