The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
The 3rd International Planning Competition: Results and Analysis
Open accessAbstract
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The FF Planning System: Fast Plan Generation Through Heuristic Search
Hoffmann, J., & Nebel, B. (2001) · Journal of Artificial Intelligence Research · doi:10.1613/jair.855 · Cited by 1,838
PDDL2.1: An Extension to PDDL for Expressing Temporal Planning Domains
Fox, M., & Long, D. (2003) · Journal of Artificial Intelligence Research · doi:10.1613/jair.1129 · Cited by 1,741
Self-citationFast planning through planning graph analysis
Blum, A. L., & Furst, M. L. (1997) · Artificial Intelligence · doi:10.1016/s0004-3702(96)00047-1 · Cited by 1,564
Kanji, G. (2006) · SAGE Publications Ltd eBooks · doi:10.4135/9781849208499 · Cited by 783
Using temporal logics to express search control knowledge for planning
Fahiem Bacchus, A., & Kabanza, F. (2000) · Artificial Intelligence · doi:10.1016/s0004-3702(99)00071-5 · Cited by 549
The Metric-{FF} Planning System: Translating {"Ignoring Delete Lists"} To Numeric State Variables
Hoffmann, J. (2003) · Max Planck Digital Library · Cited by 410
Fast Planning Through Planning Graph Analysis.
Blum, A. L., & Furst, M. L. (1995) · doi:10.21236/ada303260 · Cited by 365
Planning Through Stochastic Local Search and Temporal Action Graphs in LPG
Gerevini, A., Saetti, A., & Serina, I. (2003) · Journal of Artificial Intelligence Research · doi:10.1613/jair.1183 · Cited by 318
The 1998 AI Planning Systems Competition
McDermott, D. M. (2000) · doi:10.1609/aimag.v21i2.1506 · Cited by 294
A robust and fast action selection mechanism for planning
Bonet, B., Loerincs, G., & Geffner, H. (1997) · Cited by 216
Cited by
PDDL2.1: An Extension to PDDL for Expressing Temporal Planning Domains
Fox, M., & Long, D. (2003) · Journal of Artificial Intelligence Research · doi:10.1613/jair.1129 · Cited by 1,741
Self-citationPlanning Through Stochastic Local Search and Temporal Action Graphs in LPG
Gerevini, A., Saetti, A., & Serina, I. (2003) · Journal of Artificial Intelligence Research · doi:10.1613/jair.1183 · Cited by 318
Hansen, E. A., & Zhou, R. (2007) · Journal of Artificial Intelligence Research · doi:10.1613/jair.2096 · Cited by 259
VAL: automatic plan validation, continuous effects and mixed initiative planning using PDDL
Howey, R., Long, D., & Fox, M. (2005) · 16th IEEE International Conference on Tools with Artificial Intelligence · doi:10.1109/ictai.2004.120 · Cited by 194
Self-citationPDDLStream: Integrating Symbolic Planners and Blackbox Samplers via Optimistic Adaptive Planning
Garrett, C. R., Lozano-Pérez, T., & Kaelbling, L. P. (2020) · Proceedings of the International Conference on Automated Planning and Scheduling · doi:10.1609/icaps.v30i1.6739 · Cited by 191
Metadata
- Authors
- Long, D., & Fox, M.
- Venue
- Journal of Artificial Intelligence Research
- Publisher
- AI Access Foundation
- Published
- 2003-12-01
- Volume
- 20
- Pages
- 1-59
- ISSN
- 1076-9757 (ISSN-L)
- OpenAlex
- W2111384628
- Cited by
- 289
- References
- 23
- FWCI
- 22.97
- Type
- journal article
- Language
- en
- Open access
- diamond
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: The 3rd International Planning Competition: Results and Analysis. https://app.cochat.ai/papers/10.1613/jair.1240
- The paper
- Long, D., & Fox, M. (2003). The 3rd International Planning Competition: Results and Analysis. Journal of Artificial Intelligence Research. https://doi.org/10.1613/jair.1240
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.