Uni-Logo

IPC 2020 - Participants

The 2020 IPC for Hierarchical Planning - Competitors

This list contains current status information on all active competitors of the 2020 IPC. For each competitor we show whether the planner currently compiles and whether it solves a given set of sample problems. The logs of the compilation and every run are available for download by clicking on the blue links. The test instances can be downloaded by clicking at the columns headers.

Each of the six sample problems is divided into two sections. The one on the top shows whether the planner is able to find a plan (green) or not (red). The second section below shows whether the generated plan is valid. Green indicates that the plan is valid, red that it is not, and blue that no plan was found in the first place. If the planner produced only a primitive plan and did not provide a decomposition witness, we will indicate with cyan that the primitive plan is executable. Yellow indicates instances that the planner does not support (either due to recursion or partial order).

For the last column, we let each planner run for 10 seconds on a larger set of benchmark instances. As a summary per domain we report:

  1. SOL - the planner has solved the problem with a valid plan,
  2. INVAL - the planner has solved the problem, but the plan failed verification, and
  3. TLE - the planner exceeded the timelimit of 10 seconds.
Note that INVAL here also includes cases where the planner produced only a primitive plan which was valid.

CompetitorCompile Status rover01 satellite01 um-translog01 transport01 p-rover01 p-transport01 10 seconds run (SOL,INVAL,TLE)
Lilotane
recursion: yes
partial order: no
Compile Log
390.51 sec
599832 kbyte
Planner Log
0.40 sec
24456 kbyte
Planner Log
0.35 sec
24380 kbyte
Planner Log
0.48 sec
24488 kbyte
Planner Log
0.33 sec
24184 kbyte
not supported not supported Miconic:
7 / 0 / 0
Zenotravel:
5 / 0 / 0
UM-Translog:
22 / 0 / 0
Satellite:
25 / 0 / 0
Woodworking:
11 / 0 / 0
SmartPhone:
7 / 0 / 0
rover:
20 / 0 / 0
transport:
27 / 0 / 3
Planner Log
Verify Log
0.01 sec
3216 kbyte
Verify Log
0.00 sec
2496 kbyte
Verify Log
0.01 sec
4668 kbyte
Verify Log
0.00 sec
2704 kbyte
no plan no plan
HPDL-planner
recursion: yes
partial order: yes
Compile Log
196.08 sec
443176 kbyte
Planner Log
0.57 sec
24764 kbyte
Planner Log
0.55 sec
24748 kbyte
Planner Log
0.73 sec
24316 kbyte
Planner Log
0.54 sec
24752 kbyte
Planner Log
0.60 sec
25088 kbyte
Planner Log
0.60 sec
24872 kbyte
Miconic:
7 / 0 / 0
Zenotravel:
5 / 0 / 0
UM-Translog:
22 / 0 / 0
Satellite:
25 / 0 / 0
Woodworking:
3 / 0 / 8
SmartPhone:
2 / 0 / 5
rover:
13 / 0 / 7
transport:
1 / 0 / 29
Planner Log
Verify Log
0.00 sec
3368 kbyte
Verify Log
0.00 sec
2500 kbyte
Verify Log
0.01 sec
4664 kbyte
Verify Log
0.00 sec
2704 kbyte
Verify Log
0.00 sec
3368 kbyte
Verify Log
0.00 sec
2704 kbyte

