scispace - formally typeset
Open AccessJournal ArticleDOI

The 3rd international planning competition: results and analysis

Reads0
Chats0
TLDR
The paper addresses 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 through statistical analysis of the raw results.
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.

read more

Content maybe subject to copyright    Report

Citations
More filters
Journal ArticleDOI

PDDL2.1: an extension to PDDL for expressing temporal planning domains

TL;DR: PDDL2.1 as discussed by the authors is a modelling language capable of expressing temporal and numeric properties of planning domains and has been used in the International Planning Competitions (IPC) since 1998.
Journal ArticleDOI

The metric-FF planning system: translating Ignoring delete lists to numeric state variables

TL;DR: A natural extension of "ignoring delete lists" to numeric state variables is presented, preserving the relevant theoretical properties of the STRIPS relaxation under the condition that the numeric task at hand is "monotonic".
Journal ArticleDOI

Planning through stochastic local search and temporal action graphs in LPG

TL;DR: This paper focuses on temporal planning, introducing TA-graphs and proposing some techniques to guide the search in LPG using this representation, and shows that these techniques can be very effective.
Journal ArticleDOI

Ordered landmarks in planning

TL;DR: This work extends Koehler and Hoffmann's definition of reasonable orders between top level goals to the more general case of landmarks and shows how landmarks can be found, how their reasonable orders can be approximated, and how this information can be used to decompose a given planning task into several smaller sub-tasks.
Book

Automated Planning and Acting

TL;DR: This book presents a comprehensive paradigm of planning and acting using the most recent and advanced automated-planning techniques, and explains the computational deliberation capabilities that allow an actor to reason about its actions, choose them, organize them purposefully, and act deliberately to achieve an objective.
References
More filters
Journal ArticleDOI

The FF planning system: fast plan generation through heuristic search

TL;DR: A novel search strategy is introduced that combines hill-climbing with systematic search, and it is shown how other powerful heuristic information can be extracted and used to prune the search space.
Proceedings Article

Fast planning through planning graph analysis

TL;DR: A new approach to planning in STRIPS-like domains based on constructing and analyzing a compact structure the authors call a Planning Graph is introduced, and a new planner, Graphplan, is described that uses this paradigm.
Journal ArticleDOI

PDDL2.1: an extension to PDDL for expressing temporal planning domains

TL;DR: PDDL2.1 as discussed by the authors is a modelling language capable of expressing temporal and numeric properties of planning domains and has been used in the International Planning Competitions (IPC) since 1998.
Book

100 statistical tests

TL;DR: In this article, the authors introduce Statistical Testing Examples of Test Procedures List of Tests Classification of Tests The Tests List of Tables Tables Tables The Tests list of tables tables Table 1.1.
Journal ArticleDOI

Using temporal logics to express search control knowledge for planning

TL;DR: This work shows how domain dependent search control knowledge can be represented in a temporal logic, and then utilized to effectively control a forward-chaining planner.
Related Papers (5)