Speeding Up Planning through Minimal Generalizations of Partially Ordered Plans

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F10%3A00181924" target="_blank" >RIV/68407700:21230/10:00181924 - isvavai.cz</a>

Result on the web

<a href="http://dx.doi.org/10.1007/978-3-642-21295-6_29" target="_blank" >http://dx.doi.org/10.1007/978-3-642-21295-6_29</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/978-3-642-21295-6_29" target="_blank" >10.1007/978-3-642-21295-6_29</a>

Result language

angličtina

Original language name

Speeding Up Planning through Minimal Generalizations of Partially Ordered Plans

Original language description

We present a novel strategy enabling to exploit existing plans in solving new similar planning tasks by finding a common generalized core of the existing plans. For this purpose we develop an operator yielding a minimal joint generalization of two partially ordered plans. In three planning domains we show a substantial speed-up of planning achieved when the planner starts its search space exploration from the learned common generalized core, rather than from scratch.

Czech name

—

Czech description

—

Type

D - Article in proceedings

CEP classification

IN - Informatics

OECD FORD branch

—

Project

<a href="/en/project/GA201%2F08%2F0509" target="_blank" >GA201/08/0509: LeCoS: merging machine LEarning and COnstraint Satisfaction</a><br>

Continuities

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

Publication year

2010

Confidentiality

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

Article name in the collection

Inductive Logic Programming

ISBN

978-3-642-21294-9

ISSN

0302-9743

e-ISSN

—

Number of pages

8

Pages from-to

269-276

Publisher name

Springer

Place of publication

Heidelberg

Event location

Firenze

Event date

Jun 27, 2010

Type of event by nationality

WRD - Celosvětová akce

UT code for WoS article

—