Heuristic Planning with Time and Resources

1 / 37

# Heuristic Planning with Time and Resources - PowerPoint PPT Presentation

Heuristic Planning with Time and Resources. --Sapa, TP4, and others. t s. t s. t s. t e. t e. t e. Quiz1: Expressiveness of Temporal Action. precondition. ZENO TGP TP4 Sapa. effect. Sapa and TP4. Forward chaining. Backward chaining. Sapa and TP4. Forward chaining.

I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.

## Heuristic Planning with Time and Resources

An Image/Link below is provided (as is) to download presentation

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.

- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript
1. Heuristic Planning with Time and Resources --Sapa, TP4, and others

2. ts ts ts te te te Quiz1: Expressiveness of Temporal Action precondition • ZENO • TGP • TP4 • Sapa effect

3. Sapa and TP4 Forward chaining Backward chaining

4. Sapa and TP4 Forward chaining Backward chaining

5. Sapa: search space S = ( P, M, II, Q, t) t: time stamp P: set of predicates that are true P= {(pi, ti)|ti<t}: set of predicates that are true at t and achieved at ti II: set of persistent conditions that need to be protected for a while Q: queue containing scheduled future events M: set of functions representing metric-resources

6. Theinitial state S0=(P,M,II,Q,t) P= {(pi, ti)|ti<t}: p is true at t and achieved at ti M: metric-resources II: persistent conditions Q: scheduled future events t: time stamp Sapa: Search Space --P= (pi, to), piÎIp --M given resource constraints --Q empty, II empty

7. Thestate S=(P,M,II,Q,t) entails the goal G if P= {(pi, ti)|ti<t}: p is true at t and achieved at ti M: metric-resources II: persistent conditions Q: scheduled future events t: time stamp Sapa: Search Space --(pi, ti)ÎG,  (pi, tj)ÎP, tj<=ti, no event in deletespi -- eÎQ adds piat tj, tj<=ti

8. Giving S=(P,M,II,Q,t), an action A is applicable in S if: P= {(pi, ti)|ti<t}: p is true at t and achieved at ti M: metric-resources II: persistent conditions Q: scheduled future events t: time stamp Sapa: Action Application -- All instant-pre(A) |= P,M -- eff(A) not interfere with II and Q -- no eÎQ interferes with persistent-pre(A)

9. Choose an action A applicable in S, if A != no-op S’ = ApplyInstantaneousUpdates ( S, A ) Q’ = AddDelayedEvents ( Q, S, A) Else S’ = S S’.t = eventTime( Front(Q) ) While eventTime(Front(Q)) == S’.t e = Dequeue(Q); S’ = ApplyEffect(S’, e ); Sapa: branching rule

10. TP4: search space S = ( E, F, t) t: time stamp E: set of predicates that are required to be true F= {(ai, di)}: action ai is planned to start at t- di

11. The initial state S0=? E={pi}: pi is required to be true at t F= {(ai, di)}: action ai is planned to start at t- di t: time stamp TP4: Search Space S0= (G, NULL) The final state S ? {S= (E, NULL)|EIp}

12. S=(E,{(aj,dj)},t) A set of actions SE is applicable in S if E={pi}: pi is required to be true at t F= {(ai, di)}: action ai is planned to start at t- di t: time stamp TP4: Action Application -- every action is compatible with each other; --pE, aSE, padd(a), a is compatible with bF

13. TP4: branching rule Choose a set of actions SE applicable in S, define: Fnew = { (a, dur(a)| aSE } dadv = min{d, a!=no-op} then E’ = {pre(a) | (a,d)ÎFÈFnew} F’ = { (a, d-dadv)| (a,d)ÎFÈFnew, d>dadv} S’ = (E’, F’)

14. Sapa and TP4 Forward chaining Backward chaining

15. qpre(a) !qdelayed-effect(b) Quiz 2: Concurrency

16. Quiz 2: Concurrency qpre(a) !qdelayed-effect(b)

17. qinstant-effect(a) !qdelayed-effect(b) Quiz 2: Concurrency

18. qinstant-effect(a) !qdelayed-effect(b) Quiz 2: Concurrency

19. Sapa and TP4 Forward chaining Backward chaining

20. Sapa and TP4 Forward chaining Backward chaining

21. Sapa: Extension? P= {(pi, ti)|ti<t}: p is true at t and achieved at ti M: metric-resources II: persistent conditions Q: scheduled future events t: time stamp All (pre(a), -t1) |= P, M an action A is applicable in S=(P,M,II,Q,t) if: -- All instant-pre(A) |= P,M -- eff(A) not interfere with II and Q -- no eÎQ interferes with persistent-pre(A) II = { (prea, t2 ) }

22. TP4: Extension? • E={pi}: pi is required to be true at t • F= {(ai, di)}: action ai is planned to start at t- di • t: time stamp A set of actions SE is applicable in S=(E, F, t) if: -- every action is compatible with each other; --pE, aSE, padd(a), a is compatible with bF E={ p| p is true during [t1, t2] }

23. Sapa and TP4 Forward chaining Backward chaining

24. Sapa and TP4 Forward chaining Backward chaining

25. Relaxed temporal planning graph(RTPG) -- no delete list -- no resource consumption Max-span? Min-slack? Max-slack? Sum-slack? Sum-action? Sum-duration? Sapa: Heuristic Function

26. Sapa: Heuristic Function Max-span? Min-slack? Max-slack?Sum-slack? Sum-action? Sum-duration?

27. TP4: Heuristic Functions

28. Sapa and TP4 Forward chaining Backward chaining

29. TP4: Incremental Branching • Estimating the cost of Partial States • Estimate lower bounds on dp • Ordering predicates in a state • -- decreasing order of “difficulty” • Right-shift equivalence • -- if an action was applicable but was not used, then it won’t be used

30. Sapa and TP4 Forward chaining Backward chaining

31. Resource Management • Producible • Consumable • Reusable • Shareable • Non-shareable • Limited-capacity

32. Sapa: resource management • Producable, consumable, non-shareable Sum-action Sum-duration • Shareable ?

33. TP4: resource management • Reusable & Non-shareable? • Reusable & Limited-capacity? • Consumable & non-producible?

34. Sapa and TP4

35. Quiz3: Continuous Change • ZENO? • Sapa? • TGP & TP4?

36. Experiments performance TGP TP4 Sapa ZENO expressiveness