高级检索+

改进自适应蚁群的城市道路智能车路径优化

Improved Adaptive Ant Colony-based Urban Road Smart Car Path Optimization

  • 摘要: 为优化城市道路中智能车辆规划路径的长度与转折次数,本文提出一种改进的自适应蚁群算法。以栅格法对城市道路环境网格化处理,以路径最短、转折次数最少为优化目标函数,改进邻域搜索范围,将8邻域扩大为24邻域,利用启发函数更新初始信息素,动态调整信息素挥发系数,并提出返回上一步的死锁策略,最后考虑曲率限制,以三次B样条曲线法(B-spline curve)平滑优化处理。此研究表明,在随机生成的城市环境地图模型下,该算法较标准蚁群算法与自适应算法,路径长度分别缩短3.89%、8.38%,路径节点分别减少28%、24.2%,收敛次数分别减少37.5%、20%。此研究结果为城市道路智能车辆路径优化提供较好的理论依据。

     

    Abstract: In order to optimize the length and number of turns of intelligent vehicle planning paths in urban roads, this paper proposes an improved adaptive ant colony algorithm. The raster method is used to grid the urban road environment, the shortest path and the least number of turns are used as the optimization objective function, the neighborhood search range is improved, the 8 neighborhood is expanded to 24 neighborhoods, the initial pheromone is updated using a heuristic function, the pheromone volatility coefficient is dynamically adjusted, and a deadlock strategy of returning to the previous step is proposed, and finally the curvature limitation is considered and the three-time B-spline curve method is used to process smoothing optimization. This study shows that the algorithm reduces the path length by 3.89% and 8.38%, the path nodes by 28% and 24.2%, and the number of convergence by 37.5% and 20%, respectively, compared with the standard ACO and the adaptive algorithm under the randomly generated urban environment map model. The results of this study provide a good theoretical basis for the optimization of intelligent vehicle paths on urban roads.

     

/

返回文章
返回