启发式搜索和A算法（Heuristics and A Pathfinding）

最新推荐文章于 2025-06-20 11:34:29 发布

转载最新推荐文章于 2025-06-20 11:34:29 发布 · 932 阅读

文章标签：

#A-star算法 #启发式搜索

人工智能专栏收录该内容

2 篇文章

订阅专栏

本文介绍了A*路径寻找算法中的两种常见启发式方法：曼哈顿距离法和对角线捷径法。曼哈顿方法计算简单且速度快，但可能不会找到最短路径；对角线捷径法则能更好地平衡启发式与实际成本，适用于需要精确路径的情况。

作者：Patrick Lester

原文地址：http://www.policyalmanac.org/games/heuristics.htm

Heuristics and A* Pathfinding

By Patrick Lester ( Updated April 21, 2004)

This article is a sidebar for the main article, “A* Pathfinding for Beginners.”

As was noted in the main article, there are several ways that you can calculate the heuristic in A*. I describe a few here. You should also check out the links at the bottom of this page.

Manhattan Method

This is the method used in the main article. Its primary advantage is that it will generally get you to the target faster than most alternatives. Its primary drawback is that in a 8-way pathfinder like the one in the main example, this method is inadmissible, so it is not guaranteed to give us the shortest possible path. It will almost always give the shortest path, though, and when it doesn't it won't be far off. Also, because it is overweighted compared to G, it will overpower any small modifiers that you try to add to the calculation of G like, say, a turning penalty or an influence map modifier. If you don't have those, this method is probably your best bet. The equation, where abs = absolute value, is:

H = 10*(abs(currentX-targetX) + abs(currentY-targetY))

Diagonal Shortcut

This method balances H with G. Its primary advantage is that, because it is balanced, it is able to fully consider small modifiers like a turning penalty or influence map modifier. It is also admissible. It is a bit slower than the Manhattan method, though. The equation, where abs = absolute value, is:

xDistance = abs(currentX-targetX)
yDistance = abs(currentY-targetY)
if xDistance > yDistance
H = 14*yDistance + 10*(xDistance-yDistance)
else
H = 14*xDistance + 10*(yDistance-xDistance)
end if

There are many other methods for calculating H, although these are probably two of the most commonly used. In general, the closer your estimate is to the actual remaining distance along the path to the goal, the faster A* will find that goal. If you overestimate H compared to the actual remaining distance, however, A* is not guaranteed to give you the best path. The trick, then, is to come as close to the actual distance as possible, without overestimating.

For more information, see: