.png){kind=icon}
.png){kind=icon}
Return
Trajectory Optimization for Cellular-Enabled UAV with Connectivity and Battery Constraints
.png){kind=icon}
OA
AI
H
K
S
DOI：10.1109/VTC2023-Fall60731.2023.10333437.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, we address the problem of path planning for a cellular-enabled UAV with connectivity and battery constraints. The UAV's mission is to deliver a payload from an initial point to a final point, while maintaining connectivity with a BS and adhering to the battery constraint. The UAV's battery can be replaced by a fully charged battery at a charging station, which takes some time. Our key contribution lies in proposing an algorithm that efficiently computes an optimal path that minimizes the mission completion time, solvable in polynomial time. We achieve this by transforming the problem into an equivalent two-level shortest path finding problem over weighted graphs and leveraging graph theoretic approaches to solve it. In more detail, we first find an optimal path and speed to travel between each pair of charging stations without replacing the battery, and then find the optimal order of visiting charging stations. To demonstrate the effectiveness of our approach, we compare it with previously proposed algorithms and show that our algorithm outperforms those in terms of both computational complexity and performance.
Journal
I
IF:
0
Papers:
123
Citations:
0
Organization
No organization information available
Cited Papers