Principles of AI Planning - Bibliography

Introduction, General

Jörg Hoffmann, Everything You Always Wanted to Know About Planning (But Were Afraid to Ask).
Invited paper in Proceedings of the 34th Annual German Conference on Artificial Intelligence (KI'11), 2011. (PDF)

Stuart Russell and Peter Norvig, Artificial Intelligence: A Modern Approach.
Prentice Hall, 2009.

Hector Geffner and Blai Bonet, A Concise Introduction to Models and Methods for Automated Planning.
Morgan & Claypool Publishers, 2013.

Dana Nau, Malik Ghallab and Paolo Traverso, Automated Planning: Theory and Practice.
Morgan Kaufmann, 2004.

Computational Complexity

Tom Bylander, The Computational Complexity of Propositional STRIPS Planning.
Artificial Intelligence 69(1-2):165-204, 1994. (PS.GZ)

Kutluhan Erol, Dana S. Nau and V. S. Subrahmanian, Complexity, Decidability and Undecidability Results for Domain-Independent Planning.
Artificial Intelligence 76(1-2):65-88, 1995. (ScienceDirect)

Michael L. Littman, Probabilistic Propositional Planning: Representations and Complexity.
Proceedings of the Fourteenth National Conference on Artificial Intelligence (AAAI-97), pp. 748-754, 1997. (PS)

Patrik Haslum and Peter Jonsson, Some Results on the Complexity of Planning with Incomplete Information.
Proceedings of the 5th European Conference on Planning (ECP-99), pp. 308-318, 1999. (PDF of preprint)

Malte Helmert, Decidability and Undecidability Results for Planning with Numerical State Variables.
Proceedings of the Sixth International Conference on Artificial Intelligence Planning and Scheduling (AIPS 2002), pp. 303-312, 2002. (PDF)

Jussi Rintanen, Complexity of Planning with Partial Observability.
Proceedings of the Fourteenth International Conference on Automated Planning and Scheduling (ICAPS 2004), pp. 345-354, 2004. (PDF)

Planning as Heuristic Search

Blai Bonet, Gábor Loerincs and Héctor Geffner, A Fast and Robust Action Selection Mechanism for Planning.
Proceedings of the Fourteenth National Conference on Artificial Intelligence (AAAI-97), pp. 714-719, 1997. (PS)

Blai Bonet and Héctor Geffner, Planning as Heuristic Search: New Results.
Proceedings of the 5th European Conference on Planning (ECP-99), pp. 360-372, 1999. (PS)

Blai Bonet and Héctor Geffner, Planning as Heuristic Search.
Artificial Intelligence 129(1):5-33, 2001. (PS)

Stefan Edelkamp, Planning with Pattern Databases.
Pre-proceedings of the Sixth European Conference on Planning (ECP 2001), pp. 13-24, 2001. (PDF of preprint)

Jörg Hoffmann and Bernhard Nebel, The FF Planning System: Fast Plan Generation Through Heuristic Search.
Journal of Artificial Intelligence Research 14:253-302, 2001. (PDF)

Stefan Edelkamp, Symbolic Pattern Databases in Heuristic Search Planning.
Proceedings of the Sixth International Conference on Artificial Intelligence Planning and Scheduling (AIPS 2002), pp. 274-283, 2002. (PDF)

Patrik Haslum, Blai Bonet and Héctor Geffner, New Admissible Heuristics for Domain-Independent Planning.
Proceedings of the Twentieth National Conference on Artificial Intelligence (AAAI 2005), pp. 1163-1168, 2005. (PDF)

Jörg Hoffmann, Where 'Ignoring Delete Lists' Works: Local Search Topology in Planning Benchmarks,
Journal of Artificial Intelligence Research 24:685-758, 2005. (PDF)

Malte Helmert, The Fast Downward Planning System.
Journal of Artificial Intelligence Research 26:191-246, 2006. (PDF)

Stefan Edelkamp, Automated Creation of Pattern Database Search Heuristics.
Proceedings of the 4th Workshop on Model Checking and Artificial Intelligence (MoChArt 2006), pp. 35-50, 2007. (SpringerLink)

Patrik Haslum, Adi Botea, Malte Helmert, Blai Bonet and Sven Koenig, Domain-Independent Construction of Pattern Database Heuristics for Cost-Optimal Planning.
Proceedings of the 22nd AAAI Conference on Artificial Intelligence (AAAI 2007), pp. 1007-1012, 2007. (PDF)

Malte Helmert, Patrik Haslum and Jörg Hoffmann, Flexible Abstraction Heuristics for Optimal Sequential Planning.
Proceedings of the Seventeenth International Conference on Automated Planning and Scheduling (ICAPS 2007), pp. 176-183, 2007. (PDF)

Vitaly Mirkis and Carmel Domshlak, Cost-Sharing Approximations for h+.
Proceedings of the Seventeenth International Conference on Automated Planning and Scheduling (ICAPS 2007), pp. 240-247, 2007. (PDF)

Emil Keyder and Héctor Geffner, Heuristics for Planning with Action Costs Revisited.
Proceedings of the 18th European Conference on Artificial Intelligence (ECAI 2008), 2008. (PDF)

Silvia Richter, Malte Helmert and Matthias Westphal, Landmarks Revisited.
Proceedings of the 23rd AAAI Conference on Artificial Intelligence (AAAI 2008), pp. 975-982. (PDF)

Michael Katz and Carmel Domshlak, Optimal Additive Composition of Abstractian-based Admissible Heuristics.
Proceedings of the Eighteenth International Conference on Automated Planning and Scheduling (ICAPS 2008), pp. 174-181, 2008. (PDF)

Nondeterministic Planning

Blai Bonet and Héctor Geffner, Planning with Incomplete Information as Heuristic Search in Belief Space.
Proceedings of the Fifth International Conference on Artificial Intelligence Planning and Scheduling (AIPS 2000), pp. 52-61, 2000. (PS)

Alessandro Cimatti, Marco Pistore, Marco Roveri, and Paolo Traverso, Weak, Strong, and Strong Cyclic Planning via Symbolic Model Checking.
Technical Report #0104-11 at the Istituto Trentino di Cultura, 2001.

Background and Miscellaneous

Richard E. Fikes and Nils J. Nilsson, STRIPS: A New Approach to the Application of Theorem Proving to Problem Solving
Artificial Intelligence 2:189-208, 1971. (PDF)

Joseph C. Culberson and Jonathan Schaeffer, Searching with Pattern Databases.
Proceedings of the Eleventh Biennial Conference of the Canadian Society for Computational Studies of Intelligence (CSCSI-96), pp. 402-416, 1996. (PS.GZ)

Richard E. Korf, Michael Reid and Stefan Edelkamp, Time complexity of iterative-deepening-A*.
Artificial Intelligence 129(1-2): 199-218, 2001. (ScienceDirect)

Etsuji Tomita, Akira Tanaka and Haruhisa Takahashi, The Worst-Case Time Complexity for Generating All Maximal Cliques.
Proceedings of the 10th Annual International Conference on Computing and Combinatorics (COCOON 2004), pp. 161-170, 2004. (SpringerLink)

Klaus Dräger, Bernd Finkbeiner and Andreas Podelski, Directed Model Checking with Distance-Preserving Abstractions.
Proceedings of the 13th International SPIN Workshop (SPIN 2006), pp. 19-34, 2006. (PDF)