| | |
Summary: Planning by Rewriting: Efficiently Generating HighQuality Plans \Lambda
Jos'e Luis Ambite and Craig A. Knoblock
Information Sciences Institute and Department of Computer Science
University of Southern California
4676 Admiralty Way, Marina del Rey, CA 90292
fambite, knoblockg@isi.edu
In Proceedings of the Fourteenth National Conference on
Artificial Intelligence, Providence, Rhode Island, 1997.
Abstract
Domainindependent planning is a hard combinatorial
problem. Taking into account plan quality makes the
task even more difficult. We introduce a new paradigm
for efficient highquality planning that exploits plan
rewriting rules and efficient local search techniques
to transform an easytogenerate, but possibly sub
optimal, initial plan into a lowcost plan. In addition
to addressing the issues of efficiency and quality, this
framework yields a new anytime planning algorithm.
We have implemented this planner and applied it to
several existing domains. The results show that this
|