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
270 Chapter 12 Control Strategies in Deductive Planning
to a plan that moves iteratively the robot r1 to transport all the containers in a
given location to the original location where the robot comes from.
The language allows for incomplete specifications of plans, in which case ordinary
first-order theorem proving is used to generate the plan.
Example 12.3 In situation calculus, it is possible to write the following program
ll
if at(r1,l
)then
while c in(c,l)do
move(r1,l
, l); π ;move(r1,l;l
);unload(r1,c)
with a condition that states that π should lead from a situation where r1 is unloaded
in l
to a situation where r1 is loaded in l
with a container ...
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