Published May 18, 2021 | Version v1
Software Open

Code and benchmarks from the paper "Polynomial-Time in PDDL Input Size: Making the Delete Relaxation Feasible for Lifted Planning"

Creators

  • 1. Saarland University
  • 2. Aalborg University
  • 3. Saarland University, Czech Technical University in Prague

Description

Publication: Lauer, P.; Torralba, A.; Fišer, D.; Höller, D.; Wichlacz, J.; Hoffmann, J. 2021. Polynomial-Time in PDDL Input Size: Making the Delete Relaxation Feasible for Lifted Planning. In Proc. IJCAI-21.

  • benchmarks.zip contains the newly introduced hard to ground benchmarks.
  • hur-source-code.zip contains the standard implementation of h^{ur} and h^{ur-d}. The implementation was done inside the Powerlifted Planner. This means the .zip includes the planners' source code. See references for more details.
  • tiebreak-source-code.zip is a modification of hur-source-code.zip to be used with the tie-breaking variants.

Files

benchmarks.zip

Files (8.9 MB)

Name Size Download all
md5:306037427b83f7dafd335782dffb035c
8.6 MB Preview Download
md5:ceaf7f746acec00119ca8178eada12b6
151.8 kB Preview Download
md5:03cff1b52c4be4f20a2cc7e65ae3a176
149.2 kB Preview Download

Additional details

References

  • Lauer, P.; Torralba, A.; Fišer, D.; Höller, D.; Wichlacz, J.; Hoffmann, J. 2021. Polynomial-Time in PDDL Input Size: Making the Delete Relaxation Feasible for Lifted Planning. In Proc. IJCAI-21.
  • Corrêa, A. B.; Pommerening, F.; Helmert, M.; and Francès, G. 2020. Lifted Successor Generation using Query Optimization Techniques. In Proc. ICAPS 2020.