Search for a Moving Target: Upper Bound on Detection Probability
Washburn_Search_for_1978_Redacted.pdf (491.4Kb)Date
1978-10Metadata
Show full item recordAbstract
Existing algorithms for computing the optimal distribution of effort in search for a moving target operate by producing a sequence of progressively better distributions. This report shows how to compute an upper bound on the detection proability for each of those effort distributions in the case where the detection function is concave.
NPS Report Number
NPS55-78-029Related items
Showing items related by title, author, creator and subject.
-
Detection of gamma-neutron radiation by solid-state scintillation detectors
(IEEE, 2015-07-01);It is known that solid-state scintillators can be used for detection of both gamma radiation and neutron flux. In the past, neutron detection efficiencies of such solid-state scintillators did not exceed 5-7%. At the same ... -
Search parameter optimization for discrete, Bayesian, and continuous search algorithms
(Monterey, California: Naval Postgraduate School, 2017-09);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 ... -
Passive and active sonar prosecution of diesel submarines by nuclear submarines
(Monterey, California. Naval Postgraduate School, 2008-03);This study analyses the trend for initial detection times using both passive and active sonar during submarine-on-submarine operations. Specifically, it simulates a nuclear powered submarine (SSN) searching for a diesel ...
