Curvature-Optimal Merging Segment Planning for Autonomous Racing Vehicles

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 pre-defined 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.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Intelligent Transportation Systems
Published
2024-12-20
DOI
https://doi.org/10.1109/tits.2024.3515649
Primary Topic
Transportation and Mobility Innovations
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Curvature-Optimal Merging Segment Planning for Autonomous Racing Vehicles

Andrea Ticozzi, Sergio M. Savaresi, Giulio Panzani, Matteo Corno et al.
IEEE Transactions on Intelligent Transportation Systems
Transportation and Mobility Innovations
article

Curvature-Optimal Merging Segment Planning for Autonomous Racing Vehicles

Andrea Ticozzi, Sergio M. Savaresi, Giulio Panzani, Matteo Corno, Alberto Lucchini
article en

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 pre-defined 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.

IEEE Transactions on Intelligent Transportation SystemsVol. 26(2)
Politecnico di Milano (IT)
Openalex Percentile: Top 74%
Transportation and Mobility Innovations
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Curvature-Optimal Merging Segment Planning for Autonomous Racing Vehicles — Andrea Ticozzi, Sergio M. Savaresi, et al. · IEEE Transactions on Intelligent Transportation Systems (2024) | TGRS Research Map | TGRS