← Search

Pascal Lauer

1 accepted papers

2021

Polynomial-Time in PDDL Input Size: Making the Delete Relaxation Feasible for Lifted Planning

IJCAI 2021poster

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 exponentially smaller. This limits practical applicability to cases w…

Cited by 41SourcePDFScholar