Euclidean and non-Euclidean Trajectory Optimization Approaches for Quadrotor Racing
Thomas Fork, Francesco Borrelli
TL;DR
This paper addresses the challenge of computing high‑fidelity racelines for quadrotor racing by presenting two geometry‑based trajectory optimization methods: a Euclidean formulation and a novel non‑Euclidean formulation that moves with the centerline. Both approaches leverage full drone dynamics, avoid gateway approximations, and support obstacle avoidance, with the non‑Euclidean method augmented by a safe flight corridor to handle dense obstacle fields. The authors demonstrate approximately 100× faster compute times than prior methods and show improved convergence, including successful obstacle avoidance on complex scenarios. The work significantly reduces planning time while maintaining dynamic feasibility, enabling more practical and scalable raceline optimization for competitive quadrotor racing.
Abstract
We present two quadrotor raceline optimization approaches which differ in using Euclidean or non-Euclidean geometry to describe vehicle position. Both approaches use high-fidelity quadrotor dynamics and avoid the need to approximate gates using waypoints. We demonstrate both approaches on simulated racetracks with realistic vehicle parameters where we demonstrate 100x faster compute time than comparable published methods and improved solver convergence. We then extend the non-Euclidean approach to compute racelines in the presence of numerous static obstacles.
