Joint Green and Deadline-Aware Path Planning for Rotary-Wing UAV-Assisted Internet-of-Things

This paper proposes two unmanned aerial vehicles (UAV) trajectory planning solutions taking into consideration mission deadline, energy consumption, and communication constraints. The problem is mathematically formulated as a mult-iobjective optimization problem. The NP-hardness complexity is demonstrated then two heuristic solutions are proposed. Specifically, we first present a near-optimal UAV trajectory planning algorithm that reduces the number of stop/hovering points. Then, we propose an artificial bee colony-based algorithm with enhanced candidate selection. Extensive simulation results show that both our schemes outperform the well-known Successive Convex Approximation (SCA) technique, under low-moderate traffic demand. They perform as well as SCA under high demand.

Authors

Institutions

Publication Details

Published
2024-09-02
DOI
https://doi.org/10.1109/pimrc59610.2024.10817272
Citations
1
Primary Topic
Robotic Path Planning Algorithms
Type
article
Field-Weighted Citation Impact
0.25
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Joint Green and Deadline-Aware Path Planning for Rotary-Wing UAV-Assisted Internet-of-Things

Halima Elbiaze, Essaïd Sabir, Akram Khelili
1 citations
Robotic Path Planning Algorithms
0.25
article

Joint Green and Deadline-Aware Path Planning for Rotary-Wing UAV-Assisted Internet-of-Things

Halima Elbiaze, Essaïd Sabir, Akram Khelili
article en
1 citations

Abstract

This paper proposes two unmanned aerial vehicles (UAV) trajectory planning solutions taking into consideration mission deadline, energy consumption, and communication constraints. The problem is mathematically formulated as a mult-iobjective optimization problem. The NP-hardness complexity is demonstrated then two heuristic solutions are proposed. Specifically, we first present a near-optimal UAV trajectory planning algorithm that reduces the number of stop/hovering points. Then, we propose an artificial bee colony-based algorithm with enhanced candidate selection. Extensive simulation results show that both our schemes outperform the well-known Successive Convex Approximation (SCA) technique, under low-moderate traffic demand. They perform as well as SCA under high demand.

Université du Québec à Montréal (CA)
Openalex Percentile: Top 43%
Robotic Path Planning Algorithms
0.25
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.