The Approximate Solution of a Simple Constrained Search Path Moving Target Problem Using Moving Horizon Policies.
NAVAL POSTGRADUATE SCHOOL MONTEREY CA
Pagination or Media Count:
A simple moving target problem is approximately solved for that search path minimizing the probability of non-detection subject to specified constraints on the search path. The solution procedure uses moving horizon policies. An almost asymptotically geometric structure is observed in the solution. Author
- Theoretical Mathematics