Parsing-Based Recognition of Hierarchical Plans Using the Grammar Constraint

Kód výsledku v IS VaVaI

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

Výsledek na webu

<a href="https://journals.flvc.org/FLAIRS/article/view/133367" target="_blank" >https://journals.flvc.org/FLAIRS/article/view/133367</a>

DOI - Digital Object Identifier

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

Jazyk výsledku

angličtina

Název v původním jazyce

Parsing-Based Recognition of Hierarchical Plans Using the Grammar Constraint

Popis výsledku v původním jazyce

Plan recognition is the problem of recognizing a goal task and an agent&apos;s plan based on the observed actions. Plan recognition techniques can be employed in multiagent systems, behaviour recognition, computer security, and other fields related to artificial intelligence. Hierarchical task networks (HTN) describe the decomposition hierarchy of tasks in planning problems. In HTN plan recognition, a prefix of the plan (actions observed so far) is given as an input, and the aim is to find a task that decomposes into a sequence of actions with the given prefix. In this paper, we show how the performance of parsing-based HTN plan recognition can be improved by restricting possible suffixes of the given prefix based on generalized arc consistency of a corresponding context-free grammar.

Název v anglickém jazyce

Parsing-Based Recognition of Hierarchical Plans Using the Grammar Constraint

Popis výsledku anglicky

Plan recognition is the problem of recognizing a goal task and an agent&apos;s plan based on the observed actions. Plan recognition techniques can be employed in multiagent systems, behaviour recognition, computer security, and other fields related to artificial intelligence. Hierarchical task networks (HTN) describe the decomposition hierarchy of tasks in planning problems. In HTN plan recognition, a prefix of the plan (actions observed so far) is given as an input, and the aim is to find a task that decomposes into a sequence of actions with the given prefix. In this paper, we show how the performance of parsing-based HTN plan recognition can be improved by restricting possible suffixes of the given prefix based on generalized arc consistency of a corresponding context-free grammar.

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

The International FLAIRS Conference Proceedings

ISBN

—

ISSN

2334-0762

e-ISSN

—

Počet stran výsledku

5

Strana od-do

—

Název nakladatele

LibraryPress@UF

Místo vydání

Neuveden

Místo konání akce

Clearwater Beach, 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

—