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
398 Chapter 16 Planning Based on Markov Decision Processes
s1
s2
deliver to l2
s3
move to l1
move to l2
wait
1
0.5
0.5
0.5
0.5
wait
wait
1
1
1
full
l1
l1
empty
Figure 16.9 A stochastic system for continuous delivery.
the nondeterminism of actions move(r1,l2,l1) and wait that can lead to a state
with or without containers (full or empty) with uniform probability distribution.
We can express the goal described informally by assigning a high reward to state
s2. Given this planning problem, the planning algorithms generate the obvious
policy {(s1, deliver to l2), (s2, wait), (s3, move(r1, l2, l1)}. This policy continuously
delivers containers to location l2 as soon as they ...
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