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
244 Chapter 11 Hierarchical Task Network Planning
These are the first two decompositions. The rest of the decomposition tree can be
produced in a similar manner.
11.5 HTN Planning
In STN planning, we associated two kinds of constraints with a method: ordering
constraints and preconditions. We represented ordering constraints explicitly in the
task network as edges of a digraph. We did not keep track of these preconditions
explicitly in the task network: instead, we enforced the preconditions by constructing
task networks that were guaranteed to satisfy them. This was the purpose of the set
of edges {(v, u
) | u
succ
1
(u)} in Definition 11.5 (see page ...
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