For a flying military vehicle, avoiding detection can be a key objective. To achieve this, flying the least-probability-of-detection path from A to B through a field of detectors is a fundamental strategy. While most of the previous optimization models aim to minimize the cumulative radar exposure, this paper derives a model that can directly minimize the probability of being detected. Furthermore, a variational dynamic programming method is applied to this model which allows one finding a precise local optimal path with low computational complexity. In addition, a homotopy method is derived to adjust the optimal path with exceptionally low computational complexity when the detection rate function changes due to the removal of detectors, the addition of detectors or the changes of understanding of detectors.
|Number of pages||7|
|Journal||IFAC Proceedings Volumes (IFAC-PapersOnline)|
|Publication status||Published - 2014|
|Event||19th IFAC World Congress on International Federation of Automatic Control, IFAC 2014 - Cape Town, South Africa|
Duration: 24 Aug 2014 → 29 Aug 2014