Title :
Constrained search for a moving target
Author_Institution :
AFRL/MNGN
Abstract :
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
Keywords :
constraint theory; optimisation; path planning; probability; constrained path planning; constrained search; finite planning horizon; moving target; probability; receding-horizon optimization framework; wide area search munition; Lakes; Markov processes; Path planning; Search problems; Target recognition; Trajectory; Underwater vehicles; Weapons;
Conference_Titel :
Collaborative Technologies and Systems, 2005. Proceedings of the 2005 International Symposium on
Conference_Location :
St Louis, MO
Print_ISBN :
0-7695-2387-0
DOI :
10.1109/ISCST.2005.1553330
