Numerical methods in search path planning
I. Yan, G. L. Blankenship · 2003
The detection search problem is the identification of search paths for a specified time interval (0,T), so that the expected number of surviving targets at time T is minimized. The problem can be solved in real time only when the two major procedures, namely estimation of target posterior distribution and evaluation of optimal controls (search path planning) based on this posterior target distribution, can be done online. The path-planning problem is difficult since the state space is infinite-dimensional. The authors introduce a discrete space-time model to which the ordered search algorithm in artificial intelligence graph search theory (with proper modification) can be applied. The algorithm not only stops at the (or an) optimal path but also expands far fewer nodes than an exhaustive search.>