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
4.3 Backward Search 73
will be
s
0
, ..., s
i1
, s
i
, s
i+1
, ..., s
k1
, s
k
, s
k+1
, ..., s
n
,
where n is the length of the solution. Let that solution be p =a
1
, ..., a
n
, where
s
j+1
= γ (s
j
, a
j+1
) for j = 0, ..., n 1. Then it is easy to prove that the plan
p
=a
1
, ..., a
i1
, a
k
, a
k+1
, ..., a
n
is also a solution (see Exercise 4.3). Thus, p
cannot be a shortest-length solution.
4.3 Backward Search
Planning can also be done using a backward search. The idea is to start at the goal
and apply inverses of the planning operators to produce subgoals, stopping if we
produce a set of subgoals satisfied by the initial state. The set of all states that are
predecessors ...
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