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 Different Strategies for Eliminating Redundant Actions from Plans

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F14%3A10285819" target="_blank" >RIV/00216208:11320/14:10285819 - isvavai.cz</a>

  • Result on the web

    <a href="http://www.aaai.org/ocs/index.php/SOCS/SOCS14/paper/view/8915" target="_blank" >http://www.aaai.org/ocs/index.php/SOCS/SOCS14/paper/view/8915</a>

  • DOI - Digital Object Identifier

Alternative languages

  • Result language

    angličtina

  • Original language name

    On Different Strategies for Eliminating Redundant Actions from Plans

  • Original language description

    Satisficing planning engines are often able to generate plans in a reasonable time, however, plans are often far from optimal. Such plans often contain a high number of redundant actions, that are actions, which can be removed without affecting the validity of the plans. Existing approaches for determining and eliminating redundant actions work in polynomial time, however, do not guarantee eliminating the 'best' set of redundant actions, since such a problem is NP-complete. We introduce an approach which encodes the problem of determining the 'best' set of redundant actions (i.e. having the maximum total-cost) as a weighted MaxSAT problem. Moreover, we adapt the existing polynomial technique which greedily tries to eliminate an action and its dependants from the plan in order to eliminate more expensive redundant actions. The proposed approaches are empirically compared to existing approaches on plans generated by state-of-the-art planning engines on standard planning benchmarks.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

    IN - Informatics

  • OECD FORD branch

Result continuities

  • Project

  • Continuities

    S - Specificky vyzkum na vysokych skolach

Others

  • Publication year

    2014

  • 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, The Seventh International Symposium on Combinatorial Search (SoCS 2014)

  • ISBN

    978-1-57735-676-9

  • ISSN

  • e-ISSN

  • Number of pages

    9

  • Pages from-to

    10-18

  • Publisher name

    AAAI Press

  • Place of publication

    Praha

  • Event location

    Praha

  • Event date

    Aug 15, 2014

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article