Search for Moving Targets
Abstract
A fundamental problem in the theory of search involves the calculation of the probability of detection for searchers following known paths while attempting to detect a target whose motion is characterized statistically. The searchers' laws of detection and the target's initial distribution are given. Hellman has solved the problem when provided a Fokker-Planck equation for target motion, an unlikely input for military applications. The author solves the problem using the transition probabilities directly, and presents a closed-form expression for the probability of detecting a fleeing datum with an arbitrary search density. This solution is used to perform a gradient optimization for placement of stationary searchers in an antisubmarine warfare context.
Document Details
- Document Type
- Technical Report
- Publication Date
- Nov 01, 1976
- Accession Number
- ADA033214
Entities
People
- Anthony P. Ciervo