Pascal Lauer
YOU?
Author Swipe
View article: Potential Heuristics: Weakening Consistency Constraints
Potential Heuristics: Weakening Consistency Constraints Open
In classical planning, admissible potential heuristics are computed by solving linear programs (LPs) with constraints expressing consistency and goal-awareness of the heuristic. Potential heuristics can return negative estimates. So, given…
View article: Continuing the Quest for Polynomial Time Heuristics in PDDL Input Size: Tractable Cases for Lifted hᵃᵈᵈ
Continuing the Quest for Polynomial Time Heuristics in PDDL Input Size: Tractable Cases for Lifted hᵃᵈᵈ Open
Recent interest in solving planning tasks, where full grounding is infeasible, has highlighted the need to compute heuristics at a lifted level. We turn our attention to the evaluation of the hᵃᵈᵈ heuristic, which is an important cornersto…
View article: Polynomial-Time in PDDL Input Size: Making the Delete Relaxation Feasible for Lifted Planning
Polynomial-Time in PDDL Input Size: Making the Delete Relaxation Feasible for Lifted Planning Open
Polynomial-time heuristic functions for planning are commonplace since 20 years. But polynomial-time in which input? Almost all existing approaches are based on a grounded task representation, not on the actual PDDL input which is exponent…