Gaifman Graphs in Lifted Planning

Rostislav Horčík*, Daniel Fišer

*Corresponding author for this work

Research output: Contribution to book/anthology/report/conference proceedingArticle in proceedingResearchpeer-review

1 Citation (Scopus)

Abstract

We introduce the metric induced by Gaifman graphs into lifted planning. We analyze what kind of information this metric carries and how it can be utilized for constructing lifted delete-free relaxation heuristics. In particular, we prove how the action dynamics influence the distances between objects. As a corollary, we derive a lower bound on the length of any plan. Finally, we apply our theoretical findings on the Gaifman graphs to improve the delete-free relaxation heuristics induced by PDDL homomorphisms.

Original languageEnglish
Title of host publicationECAI 2023 - 26th European Conference on Artificial Intelligence, including 12th Conference on Prestigious Applications of Intelligent Systems, PAIS 2023 - Proceedings
EditorsKobi Gal, Kobi Gal, Ann Nowe, Grzegorz J. Nalepa, Roy Fairstein, Roxana Radulescu
Number of pages8
PublisherIOS Press
Publication date28 Sept 2023
Pages1052-1059
ISBN (Electronic)9781643684369
DOIs
Publication statusPublished - 28 Sept 2023
Externally publishedYes
Event26th European Conference on Artificial Intelligence, ECAI 2023 - Krakow, Poland
Duration: 30 Sept 20234 Oct 2023

Conference

Conference26th European Conference on Artificial Intelligence, ECAI 2023
Country/TerritoryPoland
CityKrakow
Period30/09/202304/10/2023
SponsorAmazon Alexa, APTIV, et al., Hewlett Packard, IDEAS, Software Force
SeriesFrontiers in Artificial Intelligence and Applications
Volume372
ISSN0922-6389

Bibliographical note

Publisher Copyright:
© 2023 The Authors.

Fingerprint

Dive into the research topics of 'Gaifman Graphs in Lifted Planning'. Together they form a unique fingerprint.

Cite this