Two lifted compilation methods for qualitative state-trajectory constraints in PDDL avoid grounding, produce orders-of-magnitude more succinct problems, and remain competitive with state-of-the-art planners on IPC domains.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.AI 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Two Constraint Compilation Methods for Lifted Planning
Two lifted compilation methods for qualitative state-trajectory constraints in PDDL avoid grounding, produce orders-of-magnitude more succinct problems, and remain competitive with state-of-the-art planners on IPC domains.