The 3rd International Planning Competition: Results and Analysis

Abstract

This paper reports the outcome of the third in the series of biennial international planning competitions, held in association with the International Conference on AI Planning and Scheduling (AIPS) in 2002. In addition to describing the domains, the planners and the objectives of the competition, the paper includes analysis of the results. The results are analysed from several perspectives, in order to address the questions of comparative performance between planners, comparative difficulty of domains, the degree of agreement between planners about the relative difficulty of individual problem instances and the question of how well planners scale relative to one another over increasingly difficult problems. The paper addresses these questions through statistical analysis of the raw results of the competition, in order to determine which results can be considered to be adequately supported by the data. The paper concludes with a discussion of some challenges for the future of the competition series.

References in corpus (6)

• 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
• VHPOP: Versatile Heuristic Partial Order Planner
• SAPA: A Multi-objective Metric Temporal Planner
• A Critical Assessment of Benchmark Comparison in Planning

Cited by in corpus (7)

• PDDL2.1: An Extension to PDDL for Expressing Temporal Planning Domains
• Planning Through Stochastic Local Search and Temporal Action Graphs in LPG
• The Metric-FF Planning System: Translating "Ignoring Delete Lists" to Numeric State Variables
• SAPA: A Multi-objective Metric Temporal Planner
• Planning Graph Heuristics for Belief Space Search
• AltAltp: Online Parallelization of Plans with Heuristic State Search
• TALplanner in IPC-2002: Extensions and Control Rules