Trajectory Optimization for UAV-Based Medical Delivery with Temporal Logic Constraints and Convex Feasible Set Collision Avoidance

📅 2025-06-06
📈 Citations: 0
Influential: 0
📄 PDF
🤖 AI Summary
This paper addresses time-critical medical supply delivery by unmanned aerial vehicles (UAVs) in urban environments, subject to multi-hospital time-window constraints, cargo priority levels, 3D convex building obstacles, and 3-degree-of-freedom dynamical feasibility. Method: We propose a trajectory optimization framework that jointly integrates formal task specification—expressed in Signal Temporal Logic (STL)—with real-time safety guarantees via convex feasible sets (CFS) for obstacle avoidance, all embedded within a unified convex optimization formulation. Contribution/Results: To the best of our knowledge, this is the first approach to achieve joint convexification of STL semantic constraints and geometric safety requirements. The resulting trajectories are dynamically feasible, collision-free, and strictly satisfy spatiotemporal deadlines and cargo priority ordering. Extensive simulations demonstrate high reliability and scalability in complex urban settings with dense, heterogeneous obstacles.

Technology Category

Application Category

📝 Abstract
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.
Problem

Research questions and friction points this paper is trying to address.

Optimize UAV medical delivery trajectories with time constraints
Ensure collision avoidance using convex feasible set method
Formulate mission objectives via Signal Temporal Logic (STL)
Innovation

Methods, ideas, or system contributions that make the work stand out.

UAV trajectory optimization with Signal Temporal Logic
Convex Feasible Set for 3D obstacle avoidance
Convex optimization for efficient medical delivery planning
🔎 Similar Papers
No similar papers found.
Kaiyuan Chen
Kaiyuan Chen
Bytedance
LLMScaling LawAI4WeatherVideo Generation
Y
Yuhan Suo
School of Automation, Beijing Institute of Technology, Beijing, 100081, China
S
Shaowei Cui
Y
Yuanqing Xia
School of Automation, Beijing Institute of Technology, Beijing, 100081, China
W
Wannian Liang
Vanke School of Public Health, Institute for Healthy China, Tsinghua University, Beijing, 100084, China
S
Shuo Wang
State Key Laboratory of Management and Control for Complex Systems, Institute of Automation, Chinese Academy of Sciences, Beijing 100190, China, also with the School of Artificial Intelligence, University of Chinese Academy of Sciences, Beijing 100049, China