The A^* heuristic path planing algorithm reduces the search space of Dijkstra using a heuristic. A valid heuristic should not overestimate the distance to the target. https://en.wikipedia.org/wiki/A*_search_algorithm