Dijkstra 算法与 A-Star 相比如何? [英] How does Dijkstra's Algorithm and A-Star compare?

问题描述

我正在查看
(马里奥 A* 机器人实战视频)

我的问题是，A-Star 与 Dijkstra 相比如何?仔细一看，它们看起来很相似.

为什么有人会使用一个而不是另一个?尤其是在游戏路径的背景下?

解决方案

Dijkstra 是 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.

(Video of Mario A* Bot In Action)

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 is a special case for A* (when the heuristics is zero).

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