The 3rd International Planning Competition: Results and Analysis

@article{Fox2003The3I,
  title={The 3rd International Planning Competition: Results and Analysis},
  author={Maria Fox and Derek Long},
  journal={J. Artif. Intell. Res.},
  year={2003},
  volume={20},
  pages={1-59}
}
  • M. FoxD. Long
  • Published 1 December 2003
  • Economics
  • J. Artif. Intell. Res.
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… 

Hierarchical Planning in the IPC

This paper proposes to create a new track for the IPC in which hierarchical planners will compete, which will result in a standardised description language, broader support for core features of that language among planners, a set of benchmark problems, a means to fairly and objectively compare HTN planners, and for new challenges for planners.

The Dimensions of Driverlog

A preliminary problem generator for the Driverlog domain is presented, and several important qualities (or dimensions) of the domain are introduced, and the performance of three planners on instances generated by the generator are compared with their performance on the competition instances.

Automating the evaluation of planning systems

A gentle introduction to this software is provided and the main difficulties, both from a scientific and engineering point of view, in assessing the performance of automated planners are examined.

TALplanner in the Third International Planning Competition: Extensions and Control Rules

TALplanner recently participated in the third International Planning Competition, which had a clear emphasis on increasing the complexity of the problem domains being used as benchmark tests and the expressivity required to represent these domains in a planning system.

The Academic Advising Planning Domain

This paper argues that in order to continue to raise challenges and match real world applications, domains must be generated that exhibit true stochasticity, multi-valued domain variables, and concurrent actions, and proposes the academic advising domain as a planning competition domain that exhibits these characteristics.

Quality of solutions to IPC5 benchmark problems: Preliminary results

The results of efforts to find optimal solutions, or improved lower and upper bounds on the quality of solutions, to problems in the IPC5 domains, by a variety of methods are presented.

On the Use of Landmarks in LPG

This work proposes the use of Landmarks for the LPG planner, considering different design choices and analysing empirically its impact on the performance of the planner, finding results comparable with the state-of-the-art planner LAMA.

An Empirical Analysis of Some Heuristic Features for Planning with Local Search in LPG

Three heuristic functions for evaluating the search neighborhood and some settings of the “noise” parameter, that randomizes the next search step for escaping from local minima are examined.

An Empirical Analysis of Some Heuristic Features for Local Search in LPG

Three heuristic functions for evaluating the search neighborhood and some settings of the "noise" parameter, that randomizes the next search step for escaping from local minima are examined.
...

References

SHOWING 1-10 OF 42 REFERENCES

AIPS 2000 Planning Competition: The Fifth International Conference on Artificial Intelligence Planning and Scheduling Systems

An overview of the AIPS'00 planning competition is presented and the main results are reviewed.

The 1998 AI Planning Systems Competition

The 1998 Planning Competition at the AI Planning Systems Conference was the first of its kind to create planning domains that a wide variety of planning researchers could agree on to make comparison among planners more meaningful, and set up a framework for long-term creation of a repository of problems in a standard notation.

TALplanner in the Third International Planning Competition: Extensions and Control Rules

TALplanner recently participated in the third International Planning Competition, which had a clear emphasis on increasing the complexity of the problem domains being used as benchmark tests and the expressivity required to represent these domains in a planning system.

Sapa: A Scalable Multi-objective Heuristic Metric Temporal Planner

The technical details of extracting the heuristics are described and an empirical evaluation of the current implementation of Sapa is presented, one of the best domain independent planners for domains with metric and temporal constraints in the third International Planning Competition.

Planning Through Stochastic Local Search and Temporal Action Graphs in LPG

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.

Sapa: A Multi-objective Metric Temporal Planner

An implementation of SAPA using many of the techniques presented in this paper was one of the best domain independent planners for domains with metric and temporal constraints in the third International Planning Competition, held at AIPS-02.

A Temporal Planning System for Time-Optimal Planning

TPSYS, a Temporal Planning SYStem, is presented, which arises as an attempt to combine the ideas of Graphplan and TGP to solve temporal planning problems more efficiently.

PDDL2.1: An Extension to PDDL for Expressing Temporal Planning Domains

The syntax of the language, PDDL2.1, is described, which has considerable modelling power -- exceeding the capabilities of current planning technology -- and presents a number of important challenges to the research community.

On the extraction, ordering, and usage of landmarks in planning

This work defines ordering constraints not only over the top level goals, but also over the sub-goals that will arise during planning, and demonstrates that the approach can yield significant performance improvements in both heuristic forward search and Graphplan-style planning.

Representation and Control in IxTeT, a Temporal Planner

This paper presents a temporal planner, called IxTeT, arguing for a compromise between the expressiveness and the efficiency of the search, with two important procedures, called "feasibility" and "satisfiability", dealing respectively with goal decomposition and conflict resolution.