EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Intelligent Vehicle Path Planning Based on Optimized A* Algorithm

Liang Chu, Yilin Wang, Shibo Li, Zhiqi Guo, Weiming Du, Jinwei Li, Zewei Jiang

Sensors · 15.05.2024 · 24 (10) · 3149

DOI: 10.3390/s24103149 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Sensors, online erschienen am 15.05.2024. Verfasst von Liang Chu und 6 weiteren Autor:innen. Beteiligte Einrichtung: State Key Laboratory of Automotive Simulation and Control, Jilin University, No. 5988, Renmin Street, Nanguan District, Changchun 130022, China. Die Arbeit wurde bisher 41-mal zitiert (Crossref) und nennt 45 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: the State Scholarship Funding of CSC, the Changsha Automotive Innovation Research Institute Innovation Project-Research on Intelligent Trip Planning System of Pure Electric Vehicles Based on Big Da…, science and technology planning project in Yibin city.

AbstractSchlagwörterBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

With the rapid development of the intelligent driving technology, achieving accurate path planning for unmanned vehicles has become increasingly crucial. However, path planning algorithms face challenges when dealing with complex and ever-changing road conditions. In this paper, aiming at improving the accuracy and robustness of the generated path, a global programming algorithm based on optimization is proposed, while maintaining the efficiency of the traditional A* algorithm. Firstly, turning penalty function and obstacle raster coefficient are integrated into the search cost function to increase the adaptability and directionality of the search path to the map. Secondly, an efficient search strategy is proposed to solve the problem that trajectories will pass through sparse obstacles while reducing spatial complexity. Thirdly, a redundant node elimination strategy based on discrete smoothing optimization effectively reduces the total length of control points and paths, and greatly reduces the difficulty of subsequent trajectory optimization. Finally, the simulation results, based on real map rasterization, highlight the advanced performance of the path planning and the comparison among the baselines and the proposed strategy showcases that the optimized A* algorithm significantly enhances the security and rationality of the planned path. Notably, it reduces the number of traversed nodes by 84%, the total turning angle by 39%, and shortens the overall path length to a certain extent.

Schlagwörter

Stichwörter der Autor:innen

A* algorithmintelligent drivingobstacle raster coefficientpath planningturning penalty function

Autor:innen und Institutionen

  • State Key Laboratory of Automotive Simulation and Control, Jilin University, No. 5988, Renmin Street, Nanguan District, Changchun 130022, China.

Förderung

  • the State Scholarship Funding of CSC
  • the Changsha Automotive Innovation Research Institute Innovation Project-Research on Intelligent Trip Planning System of Pure Electric Vehicles Based on Big Da…
  • science and technology planning project in Yibin city
  • science and technology planning project in Tianjin city
  • State Scholarship Funding of CSC
  • Changsha Automotive Innovation Research Institute Innovation Project-Research on Intelligent Trip Planning System of Pure Electric Vehicles Based on Big Data

Zitieren

APA

Chu, L., Wang, Y., Li, S., Guo, Z., Du, W., Li, J., & Jiang, Z. (2024). Intelligent Vehicle Path Planning Based on Optimized A* Algorithm. Sensors, 24(10), 3149. https://doi.org/10.3390/s24103149

Vancouver

Chu L, Wang Y, Li S, Guo Z, Du W, Li J, et al. Intelligent Vehicle Path Planning Based on Optimized A* Algorithm. Sensors. 2024;24(10):3149. doi:10.3390/s24103149

BibTeX
@article{Chu2024,
  author = {Chu, Liang and Wang, Yilin and Li, Shibo and Guo, Zhiqi and Du, Weiming and Li, Jinwei and Jiang, Zewei},
  title = {Intelligent Vehicle Path Planning Based on Optimized A* Algorithm},
  journal = {Sensors},
  year = {2024},
  volume = {24},
  number = {10},
  pages = {3149},
  doi = {10.3390/s24103149}
}
Kostenlos starten →