改进A*-DWA算法的AGV动态路径规划

Dynamic path planning for AGV based on improved A*-DWA algorithm

  • 摘要: 针对复杂仓储环境自动导引机器人(automated guided vehicle, AGV)传统路径规划算法在路径搜索中存在局部最优、搜索效率低、实时避障能力差等问题,提出了一种融合改进A*与DWA的AGV动态路径协同规划算法。首先,对传统A*算法的启发函数进行改进重构,引入动态权重系数提高搜索效率,通过减少冗余转向节点精简全局路径。其次,将改进后的全局路径关键节点作为DWA的当前目标点,改进局部路径评价函数体系,在维持全局最优性的前提下增强动态避障能力,防止陷入局部最优。同时,改进关键点选取策略,使用动态窗口快速检测下一个目标点,显著提升动态环境下的避障性能和路径搜索效率。仿真结果表明,在复杂仓储环境下,改进后的融合算法相较于传统算法,平均路径长度缩减35%,平均搜索时间缩短46%,同时路径转向次数减少58%,有效提升动态路径规划效率和实时避障能力,具有一定的优越性和有效性。

     

    Abstract: Aiming at the problems such as local optimum, low search efficiency and poor real-time obstacle avoidance ability in the path search of traditional AGV path planning algorithms in complex warehouse environments, an AGV dynamic path collaborative planning algorithm integrating improved A* and DWA is proposed. Firstly, the heuristic function of the traditional A* algorithm is improved and reconstructed. A dynamic weight coefficient is introduced to enhance the search efficiency, and the global path is streamlined by reducing redundant steering nodes. Secondly, the improved global path key nodes are taken as the current target points of DWA, and the local path evaluation function system is improved. Under the premise of maintaining global optimality, the dynamic obstacle avoidance ability is enhanced to prevent falling into local optimum. Meanwhile, the key point selection strategy was improved, and dynamic windows were used to quickly detect the next target point, significantly enhancing the obstacle avoidance performance and path search efficiency in dynamic environments. The simulation results show that in a complex warehousing environment, compared with the traditional algorithm, the improved fusion algorithm reduces the average path length by 35%, the average search time by 46%, and the number of path turns by 58%. It effectively improves the efficiency of dynamic path planning and real-time obstacle avoidance ability, and has certain superiority and effectiveness.

     

/

返回文章
返回