IPC-4, Classical Part: An Overview

1
IPC-4, Classical PartAn Overview

• Stefan Edelkamp, University of Dortmund
• Jörg Hoffmann, University of Freiburg

2
Overview

• PDDL2.2
• The Domains
• The Competitors
• How to Understand the Posters
• Results Spotlights
• Concluding Remarks

3
Overview

• PDDL2.2
• The Domains
• The Competitors
• How to Understand the Posters
• Results Spotlights
• Concluding Remarks

4
PDDL2.2 PDDL2.1

• Axioms derived predicates
• (derived (above ?x ?y)
• (or (on ?x ?y)
• (exists (?z) (and (above ?x ?z)
• (above ?z
  ?y)))))

5
PDDL2.2 PDDL2.1

• Timed initial literals literals that become true
  at a certain time independently of the actions
  taken by the planner ( a simple form of
  deterministic exogenous events)
• (at 2004.5 (over IPC-4))
• (at 6 (daylight)) (at 22 (not (daylight)))

6
Overview

• PDDL2.2
• The Domains
• The Competitors
• How to Understand the Posters
• Results Spotlights
• Concluding Remarks

7
The IPC-4 Domains

• We have worked hard to make them
• realistic
• cover diverse problem structures
• We started from diverse applications and tried to
  model them with PDDL2.2
• We compiled as much of the domain semantics as
  possible into the simpler PDDL subsets (in
  particular, adl2strips)
• We hope that these will become standard
  benchmarks!!

8
The IPC-4 Domains

• Airport control the ground traffic Hoffmann
  Trüg
• Pipesworld control oil product flow in a
  pipeline network Liporace Hoffmann
• Promela find deadlocks in communication
  protocols Edelkamp
• PSR resupply lines in a faulty electricity
  network Thiebaux Hoffmann
• Satellite Settlers Fox Long, additional
  Satellite versions with time windows for sending
  data Hoffmann
• UMTS set up applications for mobile terminals
  Edelkamp Englert

9
Overview

• PDDL2.2
• The Domains
• The Competitors
• How to Understand the Posters
• Results Spotlights
• Concluding Remarks

10
The Competitors
11
The Competitors
Detailed descriptions see booklet
12
Overview

• PDDL2.2
• The Domains
• The Competitors
• How to Understand the Posters
• Results Spotlights
• Concluding Remarks

13
The Posters

• are self-explanatory?!
• Show
• Runtime graphs suboptimal planners
• Runtime graphs optimal planners
• Graphs for NrActions, MakeSpan, MetricValue
• Some runtime graphs are split into two (directly
  above each other) for readability
• One row one domain version (well, most of the
  time)
• Planners were allowed to choose the quality
  criterion they wanted to be compared upon

14
Overview

• PDDL2.2
• The Domains
• The Competitors
• How to Understand the Posters
• Results Spotlights
• Concluding Remarks

15
Machine and Results Files

• Linux-PC, 2 CPU, 3 GHz (habakuk)
• Time bound 1/2 h
• Memory bound 1 GB
• Planformat
• timepoint action duration
• Selected optimization criteria
• CPU time seconds.milliseconds

16
Visualization of Plans
17
Airport (Strips)
18
Airport (Strips)
19
Airport (Strips, Optimal)
20
Airport ( Actions)
21
Airport (Makespan)
22
Pipesworld (Strips)
23
Pipesworld (Strips)
24
Promela (StripsDerived Predicates)
25
Satellite (Timed Initial Facts)
26
PSR (small)
27
Satellite (Optimization)
28
Settlers (Numeric)
unsolvable
29
UMTS (Optimal)
30
UMTS (Flaw)
31
Suboptimal 1st and 2nd Places
SGPlan LPG-TD Down. Diag. Mac-FF YAHSP Crikey
propos. 1st / 2nd 4 / 6 1 / 6 6 / 1 7 / 2 3 / 0 4 / 2 0 / 1
time/met. 1st / 2nd 13 / 0 9 / 4
total 17 / 6 10 / 10 6 / 1 7 / 2 3 / 0 4 / 2 0 / 1
32
Optimal 1st and 2nd Places
CPT TP-4 HSP_a SAT Opti Semsyn BFHSP
propos. 1st / 2nd 0 / 2 0 / 0 0 / 0 5 / 2 0 / 4 0 / 2 0 / 3
time/met 1st / 2nd 3 / 2 1 / 4 1 / 2
total 3 / 4 1 / 4 1 / 2 5 / 2 0 / 4 0 / 2 0 / 3
33
Hosted at International Conference on Automated
Planning and Scheduling

