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 Linear Execution Strategies in Planning Against Nature

The result's identifiers

  • Result code in IS VaVaI

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

  • Result on the web

    <a href="https://doi.org/10.1609/icaps.v34i1.31464" target="_blank" >https://doi.org/10.1609/icaps.v34i1.31464</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1609/icaps.v34i1.31464" target="_blank" >10.1609/icaps.v34i1.31464</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    On Verifying Linear Execution Strategies in Planning Against Nature

  • Original language description

    While planning and acting in environments in which nature can trigger non-deterministic events, the agent has to consider that the state of the environment might change without its consent. Practically, it means that the agent has to make sure that it eventually achieves its goal (if possible) despite the acts of nature. In this paper, we first formalize the semantics of such problems in Alternating-time Temporal Logic, which allows us to prove some theoretical properties of different types of solutions. Then, we focus on linear execution strategies, which resemble classical plans in that they follow a fixed sequence of actions. We show that any problem that can be solved by a linear execution strategy can be solved by a particular form of linear execution strategy which assigns wait-for preconditions to each action in the plan that specifies when to execute that action. Then, we propose a sound algorithm that verifies a sequence of actions and assigns wait-for preconditions to them by leveraging abstraction.

  • 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 Thirty-Fourth International Conference on Automated Planning and Scheduling

  • ISBN

    978-1-57735-889-3

  • ISSN

    2334-0835

  • e-ISSN

    2334-0843

  • Number of pages

    9

  • Pages from-to

    86-94

  • Publisher name

    AAAI Press

  • Place of publication

    Menlo Park, California

  • Event location

    Banff

  • Event date

    Jun 1, 2024

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article