Compiling Planning Problems with Non-deterministic Events into FOND Planning
Identifikátory výsledku
Kód výsledku v IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F20%3A10423813" target="_blank" >RIV/00216208:11320/20:10423813 - isvavai.cz</a>
Výsledek na webu
—
DOI - Digital Object Identifier
—
Alternativní jazyky
Jazyk výsledku
angličtina
Název v původním jazyce
Compiling Planning Problems with Non-deterministic Events into FOND Planning
Popis výsledku v původním jazyce
Automated Planning seeks to find a sequence of actions, a plan, transforming the environment from its initial state to some goal state. In real-world environments, however, exogenous events might occur and might modify the environment without agent's consent. Besides disrupting agent's plan, events might hinder agent's pursuit towards its goals and even cause damage (e.g. destroying the robot). In this paper, we present how planning problems with non-deterministic events can be translated into Fully-Observable Non-Deterministic (FOND) planning problems and hence we can exploit FOND planning engines to solve them (i.e., find strong cyclic plans). Specifically, we will consider two cases in a single agent scenario - at most one event can occur after agent's action or a set of independent events can occur after agent's action. We compare the FOND-based approach with a traditional planning/execution/replanning one to highlight the performance gap as well as success rate of the latter approach.
Název v anglickém jazyce
Compiling Planning Problems with Non-deterministic Events into FOND Planning
Popis výsledku anglicky
Automated Planning seeks to find a sequence of actions, a plan, transforming the environment from its initial state to some goal state. In real-world environments, however, exogenous events might occur and might modify the environment without agent's consent. Besides disrupting agent's plan, events might hinder agent's pursuit towards its goals and even cause damage (e.g. destroying the robot). In this paper, we present how planning problems with non-deterministic events can be translated into Fully-Observable Non-Deterministic (FOND) planning problems and hence we can exploit FOND planning engines to solve them (i.e., find strong cyclic plans). Specifically, we will consider two cases in a single agent scenario - at most one event can occur after agent's action or a set of independent events can occur after agent's action. We compare the FOND-based approach with a traditional planning/execution/replanning one to highlight the performance gap as well as success rate of the latter approach.
Klasifikace
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)
Návaznosti výsledku
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)
Ostatní
Rok uplatnění
2020
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ů
Údaje specifické pro druh výsledku
Název statě ve sborníku
Proceedings of Joint RCRA International Workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion
ISBN
978-1-72726-719-8
ISSN
1613-0073
e-ISSN
—
Počet stran výsledku
16
Strana od-do
54-69
Název nakladatele
CEUR Workshop Proceedings
Místo vydání
Německo
Místo konání akce
Italy
Datum konání akce
25. 11. 2020
Typ akce podle státní příslušnosti
WRD - Celosvětová akce
Kód UT WoS článku
—