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
19.6 The Deep Space 1 Experiment 461
Plans. In DS1, plans are special cases of chronicles, as described in Chapter 14.
Candidate plans are refined incrementally by the planner until they are a solution
for the given goal. A candidate plan contains the following elements.
A horizon (h
s
, h
e
) represents the time window considered by the plan.
A set of timelines, i.e., sequences of tokens (T
1
, ..., T
k
), contains one token
for each state variable x, with T
i
= (x, p(y
1
, ..., y
m
), s
i
, e
i
).
Ordering constraints enforce that each token in the sequence is followed by
the next token, i.e., h
s
s
1
e
1
s
2
... e
n1
s
n
e
n
h
e
.
A set of equality and temporal constraints enforces required conditions.
The Search Engine. SE starts from an initial candidate plan, ...
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