Compiling planning problems with non-deterministic events into FOND planning

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F20%3A00338683" target="_blank" >RIV/68407700:21230/20:00338683 - isvavai.cz</a>

Výsledek na webu

<a href="http://ceur-ws.org/Vol-2538/paper6.pdf" target="_blank" >http://ceur-ws.org/Vol-2538/paper6.pdf</a>

DOI - Digital Object Identifier

—

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, aplan, transforming the environment from its initial state to some goalstate. In real-world environments, however, exogenous events might oc-cur and might modify the environment without agent’s consent. Besidesdisrupting agent’s plan, events might hinder agent’s pursuit towards itsgoals and even cause damage (e.g. destroying the robot).In this paper, we present how planning problems with non-deterministicevents can be translated into Fully-Observable Non-Deterministic (FOND)planning problems and hence we can exploit FOND planning engines tosolve them (i.e., find strong cyclic plans). Specifically, we will considertwo cases in a single agent scenario – at most one event can occur af-ter agent’s action or a set of independent events can occur after agent’saction. We compare the FOND-based approach with a traditional plan-ning/execution/replanning one to highlight the performance gap as wellas 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, aplan, transforming the environment from its initial state to some goalstate. In real-world environments, however, exogenous events might oc-cur and might modify the environment without agent’s consent. Besidesdisrupting agent’s plan, events might hinder agent’s pursuit towards itsgoals and even cause damage (e.g. destroying the robot).In this paper, we present how planning problems with non-deterministicevents can be translated into Fully-Observable Non-Deterministic (FOND)planning problems and hence we can exploit FOND planning engines tosolve them (i.e., find strong cyclic plans). Specifically, we will considertwo cases in a single agent scenario – at most one event can occur af-ter agent’s action or a set of independent events can occur after agent’saction. We compare the FOND-based approach with a traditional plan-ning/execution/replanning one to highlight the performance gap as wellas success rate of the latter approach

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

<a href="/cs/project/GA18-07252S" target="_blank" >GA18-07252S: MoRePlan: Modelování a reformulace plánovacích problémů</a><br>

Návaznosti

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

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ů

Název statě ve sborníku

2019 Joint RCRA International Workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion and of the RCRA Incontri e Confronti Workshop

ISBN

—

ISSN

1613-0073

e-ISSN

1613-0073

Počet stran výsledku

16

Strana od-do

—

Název nakladatele

CEUR-WS.org

Místo vydání

—

Místo konání akce

Rende

Datum konání akce

19. 11. 2019

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

WRD - Celosvětová akce

Kód UT WoS článku

—