Katalog Plus
Bibliothek der Frankfurt UAS
Bald neuer Katalog: sichern Sie sich schon vorab Ihre persönlichen Merklisten im Nutzerkonto: Anleitung.
Dieses Ergebnis aus BASE kann Gästen nicht angezeigt werden.  Login für vollen Zugriff.

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

Title: Polynomial-Time in PDDL Input Size:Making the Delete Relaxation Feasible for Lifted Planning
Authors: Lauer, Pascal; Torralba, Alvaro; Fišer, Daniel; Höller, Daniel; Wichlacz, Julia; Hoffmann, Jörg
Source: 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 Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence. IJCAI-21. International Joint Conferences on Artificial Intelligence, pp. 4119-4126, Thirtieth International Joint Conference on Artificial Intelligence. IJCAI-21, Canada, 19/08/2021. < https://www.ijcai.org/proceedings/2021/0567.pdf >
Publisher Information: International Joint Conferences on Artificial Intelligence
Publication Year: 2021
Collection: Aalborg University (AAU): Publications / Aalborg Universitet: Publikationer
Description: Polynomial-time heuristic functions for planning are commonplace since 20 years. But polynomialtime 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 where the grounded representation is “small enough”. Previous attempts to tackle this problem for the delete relaxation leveraged symmetries to reduce the blow-up. Here we take a more radical approach, applying an additional relaxation to obtain a heuristic function that runs in time polynomial in the size of the PDDL input. Our relaxation splits the predicates into smaller predicates of fixed arity K. We show that computing a relaxed plan is still NP-hard (in PDDL input size) for K ≥ 2, but is polynomial-time for K = 1. We implement a heuristic function for K = 1 and show that it can improve the state of the art on benchmarks whose grounded representation is large.
Document Type: article in journal/newspaper
Language: English
Relation: info:eu-repo/semantics/altIdentifier/isbn/978-0-9992411-9-6
Availability: https://vbn.aau.dk/da/publications/50e51831-819d-4a97-9ba4-bee72d4affaf; https://www.ijcai.org/proceedings/2021/0567.pdf
Rights: info:eu-repo/semantics/closedAccess
Accession Number: edsbas.1650E78F
Database: BASE