
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