Search for a Moving Target: Upper Bound on Detection Probability
NAVAL POSTGRADUATE SCHOOL MONTEREY CA
Pagination or Media Count:
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 probability for each of those effort distributions in the case where the detection function is concave.
- Operations Research