All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

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

The result's identifiers

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

  • Result on the web

    <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>

Alternative languages

  • Result language

    angličtina

  • Original language name

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

  • Original language description

    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.

  • 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

    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)

Others

  • Publication year

    2024

  • 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

    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

  • Number of pages

    11

  • Pages from-to

    273-283

  • Publisher name

    International Joint Conferences on Artificial Intelligence Organization

  • Place of publication

  • Event location

    Hanoi

  • Event date

    Nov 2, 2024

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article