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 the Reversibility of Actions in Planning

The result's identifiers

  • Result code in IS VaVaI

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

  • Result on the web

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

  • DOI - Digital Object Identifier

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

Alternative languages

  • Result language

    angličtina

  • Original language name

    On the Reversibility of Actions in Planning

  • Original language description

    Checking whether action effects can be undone is an important question for determining, for instance, whether a planning task has dead-ends. In this paper, we investigate the reversibility of actions, that is, when the effects of an action can be reverted by applying other actions, in order to return to the original state. We propose a broad notion of reversibility that generalizes previously defined versions and investigate interesting properties and relevant restrictions. In particular, we propose the concept of uniform reversibility that guarantees that an action can be reverted independently of the state in which the action was applied, using a so-called reverse plan. In addition, we perform an in-depth investigation of the computational complexity of deciding action reversibility. We show that reversibility checking with polynomial-length reverse plans is harder than polynomial-length planning and that, in case of unrestricted plan length, the PSPACE-hardness of planning is inherited. In order to deal with the high complexity of solving these tasks, we then propose several incomplete algorithms that may be used to compute reverse plans for a relevant subset of states.

  • 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

    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

    Proceedings of the 17th International Conference on Principles of Knowledge Representation and Reasoning

  • ISBN

    978-0-9992411-7-2

  • ISSN

    2334-1033

  • e-ISSN

  • Number of pages

    10

  • Pages from-to

    652-661

  • Publisher name

    International Joint Conferences on Artificial Intelligence Organization

  • Place of publication

  • Event location

    Rhodes

  • Event date

    Sep 12, 2020

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article