1. April 3, 2006AI: Chapter 11: Planning1 Artificial Intelligence Chapter 11: Planning

2. April 3, 2006AI: Chapter 11: Planning2 Contents Search vs. Planning The Language of Planning Problems STRIPS Operators Partial Order Planning CLIPS

3. April 3, 2006AI: Chapter 11: Planning3 Introduction Planning is the task of coming up with a sequence of actions that will achieve the goal Classical planning environments –Fully observable, deterministic, finite, static (change only happens when the agent acts), and discrete (in time, action, objects)

4. April 3, 2006AI: Chapter 11: Planning4 Introduction A plan is complete iff every precondition is achieved A precondition is achieved iff it is the effect if an earlier step and no possibly intervening step undoes it

5. April 3, 2006AI: Chapter 11: Planning5 Search vs. Planning Consider a Internet Buying Agent whose task it is to buy our text book (search based) –ISBN# 0137903952 –Searched based agent One buying action for each ISBN number –Planning based agent Work backwards Goal is Have(0137903952) Have(x) results from Buy(x) Therefore Buy(0137903952)

6. April 3, 2006AI: Chapter 11: Planning6 Search vs. Planning If our planning agent could use a conjunction of subgoals –Then it could use a single domain- independent heuristic The number of unsatisfied conjuncts –Have(A)  Have(B)  Have(C)  Have(D) –A state containing Have(A)  Have(B) would have a cost 2

7. April 3, 2006AI: Chapter 11: Planning7 Search vs. Planning Another example: –Consider the task of getting milk, bananas, and a cordless drill Really want to go to supermarket and then go to the hardware store But we could get sidetracked! –By irrelevant actions

8. April 3, 2006AI: Chapter 11: Planning8 Search vs. Planning

9. April 3, 2006AI: Chapter 11: Planning9 Search vs. Planning Planning Systems do the following: –Open up action and goal representation to allow selection –Divide-and-conquer by sub-goaling –Relax requirement for sequential construction of solutions

10. April 3, 2006AI: Chapter 11: Planning10 The Language of Planning Problems Representation of states –Decompose the world into logical conditions and represent a state as a conjunction of positive literals –Must be ground and function-free –Examples: Poor  Unknown At( Plane 1, CLE )  At( Plane 2, LAS ) At(x,y) or At( Father(Fred), CLE) (not allowed)

11. April 3, 2006AI: Chapter 11: Planning11 The Language of Planning Problems Representation of goals –A partially specified state –Represented as a conjunction of ground literals –Examples At( Plane 1, LAS ) Rich  Famous –State s satisfies goal g if s contains all the atoms in g (and possibly others) Rich  Famous  Miserable satisfies Rich  Famous

12. April 3, 2006AI: Chapter 11: Planning12 The Language of Planning Problems Representation of actions –Specified in terms of the preconditions that must hold before it can be executed and the effects that ensue when it is executed –Action( Fly( p, from, to )) Precond: At(p, from)  Plane(p)  Airport(from)  Airport(to) Effect: ¬ At(p, from)  At(p, to) –This is also known as an action schema

13. April 3, 2006AI: Chapter 11: Planning13 Search vs. Planning Again Search –States: program data structures –Actions: program code –Goal: program code –Plan: sequence from S 0 Planning –States: logical sentences –Actions: preconditions and outcomes –Goal: logical sentences (conjunction) –Plan: constraints on actions

14. April 3, 2006AI: Chapter 11: Planning14 Example Suppose our current state is: –At(P1, CLE)  At(P2, LAS)  Plane(P1)  Plane(P2)  Airport(CLE)  Airport(LAS) This state satisfies the precondition –At(p, from)  Plane(p)  Airport(from)  Airport(to) Using the substitution –{p/P1, from/CLE, to/LAS} The following concrete action is applicable –Fly( P1, CLE, LAS)

15. April 3, 2006AI: Chapter 11: Planning15 STRIPS STanford Research Institute Problem Solver A restricted language for planning that describes actions and descriptions of objects in a system Example –Action: Buy(x) –Precondition: At(p), Sells(p, x) –Effect: Have(x)

16. April 3, 2006AI: Chapter 11: Planning16 STRIPS This abstracts away many important details! Restricted language -> efficient algorithm –Precondition: conjunction of positive literals –Effect: conjunction of literals A complete set of STRIPS operators can be translated into a set of successor-state axioms

17. April 3, 2006AI: Chapter 11: Planning17 STRIPS Only positive literals in states: Poor  Unknown Closed world assumption: Unmentioned literals are false Effect P  ¬Q: Add P and delete Q Only ground literals in goals: Rich  Famous

18. April 3, 2006AI: Chapter 11: Planning18 STRIPS Goals are conjunctions: Rich  Famous Effects are conjunctions: No support for equality No support for types

