Fetching the paper…
Reading the bibliography…
Fast Downward is a classical planning system based on heuristic search.
GPS: A program that simulates human thought
Newell, A., & Simon, H. A. (1963) · 1963
Earlier work this paper cites.
Planning in a hierarchy of abstraction spaces
Sacerdoti, E. D. (1974) · 1974
Earlier work this paper cites.
The HARPY
Lowerre, B. T. (1976) · 1976
Earlier work this paper cites.
Computers and Intractability — A Guide to the Theory of NP-Completeness
Garey, M. R., & Johnson, D. S. (1979) · 1979
Earlier work this paper cites.
Linear-time algorithms for testing the satisfiability of propositional Horn formulae
Dowling, W. F., & Gallier, J. H. (1984) · 1984
Earlier work this paper cites.
Planning as search: A quantitative approach
Korf, R. E. (1987) · 1987
Earlier work this paper cites.
A theoretical analysis of conjunctive-goal problems
Joslin, D., & Roach, J. (1989) · 1989
Earlier work this paper cites.
Abstraction in planning
Tenenberg, J. D. (1991) · 1991
Earlier work this paper cites.
Iterative broadening
Ginsberg, M. L., & Harvey, W. D. (1992) · 1992
Earlier work this paper cites.
Downward refinement and the efficiency of hierarchical problem solving
Bacchus, F., & Yang, Q. (1994) · 1994
Earlier work this paper cites.
The computational complexity of propositional STRIPS planning
Bylander, T. (1994) · 1994
Earlier work this paper cites.
Automatically generating abstractions for planning
Knoblock, C. A. (1994) · 1994
Cited alongside, same era.
Complexity results for SAS +
Bäckström, C., & Nebel, B. (1995) · 1995
Cited alongside, same era.
Incremental planning
Jonsson, P., & Bäckström, C. (1995) · 1995
Cited alongside, same era.
A reactive planner for a model-based executive
Williams, B. C., & Nayak, P. P. (1997) · 1997
Cited alongside, same era.
Exhibiting knowledge in planning problems to minimize state encoding length
Edelkamp, S., & Helmert, M. (1999) · 1999
Cited alongside, same era.
A ∗ with partial expansion for large branching factor problems
Yoshizumi, T., Miura, T., & Ishida, T. (2000) · 2000
Cited alongside, same era.
Planning as heuristic search
Local search topology in planning benchmarks: A theoretical analysis
Hoffmann, J. (2002) · 2002
Later among the works it cites.
Structure and complexity in planning with unary operators
Brafman, R. I., & Domshlak, C. (2003) · 2003
Later among the works it cites.
PDDL2.1: An extension to PDDL for expressing temporal planning domains
Fox, M., & Long, D. (2003) · 2003
Later among the works it cites.
Planning through stochastic local search and temporal action graphs in LPG
Gerevini, A., Saetti, A., & Serina, I. (2003) · 2003
Later among the works it cites.
Artificial Intelligence — A Modern Approach
Russell, S., & Norvig, P. (2003) · 2003
Later among the works it cites.
PDDL2.2: The language for the classical part of the 4th International Planning Competition
Edelkamp, S., & Hoffmann, J. (2004) · 2004
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Bonet, B., & Geffner, H. (2001) · 2001
Cited alongside, same era.
Multi-agent off-line coordination: Structure and complexity
Domshlak, C., & Dinitz, Y. (2001) · 2001
Cited alongside, same era.
Local search topology in planning benchmarks: An empirical analysis
Hoffmann, J. (2001) · 2001
Cited alongside, same era.
The FF planning system: Fast plan generation through heuristic search
Hoffmann, J., & Nebel, B. (2001) · 2001
Cited alongside, same era.
Structure and complexity in planning with unary operators
Domshlak, C., & Brafman, R. I. (2002) · 2002
Cited alongside, same era.
State-variable planning under structural restrictions: Algorithms and complexity
Jonsson, P., & Bäckström, C. (1998a)
Cited in the paper.
A planning heuristic based on causal graph analysis
Helmert, M. (2004) · 2004
Later among the works it cites.
Where ‘ignoring delete lists’ works: Local search topology in planning benchmarks
Hoffmann, J. (2005) · 2005
Later among the works it cites.
The deterministic part of IPC-4: An overview
Hoffmann, J., & Edelkamp, S. (2005) · 2005
Later among the works it cites.
Reviving integer programming approaches for AI planning: A branch-and-cut framework
van den Briel, M., Vossen, T., & Kambhampati, S. (2005) · 2005
Later among the works it cites.