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”

Modeling and solving planning problems in tabled logic programming: Experience from the Cave Diving domain

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F17%3A10370055" target="_blank" >RIV/00216208:11320/17:10370055 - isvavai.cz</a>

  • Alternative codes found

    RIV/68407700:21230/17:00313884

  • Result on the web

    <a href="http://dx.doi.org/10.1016/j.scico.2017.04.007" target="_blank" >http://dx.doi.org/10.1016/j.scico.2017.04.007</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1016/j.scico.2017.04.007" target="_blank" >10.1016/j.scico.2017.04.007</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Modeling and solving planning problems in tabled logic programming: Experience from the Cave Diving domain

  • Original language description

    Action planning deals with the problem of finding a sequence of actions transferring the world from a given state to a desired (goal) state. This problem is important in various areas such as robotics, manufacturing, transportation, autonomic computing, computer games, etc. Action planning is a form of a reachability problem in a huge state space so it is critical to efficiently represent world states and actions (transitions between states). In this paper we present a modeling framework for planning problems based on tabled logic programming that exploits a planner module in the Picat language. In particular, we suggest techniques for structured representation of states and for including control knowledge in the description of actions. We demonstrate these techniques using the complex planning domain Cave Diving from the International Planning Competition. Experimentally, we show properties of the model for different search approaches and we compare the performance of the proposed approach with state-of-the-art automated planners. The focus of this paper is on providing guidelines for manual modeling of planning domains rather than on automated reformulation of models.

  • 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

    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

    2017

  • 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

    Science of Computer Programming

  • ISSN

    0167-6423

  • e-ISSN

  • Volume of the periodical

    147

  • Issue of the periodical within the volume

    November

  • Country of publishing house

    NL - THE KINGDOM OF THE NETHERLANDS

  • Number of pages

    24

  • Pages from-to

    54-77

  • UT code for WoS article

    000410014200004

  • EID of the result in the Scopus database

    2-s2.0-85019569606