Estimated Distances in A* Search

Let g’(s) be an estimate of g(s) based on the currently known shortest distance from the start state to s.

Let the h’(s) be a heuristic evaluation function that estimates the distance (path length) from s to the nearest goal state.

Let f’(s) = g’(s) + h’(s)

Best-first search using f’(s) as the evaluation function is called A* search.

Previous slide

Next slide

Back to first slide

View graphic version