TY - GEN
T1 - Robust & Asymptotically Locally Optimal UAV-Trajectory Generation Based on Spline Subdivision
AU - Ni, Ruiqi
AU - Schneider, Teseo
AU - Panozzo, Daniele
AU - Pan, Zherong
AU - Gao, Xifeng
N1 - Funding Information:
This work was supported in part by NSF-IIS-(1910486 and 1908767). 1Ruiqi Ni and Xifeng Gao are with Department of Computer Science, Florida State University (rn19g@my.fsu.edu and gao@cs.fsu.edu). 2Teseo Schneider and Daniele Panozzo are with the Department of Computer Science, New York University (teseo.schneider@nyu.edu and panozzo@nyu.edu). 3Zherong Pan is with the Department of Computer Science, University of Illinois Urbana-Champaign (zherong@illinois.edu).
Publisher Copyright:
© 2021 IEEE
PY - 2021
Y1 - 2021
N2 - 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 validity and asymptotic optimality for known environments. Validity: Given a feasible initial guess, our algorithm guarantees the satisfaction of all constraints throughout the process of optimization. Asymptotic 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.
AB - 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 validity and asymptotic optimality for known environments. Validity: Given a feasible initial guess, our algorithm guarantees the satisfaction of all constraints throughout the process of optimization. Asymptotic 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.
UR - http://www.scopus.com/inward/record.url?scp=85121948584&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85121948584&partnerID=8YFLogxK
U2 - 10.1109/ICRA48506.2021.9561272
DO - 10.1109/ICRA48506.2021.9561272
M3 - Conference contribution
AN - SCOPUS:85121948584
T3 - Proceedings - IEEE International Conference on Robotics and Automation
SP - 7715
EP - 7721
BT - 2021 IEEE International Conference on Robotics and Automation, ICRA 2021
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2021 IEEE International Conference on Robotics and Automation, ICRA 2021
Y2 - 30 May 2021 through 5 June 2021
ER -