The DOI matches its Crossref record; 33 of the 33 references it cites were found in a registry or an index.
Deterministic planning in the fifth international planning competition: PDDL3 and experimental evaluation of the planners
Open accessAbstract
The international planning competition (IPC) is an important driver for planning research. The general goals of the IPC include pushing the state of the art in planning technology by posing new scientific challenges, encouraging direct comparison of planning systems and techniques, developing and improving a common planning domain definition language, and designing new planning domains and problems for the research community. This paper focuses on the deterministic part of the fifth international planning competition (IPC5), presenting the language and benchmark domains that we developed for the competition, as well as a detailed experimental evaluation of the deterministic planners that entered IPC5, which helps to understand the state of the art in the field. We present an extension of pddl, called pddl3, allowing the user to express strong and soft constraints about the structure of the desired plans, as well as strong and soft problem goals. We discuss the expressive power of the new language focusing on the restricted version that was used in IPC5, for which we give some basic results about its compilability into pddl2. Moreover, we study the relative performance of the IPC5 planners in terms of solved problems, CPU time, and plan quality; we analyse their behaviour with respect to the winners of the previous competition; and we evaluate them in terms of their capability of dealing with soft goals and constraints, and of finding good quality plans in general. Overall, the results indicate significant progress in the field, but they also reveal that some important issues remain open and require further research, such as dealing with strong constraints and computing high quality plans in metric-time domains and domains involving soft goals or constraints.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Clarke, E. M., Grümberg, O., & Long, D. (1996) · Cited by 6,813
Self-citationThe temporal logic of programs
Pnueli, A. (1977) · 18th Annual Symposium on Foundations of Computer Science (sfcs 1977) · doi:10.1109/sfcs.1977.32 · Cited by 5,689
Clarke, E. M., & Schlingloff, B. (1999) · Cited by 4,226
Automatic verification of finite-state concurrent systems using temporal logic specifications
Clarke, E. M., Emerson, E. A., & Sistla, A. P. (1986) · ACM Transactions on Programming Languages and Systems · doi:10.1145/5397.5399 · Cited by 3,605
The Temporal Logic of Reactive and Concurrent Systems
Manna, Z., & Pnueli, A. (1992) · Springer eBooks · doi:10.1007/978-1-4612-0931-7 · Cited by 2,958
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
The Fast Downward Planning System
Helmert, M. (2006) · Cited by 1,222
SOME RAPID APPROXIMATE STATISTICAL PROCEDURES
Wilcoxon, F. (1950) · Annals of the New York Academy of Sciences · doi:10.1111/j.1749-6632.1950.tb53974.x · Cited by 1,200
Bonet, B., & Geffner, H. (2001) · Artificial Intelligence · doi:10.1016/s0004-3702(01)00108-4 · Cited by 959
Simple On-the-fly Automatic Verification of Linear Temporal Logic
Gerth, R., Peled, D., Vardi, M. Y., & Wolper, P. (1996) · IFIP Advances in Information and Communication Technology · doi:10.1007/978-0-387-34892-6_1 · Cited by 705
Using temporal logics to express search control knowledge for planning
Bacchus, F., & Kabanza, F. (2000) · Artificial Intelligence · doi:10.1016/s0004-3702(99)00071-5 · Cited by 664
Semiring-based constraint satisfaction and optimization
Bistarelli, S., Montanari, U., & Rossi, F. (1997) · Journal of the ACM · doi:10.1145/256303.256306 · Cited by 630
Molecular Interaction Map of the Mammalian Cell Cycle Control and DNA Repair Systems
Kohn, K. W. (1999) · Molecular Biology of the Cell · doi:10.1091/mbc.10.8.2703 · Cited by 560
The Fast Downward Planning System
Helmert, M. (2006) · Journal of Artificial Intelligence Research · doi:10.1613/jair.1705 · Cited by 510
The 3rd International Planning Competition: Results and Analysis
Long, D., & Fox, M. (2003) · Journal of Artificial Intelligence Research · doi:10.1613/jair.1240 · Cited by 289
Self-citationDubois, D., Fargier, H., & Prade, H. (1996) · Applied Intelligence · doi:10.1007/bf00132735 · Cited by 287
Planning for temporally extended goals
Bacchus, F., & Kabanza, F. (1998) · Annals of Mathematics and Artificial Intelligence · doi:10.1023/a:1018985923441 · Cited by 276
Bacchus, F. (2001) · AI Magazine · doi:10.1609/aimag.v22i3.1571 · Cited by 187
Branching and pruning: An optimal temporal POCL planner based on constraint programming
Vidal, V., & Geffner, H. (2006) · Artificial Intelligence · doi:10.1016/j.artint.2005.08.004 · Cited by 179
Plan Constraints and Preferences in PDDL3
Gerevini, A., & Long, D. P. (2006) · Cited by 177
Self-citationThiébaux, S., Hoffmann, J., & Nebel, B. (2005) · Artificial Intelligence · doi:10.1016/j.artint.2005.05.004 · Cited by 175
The Deterministic Part of IPC-4: An Overview
Hoffmann, J., & Edelkamp, S. (2005) · Journal of Artificial Intelligence Research · doi:10.1613/jair.1677 · Cited by 145
On the Compilability and Expressive Power of Propositional Planning Formalisms
Nebel, B. (1998) · Cited by 134
TALplanner: A temporal logic based forward chaining planner
Kvarnström, J., & Doherty, P. (2000) · Annals of Mathematics and Artificial Intelligence · doi:10.1023/a:1016619613658 · Cited by 129
Planning with preferences using logic programming
Son, T. C., & Pontelli, E. (2006) · Theory and Practice of Logic Programming · doi:10.1017/s1471068406002717 · Cited by 99
Pathways to Biomedical Discovery
Thagard, P. R. (2003) · Philosophy of Science · doi:10.1086/375465 · Cited by 95
An approach to efficient planning with numerical fluents and multi-criteria plan quality
Gerevini, A., Saetti, A., & Serina, I. (2008) · Artificial Intelligence · doi:10.1016/j.artint.2008.01.002 · Cited by 90
Self-citationEngineering Benchmarks for Planning: the Domains Used in the Deterministic Part of IPC-4
Hoffmann, J., Edelkamp, S., Thiébaux, S., Englert, R. A., Liporace, F. S., & Trüg, S. (2006) · Journal of Artificial Intelligence Research · doi:10.1613/jair.1982 · Cited by 70
Complexity of concurrent temporal planning
Rintanen, J. (2007) · Cited by 66
On the Compilability and Expressive Power of Propositional Planning Formalisms
Nebel, B. (2000) · Journal of Artificial Intelligence Research · doi:10.1613/jair.735 · Cited by 45
Expressive equivalence of planning formalisms
Bäckström, C. (1995) · Artificial Intelligence · doi:10.1016/0004-3702(94)00081-b · Cited by 44
Cited by
Symbiotic human-robot collaborative assembly
Wang, L., Gao, R., Váncza, J., Krüger, J., Wang, X. V., Makris, S., & Chryssolouris, G. (2019) · CIRP Annals · doi:10.1016/j.cirp.2019.05.002 · Cited by 565
Robot task planning and explanation in open and uncertain worlds
Hanheide, M., Göbelbecker, M., Horn, G. S., Pronobis, A., Sjöö, K., Aydemir, A., Jensfelt, P., Gretton, C., Dearden, R., Janicek, M., et al. (2017) · Artificial Intelligence · doi:10.1016/j.artint.2015.08.008 · Cited by 145
The deterministic part of the seventh International Planning Competition
Linares López, C., Jiménez Celorrio, S., & García Olaya, Á. (2015) · Artificial Intelligence · doi:10.1016/j.artint.2015.01.004 · Cited by 71
Metadata
- Authors
- Gerevini, A. E., Haslum, P., Long, D., Saetti, A., & Dimopoulos, Y.
- Venue
- Artificial Intelligence
- Publisher
- Elsevier BV
- Published
- 2009-04
- Volume
- 173
- Issue
- 5-6
- Pages
- 619-668
- ISSN
- 0004-3702 (ISSN-L)
- OpenAlex
- W1989914740
- Cited by
- 295
- References
- 33
- FWCI
- 22.79
- Type
- journal article
- Language
- en
- Open access
- bronze
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
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.