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
178 Chapter 8 Constraint Satisfaction Techniques
The encoding of a planning problem into a CSP requires m = k(n + 1) 1
CSP variables, where n is the number of state variables and k is the bound on the
plan length. However, the domain of each CSP variable can be quite large. It is
important to remark that both CSP and SAT are np-complete problems, whereas
planning, and more precisely the plan-length problem which is of interest to
us here, is pspace- or nexptime-complete (see Section 3.3 and Table 3.2). This
is explained by the fact that the two encodings of planning, into SAT or into a
CSP, lead to a blowup in the size of the resulting problem. For SAT, this blowup
results in an exponential number of Boolean variables. For the CSP encoding, the
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