recursion:
partial order:
Compile Log
142.56 sec
68776 kbyte
Planner Log
0.04 sec
24760 kbyte
Planner Log
0.03 sec
24768 kbyte
Planner Log
0.04 sec
24488 kbyte
not supported not supported not supported Miconic:
0 / 0 / 7
Zenotravel:
0 / 0 / 5
UM-Translog:
0 / 0 / 22
Satellite:
0 / 0 / 25
Woodworking:
0 / 0 / 11
SmartPhone:
0 / 0 / 7
rover:
0 / 0 / 20
transport:
0 / 0 / 30
Planner Log
no plan no plan no plan no plan no plan no plan
HyperTensioN
recursion: yes
partial order: no
Compile Log
36.86 sec
197780 kbyte
Planner Log
0.44 sec
25040 kbyte
Planner Log
0.38 sec
24696 kbyte
Planner Log
0.48 sec
24652 kbyte
Planner Log
0.41 sec
24844 kbyte
not supported not supported Miconic:
7 / 0 / 0
Zenotravel:
5 / 0 / 0
UM-Translog:
22 / 0 / 0
Satellite:
25 / 0 / 0
Woodworking:
6 / 0 / 5
SmartPhone:
7 / 0 / 0
rover:
19 / 0 / 1
transport:
30 / 0 / 0
Planner Log
Verify Log
0.01 sec
3932 kbyte
Verify Log
0.00 sec
2492 kbyte
Verify Log
0.02 sec
4660 kbyte
Verify Log
0.01 sec
2704 kbyte
no plan no plan
PDDL4J
recursion: yes
partial order: no
Compile Log
189.06 sec
715192 kbyte
Planner Log
2.17 sec
97308 kbyte
Planner Log
2.13 sec
93044 kbyte
Planner Log
2.36 sec
109152 kbyte
Planner Log
2.07 sec
87740 kbyte
not supported not supported Miconic:
6 / 1 / 0
Zenotravel:
5 / 0 / 0
UM-Translog:
9 / 13 / 0
Satellite:
25 / 0 / 0
Woodworking:
3 / 3 / 5
SmartPhone:
0 / 0 / 7
rover:
20 / 0 / 0
transport:
28 / 0 / 2
Planner Log
Verify Log
0.00 sec
3212 kbyte
Verify Log
0.00 sec
2496 kbyte
Verify Log
0.01 sec
3144 kbyte
Verify Log
0.00 sec
2708 kbyte
no plan no plan
PDDL4J
recursion: yes
partial order: yes
Compile Log
185.68 sec
722484 kbyte
Planner Log
2.09 sec
98528 kbyte
Planner Log
2.15 sec
93732 kbyte
Planner Log
2.28 sec
112160 kbyte
Planner Log
2.04 sec
97280 kbyte
Planner Log
2.29 sec
98616 kbyte
Planner Log
2.13 sec
96540 kbyte
Miconic:
6 / 1 / 0
Zenotravel:
5 / 0 / 0
UM-Translog:
9 / 13 / 0
Satellite:
25 / 0 / 0
Woodworking:
3 / 2 / 6
SmartPhone:
0 / 0 / 7
rover:
20 / 0 / 0
transport:
26 / 0 / 4
Planner Log
Verify Log
0.00 sec
3212 kbyte
Verify Log
0.00 sec
2492 kbyte
Verify Log
0.01 sec
3144 kbyte
Verify Log
0.00 sec
2708 kbyte
Verify Log
0.00 sec
3124 kbyte
Verify Log
0.00 sec
2696 kbyte
pyHiPOP
recursion: yes
partial order: yes
Compile Log
102.86 sec
420872 kbyte
Planner Log
3.58 sec
59828 kbyte
Planner Log
1.61 sec
34324 kbyte
Planner Log
59.38 sec
1539724 kbyte
Planner Log
13.96 sec
113492 kbyte
Planner Log
60.13 sec
24992 kbyte
Planner Log
60.12 sec
24392 kbyte
Miconic:
7 / 0 / 0
Zenotravel:
5 / 0 / 0
UM-Translog:
17 / 0 / 5
Satellite:
14 / 0 / 11
Woodworking:
2 / 0 / 9
SmartPhone:
4 / 0 / 3
rover:
3 / 0 / 17
transport:
0 / 0 / 30
Planner Log
Verify Log
0.01 sec
3936 kbyte
Verify Log
0.00 sec
2492 kbyte
Verify Log
0.01 sec
4664 kbyte
Verify Log
0.00 sec
2704 kbyte
no plan no plan
Competitor test01 test02 test03 test04 test05 test06 test07
empty method forall forall2 no abstracts constants in domain synonymes arguments
Lilotane
recursion: yes
partial order: no
Planner Log
0.37 sec
25308 kbyte
Planner Log
0.33 sec
24744 kbyte
Planner Log
0.34 sec
24252 kbyte
Planner Log
0.31 sec
24380 kbyte
Planner Log
0.35 sec
24416 kbyte
Planner Log
0.33 sec
24768 kbyte
Planner Log
0.35 sec
24816 kbyte
Verify Log
0.00 sec
2332 kbyte
Verify Log
0.00 sec
2348 kbyte
Verify Log
0.00 sec
2352 kbyte
Verify Log
0.00 sec
2332 kbyte
Verify Log
0.00 sec
2340 kbyte
Verify Log
0.00 sec
2484 kbyte
Verify Log
0.00 sec
2344 kbyte
HPDL-planner
recursion: yes
partial order: yes
Planner Log
0.58 sec
25012 kbyte
Planner Log
0.60 sec
24588 kbyte
Planner Log
0.54 sec
24964 kbyte
Planner Log
0.55 sec
24096 kbyte
Planner Log
0.60 sec
24420 kbyte
Planner Log
0.52 sec
24708 kbyte
Planner Log
0.54 sec
24240 kbyte
Verify Log
0.01 sec
2332 kbyte
Verify Log
0.00 sec
2340 kbyte
Verify Log
0.00 sec
2352 kbyte
Verify Log
0.00 sec
2328 kbyte
Verify Log
0.00 sec
2340 kbyte
Verify Log
0.00 sec
2484 kbyte
Verify Log
0.00 sec
2344 kbyte

