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
6.4 Extensions and Improvements of Graphplan 131
To end this section, let us underline two main features of Graphplan.
1. The mutex relation on incompatible pairs of actions and propositions, and
the weak reachability condition of Proposition 6.4 (see page 123), offer a very
good insight about the interaction between the goals of a problem and about
which goals are possibly achievable at some level.
2. Because of the monotonic properties of the planning graph, the algorithm is
guaranteed to terminate; the fixed-point feature together with the reachability
condition provide an efficient failure termination condition. In particular,
when the goal propositions without mutex are not reachable, no search at all
is performed.
Because of these features and
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