Skip to Main Content
Automated Planning
book

Automated Planning

by Malik Ghallab, Dana Nau, Paolo Traverso
May 2004
Intermediate to advanced content levelIntermediate to advanced
635 pages
19h 46m
English
Morgan Kaufmann
Content preview from Automated Planning
252 Chapter 11 Hierarchical Task Network Planning
Table
11.1 Complexity of plan-existence for HTN planning.
Restrictions Must the
on nonprimitive HTNs be Are variables allowed?
tasks totally ordered? No Yes
No Undecidable
a
Undecidable
a,b
None Yes In exptime;indexptime;
d
pspace-hard expspace-hard
“Regularity” ( 1
nonprimitive task, Does not pspace- expspace-
which must follow matter complete complete
c
all primitive tasks)
No nonprimitive No np-complete np-complete
tasks Yes Polynomial time np-complete
a
Decidable if we impose acyclicity restrictions.
b
Undecidable even when the planning domain is fixed in advance.
c
In pspace when the planning domain is fixed in
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Start your free trial

You might also like

Communicate with Teams More Effectively

Communicate with Teams More Effectively

Charles Humble
How to Overcome a Power Deficit

How to Overcome a Power Deficit

Cyril Bouquet, Jean-Louis Barsoux

Publisher Resources

ISBN: 9781558608566