New Advances in GraphHTN: Identifying Independent Subproblems in Large HTN Domains

@inproceedings{citeulike:874400, abstract = {We describe in this paper a new method for extracting knowledge on Hierarchical Task-Network (HTN) planning problems for speeding up the search. This knowledge is gathered by propagating properties through an AND/OR tree that represents disjunctively all possible decompositions of an HTN planning problem. We show how to use this knowledge during the search process of our GraphHTN planner, to split the current refined planning problem into independent subproblems. We also present new...}, author = {Lotem, Amnon and Nau, Dana S. }, booktitle = {Artificial Intelligence Planning Systems}, citeulike-article-id = {874400}, keywords = {htns, planning}, pages = {206--215}, posted-at = {2006-09-26 22:32:57}, priority = {5}, title = {New Advances in GraphHTN: Identifying Independent Subproblems in Large HTN Domains}, url = {http://citeseer.ist.psu.edu/lotem00new.html}, year = {2000} }

TY - CONF ID - citeulike:874400 L3 - citeulike-article-id:874400 TI - New Advances in GraphHTN: Identifying Independent Subproblems in Large HTN Domains T2 - Artificial Intelligence Planning Systems SP - 206 EP - 215 N2 - We describe in this paper a new method for extracting knowledge on Hierarchical Task-Network (HTN) planning problems for speeding up the search. This knowledge is gathered by propagating properties through an AND/OR tree that represents disjunctively all possible decompositions of an HTN planning problem. We show how to use this knowledge during the search process of our GraphHTN planner, to split the current refined planning problem into independent subproblems. We also present new... KW - htns KW - planning AU - Lotem, Amnon AU - Nau, Dana PY - 2000/// UR - http://citeseer.ist.psu.edu/lotem00new.html ER -