We consider the problem of constrained path planning for one or two agents in search of a single randomly moving target such that we maximize the probability of intercepting the target at some time in its trajectory. We assume the agents operate in a receding-horizon optimization framework with some finite planning horizon. We present and compare several search path planning methods. This problem is particularly applicable in the case of wide area search munitions searching and engaging moving ground targets.

Searching for a moving target: optimal path planning

We consider the problem of constrained path planning for one or two agents in search of a single randomly moving target such that we maximize the probability of intercepting the target at some time in its trajectory. We assume the agents operate in a receding-horizon optimization framework with some finite planning horizon. We present and compare two search path planning methods. This problem is particularly applicable in the case of wide area search munitions searching and engaging moving ground targets

Constrained search for a moving target

In this section, we give a description of the basic search problem considered in this paper.

L. D. Stone

Papers

Optimization Algorithm for General Target Motion