Competition Domains for the temporal track
Domain 
Version 
Origin 
:typing :durativeactions 
ipc2008 

:typing :durativeactions 
ipc2008 

:typing :durativeactions 
new 

:typing :durativeactions 
new 

:typing :durativeactions 
ipc2006 

:typing :durativeactions 
ipc2008 

:typing :durativeactions 
ipc2008 

:typing :durativeactions 
ipc2008 

:typing :durativeactions 
ipc2008 

:typing :durativeactions 
ipc2006 

:typing :durativeactions 
new 

:typing :durativeactions 
new 
Also problems for Transport, Woodworking and Modeltrain domains from IPC 2008 were created, but they were finally discarded as they contain numeric preconditions which few participating planners were able to handle.
CrewPlanning
There is no description of this domain at the IPC 2008, but here you are a couple of papers describing it. Although SGPlan 6 solved all the problems at IPC 2008, the remaining planners only solved half of them, so we have reused all the problems. The selected problems are:
problem 
old 
best 
problem 
old 
best 
p01 
p15 
2880 
p11 
p25 
4320 
p02 
p13 
2880 
p12 
p26 
4320 
p03 
p14 
2880 
p13 
p27 
4320 
p04 
p12 
1455 
p14 
p28 
4320 
p05 
p07 
1440 
p15 
p29 
4320 
p06 
p22 
4320 
p16 
p30 
4320 
p07 
p23 
4320 
p17 
p17 
2880 
p08 
p24 
4320 
p18 
p18 
2910 
p09 
p16 
2880 
p19 
p20 
2880 
p10 
p19 
2880 
p20 
p21 
2910 
Elevators
For a domain description click here.
At the last IPC, there were two versions of this domain. Only 2 planners participated in the numeric version, while in the STRIPS there were 6 planners (including baseline) solving at least one problem. This year we have used only the STRIPS one. The quality of the found plans was quite poor and worse than those of the baseline.
We will select 10 old problems and create 10 new ones. In the 2008 version, problem one starts with 9 floors, 4 passengers, 2 slow elevators and 2 fast ones. Until problem 10, passengers are increased by one (13 passengers in problem 10), while the other parameters remain constant. Problem 11 has 17 floors and 8 passengers and passengers are increased by 2 (26 passengers in problem 20). Problem 21 has 25 floors, 12 passengers and 3 slow elevators, which are increased by 3 (39 passengers in last problem).
At IPC 2008 problems were exactly the same as in sequential satisficing track, so do we have created new problems with the same parameters than in that track: problem 11 starts from characteristics of old problem 30 (current problem 10), adding 2 fast elevators, 1 slow and 1 passenger. The next 4 increase the number of passengers by 3. From problem 16 floors are 40, 4 fast lifts with capacity for 6 passengers, 4 slow ones for 4 passengers, and 40 passengers, increasing the number of passengers in 5 per problem.
problem 
old 
best 
problem 
old 
best 
p01 
p20 
628 
p11 
(254044) 

p02 
p22 
278 
p12 
(254344) 

p03 
p23 
477 
p13 
(254644) 

p04 
p24 
475 
p14 
(254944) 

p05 
p25 
776 
p15 
(255244) 

p06 
p26 
736 
p16 
(404044) 

p07 
p27 
868 
p17 
(404544) 

p08 
p28 
335 
p18 
(405044) 

p09 
p29 
877 
p19 
(405544) 

p10 
p30 
1237 
p20 
(406044) 

Floortile
Author: Tomás de la Rosa.
Temporal version of the Floortile domain. For the temporal track, 5 problems for each configuration have been created:
Problem 
Rows 
Columns 
Robots 
p1p5 
3 
3 
2 
p6p10 
4 
4 
2 
p11p15 
4 
4 
3 
p16p10 
5 
5 
3 
Matchcellar
Author: Bharat Ranjan Kavuluri
This is a STRIPS version of the domain proposed by Bharat Ranjan Kavuluri. Domain is inspired in this paper. The main feature of this domain is that a lighted match is concurrently required to fix a fuse.
Problem 
Matches 
Fuses 
p1 
3 
6 
p2 
4 
7 
p3 
5 
8 
p4 
6 
9 
p5 
7 
10 
p6 
8 
11 
p7 
9 
12 
p8 
10 
13 
p9 
11 
14 
p10 
12 
15 
p11 
13 
16 
p12 
14 
17 
p13 
15 
18 
p14 
16 
19 
p15 
17 
20 
p16 
18 
21 
p17 
19 
22 
p18 
20 
23 
p19 
21 
24 
p10 
22 
25 
Openstacks
For a domain description click here.
There were 4 domain versions at IPC 2008: numeric, adl, adlnumeric and STRIPS. Most of the planners were only able to handle the STRIPS version. Most of the temporal planners participating in IPC 2011 only support STRIPS, only one supports ADL, so in this IPC we have created only STRIPS problems. Note that, at least in STRIPS, this domain has a different domain file for each problem.
At IPC 2008, three planners (including baseline) were able to solve all the problems. For this year competition we have reused the 10 most difficult problems and have generated 10 more difficult ones. In the IPC 2008, first problem has 5 objects and objects are increased by 1 from problem to problem (problem 30 has 34 objects). The density parameter has been lost.
We have generated problems with 80% density. From old problem 30 (current p10) we increase objects by 1, till 44 objects in problem 20. Given that, the selected problems are:
problem 
old 
best 
problem 
old 
best 
p01 
p20 
112 
p11 
35 

