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)
treerexx
recursion: yes
partial order: no
Compile Log
339.88 sec
629008 kbyte
Planner Log
0.40 sec
24740 kbyte
Planner Log
0.35 sec
24516 kbyte
Planner Log
0.47 sec
24392 kbyte
Planner Log
0.37 sec
24264 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:
19 / 0 / 1
transport:
26 / 0 / 4
Planner Log
Verify Log
0.00 sec
3228 kbyte
Verify Log
0.00 sec
2512 kbyte
Verify Log
0.01 sec
4688 kbyte
Verify Log
0.00 sec
2724 kbyte
no plan no plan
HPDL-planner
recursion: yes
partial order: yes
Compile Log
180.88 sec
442864 kbyte
Planner Log
0.55 sec
23956 kbyte
Planner Log
0.52 sec
24220 kbyte
Planner Log
0.63 sec
23888 kbyte
Planner Log
0.54 sec
24180 kbyte
Planner Log
0.55 sec
24472 kbyte
Planner Log
0.49 sec
23828 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
3392 kbyte
Verify Log
0.00 sec
2520 kbyte
Verify Log
0.01 sec
4684 kbyte
Verify Log
0.00 sec
2728 kbyte
Verify Log
0.01 sec
3380 kbyte
Verify Log
0.00 sec
2720 kbyte
HTN-Translation
recursion: yes
partial order: yes
Compile Log
1036.88 sec
1038796 kbyte
Planner Log
0.29 sec
25492 kbyte
Planner Log
0.30 sec
24292 kbyte
Planner Log
0.27 sec
24688 kbyte
Planner Log
0.29 sec
25312 kbyte
Planner Log
0.28 sec
24048 kbyte
Planner Log
0.27 sec
25368 kbyte
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
31.53 sec
194040 kbyte
Planner Log
0.44 sec
24564 kbyte
Planner Log
0.41 sec
24720 kbyte
Planner Log
0.45 sec
24808 kbyte
Planner Log
0.39 sec
24640 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
3952 kbyte
Verify Log
0.00 sec
2512 kbyte
Verify Log
0.01 sec
4684 kbyte
Verify Log
0.00 sec
2724 kbyte
no plan no plan
PDDL4J
recursion: yes
partial order: no
Compile Log
180.46 sec
727052 kbyte
Planner Log
1.72 sec
110968 kbyte
Planner Log
1.86 sec
113908 kbyte
Planner Log
2.04 sec
137564 kbyte
Planner Log
1.85 sec
121528 kbyte
not supported not supported Miconic:
6 / 1 / 0
Zenotravel:
5 / 0 / 0
UM-Translog:
5 / 17 / 0
Satellite:
25 / 0 / 0
Woodworking:
3 / 3 / 5
SmartPhone:
0 / 0 / 7
rover:
0 / 0 / 20
transport:
28 / 0 / 2
Planner Log
no plan Verify Log
0.00 sec
2512 kbyte
Verify Log
0.01 sec
3144 kbyte
Verify Log
0.00 sec
2724 kbyte
no plan no plan
PDDL4J
recursion: yes
partial order: yes
Compile Log
183.08 sec
730876 kbyte
Planner Log
1.80 sec
120820 kbyte
Planner Log
1.84 sec
121084 kbyte
Planner Log
2.04 sec
141348 kbyte
Planner Log
1.85 sec
122188 kbyte
Planner Log
1.92 sec
124664 kbyte
Planner Log
1.89 sec
123612 kbyte
Miconic:
6 / 1 / 0
Zenotravel:
5 / 0 / 0
UM-Translog:
5 / 17 / 0
Satellite:
25 / 0 / 0
Woodworking:
3 / 3 / 5
SmartPhone:
0 / 0 / 7
rover:
0 / 0 / 20
transport:
26 / 0 / 4
Planner Log
no plan Verify Log
0.00 sec
2512 kbyte
Verify Log
0.01 sec
3148 kbyte
Verify Log
0.00 sec
2724 kbyte
Verify Log
0.00 sec
2628 kbyte
Verify Log
0.00 sec
2460 kbyte
HiPOP
recursion: yes
partial order: yes
Compile Log
99.89 sec
425304 kbyte
Planner Log
60.13 sec
24676 kbyte
Planner Log
2.58 sec
47292 kbyte
Planner Log
60.15 sec
24608 kbyte
Planner Log
60.15 sec
24532 kbyte
Planner Log
60.15 sec
24396 kbyte
Planner Log
60.14 sec
24616 kbyte
Miconic:
1 / 0 / 6
Zenotravel:
1 / 0 / 4
UM-Translog:
0 / 0 / 22
Satellite:
3 / 0 / 22
Woodworking:
0 / 0 / 11
SmartPhone:
0 / 0 / 7
rover:
0 / 0 / 20
transport:
0 / 0 / 30
Planner Log
no plan Verify Log
0.00 sec
2516 kbyte
no plan no plan no plan no plan
Competitor test01 test02 test03 test04 test05 test06 test07
empty method forall forall2 no abstracts constants in domain synonymes arguments
treerexx
recursion: yes
partial order: no
Planner Log
0.34 sec
24472 kbyte
Planner Log
0.34 sec
24416 kbyte
Planner Log
0.34 sec
24584 kbyte
Planner Log
0.35 sec
24200 kbyte
Planner Log
0.34 sec
24644 kbyte
Planner Log
0.36 sec
24544 kbyte
Planner Log
0.34 sec
24612 kbyte
Verify Log
0.00 sec
2316 kbyte
Verify Log
0.00 sec
2368 kbyte
Verify Log
0.00 sec
2368 kbyte
Verify Log
0.00 sec
2352 kbyte
Verify Log
0.00 sec
2360 kbyte
Verify Log
0.00 sec
2504 kbyte
Verify Log
0.00 sec
2360 kbyte
HPDL-planner
recursion: yes
partial order: yes
Planner Log
0.55 sec
24180 kbyte
Planner Log
0.49 sec
24260 kbyte
Planner Log
0.51 sec
24828 kbyte
Planner Log
0.52 sec
24468 kbyte
Planner Log
0.53 sec
24080 kbyte
Planner Log
0.51 sec
24200 kbyte
Planner Log
0.52 sec
23992 kbyte
Verify Log
0.01 sec
2308 kbyte
Verify Log
0.00 sec
2364 kbyte
Verify Log
0.00 sec
2376 kbyte
Verify Log
0.00 sec
2344 kbyte
Verify Log
0.00 sec
2356 kbyte
Verify Log
0.00 sec
2496 kbyte
Verify Log
0.00 sec
2364 kbyte
HTN-Translation
recursion: yes
partial order: yes
Planner Log
0.30 sec
24348 kbyte
Planner Log
0.28 sec
24712 kbyte
Planner Log
0.28 sec
24468 kbyte
Planner Log
0.30 sec
24560 kbyte
Planner Log
0.27 sec
24596 kbyte
Planner Log
0.27 sec
24664 kbyte
Planner Log
0.27 sec
24284 kbyte
no plan no plan no plan no plan no plan no plan no plan
HyperTensioN
recursion: yes
partial order: no
Planner Log
0.42 sec
24520 kbyte
Planner Log
0.43 sec
24404 kbyte
Planner Log
0.40 sec
24800 kbyte
Planner Log
0.40 sec
24760 kbyte
Planner Log
0.69 sec
24368 kbyte
Planner Log
0.39 sec
24584 kbyte
Planner Log
0.43 sec
24724 kbyte
Verify Log
0.01 sec
2312 kbyte
Verify Log
0.00 sec
2360 kbyte
Verify Log
0.00 sec
2372 kbyte
Verify Log
0.00 sec
2352 kbyte
Verify Log
0.00 sec
2360 kbyte
Verify Log
0.00 sec
2500 kbyte
Verify Log
0.00 sec
2364 kbyte
PDDL4J
recursion: yes
partial order: no
Planner Log
1.79 sec
118860 kbyte
Planner Log
1.82 sec
119404 kbyte
Planner Log
1.80 sec
119480 kbyte
Planner Log
1.81 sec
119656 kbyte
Planner Log
1.80 sec
121708 kbyte
Planner Log
1.80 sec
122032 kbyte
Planner Log
1.85 sec
120416 kbyte
Verify Log
0.00 sec
2348 kbyte
Verify Log
0.00 sec
2368 kbyte
Verify Log
0.00 sec
2376 kbyte
Verify Log
0.00 sec
2348 kbyte
Verify Log
0.00 sec
2360 kbyte
Verify Log
0.00 sec
2240 kbyte
Verify Log
0.00 sec
2364 kbyte
PDDL4J
recursion: yes
partial order: yes
Planner Log
1.81 sec
118776 kbyte
Planner Log
1.82 sec
122228 kbyte
Planner Log
1.81 sec
119868 kbyte
Planner Log
1.78 sec
120008 kbyte
Planner Log
1.79 sec
119480 kbyte
Planner Log
1.79 sec
118368 kbyte
Planner Log
1.81 sec
119616 kbyte
Verify Log
0.00 sec
2348 kbyte
Verify Log
0.00 sec
2368 kbyte
Verify Log
0.00 sec
2368 kbyte
Verify Log
0.00 sec
2348 kbyte
Verify Log
0.00 sec
2364 kbyte
Verify Log
0.00 sec
2244 kbyte
Verify Log
0.00 sec
2364 kbyte
HiPOP
recursion: yes
partial order: yes
Planner Log
1.23 sec
34380 kbyte
Planner Log
1.32 sec
34612 kbyte
Planner Log
1.33 sec
34744 kbyte
Planner Log
1.26 sec
34068 kbyte
Planner Log
1.29 sec
34768 kbyte
Planner Log
1.48 sec
37040 kbyte
Planner Log
1.28 sec
34644 kbyte
Verify Log
0.00 sec
2308 kbyte
Verify Log
0.00 sec
2360 kbyte
Verify Log
0.00 sec
2376 kbyte
Verify Log
0.00 sec
2348 kbyte
Verify Log
0.00 sec
2360 kbyte
Verify Log
0.00 sec
2508 kbyte
Verify Log
0.00 sec
2360 kbyte