planninggraphs
Planning graphs are a data structure used in automated planning to represent the progression of states and actions from an initial state toward a set of goals. A planning graph is built as a sequence of alternating proposition (state) levels and action levels. The initial proposition level P0 encodes the literals true in the initial state, and the first action level A0 contains actions whose preconditions are all in P0. From each pair (Pi, Ai), the next proposition level Pi+1 is formed by adding the effects of the actions in Ai. To preserve possible future states, no-op or persistence actions carry literals forward from Pi to Pi+1. Within each level, mutual exclusion (mutex) relations are established to mark pairs of actions or propositions that cannot co-occur, such as incompatible effects or competing needs.
Construction proceeds iteratively: new action levels are added for which preconditions are satisfied by the preceding
Uses and variants: planning graphs underpin several heuristic methods used in AI planning. The level heuristic
Limitations: planning graphs can become large, especially for complex domains, and their usefulness depends on the