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
3.4 Complexity Results 59
enable the use of a domain-specific planning algorithm) or given as part of the
input.
3.4 Complexity Results
As summarized in Table 3.2, the computational complexity for classical planning
problems (and thus for most set-theoretic and state-variable planning problems)
Table 3.2 Complexity of classical planning.
How the Allow Allow Complexity Complexity
Kind of operators negative negative of plan- of plan-
representation are given effects? preconditions? existence length
Yes Yes/no expspace- nexptime-
Classical complete complete
rep. In the Yes nexptime- nexptime-
input complete complete
No No exptime- nexptime-
complete complete
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