p02 
p21 
112 
p12 
36 

p03 
p22 
127 
p13 
37 

p04 
p23 
121 
p14 
38 

p05 
p25 
114 
p15 
39 

p06 
p26 
120 
p16 
40 

p07 
p27 
124 
p17 
41 

p08 
p28 
129 
p18 
42 

p09 
p29 
113 
p19 
43 

p10 
p30 
134 
p20 
44 

Parcprinter
For a domain description click here.
There is no generator for this domain, so new problems have been byhand generated using IPC 2008 ones. New problems add some sheets to old problems or make twosided some of them. Like in sequential tracks, there are 3 different printers. It seems that printer 3 is the easiest and number 2 the toughest, so 433 new problems have been generated. It also seems adding an extra image is more difficult than an extra sheet.
We have selected the following problems:
problem 
old 
best 
problem 
old 
best 
p01 
p08 
140054 
p11 
printer 1  11 sheets 

p02 
p09 
148041 
p12 
printer 1  12 sheets 

p03 
p10 
176036 
p13 
printer 1  13 sheets 

p04 
p16 
186918 
p14 
printer 1  14 sheets 

p05 
p17 
185879 
p15 
printer 2  10 sheets 12 images 

p06 
p18 
218316 
p16 
printer 2  11 sheets 12 images 

p07 
p20 
323858 
p17 
printer 2  11 sheets 13 images 

p08 
p15 
309499 
p18 
printer 3  10  12 

p09 
p30 
120252 
p19 
printer 3  11 12 

p10 
p19 
326640 
p20 
printer 3  11  13 

Parking
This domain is a temporal version of the domain created for the learning part of IPC2008. This domain involves parking cars on a street with N curb locations, and where cars can be doubleparked but not tripleparked. The goal is to find a plan to move from one configuration of parked cars to another configuration, by driving cars from one curb location to another.
For the temporal track the following problems have been created:
Problem 
Cars 
Curbs 
p1p3 
11 
7 
p4p6 
13 
8 
p7p9 
15 
9 
p10p12 
16 
10 
p13p15 
18 
11 
p16p18 
20 
12 
p19p20 
22 
13 
Pegsol
For a domain description click here.
At IPC 2008 problems in temporal satisficing, sequential satisficing and sequential optimal were the same. They were taken from a pool of 105 problems. In this year's competition we have reused 20 problems.
problem 
old 
best 
problem 
old 
best 
p01 
p22 
8 
p11 
p12 
7 
p02 
p24 
7 
p12 
p18 
10 
p03 
p05 
6 
p13 
p13 
6 
p04 
p06 
6 
p14 
p21 
7 
p05 
p07 
7 
p15 
p14 
7 
p06 
p08 
6 
p16 
p28 
9 
p07 
p09 
7 
p17 
p23 
7 
p08 
p25 
7 
p18 
p17 
9 
p09 
p11 
7 
p19 
p19 
7 
p10 
p16 
9 
p20 
p30 

Sokoban
For a domain description click here.
Performance of planners in this domain was quite poor at last IPC(12 problems unsolved), so instead of generating new problems we have reused the most difficult problems of last IPC. The problems are:
problem 
old 
best 
problem 
old 
best 
p01 
p08 
21 
p11 
p27 

p02 
p03 
33 
p12 
p26 

p03 
p16 
42 
p13 
p25 

p04 
p06 
14 
p14 
p09 

p05 
p02 
90 
p15 
p24 

p06 
p17 
48 
p16 
p12 

p07 
p10 
21 
p17 
p23 

p08 
p14 
17 
p18 
p22 

p09 
p30 

p19 
p21 

p10 
p29 

p20 
p18 

