Control-Informed Constraint Adaptation in Minimum-Time Trajectory Planning for Autonomous Racing

Control-Informed Constraint Adaptation in Minimum-Time Trajectory Planning for Autonomous Racing

Ann-Kathrin Schwehn, Alexander Langmann, Mattia Piccinini, Johannes Betz · N/A · 2026

planning control

Framework

N/A

License

N/A

Stars

N/A

Summary

Autonomous racecars operate at the limits of vehicle dynamics, where small control errors translate into safety-critical behavior and lost performance. Trajectory planners assume perfect tracking and remain blind to execution errors.

Abstract Summary

Autonomous racecars operate at the limits of vehicle dynamics, where small control errors translate into safety-critical behavior and lost performance. Trajectory planners assume perfect tracking and remain blind to execution errors. To guarantee safety, trajectory planners therefore restrict themselves to conservative spatial margins, leaving usable track space untapped. To overcome these issues, we introduce a control-informed online trajectory planning framework that learns from its own execution errors. By measuring systematic tracking deviations during runtime, we dynamically adapt spatial track constraints and iteratively expand the free-space planning area. The planner remains time-optimal while compensating for accumulated execution errors. This method was analyzed in a high-fidelity closed-loop simulation environment with autonomous racecars. The results demonstrate that our approach reduces lap time by 1.8\,s without increasing computational burden, maintaining a median runtime of 25 ms. Our finding indicates that feeding control-induced deviations back into the planning layer unlocks performance previously inaccessible to modular architectures and enables autonomous vehicles to exploit track limits systematically.

Key Points

  • Autonomous racecars operate at the limits of vehicle dynamics, where small control errors translate into safety-critical behavior and lost performance.
  • Trajectory planners assume perfect tracking and remain blind to execution errors
  • To guarantee safety, trajectory planners therefore restrict themselves to conservative spatial margins, leaving usable track space untapped.
  • To overcome these issues, we introduce a control-informed online trajectory planning framework that learns from its own execution errors.
  • By measuring systematic tracking deviations during runtime, we dynamically adapt spatial track constraints and iteratively expand the free-space planning area.

Methodology

In this section, we introduce the proposed control-informed trajectory planning framework, designed to dynamically adapt the plannable area during runtime. Our algorithm is integrated into a modular autonomous racing software stack [ 29 ] . We further present the track representation, the vehicle dynamics, and the baseline OCP.

Finally, we display our core contribution in detail, presenting the mathematical formulations used to evaluate tracking errors and iteratively adapt the plannable area constraints.

Methodology — Control-Informed Constraint Adaptation in Minimum-Time Trajectory Planning for Autonomous Racing
Fig. 3: Depiction of the segmentation of the race track. The sections shaded in blue indicate the proximity of the raceline to a track boundary. The thin black lines mark the discrete points of the adaptation map.

Sources and Demonstrations

Figures are reproduced from Schwehn et al. See the full paper for experimental details and the project page, when the paper links one, for demonstrations and videos.

Share

Related Papers

AD-WM: Action-Discriminative World Models for Counterfactual Model Predictive Control
arXiv preprint

AD-WM: Action-Discriminative World Models for Counterfactual Model Predictive Control

Jiabin Qiu, Zixuan Chen, Hongye Cao et al.

Latent world models are typically trained to predict factual transitions, whereas model predictive control (MPC) must compare alternative actions from the same state. A model can therefore achieve low factual prediction error yet poorly distinguish candidate actions.

manipulation reinforcement-learning planning control
Code PDF Intermediate
GitHub ★ —