Intelligent Vehicle Path Planning Based on Optimized A Algorithm

• Published in: Sensors (Basel, Switzerland) Vol. 24; no. 10; p. 3149
• Main Authors: Chu, Liang, Wang, Yilin, Li, Shibo, Guo, Zhiqi, Du, Weiming, Li, Jinwei, Jiang, Zewei
• Format: Journal Article
• Language: English
• Published: Switzerland MDPI AG 01.05.2024
• Subjects: A algorithm; Algorithms; Efficiency; Heuristic; intelligent driving; Neural networks; obstacle raster coefficient; Optimization techniques; path planning; turning penalty function; A algorithm; intelligent driving; obstacle raster coefficient; path planning; turning penalty function
• ISSN: 1424-8220; 1424-8220
• DOI: 10.3390/s24103149

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.