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

Kód výsledku v 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>

Výsledek na webu

<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>

Jazyk výsledku

angličtina

Název v původním jazyce

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

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

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

Popis výsledku anglicky

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.

Druh

D - Stať ve sborníku

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

Výsledek vznikl pri realizaci vícero projektů. Více informací v záložce Projekty.

Návaznosti

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

Rok uplatnění

2022

Kód důvěrnosti údajů

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

Název statě ve sborníku

Proceedings of the 36th AAAI Conference on Artificial Intelligence

ISBN

978-1-57735-876-3

ISSN

2159-5399

e-ISSN

2374-3468

Počet stran výsledku

9

Strana od-do

9767-9775

Název nakladatele

AAAI Press

Místo vydání

Menlo Park

Místo konání akce

- virtual

Datum konání akce

22. 2. 2022

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

000893639102088