Hosted Pages

Pathfinding Benchmarks

Grid-Based Path Planning Competition

AAAI 2019 Student Activities

AAAI 2017 Job Fair

AAAI 2017 Workshop on what's next for AI in games

Archived Pages

AAAI16 Student Activities

AAAI15 Student Activities

MAPF 2012 Workshop

AIIDE 2011

GIGA 2011

SoCS 2010

A* and Dijkstra

The videos on this page illustrate A* and Dijkstra running on a variety of small graphs. They are well suited for class demonstration; the individual frames of each animation can be downloaded and used for teaching purposes.

Download movie frames (jpg format, 3.8MB, 1600x800 resolution)

Dijkstra on simple graph

Dijkstra on more complicated graph

Dijkstra on another more complicated graph

A* on the same simple graph as above. Note that the edge costs are much larger than the heuristics, so the heuristic is highly ineffective on this problem.

A* on the same simple graph with edge costs that do a better job of mirroring the heuristic values.

A* on the same graph for Dijkstra as above, for comparison purposes

© Nathan Sturtevant, All rights reserved.