SURVEILLANCE SEARCH FOR A MOVING TARGET

The authors formulate the surveillance search problem for applications in which the target moves according to a (not necessarily time-homogeneous) Markov process. A necessary set of conditions are derived for the optimality of a search strategy, and develop algorithms, based on the algorithm of Brown for the detection search problem, to find strategies that satisfy these necessary conditions for problems in which the search effort is infinitely divisible.