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
320 Chapter 14 Temporal Planning
14.2.4 Temporal Planning Domains, Problems, and Plans
We are now ready to define temporal planning domains, problems, and their
solutions.
A temporal planning domain is a triple D = (
, O, X), where:
is the set of all temporal databases that can be defined with the constraints
and the constant, variable, and relation symbols in our representation.
O is a set of temporal planning operators.
X is a set of domain axioms.
A temporal planning problem in D is a tuple P = (D,
0
,
g
), where:
0
= (F, C) is a database in
that satisfies the axioms of X.
0
represents
an initial scenario that describes not only the initial
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