Lessons Learned from the CYK Algorithm for Parsing-based Verification of Hierarchical Plans

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F23%3A10467290" target="_blank" >RIV/00216208:11320/23:10467290 - isvavai.cz</a>

Výsledek na webu

<a href="https://doi.org/10.32473/flairs.36.133196" target="_blank" >https://doi.org/10.32473/flairs.36.133196</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.32473/flairs.36.133196" target="_blank" >10.32473/flairs.36.133196</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Lessons Learned from the CYK Algorithm for Parsing-based Verification of Hierarchical Plans

Popis výsledku v původním jazyce

Verification of hierarchical plans deals with the problem of whether an action sequence is causally consistent and can be obtained by a decomposition of a goal task. This second sub-problem (finding the decomposition) makes the verification problem NP-hard. The task decomposition structure is very close to a parsing tree of context-free grammar (CFG). Recently, the CFG-parsing algorithm by Cocke-Younger-Kasami (CYK) has been modified to verify hierarchical plans efficiently. Despite being fast, the algorithm can only handle totally-ordered planning domains. In this paper, we ask whether the ideas from the CYK algorithm can be extended to a more general parsing-based approach that covers all planning domains, i.e., including partially ordered ones. More specifically, we study the effect of modifying the domain model by limiting the number of sub-tasks in decomposition methods to two and the effect of changing the parsing strategy.

Název v anglickém jazyce

Lessons Learned from the CYK Algorithm for Parsing-based Verification of Hierarchical Plans

Popis výsledku anglicky

Verification of hierarchical plans deals with the problem of whether an action sequence is causally consistent and can be obtained by a decomposition of a goal task. This second sub-problem (finding the decomposition) makes the verification problem NP-hard. The task decomposition structure is very close to a parsing tree of context-free grammar (CFG). Recently, the CFG-parsing algorithm by Cocke-Younger-Kasami (CYK) has been modified to verify hierarchical plans efficiently. Despite being fast, the algorithm can only handle totally-ordered planning domains. In this paper, we ask whether the ideas from the CYK algorithm can be extended to a more general parsing-based approach that covers all planning domains, i.e., including partially ordered ones. More specifically, we study the effect of modifying the domain model by limiting the number of sub-tasks in decomposition methods to two and the effect of changing the parsing strategy.

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

—

Návaznosti

S - Specificky vyzkum na vysokych skolach<br>I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Rok uplatnění

2023

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 Thirty-Sixth International Florida Artificial Intelligence Research Society Conference

ISBN

—

ISSN

2334-0754

e-ISSN

—

Počet stran výsledku

8

Strana od-do

—

Název nakladatele

FLAIRS

Místo vydání

USA

Místo konání akce

Florida USA

Datum konání akce

14. 5. 2023

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

WRD - Celosvětová akce

Kód UT WoS článku

—