Path planning for minimizing detection

B. Jiang, A. N. Bishop, B. D.O. Anderson, S. P. Drake

Research output: Contribution to journalConference articlepeer-review

5 Citations (Scopus)

Abstract

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.

Original languageEnglish
Pages (from-to)10200-10206
Number of pages7
JournalIFAC Proceedings Volumes (IFAC-PapersOnline)
Volume47
Issue number3
DOIs
Publication statusPublished - 2014
Externally publishedYes
Event19th IFAC World Congress on International Federation of Automatic Control, IFAC 2014 - Cape Town, South Africa
Duration: 24 Aug 201429 Aug 2014

Fingerprint

Dive into the research topics of 'Path planning for minimizing detection'. Together they form a unique fingerprint.

Cite this