File Download

There are no files associated with this item.

  • Find it @ UNIST can give you direct access to the published full text of this article. (UNISTARs only)
Related Researcher

AuTsz-Chiu

Au, Tsz-Chiu
Agents & Robotic Transportation Lab.
Read More

Views & Downloads

Detailed Information

Cited time in webofscience Cited time in scopus
Metadata Downloads

On the complexity of plan adaptation by derivational analogy in a universal classical planning framework

Author(s)
Au, Tsz-ChiuMunoz-Avila, HectorNau, Dana S.
Issued Date
2002-09-04
URI
https://scholarworks.unist.ac.kr/handle/201301/34496
Fulltext
https://link.springer.com/chapter/10.1007%2F3-540-46119-1_3
Citation
6th European Conference on Case-Based Reasoning (ECCBR), pp.13 - 27
Abstract
In this paper we present an algorithm called DerUCP, which can be regarded as a general model for plan adaptation using Derivational Analogy. Using DerUCP, we show that previous results on the complexity of plan adaptation do not apply to Derivational Analogy. We also show that Derivational Analogy can potentially produce exponential reductions in the size of the search space generated by a planning system.
Publisher
ECCBR
ISSN
0302-9743

qrcode

Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.