Download presentation

Presentation is loading. Please wait.

Published byKassidy Howson Modified over 3 years ago

1
Graphplan

2
Automated Planning: Introduction and Overview 2 The Dock-Worker Robots (DWR) Domain informal description: – harbour with several locations (docks), docked ships, storage areas for containers, and parking areas for trucks and trains – cranes to load and unload ships etc., and robot carts to move containers around

3
Simplified DWR Two robots: r and q Two containers: a and b Two locations: 1 and 2 Robots can load and unload containers and move between locations

4
Dock-Worker-Robot domain Move(r, l, l’) – Pre: at(r,l), adjacent(l,l’) – Effects: at(r,l’), ¬at(r,l) Load(c,r,l) – Pre: at(r,l), in(c,l), unloaded(r) – Effects: loaded(r,c), ¬in(c,l), ¬unloaded(r) Unload(c,r,l) – Pre: at(r,l), loaded(r,c) – Effects: unloded(r), in(c,l), ¬loaded(r,c)

5
Dock-Worker-Robot domain: Propositionalized version Robots r and q: – r1 and r2: at(r, l1), at(r, l2) – q1 and q2: at(q, l1), at (q, l2) – ur and uq: unloaded(r), unloaded(q) Containers a and b: – a1, a2, ar, aq: in(a, l1), in(a, l2), loaded(a, r), loaded(a,q) – b1, b2, br, bq: in(b, l1), in(b, l2), loaded(b, r), loaded(b,q) Example initial state: {r1,q2,a1,b2,ur,uq}

6
Dock-Worker-Robot domain: Propositionalized version Move actions in propositions: – Mr12: move(r,l1,l2) similarly we hae Mr21, Mq12, Mq21 Load actions: – Lar1: load(a,r,l1) Similarly we have Lar2, Laq1, Laq2, Lbr1, Lbr2, Lbq1, Lbq2 Unload actions: – Uar1: unload(a, r, l1) Similarly we have Uar2, Uaq1, Uaq2, Ubr1, Ubr2, Ubq1, Ubq2

7
The Graphplan algorithm Main compoents – Expand graph, where each level includes Action Layer Proposition Layer Mutex propositions Mutex actions – Back-search procedure to retrieve plan Executed when a graph level includes all goal propositions and non of them are mutex – This still doesn’t mean there is a valid plan in this level Basically, this is depth-first search

8
The expand method r1 q2 a1 b2 ur uq Mr12 Mq21 Lar1 Lbq2 r1 r2 q1 q2 a1 ar b2 bq ur uq Mr12 Mr21 Mq12 Mq21 Lar1 Laq1 Lbr2 Lbq2 Uar1 Ubq2 r1 r2 q1 q2 a1 ar aq b2 br bq ur uq Mr12 Mr21 Mq12 Mq21 Lar1 Laq1 Lbr2 Lbq2 Uar1 Uar2 Uaq1 Ubr2 Ubq1 Ubq2 r1 r2 q1 q2 a1 a2 ar aq b1 b2 br bq ur uq P0P0 P1P1 P2P2 P3P3 A1A1 A2A2 A3A3

9
The expand method – Expand graph, where each level includes Action Layer Proposition Layer Mutex propositions Mutex actions – Important: we also have noOps to propagate propositions from one layer to the next (these were not shown in previous example to save space)

10
Independent actions Mr12 and Lar1: – Not independent – Mr12 deletes precondition of Lar1 Mr12 and Mr21: – Not independent – Mr12 deletes positive effect of Mr21 Mr12 and Mq21: – Independent – May occur in same action layer Mr12 Mr21 Mq12 Mq21 Lar1 Laq1 Lbr2 Lbq2 Uar1 Ubq2 r1 r2 q1 q2 a1 ar aq b2 br bq ur uq P2P2 A2A2

11
Mutex actions Function mutexAction(a1, a2, mP) if not(independent(a1,a2) return true for all p1 in precon(a1) for all p2 in precon(a2) if(p1,p2) in mP return true return false

12
Mutex propositions Function mutexProposition (p1, p2, mA) for all a1 in p1.producers for all a2 in p2.producers if(a1,a2) not in mA return false return true

13
The expand method: Pseudo-code

14
Backward graph search – Back-search procedure to retrieve plan Executed when a graph level includes all goal propositions and non of them are mutex – This still doesn’t mean there is a valid plan in this level Basically, this is depth-first search from the latest layer to layer 0 At each iteration we choose an action that achieves one of the goal propositions and add its preconditions as goals for the next iteration Backtrack when fails

15
r1 q2 a1 b2 ur uq Mr12 Mq21 Lar1 Lbq2 r1 r2 q1 q2 a1 ar b2 bq ur uq Mr12 Mr21 Mq12 Mq21 Lar1 Laq1 Lbr2 Lbq2 Uar1 Ubq2 r1 r2 q1 q2 a1 ar aq b2 br bq ur uq Mr12 Mr21 Mq12 Mq21 Lar1 Laq1 Lbr2 Lbq2 Uar1 Uar2 Uaq1 Ubr2 Ubq1 Ubq2 r1 r2 q1 q2 a1 a2 ar aq b1 b2 br bq ur uq P0P0 P1P1 P2P2 P3P3 A1A1 A2A2 A3A3 noOp Choose one action for each proposition, will back track if fail

16
The noGood table When the planning graph has k levels, the noGood table is an array of k sets of sets of goal propositions. – A set of goal propositions g appears in noGood(k) if we failed to find a plan for g in level k Before searching for set g in P j : – Check whether g is in noGood(j) When search for set g in P j failed: – Add g to noGood(j)

17
Backward graph search: Optional implementation Function extract (G, g, level) if level=0 return [] if g in noGoods(level) return failure plan gpSearch(G, g, {}, level) if plan!=failure reuturn plan noGood(level) noGood(level) + g return failure

18
Backward graph search: Optional implementation Function gpSearch(G, g, plan, level) if g = {} #no more subgoals newPlan = extract (G, all preconds of actions in plan, level-1) if newPlan = failure return failure else return newPlan union with plan p g.selectOneProp() providers {a in A level |p in posEffects(a) and no action in plan is mutex with a} if providers = {} return failure a providers.chooseOneAction() return gpSearch(G, g – positive effects of a, plan+a, level) Need to add backtracking here and choose another action if failing

19
Graphplan pseudo-code

Similar presentations

OK

CPSC 322, Lecture 18Slide 1 Planning: Heuristics and CSP Planning Jim Little UBC CS 322 October 15, 2014 Textbook §8.

CPSC 322, Lecture 18Slide 1 Planning: Heuristics and CSP Planning Jim Little UBC CS 322 October 15, 2014 Textbook §8.

© 2019 SlidePlayer.com Inc.

All rights reserved.

To make this website work, we log user data and share it with processors. To use this website, you must agree to our Privacy Policy, including cookie policy.

Ads by Google