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”

Inner entanglements: Narrowing the search in classical planning by problem reformulation

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F19%3A10408238" target="_blank" >RIV/00216208:11320/19:10408238 - isvavai.cz</a>

  • Alternative codes found

    RIV/68407700:21230/19:00334343

  • Result on the web

    <a href="https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=prXvsY__oC" target="_blank" >https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=prXvsY__oC</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1111/coin.12203" target="_blank" >10.1111/coin.12203</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Inner entanglements: Narrowing the search in classical planning by problem reformulation

  • Original language description

    In the field of automated planning, the central research focus is on domain-independent planning engines that accept planning tasks (domain models and problem descriptions) in a description language, such as Planning Domain Definition Language, and return solution plans. The performance of planning engines can be improved by gathering additional knowledge about specific planning domain models/tasks (such as control rules) that can narrow the search for a solution plan. Such knowledge is often learned from training plans and solutions of simple tasks. Using techniques to reformulate the given planning task to incorporate additional knowledge, while keeping to the same input language, allows to exploit off-the-shelf planning engines. In this paper, we present inner entanglements that are relations between pairs of operators and predicates that represent the exclusivity of predicate achievement or requirement between the given operators. Inner entanglements can be encoded into a planner&apos;s input language by transforming the original planning task; hence, planning engines can exploit them. The contribution of this paper is to provide an in-depth analysis and evaluation of inner entanglements, covering theoretical aspects such as complexity results, and an extensive empirical study using International Planning Competition benchmarks and state-of-the-art planning engines.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database

  • CEP classification

  • OECD FORD branch

    50803 - Information science (social aspects)

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

    2019

  • 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

  • Name of the periodical

    Computational Intelligence

  • ISSN

    0824-7935

  • e-ISSN

  • Volume of the periodical

    35

  • Issue of the periodical within the volume

    2

  • Country of publishing house

    US - UNITED STATES

  • Number of pages

    35

  • Pages from-to

    395-429

  • UT code for WoS article

    000466182600006

  • EID of the result in the Scopus database

    2-s2.0-85063265042