Analysis of Nondeterministic Search Patterns for Minimization of UAV Counter-Targeting
Stevens, Timothy S.
Chung, Timothy H.
MetadataShow full item record
In an attempt to mitigate the expanding counter-UAV capabilities of adversary countries developed in response to the United States_ increased reliance on these platforms, we apply a nondeterministic search pattern to a finite area searcher. By implementing a Levy distribution on search leg lengths we analyze the trade-offs between efficiency and evasiveness of the searcher, comparing the expected time to target detection for a given set of Levy parameters to a probabilistic time to counter-targeting based on intelligence driven enemy capability. The culmination of this thesis is the development of a robust simulation tool, capable of modeling various parameters on both searcher and search area, the output of which is a quantifiable estimate on the probability of mission success.
Approved for public release; distribution is unlimited
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 ...
Martins, Gustavo H. A. (Monterey, California. Naval Postgraduate School, 1993-03);We consider the problem of a searcher trying to detect a target that moves among a finite set of cells, C= 1,...,N, in discrete time, according to a specified Markov process. In each time period the searcher chooses one ...
Lin, Kyle Y.; Singham, Dashi I. (Monterey, California. Naval Postgraduate School, 2015-11); NPS-OR-15-009In a classical search model, an object is hidden in one of many cells. Knowing the probability that the object is in each cell, a searcher wishes to find it. Each search in a cell incurs a cost and will discover the object ...