STRIPS PDDL Benchmarks from IPC Sequential Optimization Tracks, 1998-2018

A subset of STRIPS planning problems from the sequential optimization tracks of the International Planning Competition (IPC) held between 1998 and 2018. The dataset is sourced from the AI research group at the University of Basel and is available via the paperswithcode platform under an Open Access license. It likely contains formal problem definitions used for evaluating automated planning algorithms.

Use Cases

• Benchmarking automated planning systems based on STRIPS problem definitions.
• Developing and testing heuristic search algorithms for sequential optimization tasks.
• Comparing the performance of different planners on standardized competition problems.
• Studying the evolution of planning problem complexity over the 20-year competition period.

Strengths

• Curated from the official International Planning Competition (IPC) tracks, spanning 20 years from 1998 to 2018.
• Hosted by a university research group (University of Basel), suggesting academic rigor.

Limitations

• Column-level documentation is absent; field semantics must be inferred after download.
• Row count and dataset size are unknown, which may limit suitability assessment.

Provenance

Source

University of Basel, AI research group (Jendrik Seipp).

Collection Method

Curated from the International Planning Competition (IPC) benchmark repository.

Time Range

1998-2018