Unifying the Causal Graph and Additive Heuristics
ICAPS, pp. 140-147, 2008.
shortest path problemside effectfunctional equation
Many current heuristics for domain-independent planning, such as Bonet and Geffner's additive heuristic and Hoffmann and Nebel's FF heuristic, are based on delete relaxations. They estimate the goal distance of a search state by approx- imating the solution cost in a relaxed task where negative consequences of operator applications are ig...More
Full Text (Upload PDF)
PPT (Upload PPT)