Generalized best first search using single and multiple heuristics

Abstract

Informed best first search is studied in a generalized framework in the setting of and/ or graphs. Strategies for effectively using single and multiple sources of heuristics in single and multipass algorithms are examined and analyzed. Specific polynomial time algorithms using these strategies are presented which are more efficient than known algorithms in terms of solution quality and worst case node expansions.