Transcript table competition

AI Planning Systems Competition
CMU, 1998
Team
Number of
problems
solved
Average
Fastest
solution
on
time (msec)
Shortest
solutions
for
Blackbox
(AT&T Labs)
10
3171
3
6
HSP
(Venezuela)
IPP
(Germany)
9
25875
1
5
8 (11)
11036
1(3)
6(8)
STAN
(UK)
7
20947
5
4
24
Notes
All finalists based on SATPLAN, Graphplan, or
A* !
• Traditional non-linear planning no longer
competitive
• Knowledge-intensive approaches require too
much human effort
Other new techniques
• Type-theoretic analysis of operators: can infer
state invariants (package only in one vehicle, etc.)
– powerful, generally applicable pre-processor
• Compilation of more expressive languages
(conditional effects) to STRIPS
• Recent extensions to MDP’s of A* (Geffner),
Graphplan (Blum), SATPLAN (Littman)
25
Summary
Blackbox combines best features of Graphplan,
SATPLAN, and new randomized systematic
search engines
Automatic generation of wffs from standard
STRIPS input
• No performance penalty over hand-encodings!
Testbed for bridging different planning
paradigms
26