On the Predictability of Domain-independent Temporal Planners

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F19%3A00334344" target="_blank" >RIV/68407700:21230/19:00334344 - isvavai.cz</a>

Alternative codes found

RIV/00216208:11320/19:10408241

Result on the web

<a href="https://doi.org/10.1111/coin.12211" target="_blank" >https://doi.org/10.1111/coin.12211</a>

DOI - Digital Object Identifier

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

Result language

angličtina

Original language name

On the Predictability of Domain-independent Temporal Planners

Original language description

Temporal planning is a research discipline that addresses the problem of generating a totally or a partially ordered sequence of actions that transform the environment from some initial state to a desired goal state, while taking into account time constraints and actions' duration. For its ability to describe and address temporal constraints, temporal planning is of critical importance for a wide range of real-world applications. Predicting the performance of temporal planners can lead to significant improvements in the area, as planners can then be combined in order to boost the performance on a given set of problem instances. This paper investigates the predictability of the state-of-the-art temporal planners by introducing a new set of temporal-specific features and exploiting them for generating classification and regression empirical performance models (EPMs) of considered planners. EPMs are also tested with regard to their ability to select the most promising planner for efficiently solving a given temporal planning problem. Our extensive empirical analysis indicates that the introduced set of features allows to generate EPMs that can effectively perform algorithm selection, and the use of EPMs is therefore a promising direction for improving the state of the art of temporal planning, hence fostering the use of planning in real-world applications.

Czech name

—

Czech description

—

Type

J_imp - 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)

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)

Publication year

2019

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

Computational Intelligence

ISSN

0824-7935

e-ISSN

1467-8640

Volume of the periodical

35

Issue of the periodical within the volume

4

Country of publishing house

US - UNITED STATES

Number of pages

29

Pages from-to

745-773

UT code for WoS article

000492750300004

EID of the result in the Scopus database

2-s2.0-85064605442