寻找A *算法启发式的方法有哪些? [英] What are some good methods to finding a heuristic for the A* algorithm?
问题描述
您可以在8个方向中的任何一个方向上移动方块地图。考虑到你有一个名为 cost(tile1,tile2)
的函数,它告诉你从一个相邻的tile移动到另一个tile的代价,你如何找到一个启发函数h(y,目标)是否可接受和一致?根据成本
函数,是否可以根据此设置找到启发式的方法,或者会有所不同?
You have a map of square tiles where you can move in any of the 8 directions. Given that you have function called cost(tile1, tile2)
which tells you the cost of moving from one adjacent tile to another, how do you find a heuristic function h(y, goal) that is both admissible and consistent? Can a method for finding the heuristic be generalized given this setting, or would it be vary differently depending on the cost
function?
推荐答案
Amit的教程是我在A * (Amit's page)。你应该在这个页面上找到关于启发式的一些非常有用的提示。
Amit's tutorial is one of the best I've seen on A* (Amit's page). You should find some very useful hint about heuristics on this page .
这里是关于你的问题的引用:
Here is the quote about your problem :
在允许8个方向移动的方形网格上,使用对角距离(L∞)。
On a square grid that allows 8 directions of movement, use Diagonal distance (L∞).
这篇关于寻找A *算法启发式的方法有哪些?的文章就介绍到这了,希望我们推荐的答案对大家有所帮助,也希望大家多多支持IT屋!