Compiling planning problems with non-deterministic events into FOND planning
The result's identifiers
Result code in 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>
Result on the web
<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
—
Alternative languages
Result language
angličtina
Original language name
Compiling planning problems with non-deterministic events into FOND planning
Original language description
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
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
<a href="/en/project/GA18-07252S" target="_blank" >GA18-07252S: MoRePlan: Modeling and Reformulating Planning Problems</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2020
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
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
Number of pages
16
Pages from-to
—
Publisher name
CEUR-WS.org
Place of publication
—
Event location
Rende
Event date
Nov 19, 2019
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—