TY - GEN
T1 - Improved RRT-based Trajectory Planning for Connected Autonomous Vehicles on Urban Roads
AU - Li, Jiale
AU - Fang, Jiayi
AU - Yang, Chao
AU - Zhang, Yuhang
AU - Lu, Qizhe
N1 - Publisher Copyright:
© 2025 IEEE.
PY - 2025
Y1 - 2025
N2 - In response to the challenges of high computational costs, prolonged time consumption, and difficulty in incorporating traffic rules of standard trajectory planning algorithms. This paper proposes an improved rapidly-exploring-random-trees (RRT)-based trajectory planning method for connected autonomous vehicles (CAVs) in urban roads through utilizing real-time traffic information from vehicle-to-vehicle (V2V) and vehicle-to-infrastructure (V2I) communications. The proposed method does not require precise modeling and possesses fast planning speed and good applicability like RRT. It also removes over curves of the paths generated and satisfies traffic rules by introducing a variable step-size adjustment strategy, a heuristic search method, and a cost function incorporating driver behavior constraints. The generated trajectory is further optimized using redundant node removal and spline interpolation. Then, through lots of simulation experiments under various driving scenarios, the proposed method reduces the average planning time by 39.36% and shortens the average trajectory length by 12.59% compared to the classical RRT algorithm. Finally, the proposed algorithm's effectiveness in planning under dynamic obstacles and actual vehicle conditions was also validated.
AB - In response to the challenges of high computational costs, prolonged time consumption, and difficulty in incorporating traffic rules of standard trajectory planning algorithms. This paper proposes an improved rapidly-exploring-random-trees (RRT)-based trajectory planning method for connected autonomous vehicles (CAVs) in urban roads through utilizing real-time traffic information from vehicle-to-vehicle (V2V) and vehicle-to-infrastructure (V2I) communications. The proposed method does not require precise modeling and possesses fast planning speed and good applicability like RRT. It also removes over curves of the paths generated and satisfies traffic rules by introducing a variable step-size adjustment strategy, a heuristic search method, and a cost function incorporating driver behavior constraints. The generated trajectory is further optimized using redundant node removal and spline interpolation. Then, through lots of simulation experiments under various driving scenarios, the proposed method reduces the average planning time by 39.36% and shortens the average trajectory length by 12.59% compared to the classical RRT algorithm. Finally, the proposed algorithm's effectiveness in planning under dynamic obstacles and actual vehicle conditions was also validated.
KW - Connected autonomous vehicles
KW - RRT algorithm
KW - dynamic planning
KW - global obstacle avoidance
KW - heuristic search strategy
KW - trajectory planning
UR - https://www.scopus.com/pages/publications/105013960692
U2 - 10.1109/CCDC65474.2025.11091061
DO - 10.1109/CCDC65474.2025.11091061
M3 - Conference contribution
AN - SCOPUS:105013960692
T3 - Proceedings of the 37th Chinese Control and Decision Conference, CCDC 2025
SP - 2886
EP - 2891
BT - Proceedings of the 37th Chinese Control and Decision Conference, CCDC 2025
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 37th Chinese Control and Decision Conference, CCDC 2025
Y2 - 16 May 2025 through 19 May 2025
ER -