Homomorphisms of Lifted Planning Tasks: The Case for Delete-free Relaxation Heuristics

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F22%3A00353830" target="_blank" >RIV/68407700:21230/22:00353830 - isvavai.cz</a>

Result on the web

<a href="https://doi.org/10.1609/aaai.v36i9.21212" target="_blank" >https://doi.org/10.1609/aaai.v36i9.21212</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1609/aaai.v36i9.21212" target="_blank" >10.1609/aaai.v36i9.21212</a>

Result language

angličtina

Original language name

Homomorphisms of Lifted Planning Tasks: The Case for Delete-free Relaxation Heuristics

Original language description

Classical planning tasks are modelled in PDDL which is a schematic language based on first-order logic. Most of the current planners turn this lifted representation into a propositional one via a grounding process. However, grounding may cause an exponential blowup. Therefore it is important to investigate methods for searching for plans on the lifted level. To build a lifted state-based planner, it is necessary to invent lifted heuristics. We introduce maps between PDDL tasks preserving plans allowing to transform a PDDL task into a smaller one. We propose a novel method for computing lifted (admissible) delete-free relaxed heuristics via grounding of the smaller task and computing the (admissible) delete-free relaxed heuristics there. This allows us to transfer the knowledge about relaxed heuristics from the grounded level to the lifted level.

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

Result was created during the realization of more than one project. More information in the Projects tab.

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year

2022

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

Proceedings of the 36th AAAI Conference on Artificial Intelligence

ISBN

978-1-57735-876-3

ISSN

2159-5399

e-ISSN

2374-3468

Number of pages

9

Pages from-to

9767-9775

Publisher name

AAAI Press

Place of publication

Menlo Park

Event location

- virtual

Event date

Feb 22, 2022

Type of event by nationality

WRD - Celosvětová akce

UT code for WoS article

000893639102088