Gaifman Graphs in Lifted Planning

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F23%3A00373593" target="_blank" >RIV/68407700:21230/23:00373593 - isvavai.cz</a>
Result on the web
<a href="https://doi.org/10.3233/FAIA230378" target="_blank" >https://doi.org/10.3233/FAIA230378</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.3233/FAIA230378" target="_blank" >10.3233/FAIA230378</a>

Result language
angličtina
Original language name
Gaifman Graphs in Lifted Planning
Original language description
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.
Czech name
—
Czech description
—

Type
D - Article in proceedings
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project
<a href="/en/project/EF16_019%2F0000765" target="_blank" >EF16_019/0000765: Research Center for Informatics</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2023
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection
European Conference on Artificial Intelligence 2023
ISBN
978-1-64368-436-9
ISSN
0922-6389
e-ISSN
—
Number of pages
8
Pages from-to
1052-1059
Publisher name
IOS Press
Place of publication
Amsterdam
Event location
Krakov
Event date
Sep 30, 2023
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—

Similar results(10)