Planning Benchmark Test Set
Extension of Graphplan benchmark set
Graphplan faster than UCPOP (Weld 1992) and Prodigy (Carbonell 1992) on blocks world and rocket domains
logistics - complex, highly-parallel transportation domain, ranging up to
14 time slots, unlimited parallelism
2,165 possible actions per time slot
optimal solutions containing 150 distinct actions
Problems of this size (10^18 configurations) not previously handled by any state-space planning system