Comparison of path planning algorithms for an unmanned aerial vehicle deployment under threats

Kevin Danancier; Delphine Ruvio; Inkyung Sung; Peter Nielsen

doi:10.1016/j.ifacol.2019.11.493

Comparison of path planning algorithms for an unmanned aerial vehicle deployment under threats

Kevin Danancier, Delphine Ruvio, Inkyung Sung, Peter Nielsen

Research output: Contribution to journal › Conference article in Journal › Research › peer-review

29 Citations (Scopus)

186 Downloads (Pure)

Abstract

Following the massive interests in unmanned aerial vehicles (UAVs), various optimization algorithms have been proposed for a path planning problem that allow the units to navigate in a region filled with threats such as a radar detection in air defence systems. Among the algorithms, we address Dijkstra's algorithm and a heuristic algorithm for the path planning of a UAV. The algorithms are compared under various configurations of a region to navigate with respect to the optimality and the computational complexity of the algorithms.

Original language	English
Book series	IFAC-PapersOnLine
Volume	52
Issue number	13
Pages (from-to)	1978-1983
Number of pages	6
ISSN	2405-8963
DOIs	https://doi.org/10.1016/j.ifacol.2019.11.493
Publication status	Published - Sept 2019
Event	9th IFAC Conference on Manufacturing Modelling, Management and Control, MIM 2019 - Berlin, Germany Duration: 28 Aug 2019 → 30 Aug 2019

Conference

Conference	9th IFAC Conference on Manufacturing Modelling, Management and Control, MIM 2019
Country/Territory	Germany
City	Berlin
Period	28/08/2019 → 30/08/2019
Sponsor	et al., IFAC TC 1.3. Discrete Event and Hybrid Systems, IFAC TC 3.2. Computational Intelligence in Control, IFAC TC 4.3. Robotics, IFAC TC 5.1. Manufacturing Plant Control, International Federation of Automatic Control (IFAC) - Technical Committee on Manufacturing Modelling for Management and Control, TC 5.2

Keywords

Operations Research
Optimization and Control
Scheduling

Access to Document

10.1016/j.ifacol.2019.11.493

1-s2.0-S2405896319314776-mainFinal published version, 1 MBLicence: CC BY-NC-ND 4.0

AUB Link

Search for the material in Aalborg University Library's search engine

Cite this

@inproceedings{7d78a0588c4546029d238d8b1757e458,

title = "Comparison of path planning algorithms for an unmanned aerial vehicle deployment under threats",

abstract = "Following the massive interests in unmanned aerial vehicles (UAVs), various optimization algorithms have been proposed for a path planning problem that allow the units to navigate in a region filled with threats such as a radar detection in air defence systems. Among the algorithms, we address Dijkstra's algorithm and a heuristic algorithm for the path planning of a UAV. The algorithms are compared under various configurations of a region to navigate with respect to the optimality and the computational complexity of the algorithms.",

keywords = "Operations Research, Optimization and Control, Scheduling",

author = "Kevin Danancier and Delphine Ruvio and Inkyung Sung and Peter Nielsen",

year = "2019",

month = sep,

doi = "10.1016/j.ifacol.2019.11.493",

language = "English",

volume = "52",

pages = "1978--1983",

journal = "IFAC-PapersOnLine",

issn = "2405-8963",

publisher = "Elsevier",

number = "13",

note = "9th IFAC Conference on Manufacturing Modelling, Management and Control, MIM 2019 ; Conference date: 28-08-2019 Through 30-08-2019",

}

TY - GEN

T1 - Comparison of path planning algorithms for an unmanned aerial vehicle deployment under threats

AU - Danancier, Kevin

AU - Ruvio, Delphine

AU - Sung, Inkyung

AU - Nielsen, Peter

PY - 2019/9

Y1 - 2019/9

N2 - Following the massive interests in unmanned aerial vehicles (UAVs), various optimization algorithms have been proposed for a path planning problem that allow the units to navigate in a region filled with threats such as a radar detection in air defence systems. Among the algorithms, we address Dijkstra's algorithm and a heuristic algorithm for the path planning of a UAV. The algorithms are compared under various configurations of a region to navigate with respect to the optimality and the computational complexity of the algorithms.

AB - Following the massive interests in unmanned aerial vehicles (UAVs), various optimization algorithms have been proposed for a path planning problem that allow the units to navigate in a region filled with threats such as a radar detection in air defence systems. Among the algorithms, we address Dijkstra's algorithm and a heuristic algorithm for the path planning of a UAV. The algorithms are compared under various configurations of a region to navigate with respect to the optimality and the computational complexity of the algorithms.

KW - Operations Research

KW - Optimization and Control

KW - Scheduling

UR - http://www.scopus.com/inward/record.url?scp=85078875581&partnerID=8YFLogxK

U2 - 10.1016/j.ifacol.2019.11.493

DO - 10.1016/j.ifacol.2019.11.493

M3 - Conference article in Journal

AN - SCOPUS:85078875581

SN - 2405-8963

VL - 52

SP - 1978

EP - 1983

JO - IFAC-PapersOnLine

JF - IFAC-PapersOnLine

IS - 13

T2 - 9th IFAC Conference on Manufacturing Modelling, Management and Control, MIM 2019

Y2 - 28 August 2019 through 30 August 2019

ER -

Comparison of path planning algorithms for an unmanned aerial vehicle deployment under threats

Abstract

Conference

Keywords

Access to Document

AUB Link

Other files and links

Fingerprint

Cite this