Compiling Planning Problems with Non-deterministic Events into FOND Planning

Result code in 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>

Result on the web

—

DOI - Digital Object Identifier

—

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, 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&apos;s consent. Besides disrupting agent&apos;s plan, events might hinder agent&apos;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&apos;s action or a set of independent events can occur after agent&apos;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.

Czech name

—

Czech description

—

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)

Project

Result was created during the realization of more than one project. More information in the Projects tab.

Continuities

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

Publication year

2020

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection

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

—

Number of pages

16

Pages from-to

54-69

Publisher name

CEUR Workshop Proceedings

Place of publication

Německo

Event location

Italy

Event date

Nov 25, 2020

Type of event by nationality

WRD - Celosvětová akce

UT code for WoS article

—