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 Speeding Up Methods for Identifying Redundant Actions in Plans

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F22%3A00363584" target="_blank" >RIV/68407700:21230/22:00363584 - isvavai.cz</a>

  • Result on the web

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

  • DOI - Digital Object Identifier

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

Alternative languages

  • Result language

    angličtina

  • Original language name

    On Speeding Up Methods for Identifying Redundant Actions in Plans

  • Original language description

    Satisficing planning aims at generating plans that are not necessarily optimal. Often, minimising plan generation time negatively affects quality of generated plans. Acquiring plans quickly might be of critical importance in decision-making systems that operate nearly in realtime. However, (very) suboptimal plans might be expensive to execute and more prone to failures. Optimising plans after they are generated, in a spare time, can improve their quality. This paper focuses on speeding up the (Greedy) Action Elimination methods, which are used for identifying and removing redundant actions from plans in polynomial time. We present two enhancements of these methods: Plan Action Landmarks, actions that are not redundant in a given plan, and Action Cycles which are subsequences of actions which if removed do not affect the state trajectory after the last action of the cycle. We evaluate the introduced methods on benchmark problems from the Agile tracks of the International Planning Competition and on plans generated by several state-of-the-art planners, successful in the recent editions of the competition. 2022, Association for the Advancement of Artificial Intelligence.

  • 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

    2022

  • 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-Second International Conference on Automated Planning and Scheduling, ICAPS 2022

  • ISBN

    978-1-57735-874-9

  • ISSN

    2334-0835

  • e-ISSN

  • Number of pages

    9

  • Pages from-to

    252-260

  • Publisher name

    AAAI Press

  • Place of publication

    Menlo Park

  • Event location

    Singapur

  • Event date

    Jun 19, 2022

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article