Reading in classical planning
What is planning? What it is useful for?
Complexity and Tractability Fragments of Classical Fragments
- The Computational Complexity of Propositional STRIPS Planning, T. Bylander, Artificial Intelligence,  69(1-2): 165-204, 1994.
- Complexity Results for SAS+ Planning, C. Backstrom and B. Nebel, Computational Intelligence,  11(4):625-655, 1995.
- State-variable Planning Under Structural Restrictions: Algorithms and Complexity, P. Jonsson and C. Backstrom, Artificial Intelligence,  100(1-2): 125-176, 1998.
-
Structure and Complexity of Planning with Unary Operators , R. Brafman and C. Domshlak,
Journal of Artificial Intelligence Research, 18:315-349, 2003.
-
Multi-Agent Off-line Coordination: Structure and Complexity , Y. Dinitz and C. Domshlak, ECP-01.
- Factored Planning: How, When, and When Not, R. Brafman and C. Domshlak, AAAI-06.
- Complexity Results for Standard Benchmark Domains in Planning, M. Helmert, Artificial Intelligence,  143(2): 219-262, 2003.
- New Complexity Results for Classical Planning Benchmarks, M. Helmert, ICAPS-06.
General AI Planning Techniques --- Some fundamental things
A subset of things that you should read at a rather early stage.
- An Introduction to Least Commitment Planning, D. Weld, AI Magazine,  15(4):27-61, 1994.
- Encoding Plans in Propositional Logic, H. Kautz, D. McAllester, and B. Selman, KR-96.
- Fast Planning Through Planning Graph Analysis, A. Blum and M. Furst, Artificial Intelligence,  90:281--300, 1997.
- Pushing the Envelope: Planning, Propositional Logic, and Stochastic Search, H. Kautz and B. Selman, AAAI-96.
- Planning as Heuristic Search, B. Bonet and H. Geffner, Artificial Intelligence,  129(1-2), 2001.
- Admissible Heuristics for Optimal Planning, P. Haslum and H. Geffner, AIPS-00.
- The FF Planning System: Fast Plan Generation Through Heuristic Search, J. Hoffmann and B. Nebel, Journal of Artificial Intelligence Research, 14:253-302, 2001.
Graphical analysis of planning problems
Graphs are everywhere ... :)
- Automatically generating abstractions for planning,
C. A. Knoblock, Artificial Intelligence,  68(2), 1994.
-
Structure and Complexity of Planning with Unary Operators , R. Brafman and C. Domshlak,
Journal of Artificial Intelligence Research, 18:315-349, 2003.
-
Multi-Agent Off-line Coordination: Structure and Complexity , Y. Dinitz and C. Domshlak, ECP-01.
- The Fast Downward Planning System, M. Helmert, Journal of Artificial Intelligence Research,  26:191-246, 2006
- A Planning Heuristic Based on Causal Graph Analysis,
M. Helmert, ICAPS-04
- Factored Planning: How, When, and When Not, R. Brafman and C. Domshlak, AAAI-06.
- The role of macros in tractable planning over causal graphs,
A. Jonsson, IJCAI-07.
- Reducing Accidental Complexity in Planning Problems, P. Haslum, IJCAI-07.
Homomorphism abstractions: Pattern databases in general and in planning
- Pattern Databases, Computational Intelligence,  14(4):318-334, 1998.
- Additive Pattern Database Heuristics, A. Felner, R, E. Korf, and S. Hanan, Journal of Artificial Intelligence Research,  22:279-318, 2004.
- Planning with Pattern Databases, S. Edelkamp, ECP-01.
- Domain-Independent Construction of Pattern Database Heuristics for Cost-Optimal Planning, P. Haslum, A. Botea, M. Helmert, B. Bonet, and S. Koenig, AAAI-07.
Macro-actions in/for planning
What is a macro-action? For a brief statement, read, e.g., here.
- Macro-FF: Improving AI Planning with Automatically Learned Macro-Operators, Botea A., Enzenberger M., Muller M., and Schaeffer J, Journal of Artificial Intelligence Research,  24:581-621, 2005.
- Planning with Reduced Operator Sets, P. Haslum and P. Jonsson, ICAPS-00.
- Sokoban: Enhancing General Single-Agent Search Methods Using Domain Knowledge, A. Junghanns and J. Schaeffer, Artificial Intelligence,  129(1-2):219-251, 2001.
- Marvin: A Heuristic Search Planner with Online Macro-Action Learning, A. I. Coles and A. J. Smith,  28:119-156, 2007.