Joint Optimization of Trajectory and Handover Strategy for Cellular-Enabled UAV

We consider a scenario where a UAV travels from an initial point to a final point while maintaining connectivity with the cellular network. For this scenario, the problem of jointly optimizing UAV trajectory and handover strategy to travel between the two points swiftly while avoiding overly frequent handovers is formulated. For this optimization problem, we propose an algorithm that involves converting the original problem into the problem of finding the minimum weight path over a weighted finite graph which can be solved in polynomial time. Our proposed algorithm is compared with some existing algorithms in terms of performance and time complexity, and it is shown that our algorithm is the only one that outputs an optimal solution in polynomial time. Furthermore, various numerical results are presented to illustrate optimal UAV trajectories and handover strategies according to environments.

Authors

Institutions

Publication Details

Journal
IEEE Access
Published
2025-01-01
DOI
https://doi.org/10.1109/access.2025.3595184
Primary Topic
Robotic Path Planning Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Joint Optimization of Trajectory and Handover Strategy for Cellular-Enabled UAV

Jaehoon Chung, Kyu-Yeong Kim, Hyeon-Seong Im, Si-Hyeon Lee
IEEE Access
Robotic Path Planning Algorithms
article

Joint Optimization of Trajectory and Handover Strategy for Cellular-Enabled UAV

Jaehoon Chung, Kyu-Yeong Kim, Hyeon-Seong Im, Si-Hyeon Lee
article en

Abstract

We consider a scenario where a UAV travels from an initial point to a final point while maintaining connectivity with the cellular network. For this scenario, the problem of jointly optimizing UAV trajectory and handover strategy to travel between the two points swiftly while avoiding overly frequent handovers is formulated. For this optimization problem, we propose an algorithm that involves converting the original problem into the problem of finding the minimum weight path over a weighted finite graph which can be solved in polynomial time. Our proposed algorithm is compared with some existing algorithms in terms of performance and time complexity, and it is shown that our algorithm is the only one that outputs an optimal solution in polynomial time. Furthermore, various numerical results are presented to illustrate optimal UAV trajectories and handover strategies according to environments.

IEEE AccessVol. 13
Korea Advanced Institute of Science and Technology (KR), LG (United States) (US), GS Caltex (South Korea) (KR), LG (South Korea) (KR)
Affordable and clean energy
Openalex Percentile: Top 82%
Robotic Path Planning Algorithms
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.