19. April 3, 2006AI: Chapter 11: Planning19 ADL Positive and negative literals in states: ¬ Rich  ¬ Famous Open world assumption: Unmentioned literals are unknown Effect P  ¬Q: Add P and ¬ Q and delete ¬ P and Q Quantified variables in goals:  x At(P 1, x)  At(P 2, x) is the goal of having P 1 and P 2 in the same place

20. April 3, 2006AI: Chapter 11: Planning20 ADL Goals allow conjunction and disjunction: ¬ Poor  (Famous  Smart) Conditional Effects are allowed: when P: E means E is an effect only if P is satisfied Equality predicate built in: (x = y) Variables can have types: (p : Plane)

21. April 3, 2006AI: Chapter 11: Planning21

22. April 3, 2006AI: Chapter 11: Planning22 Example: Air Cargo Transport Init(At(C 1, CLE)  At(C 2, LAS)  At(P 1, CLE)  At(P 2, LAS)  Cargo(C 1 )  Cargo(C 2 )  Plane(P 1 )  Plane(P 2 )  Airport(CLE)  Airport(LAS)) Goal( At(C 1, LAS) At(C 2, CLE))

23. April 3, 2006AI: Chapter 11: Planning23 Example: Air Cargo Transport Action( Load(c, p, a), Precond: At(c, a)  At(p, a)  Cargo(c)  Plane(p)  Airport(a) Effect: ¬ At(c, a)  In(c, p)) Action( Unload(c, p, a), Precond: In(c, p)  At( p, a)  Cargo(c)  Plane(p)  Airport(a) Effect: At(c, a)  ¬ In(c, p)) Action( Fly( p, from, to), Precond: At(p, from)  Plane(p)  Airport(from)  Airport(to) Effect: ¬ At(p, from)  At(p, to))

24. April 3, 2006AI: Chapter 11: Planning24 Example: Air Cargo Transport [ Load(C 1, P 1, CLE), Fly(P 1, CLE, LAS), Unload( C 1, P 1, LAS), Load(C 2, P 2, LAS), Fly(P 2, LAS, CLE), Unload( C 2, P 2, CLE)] Is it possible for a plane to fly to and from the same airport?

25. April 3, 2006AI: Chapter 11: Planning25 Example: The Spare Tire Problem Init( At( Flat, Axle)  At( Spare, Trunk)) Goal( At(Spare, Axle))

