A path-planning algorithm for autonomous vehicles based on traffic stability criteria: the AS-IAPF algorithm

Abstract. Urban traffic congestion, obstacle avoidance, and driving efficiency are the challenges faced by autonomous-vehicle path-planning technology in cities. The traditional artificial potential field (APF) algorithm is insufficient to meet the requirements of efficiency and safety in path planning, as it easily gets trapped in local optima when dealing with complex environments. Therefore, this paper proposes a novel AS-IAPF path-planning algorithm to more efficiently enhance the target reachability of autonomous vehicles in complex traffic environments. Firstly, this paper analyzes and elucidates the macroscopic traffic model, achieving effective modeling of dynamic traffic flow stability based on Lyapunov stability theorem and a classical 1D flow model. Thus, the threshold discriminant formula for traffic element stability is obtained. Secondly, based on the aforementioned threshold discriminant formula, a new AS-IAPF algorithm is proposed. The algorithm mainly includes two aspects: firstly, by pre-generating initial paths and introducing a Gaussian oscillation coefficient of force fields, it avoids the algorithm falling into local optima; secondly, by using the aforementioned driving stability threshold discriminant formula as a dimensional adjustment for adaptively improving and adjusting the strength coefficient of the AS-APF repulsive field, the algorithm further improves the efficiency of path planning. Finally, the algorithm is subjected to joint simulations of 2D and 3D scenarios of different types. The research results show that the AS-IAPF algorithm outperforms other algorithms of the same type with respect to comprehensive performance based on multiple 2D scenario simulation experiments. In the 3D simulation experiments of three different typical traffic scenarios, the proposed algorithm can drive autonomous vehicles to effectively perform corresponding obstacle avoidance actions based on the actual traffic scenarios ahead, ultimately achieving safe obstacle avoidance. The path-planning method proposed in this paper can enhance driving efficiency while considering the safety and stability of vehicles, providing a promising approach and reference for the path planning of autonomous vehicles.

Authors

Institutions

Publication Details

Journal
Mechanical sciences
Published
2024-11-08
DOI
https://doi.org/10.5194/ms-15-613-2024
Citations
1
Primary Topic
Robotic Path Planning Algorithms
Type
article
Field-Weighted Citation Impact
0.25

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A path-planning algorithm for autonomous vehicles based on traffic stability criteria: the AS-IAPF algorithm

Yuming Lu, Xuan Li, Hongxi Wang, Minqing Zhao et al.
1 citations
Mechanical sciences
Robotic Path Planning Algorithms
0.25
article

A path-planning algorithm for autonomous vehicles based on traffic stability criteria: the AS-IAPF algorithm

Yuming Lu, Xuan Li, Hongxi Wang, Minqing Zhao, Shanping Ning
article en
1 citations

Abstract

Abstract. Urban traffic congestion, obstacle avoidance, and driving efficiency are the challenges faced by autonomous-vehicle path-planning technology in cities. The traditional artificial potential field (APF) algorithm is insufficient to meet the requirements of efficiency and safety in path planning, as it easily gets trapped in local optima when dealing with complex environments. Therefore, this paper proposes a novel AS-IAPF path-planning algorithm to more efficiently enhance the target reachability of autonomous vehicles in complex traffic environments. Firstly, this paper analyzes and elucidates the macroscopic traffic model, achieving effective modeling of dynamic traffic flow stability based on Lyapunov stability theorem and a classical 1D flow model. Thus, the threshold discriminant formula for traffic element stability is obtained. Secondly, based on the aforementioned threshold discriminant formula, a new AS-IAPF algorithm is proposed. The algorithm mainly includes two aspects: firstly, by pre-generating initial paths and introducing a Gaussian oscillation coefficient of force fields, it avoids the algorithm falling into local optima; secondly, by using the aforementioned driving stability threshold discriminant formula as a dimensional adjustment for adaptively improving and adjusting the strength coefficient of the AS-APF repulsive field, the algorithm further improves the efficiency of path planning. Finally, the algorithm is subjected to joint simulations of 2D and 3D scenarios of different types. The research results show that the AS-IAPF algorithm outperforms other algorithms of the same type with respect to comprehensive performance based on multiple 2D scenario simulation experiments. In the 3D simulation experiments of three different typical traffic scenarios, the proposed algorithm can drive autonomous vehicles to effectively perform corresponding obstacle avoidance actions based on the actual traffic scenarios ahead, ultimately achieving safe obstacle avoidance. The path-planning method proposed in this paper can enhance driving efficiency while considering the safety and stability of vehicles, providing a promising approach and reference for the path planning of autonomous vehicles.

Mechanical sciencesVol. 15(2)
East China Jiaotong University (CN), Xi'an Technological University (CN), Jiangling Motors Corporation (China) (CN), Nanchang Hangkong University (CN)
National Science Fund for Distinguished Young Scholars, National Transgenic Science and Technology Program
Openalex Percentile: Top 45%
Robotic Path Planning Algorithms
0.25
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.