Skip to content

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

Aug 2026 · arXiv.org · Vol abs/2608.14448 · 0 citations · 30 references
Computer Science

TL;DR

This work introduces a control-informed online trajectory planning framework that learns from its own execution errors, and demonstrates 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.

Abstract

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.

View source

Similar papers

Preprint Oct 2026

Learning Direct Control from Optimization for Dynamic Target Tracking

Dynamic target tracking requires a mobile robot to maintain target visibility while navigating obstacles with smooth, feasible controls. Online trajectory optimization explicitly encodes these objectives but requires repeated numerical solving, whereas waypoint-based neural policies separate geometric prediction from c...

Bing Sun, Yue Lin, Can-Hui Wen et al. · 0 citations
Preprint Oct 2026

Closed-Loop Refinement and Execution for Learned Driving Planners

Learning-based driving planners are usually trained and evaluated in open loop against logged trajectories. In closed loop, a trajectory with small displacement error can still stall the vehicle, steer it into a conflict with surrounding agents, or be executed with abrupt braking. We introduce Closed-Loop Refinement an...

Huai-Jin Hu, Shan-Ting Wang, Zhong-Yu Mo et al. · 0 citations
Preprint Oct 2026

Prescribed Performance Guided Safe Reinforcement Learning for Roundabout Navigation of Autonomous Vehicles

This work proposes RLTrajGen-PPMPC-CBF, a hierarchical framework for safe, smooth and comfort roundabout navigation, which regulates the coupling between RL-based planning and MPC-based control, and employs Prescribed Performance Constraints (PPC) to enforce a gradual, stable convergence between reference trajectories...

Wen-Han Li, Yang-Rui Zhang, Hang Zhou et al. · 0 citations
Preprint Oct 2026

Continuous-Time Safe Planning and Control for Agile Quadrupeds

Agile quadruped navigation in dynamic environments demands trajectories that are both dynamically feasible and provably collision-free. Most real-time planners achieve tractability through a convex reduction that requires simplified kinematic models, discarding motion that the robot can readily execute, and certify saf...

Gage MacLin, Mason B. Peterson, Camilla Tabasso et al. · 0 citations
Open access Nov 2026

Uncertainty-Calibrated Hamilton-Jacobi Value Learning for Safe Crowd Navigation

Safe navigation in human crowds requires efficiency and reliability. Learning-based policies run fast but can fail under distribution shift, whereas Hamilton–Jacobi (HJ) reachability offers principled safety guarantees but is computationally expensive. We propose a prediction-conditioned reachability framework that bri...

I. Winata, Junghyun Oh · 0 citations
Preprint Sep 2026

Time-Efficient Iterative Learning Planning for Safety-Critical Dynamic Obstacle Avoidance

Autonomous mobile robots require timeefficient planning and safety-critical dynamic obstacle avoidance under constrained onboard computation. While Iterative Learning Planning (ILP) offers lightweight and efficient traversal planning, it lacks explicit mechanisms for dynamic obstacle perception and avoidance. This arti...

Zhi-Yi Chen, Shu-Li Lv, Chen Min et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.