基于改进A*算法的四向穿梭车路径规划方法

    A Path Planning Method for Four-way Shuttles Based on an Improved A*Algorithm

    • 摘要: 针对现有四向穿梭车仓储系统在缺陷区域场景下路径规划效率低的问题,提出一种基于改进A*算法的优化方法。传统路径规划算法在该类复杂仓储环境中易产生转向次数冗余、无效节点遍历量大等缺陷,导致任务执行时间显著增加。为解决该问题,建立包含缺陷区域的仓储拓扑地图模型,系统分析曼哈顿距离、欧氏距离等启发式函数在非均匀仓储布局中的适应性差异。针对缺陷区域导致传统启发函数预估偏差较大的核心问题,引入三角形不等式准则重构启发式函数,有效提升路径成本预估精度。通过构建四向穿梭车仓储系统仿真平台,进行实验验证。实验数据表明,改进算法较双向A*算法平均减少68.5%的探索节点数量,搜索效率提升4.3%,任务执行效率提升10.1%。该方法在搜索效率与路径求解质量上有一定的优化效果,为高密度仓储系统路径规划提供了新的解决方案。

       

      Abstract: The four-way shuttle-based high-density storage system represents a new generation of stereoscopic warehouse solutions in high-density and complex environments. This paper aims to solve the problem that four-way shuttles tend to experience frequent turns and visit many invalid nodes during operation with defective areas, resulting in long task execution time and low algorithm search efficiency. By establishing a topological map of the storage environment, the search performance of different heuristic estimation functions in the four-way shuttle topological map is compared and analyzed. In scenarios with defective areas that may lead to significant deviations between heuristic estimates and actual path cost, a triangle-based heuristic method is introduced to improve the A* algorithm. A simulation platform for the four-way shuttle-based high-density storage system is constructed to verify the effectiveness of the proposed method. Simulation results show that the improved A* algorithm can effectively reduce the number of explored nodes and turning points, thereby improving the search efficiency.

       

    /

    返回文章
    返回