Modeling and Analysis of Exhaustive Probabilistic Search
Chung, Timothy H.
Silvestrini, Rachel T.
MetadataShow full item record
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 the search area, concluding with a positive or negative search decision on crossing of decision thresholds. The measure of search performance is defined as the expected time until a search decision is made as well as the probability of the search decision being correct. The searcher gathers observations using an imperfect detector, that is, one with false positive and negative errors, and integrates them in an iterative Bayesian manner. Analytic expressions for the Bayesian update recursion of the aggregate belief are given, with theoretical results describing the role of positive and negative detections, as well as sensitivity results for the effect of the detection errors on the aggregate belief evolution. Statistical studies via design of simulation experiments provide insights into the significant search parameters, including imperfect sensor characteristics, initial belief value, search decision threshold values, and the available prior probability information. Regression analysis yields statistical models to provide prescriptive guidance on the search performance as a function of these search parameters.
The article of record as published may be located at http://dx.doi.org/10.1002/nav.21574
RightsThis publication is a work of the U.S. Government as defined 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.
Kress, Moshe; Lin, Kyle Y.; Szechtman, Roberto (2007-04-16);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 ...
Baez, Francisco R.; Darken, Christian J. (2014);The modeling and simulation community has used probability threat maps and other similar approaches to address search problems and improve decision-making. Probability threat maps describe the probability of a location ...
Carpin, Stefano; Burch, Derek; Basilico, Nicola; Chung, Timothy H.; Kölsch, Mathias (Wiley, 2013-05);This paper presents a variable resolution framework for autonomously searching stationary targets in a bounded area. Theoretical formulations are also described for using a probabilistic quadtree data structure, which ...