Effective Heuristics for Suboptimal Best-First Search

Wilt, Christopher, Ruml, Wheeler

Journal of Artificial Intelligence Research 

Suboptimal heuristic search algorithms such as weighted A* and greedy best-first search are widely used to solve problems for which guaranteed optimal solutions are too expensive to obtain. These algorithms crucially rely on a heuristic function to guide their search.