What Is a Planning Graph in AI? Layered Structure for Action Sequences
Definition
A planning graph is a layered data structure used in AI planning to represent world states over time and find valid action sequences.
Components
- Layers: Discrete time steps (proposition layer → action layer → proposition layer...).
- Proposition Nodes: Facts true at that time.
- Action Nodes: Actions whose preconditions are met.
- Edges: Persistence (fact carries over), Precondition (action needs fact), Effect (action makes fact true).
Construction & Use
- Start with initial state (layer 0).
- Iteratively add actions with satisfied preconditions, then resulting propositions.
- Stop when goal propositions appear in a proposition layer.
- Extract plan via backward search from goal to start.
Pros & Cons
- Pros: Visual, efficient search, heuristic guidance (e.g., Graphplan).
- Cons: Can grow exponentially; limited expressiveness (no continuous time/resources).
Example
Move block A→B: Layer 0 (A at A), Action (move), Layer 1 (A at B). Precondition: A at A. Effect: A at B.