Guardado en:
| Autores principales: | , , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | https://arxiv.org/abs/2511.13522 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866911590439190528 |
|---|---|
| author | Eshof, Erik van den de Vries, Wytze van Kampen, Jorn Salazar, Mauro |
| author_facet | Eshof, Erik van den de Vries, Wytze van Kampen, Jorn Salazar, Mauro |
| contents | This paper presents a modeling and optimization framework to compute the minimum-lap-time spatial trajectory and powertrain operation of racing cars in a computationally efficient fashion. Specifically, we first derive a quasi-steady-state model of a racing car, whereby the racing line trajectory is jointly optimized. Next, we frame the minimum-lap-time problem and leverage its mostly convex structure by devising a sequential convex programming solution algorithm. We benchmark our method against off-the-shelf nonlinear programming solvers, showing how it can bring computation time down from a few minutes to a few seconds, paving the way for real-time implementations. Moreover, we compare our results to similarly efficient minimum-curvature racing line optimization methods, showing how a minimum-time-based racing line might lead to 4% faster lap-times. Finally, we showcase our framework for optimal powertrain energy management and we validate the common modeling assumption that the racing line is unaffected by energy limitations, showing that this assumption results in marginal lap-time losses of under 0.1%. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2511_13522 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | A Sequential Convex Programming Approach to Free-trajectory Minimum-lap-time Optimization of Racing Cars Eshof, Erik van den de Vries, Wytze van Kampen, Jorn Salazar, Mauro Optimization and Control This paper presents a modeling and optimization framework to compute the minimum-lap-time spatial trajectory and powertrain operation of racing cars in a computationally efficient fashion. Specifically, we first derive a quasi-steady-state model of a racing car, whereby the racing line trajectory is jointly optimized. Next, we frame the minimum-lap-time problem and leverage its mostly convex structure by devising a sequential convex programming solution algorithm. We benchmark our method against off-the-shelf nonlinear programming solvers, showing how it can bring computation time down from a few minutes to a few seconds, paving the way for real-time implementations. Moreover, we compare our results to similarly efficient minimum-curvature racing line optimization methods, showing how a minimum-time-based racing line might lead to 4% faster lap-times. Finally, we showcase our framework for optimal powertrain energy management and we validate the common modeling assumption that the racing line is unaffected by energy limitations, showing that this assumption results in marginal lap-time losses of under 0.1%. |
| title | A Sequential Convex Programming Approach to Free-trajectory Minimum-lap-time Optimization of Racing Cars |
| topic | Optimization and Control |
| url | https://arxiv.org/abs/2511.13522 |