26. April 3, 2006AI: Chapter 11: Planning26 Example: The Spare Tire Problem Action( Remove( Spare, Trunk ), Precond: At( Spare, Trunk ) Effect: ¬ At( Spare, Trunk)  At( Spare, Ground)) Action( Remove( Flat, Axle ), Precond: At(Flat, Axle ) Effect: ¬ At(Flat, Axle)  At(Flat, Ground)) Action( PutOn( Spare, Axle ), Precond: At( Spare, Ground )  ¬ At (Flat, Axle ) Effect: ¬ At( Spare, Ground )  At( Spare, Axle )) Action( LeaveOvernight, Precond: Effect: ¬ At( Spare, Ground )  ¬ At(Spare, Axle)  ¬ At(Spare, Trunk)  ¬ At(Flat, Ground)  ¬ At(Flat, Axle)

27. April 3, 2006AI: Chapter 11: Planning27 Example: The Blocks World Init( On(A, Table)  On(B, Table)  On(C, Table)  Block(A)  Block(B)  Block(C)  Clear(A)  Clear(B)  Clear(C)) Goal( On(A, B)  On(B, C))

28. April 3, 2006AI: Chapter 11: Planning28 Example: The Blocks World Action( Move( b, x, y ), Precond: On(b,x)  Clear(b)  Clear(y)  Block(b)  (b ≠ x)  (b≠y)  (x ≠ y) Effect: On(b, y)  Clear(x)  ¬ On(b,x)  ¬ Clear(y)) Action( MoveToTable(b, x ), Precond: On(b, x)  Clear(b)  Block(b)  (b ≠ x) Effect: On(b, Table)  Clear(x)  ¬ On(b, x))

29. April 3, 2006AI: Chapter 11: Planning29 Example: The Blocks World A plan for building a three block tower [Move(B, Table, C), Move(A, Table, B)]

30. April 3, 2006AI: Chapter 11: Planning30

31. April 3, 2006AI: Chapter 11: Planning31 Partially Ordered Plans Partially Ordered Plan –A partially ordered collection of steps Start step has the initial state description and its effect Finish step has the goal description as its precondition Causal links from outcome of one step to precondition of another step Temporal ordering between pairs of steps

32. April 3, 2006AI: Chapter 11: Planning32 Partial Ordered Plans An open condition is a precondition of a step not yet causally linked A plan is complete iff every precondition is achieved A precondition is achieved iff it is the effect if an earlier step and no possibly intervening step undoes it

33. Partial Order Planning (POP) State-space search –Yields totally ordered plans (linear plans) POP –Works on subproblems independently, then combines subplans –Example Goal(RightShoeOn  LeftShoeOn) Init() Action(RightShoe, P RECOND : RightSockOn, E FFECT : RightShoeOn) Action(RightSock, E FFECT : RightSockOn) Action(LeftShoe, P RECOND : LeftSockOn, E FFECT : LeftShoeOn) Action(LeftSock, E FFECT : LeftSockOn) 33

34. POP Example & its linearization 34

35. April 3, 2006AI: Chapter 11: Planning35 Partially Ordered Plans Start Finish Right Sock Right Shoe Left Sock Left Shoe

36. Components of a Plan 1.A set of actions 2.A set of ordering constraints –A  B reads “A before B” but not necessarily immediately before B –Alert: caution to cycles A  B and B  A 3.A set of causal links (protection intervals) between actions –A B reads “A achieves p for B” and p must remain true from the time A is applied to the time B is applied –Example “RightSock RightShoe 4.A set of open preconditions –Planners work to reduce the set of open preconditions to the empty set w/o introducing contradictions 36 p RightSockOn

37. Consistent Plan (POP) Consistent plan is a plan that has –No cycle in the ordering constraints –No conflicts with the causal links Solution –Is a consistent plan with no open preconditions To solve a conflict between a causal link A B and an action C (that clobbers, threatens the causal link), we force C to occur outside the “protection interval” by adding – the constraint C  A (demoting C) or – the constraint B  C (promoting C) 37 p

38. Setting up the PoP Add dummy states –Start Has no preconditions Its effects are the literals of the initial state –Finish Its preconditions are the literals of the goal state Has no effects Initial Plan: –Actions: {Start, Finish} –Ordering constraints: {Start  Finish} –Causal links: {} –Open Preconditions: {LeftShoeOn,RightShoeOn} 38 Start Finish Start Finish LeftShoeOn, RightShoeOn Literal 1, Literal 2, … Literal a, Literal b, …

39. POP as a Search Problem The successor function arbitrarily picks one open precondition p on an action B For every possible consistent action A that achieves p –It generates a successor plan adding the causal link A B and the ordering constraint A  B –If A was not in the plan, it adds Start  A and A  Finish –It resolves all conflicts between the new causal link and all existing actions between A and all existing causal links –Then it adds the successor states for combination of resolved conflicts It repeats until no open precondition exists 39 p

40. April 3, 2006AI: Chapter 11: Planning40 Partially Ordered Plans

41. April 3, 2006AI: Chapter 11: Planning41 Partially Ordered Plans

42. April 3, 2006AI: Chapter 11: Planning42 Partially Ordered Plans

43. April 3, 2006AI: Chapter 11: Planning43 POP Algorithm

44. April 3, 2006AI: Chapter 11: Planning44 POP Algorithm

45. April 3, 2006AI: Chapter 11: Planning45 Clobbering A clobberer is a potentially intervening step that destroys the condition achieved by a causal link –Example Go(Home) clobbers At(Supermarket) Demotion –Put before Go(Supermarket) Promotion –Put after Buy(Milk)

46. April 3, 2006AI: Chapter 11: Planning46 Example: Blocks World

47. April 3, 2006AI: Chapter 11: Planning47 Example: Blocks World

48. April 3, 2006AI: Chapter 11: Planning48 Example: Blocks World

49. April 3, 2006AI: Chapter 11: Planning49 Example: Blocks World

50. April 3, 2006AI: Chapter 11: Planning50 Example: Blocks World

51. See problem description in Fig 11.7 page 391 Only one open precondition Only 1 applicable action Example of POP: Flat tire problem 51 Start Finish At(Spare,Trunk), At(Flat,Axle) At(Spare,Axle) PutOn(Spare,Axle) At(Spare,Ground),  At(Flat,Axle) Pick up At(Spare,Ground) Choose only applicable action Remove(Spare,Trunk)

52. 52 Pick up  At(Flat,Axle) There are 2 applicable actions: LeaveOvernight and Remove(Flat,Axle) Choose LeaveOvernight Add causal link between Remove(Spare,Trunk) and PutOn(Spare,Axle) LeaveOvernight has effect  At(Spare,Ground), which conflicts with the causal link We remove the conflict by forcing LeaveOvernight to occur before Remove(Spare,Trunk) Conflicts with effects of Remove(Spare,Trunk) The only way to resolve the conflict is to undo LeaveOvernightuse the action Remove(Flat,Axle)

53. 53 This time, we choose Remove(Flat,Axle) Pick up At(Spare,Trunk) and choose Start to achieve it Pick up At(Flat,Axle) and choose Start to achieve it. We now have a complete consistent partially ordered plan