On the Complexity of Plan Adaptation by Derivational Analogy in a Universal Classical Planning Framework
| Title | On the Complexity of Plan Adaptation by Derivational Analogy in a Universal Classical Planning Framework |
| Publication Type | Book Chapters |
| Year of Publication | 2002 |
| Authors | Au T-C, Muñoz-Avila H, Nau DS |
| Editor | Craw S, Preece A |
| Book Title | Advances in Case-Based Reasoning |
| Series Title | Lecture Notes in Computer Science |
| Volume | 2416 |
| Pagination | 199 - 206 |
| Publisher | Springer Berlin / Heidelberg |
| ISBN Number | 978-3-540-44109-0 |
| Keywords | Computer science |
| 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. |
| URL | http://www.springerlink.com/content/db2mr13j90mfrcaw/abstract/ |