UMCP: A Sound and Complete Procedure for Hierarchical Task-Network Planning (0)
Cached
Download Links
- [www.cs.umd.edu]
- [www.cs.umd.edu]
- [www.cs.umd.edu]
- DBLP
Other Repositories/Bibliography
by
Kutluhan Erol
,
James Hendler
,
Dana S. Nau
| Citations: | 109 - 12 self |
BibTeX
@INPROCEEDINGS{Erol_umcp:a,
author = {Kutluhan Erol and James Hendler and Dana S. Nau},
title = {UMCP: A Sound and Complete Procedure for Hierarchical Task-Network Planning},
booktitle = {},
year = {},
pages = {249--254}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
One big obstacle to understanding the nature of hierarchical task network (htn) planning has been the lack of a clear theoretical framework. In particular, no one has yet presented a clear and concise htn algorithm that is sound and complete.
