A sequential convex programming framework computes minimum-lap-time trajectories and powertrain settings for racing cars in seconds, yielding up to 4% faster laps than minimum-curvature methods and validating that energy limits barely affect the optimal line.
A three-dimensional free-trajectory quasi- steady-state optimal-control method for minimum-lap-time of race vehicles,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
A Sequential Convex Programming Approach to Free-trajectory Minimum-lap-time Optimization of Racing Cars
A sequential convex programming framework computes minimum-lap-time trajectories and powertrain settings for racing cars in seconds, yielding up to 4% faster laps than minimum-curvature methods and validating that energy limits barely affect the optimal line.