| | |
Summary: On the Complexity of Plan Adaptation by
Derivational Analogy in a Universal Classical
Planning Framework
Tsz-Chiu Au1
, H´ector Mu~noz-Avila2
, Dana S. Nau1
1
Department of Computer Science and Institute for System Research
University of Maryland, College Park, MD 20742, USA
{chiu, nau}@cs.umd.edu
2
Department of Computer Science and Engineering
Lehigh University, Bethlehem, PA 18015, USA
munoz@cse.lehigh.edu
Abstract. In this paper we present an algorithm called DerUCP, which
can be regarded as a general model for plan adaptation using Deriva-
tional 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 exponen-
tial reductions in the size of the search space generated by a planning
|
