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
144 Chapter 7 Propositional Satisfiability Techniques
planning in nondeterministic domains. These extensions are described in Part V,
Chapter 18.
7.2 Planning Problems as Satisfiability Problems
We consider a classical planning problem P as defined in Sections 2.1 and 2.2, where
P = (, s
0
, S
g
); = (S, A, γ ) is the planning domain, S the set of states, A the set
of actions, γ the deterministic transition function, s
0
the initial state, and S
g
the set
of goal states.
In the “planning as satisfiability” approach, a classical planning problem is
encoded as a propositional formula with the property that any of its models corre-
spond to plans that are solutions ...
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