Proceedings:
Book One
Volume
Issue:
Proceedings of the International Conference on Automated Planning and Scheduling, 25
Track:
Technical Papers
Downloads:
Abstract:
A successful partial delete relaxation method is to compute hFF in a compiled planning task PiC which represents a set C of conjunctions explicitly. While this compilation view of such partial delete relaxation is simple and elegant, its meaning with respect to the original planning task is opaque. We provide a direct characterization of h+(PiC), without compilation, making explicit how it arises from a "marriage" of the critical-path heuristic hm with (a somewhat novel view of) h+. This explicit view allows us to derive a direct characterization of hFF(PiC), which in turn allows us to compute a version of that heuristic function in time polynomial in |C|.
DOI:
10.1609/icaps.v25i1.13702
ICAPS
Proceedings of the International Conference on Automated Planning and Scheduling, 25