Total-order planning with partially ordered subtasks (2001)
| Venue: | In Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence |
| Citations: | 54 - 12 self |
BibTeX
@INPROCEEDINGS{Nau01total-orderplanning,
author = {Dana Nau and Héctor Muñoz-avila and Yue Cao and Amnon Lotem and Steven Mitchell},
title = {Total-order planning with partially ordered subtasks},
booktitle = {In Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence},
year = {2001},
pages = {425--430}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
One of the more controversial recent planning algorithms is the SHOP algorithm, an HTN planning algorithm that plans for tasks in the same order that they are to be executed. SHOP can use domaindependent knowledge to generate plans very quickly, but it can be difficult to write good knowledge bases for SHOP. Our hypothesis is that this difficulty is because SHOP’s total-ordering requirement for the subtasks of its methods is more restrictive than it needs to be. To examine this hypothesis, we have developed a new HTN planning algorithm called SHOP2. Like SHOP, SHOP2 is sound and complete, and it constructs plans in the same order that they will later be executed. But unlike SHOP, SHOP2 allows the subtasks of each
