Optimum UAV trajectory design for data harvesting from distributed nodes

Research output: Contribution to journalArticlepeer-review

3 Downloads (Pure)

Abstract

This paper designs energy-efficient trajectories for unmanned aerial vehicles (UAVs) harvesting data sequentially from distributed ground nodes. We propose a novel optimization framework for path planning, based on dynamic programming. We develop an optimum backward-forward algorithm that jointly optimizes the hovering locations for each ground node, and the visiting order to those locations. Our algorithm minimizes the total energy consumption of the UAV over its trajectory. Our framework is compatible with various probabilistic wireless communication channel models, and can also be applied to different cost functions, including minimising the total flying time, and allowing for bi-directional communications. We also develop a lower complexity algorithm that approximates the optimum UAV trajectory by decomposing the original problem into two sub-problems, and iterating back and forth between the two. This alternating algorithm has polynomial time complexity, and we show that it produces a near-optimum UAV trajectory, with as little deviation as 5% to 15% from the average energy consumption of the optimum algorithm.

Original languageEnglish
Pages (from-to)302-316
Number of pages15
JournalIEEE Transactions on Communications
Volume72
Issue number1
Early online date10 Oct 2023
DOIs
Publication statusPublished - Jan 2024

Bibliographical note

Copyright the Author(s) 2023. Version archived for private and non-commercial use with the permission of the author/s and according to publisher conditions. For further rights please contact the publisher.

Fingerprint

Dive into the research topics of 'Optimum UAV trajectory design for data harvesting from distributed nodes'. Together they form a unique fingerprint.

Cite this