Planning: Part 3 Planning Graphs

More documents

Recommendations

Info

Cake example Repeat process until graph levels off: two consecutive levels are identical, or contain the same amount of literals (explanation follows later)
The GRAPHPLAN Algorithm Extract a solution directly from the PG function GRAPHPLAN(problem) return solution or failure graph INITIAL-PLANNING-GRAPH(problem) goals GOALS[problem] loop do if goals all non-mutex in last level of graph then do solution EXTRACT-SOLUTION(graph, goals, LENGTH(graph)) failure if solution failure then return solution else if NO-SOLUTION-POSSIBLE(graph) then return graph EXPAND-GRAPH(graph, problem)
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 and 10: PG Example Identify mutual exclusio
Page 11: Cake example Level S 1 contains al
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?