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
227.46 sec
506160 kbyte
Planner Log
0.38 sec
24628 kbyte
Planner Log
0.35 sec
24840 kbyte
Planner Log
0.55 sec
24384 kbyte
Planner Log
0.35 sec
24576 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:
18 / 0 / 2
transport:
25 / 0 / 5
Planner Log
Verify Log
0.00 sec
4128 kbyte
Verify Log
0.00 sec
2540 kbyte
Verify Log
0.01 sec
5420 kbyte
Verify Log
0.00 sec
2808 kbyte
no plan no plan
HPDL-planner
recursion: yes
partial order: yes
Compile Log
179.16 sec
436044 kbyte
Planner Log
0.57 sec
24240 kbyte
Planner Log
0.53 sec
24116 kbyte
Planner Log
0.61 sec
24084 kbyte
Planner Log
0.54 sec
23804 kbyte
Planner Log
0.60 sec
24648 kbyte
Planner Log
0.50 sec
25056 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.01 sec
4132 kbyte
Verify Log
0.00 sec
2540 kbyte
Verify Log
0.01 sec
5420 kbyte
Verify Log
0.00 sec
2808 kbyte
Verify Log
0.00 sec
4104 kbyte
Verify Log
0.00 sec
2800 kbyte
HTN-Translation
recursion: yes
partial order: yes
Compile Log
25.38 sec
146388 kbyte
Planner Log
2.46 sec
24592 kbyte
Planner Log
2.46 sec
24712 kbyte
Planner Log
1.96 sec
24904 kbyte
Planner Log
2.45 sec
24120 kbyte
Planner Log
0.80 sec
25160 kbyte
Planner Log
1.09 sec
24704 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
32.19 sec
192024 kbyte
Planner Log
0.50 sec
24968 kbyte
Planner Log
0.49 sec
24156 kbyte
Planner Log
0.55 sec
24716 kbyte
Planner Log
0.50 sec
24752 kbyte
not supported not supported Miconic:
7 / 0 / 0
Zenotravel:
5 / 0 / 0
UM-Translog:
22 / 0 / 0
Satellite:
25 / 0 / 0
Woodworking:
5 / 0 / 6
SmartPhone:
7 / 0 / 0
rover:
18 / 0 / 2
transport:
26 / 0 / 4
Planner Log
Verify Log
0.01 sec
4988 kbyte
Verify Log
0.00 sec
2536 kbyte
Verify Log
0.01 sec
5420 kbyte
Verify Log
0.00 sec
3272 kbyte
no plan no plan
Competitor test01 test02 test03 test04 test05 test06
empty method forall no abstracts sortof constants in domain synonymes
Treerexx
recursion: yes
partial order: no
Planner Log
0.36 sec
25008 kbyte
Planner Log
0.36 sec
24248 kbyte
Planner Log
0.33 sec
25308 kbyte
Planner Log
0.32 sec
24688 kbyte
Planner Log
0.32 sec
24372 kbyte
Planner Log
0.31 sec
24744 kbyte
Verify Log
0.00 sec
2356 kbyte
Verify Log
0.21 sec
2360 kbyte
Verify Log
0.00 sec
2352 kbyte
Verify Log
0.00 sec
2364 kbyte
Verify Log
0.00 sec
2364 kbyte
Verify Log
0.00 sec
2508 kbyte
HPDL-planner
recursion: yes
partial order: yes
Planner Log
0.51 sec
24264 kbyte
Planner Log
0.56 sec
24184 kbyte
Planner Log
0.52 sec
24640 kbyte
Planner Log
0.52 sec
24376 kbyte
Planner Log
0.52 sec
24204 kbyte
Planner Log
0.52 sec
24232 kbyte
Verify Log
0.01 sec
2232 kbyte
Verify Log
0.00 sec
2368 kbyte
Verify Log
0.00 sec
2348 kbyte
Verify Log
0.00 sec
2360 kbyte
Verify Log
0.00 sec
2364 kbyte
Verify Log
0.00 sec
2504 kbyte
HTN-Translation
recursion: yes
partial order: yes
Planner Log
0.31 sec
24416 kbyte
Planner Log
0.28 sec
24620 kbyte
Planner Log
0.30 sec
24588 kbyte
Planner Log
0.32 sec
24200 kbyte
Planner Log
0.27 sec
24844 kbyte
Planner Log
1.96 sec
24960 kbyte
no plan no plan no plan no plan no plan no plan
HyperTensioN
recursion: yes
partial order: no
Planner Log
0.49 sec
24092 kbyte
Planner Log
0.48 sec
24400 kbyte
Planner Log
0.49 sec
25000 kbyte
Planner Log
0.49 sec
24692 kbyte
Planner Log
0.52 sec
23920 kbyte
Planner Log
0.49 sec
24512 kbyte
Verify Log
0.00 sec
2348 kbyte
Verify Log
0.00 sec
2372 kbyte
Verify Log
0.00 sec
2344 kbyte
Verify Log
0.00 sec
2360 kbyte
Verify Log
0.00 sec
2356 kbyte
Verify Log
0.00 sec
2504 kbyte