1
vote
Accepted
What is the difference between the uniform-cost search and Dijkstra's algorithm?
The answer to my question can be found in the paper Position Paper: Dijkstra's Algorithm versus Uniform Cost Search or a Case Against Dijkstra's Algorithm (2011), in particular section Similarities of ...
- 39.7k
1
vote
Accepted
What types of AI agents are Djikstra's algorithm and Prim's Minimum Spanning Tree algorithm?
Why do you want to think of these algorithms as agents?
An agent is an abstract and higher-level concept than the concept of an algorithm, which is just a set of instructions.
You could have two ...
- 39.7k
1
vote
A* is similar to Dijkstra with reduced cost
What you are doing when calculating $d'(x,y)$:
$d(x,y)$: calculating the original edge distance from $x$ to $y$
$h(y)$: plus the heuristic from $y$ to the goal
$h(x)$: minus the heuristic from $x$ to ...
- 1,011
Only top scored, non community-wiki answers of a minimum length are eligible