Mutual Exclusion in Planning Graph
Mutual exclusion in graph planning refers to the principle that certain actions or propositions cannot coexist or occur simultaneously due to inherent constraints or dependencies within the planning problem. Mutex relations can hold between actions and literals under various conditions.
Mutex Conditions Between Actions
- Inconsistent Effects: One action negates the effect of another.
- Interference: One action deletes a precondition or creates an add-effect of another.
- Competing Needs: Precondition of action a and precondition of action b cannot be true simultaneously.
Mutex Conditions Between Literals
- Negation of Each Other: Two literals are mutually exclusive if one is the negation of the other.
- Achieved by Mutually Exclusive Actions: No pair of non-mutex actions can make both literals true at the same level.
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
Contact Us