Global minimum time trajectory planning considering curvature and distance for track racing

This work focuses on global minimum time trajectory planning for track racing considering curvature and distance based on offline high-precision map of track. Offline mapping of track, post processing and a new gridding method are firstly introduced. Then according to the requirement of quadratic programming method, the sum of discrete squared distance and the sum of discrete squared curvature are derived respectively, which are then combined together by a weight coefficient to constitute the objective function of minimum time trajectory. Drivable curbs, size of vehicle and safe distance are considered in constraint conditions in order to make full use of the width of track. With objective function and constraint conditions, quadratic programming method is used to calculate and iterate a smooth and reasonable trajectory. Petrol and electric racecars, different driver models and different trajectories are simulated in CarSim. Results show that conspicuous improvement can be obtained if using drivable curbs, and the minimum time trajectories for different vehicles and drivers display significant difference.

Authors

Institutions

Publication Details

Journal
Scientific Reports
Published
2025-10-24
DOI
https://doi.org/10.1038/s41598-025-21211-2
Primary Topic
Robotic Path Planning Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Global minimum time trajectory planning considering curvature and distance for track racing

Dongmin Zhang, Yang Yuan, Futang Zhu
Scientific Reports
Robotic Path Planning Algorithms
article

Global minimum time trajectory planning considering curvature and distance for track racing

Dongmin Zhang, Yang Yuan, Futang Zhu
article en

Abstract

This work focuses on global minimum time trajectory planning for track racing considering curvature and distance based on offline high-precision map of track. Offline mapping of track, post processing and a new gridding method are firstly introduced. Then according to the requirement of quadratic programming method, the sum of discrete squared distance and the sum of discrete squared curvature are derived respectively, which are then combined together by a weight coefficient to constitute the objective function of minimum time trajectory. Drivable curbs, size of vehicle and safe distance are considered in constraint conditions in order to make full use of the width of track. With objective function and constraint conditions, quadratic programming method is used to calculate and iterate a smooth and reasonable trajectory. Petrol and electric racecars, different driver models and different trajectories are simulated in CarSim. Results show that conspicuous improvement can be obtained if using drivable curbs, and the minimum time trajectories for different vehicles and drivers display significant difference.

Scientific ReportsVol. 15(1)
China Automotive Engineering Research Institute (CN)
Openalex Percentile: Top 70%
Robotic Path Planning Algorithms
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.