Optimal Discrete Search with Imperfect Specificity
Lin, Kyle Y.
MetadataShow full item record
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 of 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.
Mathematical Methods of Operations Research, V. 68, pp 539-549.
Rightsdefined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.
Showing items related by title, author, creator and subject.
Castle, Timothy S. (Monterey, California. Naval Postgraduate School, 1998-09);This thesis designs and implements the Coordinated Inland Area Search and Rescue (SAR) System (COINSS). This n provides several important features not provided by current inland SAR computer systems. First is the ability ...
Klaus, Christian; Chung, Timothy H. (IEEE, 2011-12);This paper investigates the effect on the performance of a mobile sensor search caused by the search environment. We model the search environment as a simple connected undirected graph. By adding non-existing edges to ...
Chung, Timothy H.; Silvestrini, Rachel T. (2014);This article explores a probabilistic formulation for exhaustive search of a bounded area by a single searcher for a single static target. The searcher maintains an aggregate belief of the target’s presence or absence in ...