On Verifying and Generating Robust Plans for Planning Tasks with Exogenous Events

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21730%2F24%3A00378769" target="_blank" >RIV/68407700:21730/24:00378769 - isvavai.cz</a>

Výsledek na webu

<a href="https://doi.org/10.24963/kr.2024/26" target="_blank" >https://doi.org/10.24963/kr.2024/26</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.24963/kr.2024/26" target="_blank" >10.24963/kr.2024/26</a>

Jazyk výsledku

angličtina

Název v původním jazyce

On Verifying and Generating Robust Plans for Planning Tasks with Exogenous Events

Popis výsledku v původním jazyce

Planning and acting under the presence of exogenous events brings a number of challenges as events might modify the environment without the consent of the acting agent. Consequently, the agent's plan might get disrupted, agent's goals might no longer be achievable, or, worse, the agent might suffer some damage (e.g. damage to the robot). Although policies, mapping states to appropriate actions to take, can describe, in theory, how the agent should act, they might be difficult to explain and understand for humans in the loop. In this paper, we describe the concept of robust plans that are sequences of actions that can be successfully executed regardless of event occurrence. Robust plans are easier to understand (than policies). We present two methods for verifying whether a sequence of actions is a robust plan, one based on compilation to classical planning, and the other based on leveraging delete-relaxation. We also present a method for generating robust plans that is derived from the "relaxation" verification method. The methods are evaluated on three domains.

Název v anglickém jazyce

On Verifying and Generating Robust Plans for Planning Tasks with Exogenous Events

Popis výsledku anglicky

Planning and acting under the presence of exogenous events brings a number of challenges as events might modify the environment without the consent of the acting agent. Consequently, the agent's plan might get disrupted, agent's goals might no longer be achievable, or, worse, the agent might suffer some damage (e.g. damage to the robot). Although policies, mapping states to appropriate actions to take, can describe, in theory, how the agent should act, they might be difficult to explain and understand for humans in the loop. In this paper, we describe the concept of robust plans that are sequences of actions that can be successfully executed regardless of event occurrence. Robust plans are easier to understand (than policies). We present two methods for verifying whether a sequence of actions is a robust plan, one based on compilation to classical planning, and the other based on leveraging delete-relaxation. We also present a method for generating robust plans that is derived from the "relaxation" verification method. The methods are evaluated on three domains.

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

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)

Rok uplatnění

2024

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

Proceedings of the 21st International Conference on Principles of Knowledge Representation and Reasoning

ISBN

978-1-956792-05-8

ISSN

2334-1033

e-ISSN

2334-1033

Počet stran výsledku

11

Strana od-do

273-283

Název nakladatele

International Joint Conferences on Artificial Intelligence Organization

Místo vydání

—

Místo konání akce

Hanoi

Datum konání akce

2. 11. 2024

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

WRD - Celosvětová akce

Kód UT WoS článku

—