Explore Real-time Path Planning Algorithms For Autonomous Vehicles In Dynamic Environments
Year: 2024
Type: article
Abstract: In recent years, the technology of autonomous driving has aroused wide concern in the society. This paper aims to introduce the principle of four kinds of path planning algorithms mainly applied to automatic driving technology and point out their advantages and disadvantages. In dynamic environments, perfect automated driving technology should be able to avoid obstacles completely. This means it can face uncontrollable factors such as pedestrians and vehicles on the road. This means that automated driving technology can improve traffic safety and avoid accidents. The algorithm should also be able to calculate the best path and speed to reduce traffic congestion. Calculate the traffic sequence between vehicles to improve traffic efficiency. In dynamic road conditions, the real-time path planning algorithm mainly faces the requirements of environment change, algorithm smoothness and real-time performance. In this paper, the Dijkstra algorithm, A* algorithm, RRT algorithm, PRM algorithm and MPC algorithm are analyzed and compared. This paper focuses on the advantages and limitations of algorithms, summarizes the shortcomings of five algorithms, and puts forward some ideas for future research.
Author: Zhexuan Zhao
Institution: Curtin Singapore
Language: English
Subfield: Computer Vision and Pattern Recognition
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid
OpenAlex ID: W4404798937