Chu Liang, Wang Yilin, Li Shibo, Guo Zhiqi, Du Weiming, Li Jinwei, Jiang Zewei
State Key Laboratory of Automotive Simulation and Control, Jilin University, No. 5988, Renmin Street, Nanguan District, Changchun 130022, China.
Sensors (Basel). 2024 May 15;24(10):3149. 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.
随着智能驾驶技术的快速发展,为无人驾驶车辆实现精确的路径规划变得越来越关键。然而,路径规划算法在处理复杂且不断变化的道路状况时面临挑战。本文旨在提高生成路径的准确性和鲁棒性,提出了一种基于优化的全局规划算法,同时保持传统A算法的效率。首先,将转弯惩罚函数和障碍物栅格系数集成到搜索成本函数中,以提高搜索路径对地图的适应性和方向性。其次,提出了一种高效的搜索策略,以解决轨迹在减少空间复杂度的同时会穿过稀疏障碍物的问题。第三,基于离散平滑优化的冗余节点消除策略有效地减少了控制点和路径的总长度,并大大降低了后续轨迹优化的难度。最后,基于真实地图栅格化的仿真结果突出了路径规划的先进性能,并且基线与所提出策略之间的比较表明,优化后的A算法显著提高了规划路径的安全性和合理性。值得注意的是,它将遍历节点数量减少了84%,总转弯角度减少了39%,并在一定程度上缩短了整体路径长度。