Planning as search: a quantitative approach
Artificial Intelligence
Derivational Analogy in PRODIGY: Automating Case Acquisition, Storage, and Utilization
Machine Learning - Special issue on case-based reasoning
Analysis and empirical studies of derivational analogy
Artificial Intelligence
The computational complexity of propositional STRIPS planning
Artificial Intelligence
Derivation replay for partial-order planning
AAAI'94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 2)
Plan reuse versus plan generation: a theoretical and empirical analysis
Artificial Intelligence - Special volume on planning and scheduling
A domain-independent algorithm for plan adaptation
Journal of Artificial Intelligence Research
An analysis of transformational analogy: general framework and complexity
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 3
Kernel functions for case-based planning
Artificial Intelligence
Case adaptation by segment replanning for case-based planning systems
ICCBR'05 Proceedings of the 6th international conference on Case-Based Reasoning Research and Development
An analysis on transformational analogy: general framework and complexity
ECCBR'06 Proceedings of the 8th European conference on Advances in Case-Based Reasoning
Domain-independent multi-agent plan repair
Journal of Network and Computer Applications
| Hi-index | 0.00 |
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.