CL-infoRRT Collision-Avoidance Trajectory Planning for Autonomous Vehicle

<div class="section abstract"><div class="htmlview paragraph">To ensure the safety and stability of road traffic, autonomous vehicles must proactively avoid collisions with traffic participants when driving on public roads. Collision avoidance refers to the process by which autonomous vehicles detect and avoid static and dynamic obstacles on the road, ensuring safe navigation in complex traffic environments. To achieve effective obstacle avoidance, this paper proposes a CL-infoRRT planning algorithm. CL-infoRRT consists of two parts. The first part is the informed RRT algorithm for structured roads, which is used to plan the reference path for obstacle avoidance. The second part is a closed-loop simulation module that incorporates vehicle kinematics to smooth the planned obstacle avoidance reference path, resulting in an executable obstacle avoidance trajectory. To verify the effectiveness of the proposed method, four static obstacle test scenarios and four RRT comparison algorithms were designed. The implementation results show that all five algorithms can generate obstacle avoidance trajectories in the four scenarios. However, compared with the comparison algorithms, the proposed method uses fewer nodes. In Scenario 1, the proposed method uses 3.82% fewer nodes than RRT-Basic, 0.96% fewer nodes than RRT-Goal, 0.77% fewer nodes than RRT-Star, and 4.77% fewer nodes than RRT-Connect. In Scenario 2, the proposed method uses 3.76% fewer nodes than RRT-Basic, 1.35% fewer nodes than RRT-Goal, 0.12% fewer nodes than RRT-Star, and 13.14% fewer nodes than RRT-Connect. In Scenario 3, the proposed method uses 4.48% fewer nodes than RRT-Basic, 2.01% fewer nodes than RRT-Goal, 0.57% fewer nodes than RRT-Star, and 5.87% fewer nodes than RRT-Connect. In Scenario 4, the proposed method uses 3.59% fewer nodes than RRT-Basic, 1.76% fewer nodes than RRT-Goal, 0.16% fewer nodes than RRT-Star, and 5.77% fewer nodes than RRT-Connect. This indicates that the proposed method can effectively plan optimal and safe obstacle avoidance trajectories.</div></div>

Authors

Institutions

Publication Details

Journal
SAE technical papers on CD-ROM/SAE technical paper series
Published
2025-03-31
DOI
https://doi.org/10.4271/2025-01-8027
Citations
1
Primary Topic
Robotic Path Planning Algorithms
Type
article
Field-Weighted Citation Impact
1.28
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

CL-infoRRT Collision-Avoidance Trajectory Planning for Autonomous Vehicle

Jinwen Yang, Dequan Zeng, Xiaoliang Wang, Yiming Hu et al.
1 citations
SAE technical papers on CD-ROM/SAE technical paper series
Robotic Path Planning Algorithms
1.28
article

CL-infoRRT Collision-Avoidance Trajectory Planning for Autonomous Vehicle

Jinwen Yang, Dequan Zeng, Xiaoliang Wang, Yiming Hu, Qin Yu, Jun Lu, Wei Wu
article en
1 citations

Abstract

<div class="section abstract"><div class="htmlview paragraph">To ensure the safety and stability of road traffic, autonomous vehicles must proactively avoid collisions with traffic participants when driving on public roads. Collision avoidance refers to the process by which autonomous vehicles detect and avoid static and dynamic obstacles on the road, ensuring safe navigation in complex traffic environments. To achieve effective obstacle avoidance, this paper proposes a CL-infoRRT planning algorithm. CL-infoRRT consists of two parts. The first part is the informed RRT algorithm for structured roads, which is used to plan the reference path for obstacle avoidance. The second part is a closed-loop simulation module that incorporates vehicle kinematics to smooth the planned obstacle avoidance reference path, resulting in an executable obstacle avoidance trajectory. To verify the effectiveness of the proposed method, four static obstacle test scenarios and four RRT comparison algorithms were designed. The implementation results show that all five algorithms can generate obstacle avoidance trajectories in the four scenarios. However, compared with the comparison algorithms, the proposed method uses fewer nodes. In Scenario 1, the proposed method uses 3.82% fewer nodes than RRT-Basic, 0.96% fewer nodes than RRT-Goal, 0.77% fewer nodes than RRT-Star, and 4.77% fewer nodes than RRT-Connect. In Scenario 2, the proposed method uses 3.76% fewer nodes than RRT-Basic, 1.35% fewer nodes than RRT-Goal, 0.12% fewer nodes than RRT-Star, and 13.14% fewer nodes than RRT-Connect. In Scenario 3, the proposed method uses 4.48% fewer nodes than RRT-Basic, 2.01% fewer nodes than RRT-Goal, 0.57% fewer nodes than RRT-Star, and 5.87% fewer nodes than RRT-Connect. In Scenario 4, the proposed method uses 3.59% fewer nodes than RRT-Basic, 1.76% fewer nodes than RRT-Goal, 0.16% fewer nodes than RRT-Star, and 5.77% fewer nodes than RRT-Connect. This indicates that the proposed method can effectively plan optimal and safe obstacle avoidance trajectories.</div></div>

SAE technical papers on CD-ROM/SAE technical paper seriesVol. 1
East China Jiaotong University (CN)
Openalex Percentile: Top 22%
Robotic Path Planning Algorithms
1.28
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.