The Deterministic Part of IPC-4: An Overview
arXiv:1109.5663 · doi:10.1613/jair.1677
Abstract
We provide an overview of the organization and results of the deterministic part of the 4th International Planning Competition, i.e., of the part concerned with evaluating systems doing deterministic planning. IPC-4 attracted even more competing systems than its already large predecessors, and the competition event was revised in several important respects. After giving an introduction to the IPC, we briefly explain the main differences between the deterministic part of IPC-4 and its predecessors. We then introduce formally the language used, called PDDL2.2 that extends PDDL2.1 by derived predicates and timed initial literals. We list the competing systems and overview the results of the competition. The entire set of data is far too large to be presented in full. We provide a detailed summary; the complete data is available in an online appendix. We explain how we awarded the competition prizes.
References in corpus (7)
- The FF Planning System: Fast Plan Generation Through Heuristic Search
- PDDL2.1: An Extension to PDDL for Expressing Temporal Planning Domains
- Planning Through Stochastic Local Search and Temporal Action Graphs in LPG
- The 3rd International Planning Competition: Results and Analysis
- The Deterministic Part of IPC-4: An Overview
- Engineering Benchmarks for Planning: the Domains Used in the Deterministic Part of IPC-4
- Supply Restoration in Power Distribution Systems - A Case Study in Integrating Model-Based Diagnosis and Repair Planning
Cited by in corpus (7)
- Modelling Mixed Discrete-Continuous Domains for Planning
- The Deterministic Part of IPC-4: An Overview
- COLIN: Planning with Continuous Linear Numeric Change
- Engineering Benchmarks for Planning: the Domains Used in the Deterministic Part of IPC-4
- A Hybrid LP-RPG Heuristic for Modelling Numeric Resource Flows in Planning
- SAP Speaks PDDL: Exploiting a Software-Engineering Model for Planning in Business Process Management
- Handling PDDL3.0 State Trajectory Constraints with Temporal Landmarks