Efficient Planning by Graph Rewriting

Planning involves the generation of a network of actions that achieves a desired goal given an initial state of the world. There has been significant progress in the analysis of planning algorithms, particularly in partial-order and in hierarchical task network (HTN) planning (Kambhampati 95; Erol et al. 94). In this abstract we propose a more general framework in which planning is seen as a graph rewriting process. This approach subsumes previous work and offers new opportunities for efficient planning.

Authors

• José Luis Ambite Greg Barish

Keywords

No keywords are indexed for this paper.