Efficient Planning by Graph Rewriting
Abstract
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. 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.
Cite
Text
Ambite and Knoblock. "Efficient Planning by Graph Rewriting." AAAI Conference on Artificial Intelligence, 1996.Markdown
[Ambite and Knoblock. "Efficient Planning by Graph Rewriting." AAAI Conference on Artificial Intelligence, 1996.](https://mlanthology.org/aaai/1996/ambite1996aaai-efficient/)BibTeX
@inproceedings{ambite1996aaai-efficient,
title = {{Efficient Planning by Graph Rewriting}},
author = {Ambite, José Luis and Knoblock, Craig A.},
booktitle = {AAAI Conference on Artificial Intelligence},
year = {1996},
pages = {1376},
url = {https://mlanthology.org/aaai/1996/ambite1996aaai-efficient/}
}