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
7.3 Planning by Satisfiability 151
We can now formalize the notion of encoding correctly a planning problem into
a satisfiability problem. Let = (S, A , γ ) be a deterministic state-transition system
(as described in Section 1.4). Let P = (, s
0
, S
g
) be a classical planning problem,
where s
0
and S
g
are the initial and goal states, respectively. Let Enc be a function
that takes a planning problem P and a length bound n and returns a propositional
formula : Enc(P, n) = .
Definition 7.1 Enc encodes the planning problem P to a satisfiability problem when the
following holds: is satisfiable iff there exists a solution plan of length n to P.We
say, in short, that Enc encodes planning to satisfiability.
Proposition 7.1 The encoding defined by Formulas 7.9
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