In this article, we propose a path planning algorithm focused on high-speed lane-change scenarios in autonomous racing applications. Specifically, by formulating a quadratic Optimal Control Problem, we design nearly curvature optimal trajectories that can allow for high-speed maneuver execution. The problem formulation includes a convenient approach for the linearization and discretization of the path system dynamics. Unlike most state-of-the-art approaches, the proposed method does not need to constrain the path shape to predefined polynomial primitives and does not perform inefficient grid searches over sets of candidate maneuvers. Instead, it can directly optimize path curvature, while fulfilling path smoothness and trajectory constraints. We tested the proposed methods in a racing simulation environment, and compared its results with a benchmark algorithm. The results show the algorithm’s ability to return nearly curvature-optimal solutions while maintaining real-time feasibility. Eventually, such results demonstrate the effectiveness of the proposed solutions.

Curvature-Optimal Merging Segment Planning for Autonomous Racing Vehicles

Lucchini A.;Ticozzi A.;Panzani G.;Corno M.;Savaresi S. M.
2025-01-01

Abstract

In this article, we propose a path planning algorithm focused on high-speed lane-change scenarios in autonomous racing applications. Specifically, by formulating a quadratic Optimal Control Problem, we design nearly curvature optimal trajectories that can allow for high-speed maneuver execution. The problem formulation includes a convenient approach for the linearization and discretization of the path system dynamics. Unlike most state-of-the-art approaches, the proposed method does not need to constrain the path shape to predefined polynomial primitives and does not perform inefficient grid searches over sets of candidate maneuvers. Instead, it can directly optimize path curvature, while fulfilling path smoothness and trajectory constraints. We tested the proposed methods in a racing simulation environment, and compared its results with a benchmark algorithm. The results show the algorithm’s ability to return nearly curvature-optimal solutions while maintaining real-time feasibility. Eventually, such results demonstrate the effectiveness of the proposed solutions.
2025
Autonomous racing
curvature optimization
optimal control problem
path planning
File in questo prodotto:
File Dimensione Formato  
Curvature-Optimal_Merging_Segment_Planning_for_Autonomous_Racing_Vehicles.pdf

Accesso riservato

: Publisher’s version
Dimensione 11.82 MB
Formato Adobe PDF
11.82 MB Adobe PDF   Visualizza/Apri

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11311/1287465
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 0
  • ???jsp.display-item.citation.isi??? 0
social impact