The problem of minimum risk path planning for flying robots in dangerous environments

Andrey V. Savkin; Hailong Huang

doi:10.1109/ChiCC.2016.7554196

The problem of minimum risk path planning for flying robots in dangerous environments

Research output: Chapter in book / Conference proceeding › Conference article published in proceeding or book › Academic research › peer-review

10 Citations (Scopus)

Abstract

We consider the problem of navigating an aircraft in a threat environment to its destination while minimizing the maximum threat level and the length of the aircraft path. The proposed method to construct optimal low-risk aircraft paths involves a simple geometric procedure and is very computationally efficient. The effectiveness of the developed algorithm is confirmed by a number of examples.

Original language	English
Title of host publication	2016 35th Chinese Control Conference
DOIs	https://doi.org/10.1109/ChiCC.2016.7554196
Publication status	Published - Jul 2016
Externally published	Yes

More information

10.1109/ChiCC.2016.7554196

Cite this

@inproceedings{40c50372ce5d4ab78dc604460a6d21f8,

title = "The problem of minimum risk path planning for flying robots in dangerous environments",

abstract = "We consider the problem of navigating an aircraft in a threat environment to its destination while minimizing the maximum threat level and the length of the aircraft path. The proposed method to construct optimal low-risk aircraft paths involves a simple geometric procedure and is very computationally efficient. The effectiveness of the developed algorithm is confirmed by a number of examples.",

author = "Savkin, \{Andrey V.\} and Hailong Huang",

year = "2016",

month = jul,

doi = "10.1109/ChiCC.2016.7554196",

language = "English",

booktitle = "2016 35th Chinese Control Conference",

}

TY - GEN

T1 - The problem of minimum risk path planning for flying robots in dangerous environments

AU - Savkin, Andrey V.

AU - Huang, Hailong

PY - 2016/7

Y1 - 2016/7

N2 - We consider the problem of navigating an aircraft in a threat environment to its destination while minimizing the maximum threat level and the length of the aircraft path. The proposed method to construct optimal low-risk aircraft paths involves a simple geometric procedure and is very computationally efficient. The effectiveness of the developed algorithm is confirmed by a number of examples.

AB - We consider the problem of navigating an aircraft in a threat environment to its destination while minimizing the maximum threat level and the length of the aircraft path. The proposed method to construct optimal low-risk aircraft paths involves a simple geometric procedure and is very computationally efficient. The effectiveness of the developed algorithm is confirmed by a number of examples.

U2 - 10.1109/ChiCC.2016.7554196

DO - 10.1109/ChiCC.2016.7554196

M3 - Conference article published in proceeding or book

BT - 2016 35th Chinese Control Conference

ER -

The problem of minimum risk path planning for flying robots in dangerous environments

Abstract

More information

Fingerprint

Cite this