采用改进HPA^(*)算法的大型游戏地图路径规划

Researches on Path Optimization of Large-scale Game Maps Based on Improved HPA^(*) Algorithm

针对在大型游戏场景地图中使用HPA^(*)寻路算法时,容易出现搜索节点过多、寻路效率低的问题,提出了一种改进的HPA^(*)寻路算法。该算法将游戏地图分解为两个层级地图,通过在不同层级之间进行路径搜索来缓存关键节点对最短路径和构建层级映射矩阵,简化抽象过程。此外,还设置了节点权重值以引导寻路方向和规避closeList循环遍历等方式来优化HPA^(*)算法。实验结果表明,相对于传统的A^(*)和HPA^(*)算法,改进算法在计算效率和响应速度上均有明显提高。

ion process.In addition,node weight values are set to guide pathfinding direction and avoid closeList loop traversal to optimize the HPA^(*) algorithm.Experimental results show that compared to traditional A^(*) and HPA^(*) algorithms,the improved algorithm has significantly improved computational efficiency and response speed.