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

Code and benchmarks from the paper ``Polynomial-Time in PDDL Input Size: Making the Delete Relaxation Feasible for Lifted Planning''. Lauer, P., Torralba, Á., Fišer, D., Höller, D., Wichlacz, J., & Hoffmann, J. 2021.
doi bibtex

@Misc{Lauer2021FeasibleDelRelaxCode,
   author    = {Pascal Lauer and {\'A}lvaro Torralba and Daniel Fi\v{s}er and Daniel H{\"o}ller and Julia Wichlacz and J{\"o}rg Hoffmann},
   title     = {Code and benchmarks from the paper ``Polynomial-Time in PDDL Input Size: Making the Delete Relaxation Feasible for Lifted Planning''},
   year      = {2021},
   doi       = {10.5281/zenodo.4768790},
   publisher = {Zenodo}
}

Downloads: 0

{"_id":"Dy8ThecnYrGwxonBx","bibbaseid":"lauer-torralba-fier-hller-wichlacz-hoffmann-codeandbenchmarksfromthepaperpolynomialtimeinpddlinputsizemakingthedeleterelaxationfeasibleforliftedplanning-2021","author_short":["Lauer, P.","Torralba, Á.","Fišer, D.","Höller, D.","Wichlacz, J.","Hoffmann, J."],"bibdata":{"bibtype":"misc","type":"misc","author":[{"firstnames":["Pascal"],"propositions":[],"lastnames":["Lauer"],"suffixes":[]},{"firstnames":["Álvaro"],"propositions":[],"lastnames":["Torralba"],"suffixes":[]},{"firstnames":["Daniel"],"propositions":[],"lastnames":["Fišer"],"suffixes":[]},{"firstnames":["Daniel"],"propositions":[],"lastnames":["Höller"],"suffixes":[]},{"firstnames":["Julia"],"propositions":[],"lastnames":["Wichlacz"],"suffixes":[]},{"firstnames":["Jörg"],"propositions":[],"lastnames":["Hoffmann"],"suffixes":[]}],"title":"Code and benchmarks from the paper ``Polynomial-Time in PDDL Input Size: Making the Delete Relaxation Feasible for Lifted Planning''","year":"2021","doi":"10.5281/zenodo.4768790","publisher":"Zenodo","bibtex":"@Misc{Lauer2021FeasibleDelRelaxCode,\n author = {Pascal Lauer and {\\'A}lvaro Torralba and Daniel Fi\\v{s}er and Daniel H{\\\"o}ller and Julia Wichlacz and J{\\\"o}rg Hoffmann},\n title = {Code and benchmarks from the paper ``Polynomial-Time in PDDL Input Size: Making the Delete Relaxation Feasible for Lifted Planning''},\n year = {2021},\n doi = {10.5281/zenodo.4768790},\n publisher = {Zenodo}\n}\n\n","author_short":["Lauer, P.","Torralba, Á.","Fišer, D.","Höller, D.","Wichlacz, J.","Hoffmann, J."],"key":"Lauer2021FeasibleDelRelaxCode","id":"Lauer2021FeasibleDelRelaxCode","bibbaseid":"lauer-torralba-fier-hller-wichlacz-hoffmann-codeandbenchmarksfromthepaperpolynomialtimeinpddlinputsizemakingthedeleterelaxationfeasibleforliftedplanning-2021","role":"author","urls":{},"metadata":{"authorlinks":{}}},"bibtype":"misc","biburl":"https://bercher.net/bibtex/bibliography.bib","dataSources":["bPpsmYWjffAy6QHP5"],"keywords":[],"search_terms":["code","benchmarks","paper","polynomial","time","pddl","input","size","making","delete","relaxation","feasible","lifted","planning","lauer","torralba","fišer","höller","wichlacz","hoffmann"],"title":"Code and benchmarks from the paper ``Polynomial-Time in PDDL Input Size: Making the Delete Relaxation Feasible for Lifted Planning''","year":2021}