Automated Planning

This online textbook follows the public TDDD48 Automated Planning lecture sequence and turns slide material into fuller textbook chapters.

Reading Path

Start with What Is Planning?, the first substantive chapter rewritten from slides A2.

Chapter Tree

• Orientation
  • What Is Planning?
• Foundations
  • Transition Systems and Propositional Logic
  • Planning Tasks
  • Formal Definition of Planning
• Search Algorithms
  • Classical Planning Algorithms
  • Progression and Regression Search
• Delete Relaxation
  • Delete Relaxation
• Abstraction Heuristics
  • Planning Tasks in Finite-Domain Representation
  • Abstractions and Pattern Databases
  • Merge-and-Shrink
• Constraint-Based Heuristics
  • Landmarks and Constraints
  • Operator Counting and Potential Heuristics

Editorial Approach

• Follow the course outline and keep source PDFs traceable.
• Expand slide bullets into definitions, explanations, examples, and study checks.
• Add glossary entries as new technical terms appear.

Source

The lecture outline and PDFs are from the public TDDD48 Automated Planning course page.