Storage
Corresponds to the "time version" from the IPC2006 domain where actions have duration and the plan quality is totaltime (plan makespan). This domain deals with moving a certain number of crates from some containers to some depots by hoists. Inside a depot, each hoist can move according to a specified spatial map connecting different areas of the depot. The test problems for this domain involve different numbers of depots, hoists, crates, containers, and depot areas. The domain has five different actions: an action for lifting a crate by a hoist, an action for dropping a crate by a hoist, an action for moving a hoist into a depot, an action for moving a hoist from one area of a depot to another one, and finally an action for moving a hoist outside a depot.
Five problems for each configuration have been created:
Problem 
Hoists 
Depots 
Containers 
Crates 
Areas 
p1p5 
1 
1 
2 
8 
8 
p6p10 
2 
2 
2 
8 
8 
p11p15 
3 
3 
3 
12 
12 
p16p20 
3 
4 
4 
16 
16 
Temporal Machine Shop
Author: Frédéric Maris
The "tmsktp" domain (temporal machine shop, first proposed in [2]) is inspired by a realworld application. It concerns the use of k kilns, each with different baking times, to bake p ceramic pieces (bakeceramic) of t different types. Each of these types requires a different baking time. These ceramics can then be assembled to produce different structures (makestructure). The resulting structures can then be baked again to obtain a bigger structure (bakestructure). We have defined too a "light" version of these domain for temporallyexpressive planners which do not support richer durative actions (that is with time intervals).
All possible solutions require concurrency of actions (temporally expressive problem).
Although many temporal planners have been compared in the International Planning Competitions (IPC), recent theoretical studies have brought to light the limitations of the current approaches to temporal planning [1]. [2] shows that the domains and problems which have been used up until now in the last competitions can always be solved with a sequential plan. They propose a method to prove that a domain can only be solved using concurrent actions. In fact, the winning planners in the IPC competitions, even if they are efficient in a restricted temporal framework, cannot solve problems for which all possible solutions require parallelism (temporally expressive problems) but only those for which there is at least a sequential solution (temporally simple problems). So, they are therefore far from being capable of solving realworld problems. The objective evaluation of these systems requires the setting up of new benchmarks corresponding to temporally expressive problems.
References:
[1] W.Cushing, S.Kambhampati, Mausam, D.S.Weld, "When is temporal planning really temporal ?", IJCAI, pp. 18521859, 2007.
[2] W.Cushing, S.Kambhampati, K.Talamadupula, D.S.Weld, Mausam, "Evaluating temporal planning domains", ICAPS, pp. 105112, 2007.
[3] Maris F., Régnier P., 2008, "TLPGP: New Results on TemporallyExpressive Planning Benchmarks", in Proceedings of 20th IEEE International Conference on Tools with Artificial Intelligence (ICTAI2008), vol. 1, pp 507514, Dayton OH, USA, November 2008.
[4] Maris F., Régnier P., 2008, "TLPGP: Solving TemporallyExpressive Planning Problems", in Proceedings of 15th International Symposium on Temporal Representation and Reasoning (TIME2008), pp 137144, Montreal QC, Canada, June 2008.
Problem 
Type1 
Type2 
Type3 
p1 
10 
15 
25 
p2 
12 
18 
30 
p3 
14 
21 
35 
p4 
16 
24 
40 
p5 
18 
27 
45 
p6 
20 
30 
50 
p7 
22 
33 
55 
p8 
24 
36 
60 
p9 
26 
39 
65 
p10 
28 
42 
70 
p11 
30 
45 
75 
p12 
32 
48 
80 
p13 
34 
51 
85 
p14 
36 
54 
90 
p15 
38 
57 
95 
p16 
40 
60 
100 
p17 
42 
63 
105 
p18 
44 
66 
110 
p19 
46 
69 
115 
p20 
48 
72 
120 
Turn and Open
Author: Sergio Jiménez Celorrio
In this domain there are a number of robots, with two gripper hands, and a set of rooms containing balls. The goal is to find a plan to transport balls from a given room to another. There are doors that must be open to move from one room to another. In order to open a given door the robot must turn the doorknob and open the door at the same time.
Problem 
Robots 
Rooms 
Balls 
p1 
2 
8 
10 
p2 
2 
8 
12 
p3 
2 
8 
14 
p4 
2 
8 
16 
p5 
2 
9 
18 
p6 
2 
9 
20 
p7 
2 
9 
22 
p8 
2 
9 
24 
p9 
3 
10 
26 
p10 
3 
10 
28 
p11 
3 
10 
30 
p12 
3 
10 
32 
p13 
3 
11 
34 
p14 
3 
11 
36 
p15 
3 
11 
38 
p16 
3 
11 
40 
p17 
4 
12 
42 
p18 
4 
12 
44 
p19 
4 
12 
46 
p20 
4 
12 
48 