Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

24

AAAI
1994

favoriteEmaildiscussreport

132views Intelligent Agents» more AAAI 1994»

HTN Planning: Complexity and Expressivity

14 years 6 days ago

HTN Planning: Complexity and Expressivity

Download www.cs.umd.edu

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 analytical work on the properties of HTN planners. This paper describes how the complexity of HTN planning varies with various conditions on the task networks.

Kutluhan Erol, James A. Hendler, Dana S. Nau

Real-time Traffic

AAAI 1994 | HTN Planners | HTN Planning Varies | Intelligent Agents | Task Networks |

claim paper

Related Content

» Encoding HTN Planning in Propositional Logic

» Durative Planning in HTNs

» SquadSmart Hierarchical Planning and Coordinated Plan Execution for Squads of Characters

» HTNMAKER Learning HTNs with Minimal Additional Knowledge Engineering Required

» Control Strategies in HTN Planning Theory Versus Practice

» Planning in Answer Set Programming using Ordered Task Decomposition

» Planning for Conditional Learning Routes

» GIPO II HTN Planning in a Toolsupported Knowledge Engineering Environment

» TotalOrder MultiAgent TaskNetwork Planning for Contract Bridge

Post Info
More Details (n/a)

Added	02 Nov 2010
Updated	02 Nov 2010
Type	Conference
Year	1994
Where	AAAI
Authors	Kutluhan Erol, James A. Hendler, Dana S. Nau

Comments (0)