The 3rd International Planning Competition: Results and Analysis

TL;DR

This paper presents the results and analysis of the third international planning competition, comparing planner performance, domain difficulty, and scalability, providing insights into current capabilities and future challenges in AI planning.

Contribution

It offers a comprehensive analysis of competition results, including performance comparisons and domain difficulty assessments, advancing understanding of planner capabilities.

Findings

Planners show varying performance across domains

Difficulty of problem instances varies significantly

Scalability of planners differs with problem complexity

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.