Commitment Strategies in Hierarchical Task Network Planning
Abstract
This paper compares three commitment strategies for HTN planning: (1) a strategy that delays variable bindings as much as possible; (2) a strategy in which no non-primitive task is expanded until all variable constraints are committed; and (3) a strategy that chooses between expansion and variable instantiation based on the number of branches that will be created in the search tree. Our results show that while there exist planning domains in which the first two strategies do well, the third does well over a broader range of planning domains.
Cite
Text
Tsuneto et al. "Commitment Strategies in Hierarchical Task Network Planning." AAAI Conference on Artificial Intelligence, 1996.Markdown
[Tsuneto et al. "Commitment Strategies in Hierarchical Task Network Planning." AAAI Conference on Artificial Intelligence, 1996.](https://mlanthology.org/aaai/1996/tsuneto1996aaai-commitment/)BibTeX
@inproceedings{tsuneto1996aaai-commitment,
title = {{Commitment Strategies in Hierarchical Task Network Planning}},
author = {Tsuneto, Reiko and Erol, Kutluhan and Hendler, James A. and Nau, Dana S.},
booktitle = {AAAI Conference on Artificial Intelligence},
year = {1996},
pages = {536-542},
url = {https://mlanthology.org/aaai/1996/tsuneto1996aaai-commitment/}
}