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
14.3 Planning with Chronicles 341
C in K. At an update such as K K ∪{C},ifC is not yet known explicitly, it is
left pending.
11
Otherwise, the consistency of each enabler φ C is checked with
respect to the current ; φ is removed from C if φ is not consistent with . At the
end, one of the following occurs.
If C =∅, then this is a backtracking point.
If |C|=1, then there is a single enabler. Its constraints are directly added to the
temporal network and to the object variable network, with the corresponding
updates for K and .
Otherwise, the meta-CSP X
K
is updated with a new variable x
C
, whose
domain is the set of remaining enablers in C.
Consistent ...
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