Robust & Asymptotically Locally Optimal UAV-Trajectory Generation Based on Spline Subdivision
Not on the map. Why?
Abstract (arXiv)
Generating locally optimal UAV-trajectories is challenging due to the non-convex constraints of collision avoidance and actuation limits. We present the first local, optimization-based UAV-trajectory generator that simultaneously guarantees the validity and asymptotic optimality for known environments. textitValidity: Given a feasible initial guess, our algorithm guarantees the satisfaction of all constraints throughout the process of optimization. textitAsymptotic Optimality: We use an asymptotic exact piecewise approximation of the trajectory with an automatically adjustable resolution of its discretization. The trajectory converges under refinement to the first-order stationary point of the exact non-convex programming problem. Our method has additional practical advantages including joint optimality in terms of trajectory and time-allocation, and robustness to challenging environments as demonstrated in our experiments.
Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). First posted on arXiv 19 Oct 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2022: 1; 2023: 1; 2024: 0; 2025: 1; 2026: 1.
4 papers.