Sciweavers

173 search results - page 1 / 35
» Search Complexities for HTN Planning
Sort
View
AAAI
1994
13 years 7 months ago
HTN Planning: Complexity and Expressivity
Most practical work on AI planningsystems during the last fteen years has been based on hierarchical task network (HTN) decomposition, but until now, there has been very little an...
Kutluhan Erol, James A. Hendler, Dana S. Nau
AIPS
1998
13 years 7 months ago
Encoding HTN Planning in Propositional Logic
Casting planning problems as propositional satis ability problems has recently been shown to be an effective way of scaling up plan synthesis. Until now, the bene ts of this appro...
Amol Dattatraya Mali, Subbarao Kambhampati
AIPS
2000
13 years 7 months ago
New Advances in GraphHTN: Identifying Independent Subproblems in Large HTN Domains
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 prop...
Amnon Lotem, Dana S. Nau
AAAI
1996
13 years 7 months ago
Total-Order Multi-Agent Task-Network Planning for Contract Bridge
This paper describes the results of applying a modified version of hierarchical task-network (HTN) planning to the problem of declarer play in contract bridge. We represent inform...
Stephen J. J. Smith, Dana S. Nau, Thomas A. Throop
AIPS
2006
13 years 7 months ago
Durative Planning in HTNs
This paper provides techniques for hierarchical task network (HTN) planning with durative actions. HTNs can provide useful heuristic guidance to planners, express goals that canno...
Robert P. Goldman