The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
The FF Planning System: Fast Plan Generation Through Heuristic Search
Open accessAbstract
We describe and evaluate the algorithmic techniques that are used in the FF planning system. Like the HSP system, FF relies on forward state space search, using a heuristic that estimates goal distances by ignoring delete lists. Unlike HSP's heuristic, our method does not assume facts to be independent. We introduce a novel search strategy that combines hill-climbing with systematic search, and we show how other powerful heuristic information can be extracted and used to prune the search space. FF was the most successful automatic planner at the recent AIPS-2000 planning competition. We review the results of the competition, give data for other benchmark domains, and investigate the reasons for the runtime performance of FF compared to HSP.
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
Nonparametric Statistics for the Behavioral Sciences
Guitton, H., & Siegel, S. (1958) · Revue économique · doi:10.2307/3498751 · Cited by 35,245
STRIPS: A New Approach to the Application of Theorem Proving to Problem Solving
Fikes, R. E., & Nilsson, N. J. (1971) · Artificial Intelligence · doi:10.1016/0004-3702(71)90010-5 · Cited by 4,882
Fast 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
Bonet, B., & Geffner, H. (2001) · Artificial Intelligence · doi:10.1016/s0004-3702(01)00108-4 · Cited by 959
The computational complexity of propositional STRIPS planning
Bylander, T. (1994) · Artificial Intelligence · doi:10.1016/0004-3702(94)90081-7 · Cited by 865
Pushing the envelope: planning, propositional logic, and stochastic search
Kautz, H., & Selman, B. (1996) · Cited by 830
Hard and easy distributions of SAT problems
Mitchell, D. G. M., Selman, B., & Levesque, H. J. (1992) · Cited by 799
McAllester, D., & Rosenblitt, D. (1991) · Cited by 525
ADL: exploring the middle ground between STRIPS and the situation calculus
Pednault, E. (1989) · Principles of Knowledge Representation and Reasoning · Cited by 479
Unifying SAT-based and graph-based planning
Kautz, H., & Selman, B. (1999) · Cited by 429
Cited by
ALFRED: A Benchmark for Interpreting Grounded Instructions for Everyday Tasks
Shridhar, M., Thomason, J., Gordon, D., Bisk, Y., Han, W., Mottaghi, R., Zettlemoyer, L., & Fox, D. (2020) · 2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr42600.2020.01075 · Cited by 540
Narrative Planning: Balancing Plot and Character
Riedl, M. O., & Young, R. M. (2010) · Journal of Artificial Intelligence Research · doi:10.1613/jair.2989 · Cited by 522
The Fast Downward Planning System
Helmert, M. (2006) · Journal of Artificial Intelligence Research · doi:10.1613/jair.1705 · Cited by 510
Combined task and motion planning through an extensible planner-independent interface layer
Srivastava, S., Fang, E., Riano, L., Chitnis, R., Russell, S., & Abbeel, P. (2014) · 2014 IEEE International Conference on Robotics and Automation (ICRA) · doi:10.1109/icra.2014.6906922 · Cited by 459
Integrated Task and Motion Planning
Garrett, C. R., Chitnis, R., Holladay, R., Kim, B., Silver, T., Kaelbling, L. P., & Lozano-Pérez, T. (2021) · Annual Review of Control, Robotics, and Autonomous Systems · doi:10.1146/annurev-control-091420-084139 · Cited by 409
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
A hybrid self-adaptive sine cosine algorithm with opposition based learning
Gupta, S., & Deep, K. (2019) · Expert Systems with Applications · doi:10.1016/j.eswa.2018.10.050 · Cited by 299
Gerevini, A. E., Haslum, P., Long, D., Saetti, A., & Dimopoulos, Y. (2009) · Artificial Intelligence · doi:10.1016/j.artint.2008.10.012 · Cited by 295
Robot task planning using semantic maps
Galindo, C., Fernández-Madrigal, J.-A., González, J., & Saffiotti, A. (2008) · Robotics and Autonomous Systems · doi:10.1016/j.robot.2008.08.007 · Cited by 291
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
Forward-Chaining Partial-Order Planning
Coles, A., Coles, A., Fox, M., & Long, D. (2010) · Proceedings of the International Conference on Automated Planning and Scheduling · doi:10.1609/icaps.v20i1.13403 · Cited by 257
The 2014 International Planning Competition: Progress and Trends
Vallati, M., Chrpa, L., Grześ, M., McCluskey, T. L., Roberts, M., & Sanner, S. (2015) · AI Magazine · doi:10.1609/aimag.v36i3.2571 · Cited by 112
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
Adapting an AI Planning Heuristic for Directed Model Checking
Kupferschmid, S., Hoffmann, J., Dierks, H., & Behrmann, G. (2006) · Lecture Notes in Computer Science · doi:10.1007/11691617_3 · Cited by 50
Self-citationMPTP: Motion-Planning-Aware Task Planning for Navigation in Belief Space
Thomas, A., Mastrogiovanni, F., & Baglietto, M. (2021) · Robotics and Autonomous Systems · doi:10.1016/j.robot.2021.103786 · Cited by 21
TASKOGRAPHY: Evaluating robot task planning over large 3D scene graphs
Agia, C., Jatavallabhula, K. M., Khodeir, M., Miksik, O., Vineet, V., Mukadam, M., Paull, L., & Shkurti, F. (2022) · arXiv · doi:10.48550/arxiv.2207.05006 · Cited by 21
Intentionality and Conflict in The Best Laid Plans Interactive Narrative Virtual Environment
Ware, S. G., & Young, R. M. (2016) · IEEE Transactions on Computational Intelligence and AI in Games · doi:10.1109/tciaig.2015.2489159 · Cited by 19
LLMs Can't Plan, But Can Help Planning in LLM-Modulo Frameworks
Kambhampati, S., Valmeekam, K., Guan, L., Verma, M., Stechly, K., Bhambri, S., Saldyt, L., & Murthy, A. (2024) · arXiv · doi:10.48550/arxiv.2402.01817 · Cited by 237
“In the past, this meant that the only reliable way to generate synthetic data is to use external plan generators–for example, use a classical planner like FF to solve a host of blocks world instances and then use those solutions to fine-tune the LLM.”
Method
Metadata
- Authors
- Hoffmann, J., & Nebel, B.
- Venue
- Journal of Artificial Intelligence Research
- Publisher
- AI Access Foundation
- Published
- 2001-05-01
- Volume
- 14
- Pages
- 253-302
- ISSN
- 1076-9757 (ISSN-L)
- OpenAlex
- W1545688112
- Cited by
- 1,838
- References
- 23
- FWCI
- 53.33
- 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
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.