DocumentCode
3493937
Title
Searching for a moving target: optimal path planning
Author
Grundel, Don A.
Author_Institution
Munitions Directorate, Air Force Res. Lab., Eglin AFB, FL, USA
fYear
2005
fDate
19-22 March 2005
Firstpage
867
Lastpage
872
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 several search path planning methods. This problem is particularly applicable in the case of wide area search munitions searching and engaging moving ground targets.
Keywords
military systems; optimisation; path planning; target tracking; constrained path planning; finite planning horizon; optimal path planning; receding-horizon optimization framework; search path planning methods; single randomly moving target search; wide area search munitions searching; Laboratories; Lakes; Path planning; Search problems; Target recognition; Trajectory; Underwater vehicles; Weapons;
fLanguage
English
Publisher
ieee
Conference_Titel
Networking, Sensing and Control, 2005. Proceedings. 2005 IEEE
Print_ISBN
0-7803-8812-7
Type
conf
DOI
10.1109/ICNSC.2005.1461306
Filename
1461306
Link To Document