top of page
Chapter 10:
classical planning
ARTIFICIAL INTELLIGENCE MODERN APPROACH
Visual Summaries
Table Summary
Core Terminology
Master key academic terminology through active recall and spaced repetition concepts.
single-agent
Classical planning operates in environments that are fully observable, deterministic, static, and ____.
PDDL (Planning Domain Definition Language)
What is the primary language used in classical planning to represent problems through factored representations?
Fluents
In PDDL, what term describes the ground, functionless atoms used to represent states?
Unique names assumption
What PDDL assumption states that distinct constants (e.g., Truck1 and Truck2) always refer to different objects?
PlanSAT
What is the name of the decision problem that asks if any plan exists to solve a given planning problem?
Bounded PlanSAT
What is the name of the decision problem that asks if a solution of length k or less exists?
Chapter Quiz
In the Planning Domain Definition Language (PDDL), which of the following is strictly prohibited from being part of a state representation?
Given a state s and an action a, which formula correctly defines the resulting state RESULT(s,a) in PDDL set semantics?
Which statement accurately describes the complexity of the PlanSAT and Bounded PlanSAT problems in classical planning?
In backward (regression) search, an action is considered 'relevant' to a goal if it meets which of the following criteria?
The 'ignore delete lists' heuristic is considered effective because it transforms the planning problem into one where:
Answers: C, B, C, B, D
bottom of page