TLP-GP

Temporally-Lifted Progression GraphPlan

Temporally-Expressive Planning Benchmarks

The first test domains extend the problem of [Cushing et al., IJCAI'07, figure 3] in three different ways

Tempo Depth (tempo-depth-n.pddl)

The "tempo-depth-n" problems extend the original problem over a greater number of levels. The solution-plan requires n stages, each composed of triples of concurrent actions.
tempo-depth.tar.gz

Tempo Width (tempo-width.pddl)

The "tempo-width-m" problems require m triples of concurrent actions over only three levels of the graph in order to achieve the goal.
tempo-width.tar.gz

Tempo Matrix (tempo-matrix-nxm.pddl)

The "tempo-matrix-nxm" problems combine the difficulties of the above two cases.
tempo-matrix.tar.gz

Temporal Machine Shop (tms-2-3.pddl)

The "tms-k-t-p" domain (temporal machine shop, [Cushing et al., ICAPS'07]) is inspired by a real-world application. It concerns the use of k kilns, each with different baking times, to bake p ceramic pieces (bake-ceramic) of t different types. Each of these types requires a different baking time. These ceramics can then be assembled to produce different structures (make-structure). The resulting structures can then be baked again to obtain a bigger structure (bake-structure).
tms-2-3.tar.gz

As the expressivity of LPGP and VHPOP is less than that of TLP-GP, we tested simplified, but nevertheless temporally expressive, versions of these benchmarks (tms-2-3-light.tar.gz).

To represent real-word domains, we have defined a more expressive language in which we can represent the fact that a precondition or effect p must be true (and not p false) during a minimal duration d anywhere within an interval [a,b]. Our language also allows the user to disassociate p and not p by stipulating, for example, that p must be true at the end of an interval [a,b] over all of which not p cannot be established. The "temporal-machine-shop-2-3" domain extends the "tms-2-3" domain.
temporal-machine-shop-2-3.tar.gz

Cooking (cooking-carbonara.pddl)

The "cooking" domain allows to plan the preparation of a meal, as well as its consumption by respecting constraints of warmth. Problems cooking-carbonara-n allow to plan the preparation of n dishes of pasta. The concurrency of actions is required to obtain the goal because it is necessary that the electrical plates works so that water and oil are hot enough to cook pasta and bacon cubes. It is also necessary to perform this baking in parallel to serve a hot dish during its consumption.
cooking.tar.gz