A best-first search algorithm guided by a set-valued heuristic

Presents an algorithm, called A/sup G/, for finding the least-cost path from start node to goal node set in an OR-graph, where arc costs are scalar-valued and the cost of each path is the sum of the concomitant arc costs. Search is guided by a set, H, of real-valued functions on the node set. Such a heuristic set can be a useful representation of knowledge acquired from human knowledge sources. If H.<
>