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
156 Chapter 7 Propositional Satisfiability Techniques
rules out the possibility of finding a solution plan of length 6. Davis-Putnam is called
recursively until it discovers that and has to backtrack.
A good choice is instead load(c1,r1,l1,0) because the solution plan of length 6
must first load one of the two robots. Unit propagation does its job by ruling out
all the actions that are not applicable after loading the robot, e.g., load(c1,r1,l1,1).
Some good alternatives to load(c1,r1,l1,0) are load(c2,r2,l1,0) (loading the other
robot as the first action), move(r1,l1,l2,1) (moving the first robot as the second
action), unload(r2,2) (unloading the second robot as the second action), and so
on. Alternative good choices for predicates are loaded(c1,r1,1) ...
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