A* Algorithm

Daniel Mörtenschlag gives a talk about the A* algorithm. His presentation is an introduction to the basics of the Dijkstra algorithm and the A* algorithms, especially the basic terms of graph theory, the procedures themselves and possible heuristics for certain graph problems.

In the second part of the talk it is shown how A* algorithms, graph problems and solution representations are integrated into the HeuristicLab environment.

Download: A-star.pdf (~300kb; German)