如何Dijkstra算法和A星比较？ [英] How does Dijkstra's Algorithm and A-Star compare?

问题描述

我一直在寻找什么人在马里奥AI比赛一直在做，其中一些已经建立了一些pretty的整洁马里奥机器人利用A *（A星）径处理算法。

I was looking at what the guys in the Mario AI Competition have been doing and some of them have built some pretty neat Mario bots utilizing the A* (A-Star) Pathing Algorithm.

（视频A *博特在行动）

(Video of Mario A* Bot In Action)

我的问题是，如何做一个明星与Dijkstra算法比较？纵观他们，他们似乎相似。

My question is, how does A-Star compare with Dijkstra? Looking over them, they seem similar.

为什么要使用一个比其他？特别是在路径的游戏环境？

Why would someone use one over the other? Especially in the context of pathing in games?

推荐答案

Dijkstra算法是A *的特例（当启发式为零）。

Dijkstra is a special case for A* (when the heuristics is zero).

这篇关于如何Dijkstra算法和A星比较？的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！