EUVIMEDEUVIMED entdecken
Open Access · CC BY-NC 4.0

Time optimal quadrotor maneuver: From optimality analysis to trajectory planning

Chao Qin, Jingxiang Chen, Yifan Lin, Abhishek Goudar, Angela P. Schoellig, Hugh H.-T. Liu

The International Journal of Robotics Research · 11.11.2026

DOI: 10.1177/02783649261480153 ↗

Kurz gefasst

Fachartikel in der Zeitschrift The International Journal of Robotics Research, online erschienen am 11.11.2026. Verfasst von Chao Qin und 5 weiteren Autor:innen. Die Arbeit nennt 43 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY-NC 4.0). Gefördert von: NSERC Discovery Grant.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

We address the problem of generating minimum-time quadrotor trajectories that scale efficiently across varying mission ranges. This problem is rooted in a fundamental trade-off between representing complex trajectories and optimizing them efficiently at scale. Specifically, as mission ranges expand, existing methods require more decision variables to represent the trajectory, causing computation times to surge. Furthermore, since total duration is an optimization variable, finding an adequate time-discretization resolution of the trajectory representation demands meticulous initialization and repeated, parameter-heavy tuning. We demonstrate that piecewise polynomials, despite being criticized as unsuitable for bang-bang control due to their inherent smoothness, are in fact a sensible choice for representing time-optimal trajectories for a quadrotor, as long as the selected polynomial segment number is larger than the number of switching points along the optimal trajectory of specific tasks. To establish an upper bound on the number of switching points, we analyze the time-optimality conditions and show that optimal maneuvers between two points follow a structured control policy: the most complex body rate exhibits a bang-singular-bang-singular-bang structure, while the collective thrust is bang-bang with at most seven bang arcs. This analysis enables a near-minimal trajectory parameterization alongside an efficient, scalable framework that reliably yields time-optimal waypoint trajectories over long mission distances. In numerical evaluations, our method demonstrates scale-invariant computation time and memory usage, taking virtually the same processing time across mission distances from 217 m to 2269 m, and the gaps to optimal times are minimal, falling between 1.7% and 3.5%. Finally, we validate the approach in real-world flight experiments, reaching speeds of up to 9.1 m/s.

Förderung

  • NSERC Discovery Grant

Zitieren

APA

Qin, C., Chen, J., Lin, Y., Goudar, A., Schoellig, A. P., & Liu, H. H. (2026). Time optimal quadrotor maneuver: From optimality analysis to trajectory planning. The International Journal of Robotics Research. https://doi.org/10.1177/02783649261480153

Vancouver

Qin C, Chen J, Lin Y, Goudar A, Schoellig AP, Liu HH. Time optimal quadrotor maneuver: From optimality analysis to trajectory planning. The International Journal of Robotics Research. 2026. doi:10.1177/02783649261480153

BibTeX
@article{Qin2026,
  author = {Qin, Chao and Chen, Jingxiang and Lin, Yifan and Goudar, Abhishek and Schoellig, Angela P. and Liu, Hugh H.-T.},
  title = {Time optimal quadrotor maneuver: From optimality analysis to trajectory planning},
  journal = {The International Journal of Robotics Research},
  year = {2026},
  doi = {10.1177/02783649261480153}
}
Kostenlos starten →