heuristic search

A-Star Heuristic Search Tutorial

Tutorial slides by Andrew Moore available as PDF.

The classic algorithm for finding shortests paths given an admissible heuristic. We'll deal with the notion of admissibility (summary: admissible = optimistic). We show how you can prove properties of A*. We'll also briefly discuss IDA* (iterative deepening A*).
Tags: heuristic search a-star
Category: tutorial from http://www.autonlab.org