recursion:
partial order:
Planner Log
0.04 sec
24476 kbyte
Planner Log
0.04 sec
24284 kbyte
Planner Log
0.04 sec
24296 kbyte
Planner Log
0.04 sec
24404 kbyte
Planner Log
0.04 sec
24684 kbyte
Planner Log
0.04 sec
24676 kbyte
Planner Log
0.04 sec
24600 kbyte
no plan no plan no plan no plan no plan no plan no plan
HyperTensioN
recursion: yes
partial order: no
Planner Log
0.45 sec
24452 kbyte
Planner Log
0.40 sec
24592 kbyte
Planner Log
0.42 sec
24460 kbyte
Planner Log
0.42 sec
24716 kbyte
Planner Log
0.43 sec
24840 kbyte
Planner Log
0.46 sec
24612 kbyte
Planner Log
0.41 sec
24544 kbyte
Verify Log
0.01 sec
2332 kbyte
Verify Log
0.00 sec
2344 kbyte
Verify Log
0.00 sec
2348 kbyte
Verify Log
0.00 sec
2332 kbyte
Verify Log
0.00 sec
2344 kbyte
Verify Log
0.00 sec
2484 kbyte
Verify Log
0.00 sec
2344 kbyte
PDDL4J
recursion: yes
partial order: no
Planner Log
2.25 sec
94088 kbyte
Planner Log
1.95 sec
94400 kbyte
Planner Log
2.21 sec
93944 kbyte
Planner Log
1.95 sec
93304 kbyte
Planner Log
1.98 sec
91352 kbyte
Planner Log
2.15 sec
94396 kbyte
Planner Log
2.05 sec
94236 kbyte
Verify Log
0.00 sec
2332 kbyte
Verify Log
0.00 sec
2348 kbyte
Verify Log
0.00 sec
2356 kbyte
Verify Log
0.00 sec
2328 kbyte
Verify Log
0.00 sec
2340 kbyte
Verify Log
0.00 sec
2484 kbyte
Verify Log
0.00 sec
2344 kbyte
PDDL4J
recursion: yes
partial order: yes
Planner Log
2.08 sec
93668 kbyte
Planner Log
2.07 sec
86192 kbyte
Planner Log
1.89 sec
93748 kbyte
Planner Log
1.97 sec
86112 kbyte
Planner Log
1.92 sec
92052 kbyte
Planner Log
2.08 sec
94752 kbyte
Planner Log
1.99 sec
94924 kbyte
Verify Log
0.00 sec
2332 kbyte
Verify Log
0.00 sec
2344 kbyte
Verify Log
0.00 sec
2356 kbyte
Verify Log
0.00 sec
2324 kbyte
Verify Log
0.00 sec
2340 kbyte
Verify Log
0.00 sec
2480 kbyte
Verify Log
0.00 sec
2344 kbyte
pyHiPOP
recursion: yes
partial order: yes
Planner Log
1.37 sec
31960 kbyte
Planner Log
1.61 sec
32128 kbyte
Planner Log
1.61 sec
32048 kbyte
Planner Log
1.34 sec
31764 kbyte
Planner Log
1.30 sec
32224 kbyte
Planner Log
1.35 sec
32724 kbyte
Planner Log
1.33 sec
32468 kbyte
Verify Log
0.00 sec
2336 kbyte
Verify Log
0.00 sec
2348 kbyte
Verify Log
0.00 sec
2352 kbyte
Verify Log
0.00 sec
2328 kbyte
Verify Log
0.00 sec
2336 kbyte
Verify Log
0.00 sec
2484 kbyte
Verify Log
0.00 sec
2348 kbyte