Performance Award 1st Prize, Suboptimal
Propositional Track
Malte Helmert and Silvia Richter
Fast Downward / Fast Diagonally Downward
200
Stefan Edelkamp Jörg Hoffmann IPC-4
Co-Chairs Classical Part
Whistler, June 6, 2004
34
Hosted at International Conference on Automated
Planning and Scheduling

Performance Award 2nd Prize, Suboptimal
Propositional Track
Vincent Vidal
YAHSP
100
Stefan Edelkamp Jörg Hoffmann IPC-4
Co-Chairs Classical Part
Whistler, June 6, 2004
35
Hosted at International Conference on Automated
Planning and Scheduling

Performance Award 2nd Prize, Suboptimal
Propositional Track
Yixin Chen, Chih-Wei Hsu, and Benjamin W. Wah
SGPlan
100
Stefan Edelkamp Jörg Hoffmann IPC-4
Co-Chairs Classical Part
Whistler, June 6, 2004
36
Hosted at International Conference on Automated
Planning and Scheduling

Performance Award 1st Prize, Suboptimal
Temporal Metric Track
Yixin Chen, Chi-Wei Hsu, and Benjamin W. Wah
SGPlan
200
Stefan Edelkamp Jörg Hoffmann IPC-4
Co-Chairs Classical Part
Whistler, June 6, 2004
37
Hosted at International Conference on Automated
Planning and Scheduling

Performance Award 2nd Prize, Suboptimal Metric
Temporal Track
Alfonso Gerevini, Alessandro Saetti, Ivan Serina,
and Paolo Toninelli
LPG -TD
100
Stefan Edelkamp Jörg Hoffmann IPC-4
Co-Chairs Classical Part
Whistler, June 6, 2004
38
Hosted at International Conference on Automated
Planning and Scheduling

Performance Award 1st Prize, Optimal Track
Henry Kautz, David Roznyai, Farhad
Teydaye-Saheli, Shane Neth and Michael Lindmark
200
SATPLAN04
Stefan Edelkamp Jörg Hoffmann IPC-4
Co-Chairs Classical Part
Whistler, June 6, 2004
39
Hosted at International Conference on Automated
Planning and Scheduling

Performance Award 2nd Prize, Optimal Track
Vincent Vidal and Héctor Geffner
CPT
100
Stefan Edelkamp Jörg Hoffmann IPC-4
Co-Chairs Classical Part
Whistler, June 6, 2004
40
Overview

• PDDL2.2
• The Domains
• The Competitors
• How to Understand the Posters
• Results Spotlights
• Concluding Remarks

41
Concluding Remarks

• IPC-4 success story includes
• Novel more expressive language aspects
• Advanced application-oriented planning benchmarks
• Significant advance to the State-of-the-Art
• All infos already available at hosting conference
• Joint competition booklet with language features
  and all competing planners (gt 60 authors)
• Results posters

42
Internet Resources

• PDDL2.2 - Language Description
• Domains and Problem Instances (-gt CD)
• Result Files, GNU-Plots (-gt CD)
• Plan Visualization (-gtCD)
• Planner Executables
• PDDL2.2 Validator
• Language Compilers, e.g. ADL-gtSTRIPS

43
Thanks to

• all competitors