The approximate solution of a simple constrained search path moving target problem using moving horizon policies

摘要

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)