TLP-GP

Temporally-Lifted Progression GraphPlan

New Results on Temporally-Expressive Planning Benchmarks

Here are some results on Temporally-Expressive Planning Benchmarks :

Temporally-Expressive Problems

- : timeout (> 3600 s.)

* : out of memory (> 512 MB)

- : timeout (> 3600 s.)

* : out of memory (> 512 MB)

Temporally-Expressive Problems using richer durative actions

The makespan of the compacted floating plan is 17 for all the "cooking-carbonara" problems.
The number of simple temporal constraints (STC) and disjunctive temporal constraints (DTC) is given before simplification. On this domain, there is no DTC after simplification. For cooking-carbonara-23, 96 DTC are simplified to STC, and 872 are deleted.

Temporally-Expressive Problems using new extensions for durative actions (somewhere, anywhere)

The makespan of the compacted floating plan is 20 for all the "temporal-machine-shop" problems.
The number of simple temporal constraints (STC) and disjunctive temporal constraints (DTC) is given before simplification. For temporal-machine-shop-80, 7,572 DTC are simplified to STC, and 280 are deleted. Moreover, 144 inconsistencies are detected during the extraction which reduce the use of the solver.