Optimal Discrete Search with Imperfect Specificity [report]

Moshe Kress, Kyle Y. Lin, Roberto Szechtman
2007 unpublished
A target is hidden in one of several possible locations, and the objective is to nd the target as fast as possible. One common measure of eectiveness 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 specicity (no false positive detections). In this paper, which is motivated by recent military
more » ... d homeland security search situations, we extend the results to the case where the search is subject to false positive detections. ueywordsX disrete serhD imperfet speiityD uniformly optimlF 1 Report Documentation Page Form Approved OMB No. 0704-0188 Public reporting burden for the collection of information is estimated to average 1 hour per response, including the time for reviewing instructions, searching existing data sources, gathering and maintaining the data needed, and completing and reviewing the collection of information. Send comments regarding this burden estimate or any other aspect of this collection of information, including suggestions for reducing this burden, to Washington Headquarters Services, Directorate for Information Operations and Reports, 1215 Jefferson Davis Highway, Suite 1204, Arlington VA 22202-4302. Respondents should be aware that notwithstanding any other provision of law, no person shall be subject to a penalty for failing to comply with a collection of information if it does not display a currently valid OMB control number.
doi:10.21236/ada598899 fatcat:syd3ez7sirdg5oourmlxxxsoym