Planning: Part 3 Planning Graphs

More documents

Recommendations

Info

Mutual exclusion A mutex relation holds between two actions when: Inconsistent effects: one action negates the effect of another. Interference: one of the effects of one action is the negation of a precondition of the other. Competing needs: one of the preconditions of one action is mutually exclusive with the precondition of the other. A mutex relation holds between two literals when: one is the negation of the other OR each possible action pair that could achieve the literals is mutex (inconsistent support).
Cake example Level S 1 contains all literals that could result from picking any subset of actions in A 0 Conflicts between literals that can not occur together (as a consequence of the selection action) are represented by mutex links. S1 defines multiple states and the mutex links are the constraints that define this set of states.
Page 1 and 2: PLANNING GRAPHS
Page 3 and 4: Planning Graphs Planning graphs co
Page 5 and 6: PG Example Init(Have(Cake)) Goal(Ha
Page 7 and 8: PG Example Add all applicable actio
Page 9: PG Example Identify mutual exclusio
Page 13 and 14: The GRAPHPLAN Algorithm Extract a
Page 16 and 17: GRAPHPLAN example EXPAND-GRAPH als
Page 18 and 19: GRAPHPLAN Termination Termination?
Page 20 and 21: Dinner Date example
Page 22 and 23: Dinner Date example
Page 24: Planning Graph Example Rocket probl

Planning: Part 3 Planning Graphs

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?