Attributed Transition-Based Domain Control Knowledge for Domain-Independent Planning
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F22%3A10456673" target="_blank" >RIV/00216208:11320/22:10456673 - isvavai.cz</a>
Alternative codes found
RIV/68407700:21230/22:00363581
Result on the web
<a href="https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=HQk8nNayS2" target="_blank" >https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=HQk8nNayS2</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1109/TKDE.2020.3037058" target="_blank" >10.1109/TKDE.2020.3037058</a>
Alternative languages
Result language
angličtina
Original language name
Attributed Transition-Based Domain Control Knowledge for Domain-Independent Planning
Original language description
Domain-independent planning decouples a planning task specification from planning engines. As the specification is usually describing only the physics of the environment, actions and a goal, the planning engines being generic solvers designed to solve any planning task tend to struggle with tasks that can be easily solved by domain-specific algorithms. Additional control knowledge can, to large extent, bridge such a performance gap. Instead of providing a specific planner supporting a given form of control knowledge, control knowledge can be directly encoded within the planning task specification and thus can be exploited by generic planners. In this paper, we propose Attributed Transition-Based Domain Control Knowledge (ATB-DCK) that is represented by a finite state automaton with attributed states, referring to specific states of objects, connected by transitions imposing constraints on action applicability. ATB-DCK, roughly speaking, represents the "grammar" of solution plans that guides the search. We show that ATB-DCK can be compiled into a classical planning task and thus it complements domain-independent planning techniques. Using several domains from the International Planning Competitions as benchmarks, we demonstrate that this approach often considerably improves efficiency of existing 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
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
Name of the periodical
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING
ISSN
1041-4347
e-ISSN
1558-2191
Volume of the periodical
34
Issue of the periodical within the volume
9
Country of publishing house
US - UNITED STATES
Number of pages
13
Pages from-to
4089-4101
UT code for WoS article
000836626800004
EID of the result in the Scopus database
—