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”

Compilation-Based Approaches to Parallel Planning: An Empirical Comparison

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F21%3A10435419" target="_blank" >RIV/00216208:11320/21:10435419 - isvavai.cz</a>

  • Result on the web

    <a href="https://journals.flvc.org/FLAIRS/article/view/128537/130045" target="_blank" >https://journals.flvc.org/FLAIRS/article/view/128537/130045</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.32473/flairs.v34i1" target="_blank" >10.32473/flairs.v34i1</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Compilation-Based Approaches to Parallel Planning: An Empirical Comparison

  • Original language description

    Automated planning deals with finding a sequence of actions, a plan, to reach a goal. One of the possible approaches to automated planning is a compilation of a planning problem to a Boolean satisfiability problem or to a constraint satisfaction problem, which takes direct advantage of the advancements of satisfiability and constraint satisfaction solvers. This paper provides a comparison of three encodings proposed for the compilation of planning problems: Transition constraints for parallel planning (TCPP), Relaxed relaxed exist-step encoding and Reinforced Encoding. We implemented the encodings using the programming language Picat 2.8, we suggested certain modifications, and we compared the performance of the encodings on benchmarks from international planning competitions.

  • 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

    <a href="/en/project/GA18-07252S" target="_blank" >GA18-07252S: MoRePlan: Modeling and Reformulating Planning Problems</a><br>

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Others

  • Publication year

    2021

  • 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

    The International FLAIRS Conference Proceedings

  • ISBN

  • ISSN

    2334-0762

  • e-ISSN

  • Number of pages

    6

  • Pages from-to

  • Publisher name

    LibraryPress@UF

  • Place of publication

    Neuveden

  • Event location

    Miami, Florida, USA

  • Event date

    May 16, 2021

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article