TY - JOUR
T1 - Joint Optimization of UAV Trajectory and Communication Resources with Complete Avoidance of No-Fly-Zones
AU - Heo, Kanghyun
AU - Park, Gitae
AU - Lee, Kisong
N1 - Publisher Copyright:
© 2000-2011 IEEE.
PY - 2024
Y1 - 2024
N2 - In this paper, we explore a joint optimization of unmanned aerial vehicle (UAV) trajectory and communication resources with complete avoidance of no-fly-zones (NFZs). In particular, we introduce a new constraint that allows the UAV to perfectly avoid NFZs throughout the entire continuous trajectory with rigorous mathematical proof. Under the proposed constraint on NFZs, we aim to optimize the scheduling, transmit power, length of the time slot, and trajectory of the UAV to maximize the minimum throughput among ground nodes without violating NFZs. To find the optimal UAV strategy from the non-convex optimization problem formulated here, we use various optimization techniques, such as quadratic transform, successive convex approximation, and the block coordinate descent algorithm. Simulation results confirm that the proposed constraint prevents NFZs from being violated over the entire trajectory in any scenario. Furthermore, the proposed scheme shows significantly higher throughput than the baseline scheme using the traditional NFZ constraint by achieving a zero outage probability due to NFZ violations.
AB - In this paper, we explore a joint optimization of unmanned aerial vehicle (UAV) trajectory and communication resources with complete avoidance of no-fly-zones (NFZs). In particular, we introduce a new constraint that allows the UAV to perfectly avoid NFZs throughout the entire continuous trajectory with rigorous mathematical proof. Under the proposed constraint on NFZs, we aim to optimize the scheduling, transmit power, length of the time slot, and trajectory of the UAV to maximize the minimum throughput among ground nodes without violating NFZs. To find the optimal UAV strategy from the non-convex optimization problem formulated here, we use various optimization techniques, such as quadratic transform, successive convex approximation, and the block coordinate descent algorithm. Simulation results confirm that the proposed constraint prevents NFZs from being violated over the entire trajectory in any scenario. Furthermore, the proposed scheme shows significantly higher throughput than the baseline scheme using the traditional NFZ constraint by achieving a zero outage probability due to NFZ violations.
KW - Unmanned aerial vehicle
KW - communications
KW - convex optimization
KW - no-fly-zone
KW - trajectory design
UR - http://www.scopus.com/inward/record.url?scp=85195368888&partnerID=8YFLogxK
U2 - 10.1109/TITS.2024.3403887
DO - 10.1109/TITS.2024.3403887
M3 - Article
AN - SCOPUS:85195368888
SN - 1524-9050
VL - 25
SP - 14259
EP - 14265
JO - IEEE Transactions on Intelligent Transportation Systems
JF - IEEE Transactions on Intelligent Transportation Systems
IS - 10
ER -