TY - JOUR
T1 - Trajectory optimization for UAV-based medical delivery with temporal logic constraints and convex feasible set collision avoidance
AU - Chen, Kaiyuan
AU - Suo, Yuhan
AU - Cui, Shaowei
AU - Xia, Yuanqing
AU - Liang, Wannian
AU - Wang, Shuo
N1 - Publisher Copyright:
© 2025 The Authors
PY - 2026/5
Y1 - 2026/5
N2 - This paper addresses the problem of trajectory optimization for unmanned aerial vehicles (UAVs) performing time-sensitive medical deliveries in urban environments. Specifically, we consider a single UAV with 3-degree-of-freedom dynamics tasked with delivering blood packages to multiple hospitals, each with a predefined time window and priority. Mission objectives are encoded using Signal Temporal Logic (STL), enabling the formal specification of spatial-temporal constraints. To ensure safety, city buildings are modeled as 3D convex obstacles, and obstacle avoidance is handled through a Convex Feasible Set (CFS) method. The entire planning problem—combining UAV dynamics, STL satisfaction, and collision avoidance—is formulated as a convex optimization problem that ensures tractability and can be solved efficiently using standard convex programming techniques. Simulation results demonstrate that the proposed method generates dynamically feasible, collision-free trajectories that satisfy temporal mission goals, providing a scalable and reliable approach for autonomous UAV-based medical logistics.
AB - This paper addresses the problem of trajectory optimization for unmanned aerial vehicles (UAVs) performing time-sensitive medical deliveries in urban environments. Specifically, we consider a single UAV with 3-degree-of-freedom dynamics tasked with delivering blood packages to multiple hospitals, each with a predefined time window and priority. Mission objectives are encoded using Signal Temporal Logic (STL), enabling the formal specification of spatial-temporal constraints. To ensure safety, city buildings are modeled as 3D convex obstacles, and obstacle avoidance is handled through a Convex Feasible Set (CFS) method. The entire planning problem—combining UAV dynamics, STL satisfaction, and collision avoidance—is formulated as a convex optimization problem that ensures tractability and can be solved efficiently using standard convex programming techniques. Simulation results demonstrate that the proposed method generates dynamically feasible, collision-free trajectories that satisfy temporal mission goals, providing a scalable and reliable approach for autonomous UAV-based medical logistics.
KW - Convex programming
KW - Global Trajectory optimization
KW - Temporal logic constraints
KW - Unmanned aerial vehicles
UR - https://www.scopus.com/pages/publications/105024234347
U2 - 10.1016/j.glt.2025.10.002
DO - 10.1016/j.glt.2025.10.002
M3 - Article
AN - SCOPUS:105024234347
SN - 2589-7918
VL - 8
SP - 110
EP - 119
JO - Global Transitions
JF - Global Transitions
IS - 1
ER -