The analysis shows that the grounded efficiency of the hᵃᵈᵈ heuristic does not apply to lifted tasks, leading to the identification of feasible computation strategies.
Findings reveal two tractable instances where lifted computation remains feasible, while grounding fails, including constraints on acyclic action schemata.
A novel computation technique is introduced that operates without grounding, remaining tractable even with unbounded predicate and action arity.
An empirical evaluation demonstrates the effectiveness of the new technique, combining it with existing methods to set a new benchmark for heuristic performance.