Please use this identifier to cite or link to this item:
|Scopus||Web of Science®||Altmetric|
|Title:||Path planning for minimizing detection|
|Citation:||IFAC papers online, 2014, vol.19, iss.3, pp.10200-10206|
|Conference Name:||World Congress of the International Federation of Automatic Control (IFAC) (24 Aug 2014 - 29 Aug 2014 : Cape Town, SOUTH AFRICA)|
|B. Jiang, A. N. Bishop, B. D. O. Anderson, S. P. Drake|
|Abstract:||For a ying military vehicle, avoiding detection can be a key objective. To achieve this, ying 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.|
|Appears in Collections:||Aurora harvest 7|
Chemistry and Physics publications
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.