Search parameter optimization for discrete, Bayesian, and continuous search algorithms
MetadataShow full item record
Search and Detection Theory is the overarching field of study that covers many scenarios. These range from simple search and rescue acts to prosecuting aerial/surface/submersible targets on mission. This research looks at varying the known discrete and Bayesian algorithm parameters to analyze the optimization. It also expands on previous research of two searchers with search radii coupled to their speed, executing three search patterns: inline spiral search, inline ladder search, and a multipath ladder search. Analysis reveals that the Bayesian search and discrete search work similarly, but the Bayesian search algorithm provides a more useful output in location probability. Results from the continuous search were similar to previous research, but variance in time to detection became more complex than basic increasing or decreasing ranges.
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.
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 ...
Hasting, Matthew D. (Monterey, California. Naval Postgraduate School, 2009);This thesis investigates the visual search process and the effect of contextual information on the search process in an urban combat environment. High resolution combat simulation models implement a parallel sweeping or ...
Chung, Timothy H.; Carpin, Stefano (IEEE, 2011);We propose a novel framework to search for a static target using a multiscale representation. The algorithm we present is appropriate when the target detection sensor trades off accuracy versus covered area, e.g., when a ...