Myopic search plans
de Paula Neto, Antonio Francisco
MetadataShow full item record
Different strategies can be used to search for a moving object. If the searcher's action at each time unit maximizes his chances of immediate detection, his strategy is said to be myopic. If, however, the searcher seeks to allocate search effort to maximize the probability of detecting the traget within a preset amount of time, his strategy is called optimal. This thesis documents interactive computer programs that are useful for testing search strategies against the myopic strategy, and shows examples where the myopic strategy is not optimal.
Approved for public release; distribution is unlimited
Showing items related by title, author, creator and subject.
Hasting, Matthew D. (Monterey, California. Naval Postgraduate School, 2009-06);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 ...
Cabello, Carlos S. (Monterey, California: Naval Postgraduate School, 2013-12);Throughout the past decade of wars, the U.S. has deployed unmanned aerial systems, commonly referred to as drones, from Africa to Asia collecting intelligence and targeting adversaries. The nation now stands at a crossroad ...
Yau, Meng Wee Joses (Monterey, California. Naval Postgraduate School, 2012-06);This thesis investigates the combined use of ocean models, such as idealized surface current flows, and search models, including expanding area and discrete myopic search methods, to improve the probability of detecting a ...