TLP-GP: New Results on Temporally-Expressive Planning Benchmarks

One of the major challenges for planning is to take into account the time dimension. In this paper, we present a simple approach to deal with temporally expressive problems, that is problems for which all possible solutions require concurrency of actions. Our planner TLP-GP mixes some of the advantages of GRAPHPLAN search with a constraint-based and flexible temporal formalism. Its language is consistent with PDDL 2.1 and extends its expressivity. Experimental trials on new temporally expressive benchmarks show the efficiency of our approach and demonstrate the practical possibility of solving temporally expressive problems which up until now were unsolvable by existing techniques.