Levels in Planning Graphs
- Level S0: It is the initial state of the planning graph that consists of nodes each representing the state or conditions that can be true.
- Level A0: Level A0 consists of nodes that are responsible for taking all specific actions in terms of the initial condition described in the S0.
- Si: It represents the state or condition which could hold at a time i, it may be both P and ¬P.
- Ai: It contains the actions that could have their preconditions satisfied at i.
Planning Graphs in AI
Planning graphs play a vital role in AI planning by visually representing possible states and actions that aid in decision-making. This article explores STRIP-like domains that construct and analyze the compact structure called graph planning. We will also delve into the role of mutual exclusion, providing a suitable example using a graph planning algorithm.
Table of Content
- What is a Planning Graph?
- Levels in Planning Graphs
- Working of Planning Graph
- Mutual Exclusion in Planning Graph
- Planning a Graph for a CAKE Problem
- Steps in the Graph Plan Algorithm
- Properties of Graph Plan
- Conclusion