Heuristic Planning with Time and Resources

Slides:



Advertisements
Similar presentations
Forward-Chaining Partial-Order Planning Amanda Coles, Andrew Coles, Maria Fox and Derek Long (to appear, ICAPS 2010)
Advertisements

Practical Planning: Scheduling and Hierarchical Task Networks Chapter CS 63 Adapted from slides by Tim Finin and Marie desJardins.
From Handbook of Temporal Reasoning in Artificial Intelligence By Jan Chomicki & David Toman Temporal Databases Presented by Leila Jalali CS224 presentation.
Big Ideas in Cmput366. Search Blind Search State space representation Iterative deepening Heuristic Search A*, f(n)=g(n)+h(n), admissible heuristics Local.
Planning Module THREE: Planning, Production Systems,Expert Systems, Uncertainty Dr M M Awais.
Planning Module THREE: Planning, Production Systems,Expert Systems, Uncertainty Dr M M Awais.
CLASSICAL PLANNING What is planning ?  Planning is an AI approach to control  It is deliberation about actions  Key ideas  We have a model of the.
CS4432: Database Systems II
Concurrency Control II
EDA (CS286.5b) Day 10 Scheduling (Intro Branch-and-Bound)
Reasoning About Code; Hoare Logic, continued
Situation Calculus for Action Descriptions We talked about STRIPS representations for actions. Another common representation is called the Situation Calculus.
Time Constraints in Planning Sudhan Kanitkar
Plan Generation & Causal-Link Planning 1 José Luis Ambite.
Methods of Proof Chapter 7, second half.. Proof methods Proof methods divide into (roughly) two kinds: Application of inference rules: Legitimate (sound)
Planning and Scheduling. 2 USC INFORMATION SCIENCES INSTITUTE Some background Many planning problems have a time-dependent component –  actions happen.
Specification and Enforcement of Authorization Constraints in Workflow Management Systems.
3/25: Leaving STRIPS Planning and going to Sapa. Administrivia 3/25  Homework 4 due next class  Midterm soon after that  Will be take home  Will have.
Classical Planning via State-space search COMP3431 Malcolm Ryan.
4/1: Search Methods and Heuristics  Progression: Sapa (TLPlan; FF)  Regression: TP4  Partial order: Zeno (IxTET)
Extending Graphplan to handle Resources Presenter: Pham Van Cuong Department of Computer Science New Mexico State University.
Planning Graph-based Heuristics for Cost-sensitive Temporal Planning Minh B. Do & Subbarao Kambhampati CSE Department, Arizona State University
Planning Copyright, 1996 © Dale Carnegie & Associates, Inc. Chapter 11.
CS121 Heuristic Search Planning CSPs Adversarial Search Probabilistic Reasoning Probabilistic Belief Learning.
Classical Planning via State-space search COMP3431 Malcolm Ryan.
SAPA: A Domain-independent Heuristic Temporal Planner Minh B. Do & Subbarao Kambhampati Arizona State University.
Homework 1 ( Written Portion )  Max : 75  Min : 38  Avg : 57.6  Median : 58 (77%)
CS 415 – A.I. Slide Set 6. Chapter 4 – Heuristic Search Heuristic – the study of the methods and rules of discovery and invention State Space Heuristics.
Cost-Optimal Planning with Constraints and Preferences in Large State Spaces Stefan Edelkamp, Shahid Jabbar, Mohammed Nazih University of Dortmund.
Dana Nau: Lecture slides for Automated Planning Licensed under the Creative Commons Attribution-NonCommercial-ShareAlike License:
Automated Planning and Decision Making Prof. Ronen Brafman Automated Planning and Decision Making Partial Order Planning Based on slides by: Carmel.
1 Chapter 16 Planning Methods. 2 Chapter 16 Contents (1) l STRIPS l STRIPS Implementation l Partial Order Planning l The Principle of Least Commitment.
Automated Planning Dr. Héctor Muñoz-Avila. What is Planning? Classical Definition Domain Independent: symbolic descriptions of the problems and the domain.
AI Lecture 17 Planning Noémie Elhadad (substituting for Prof. McKeown)
Introduction to Artificial Intelligence Class 1 Planning & Search Henry Kautz Winter 2007.
© Daniel S. Weld 1 Logistics Travel Wed class led by Mausam Week’s reading R&N ch17 Project meetings.
1 CMSC 471 Fall 2004 Class #21 – Thursday, November 11.
1 Propositional Logic Limits The expressive power of propositional logic is limited. The assumption is that everything can be expressed by simple facts.
Temporal Planning with Continuous Change J.Scott Penbrethy Daniel S. Weld Presented by - Parag.
Heuristic Search Planners. 2 USC INFORMATION SCIENCES INSTITUTE Planning as heuristic search Use standard search techniques, e.g. A*, best-first, hill-climbing.
Integer Programming An integer linear program (ILP) is defined exactly as a linear program except that values of variables in a feasible solution have.
CS 245: Database System Principles Notes 10: More TP
Classical Planning via State-space search
EA C461 – Artificial Intelligence Logical Agent
Basic Project Scheduling
Lecture 11: Tree Search © J. Christopher Beck 2008.
Introduction Contents Sungwook Yoon, Postdoctoral Research Associate
Uniformed Search (cont.) Computer Science cpsc322, Lecture 6
Class #17 – Thursday, October 27
CAP 5636 – Advanced Artificial Intelligence
Planning José Luis Ambite.
Graphplan/ SATPlan Chapter
Branch and Bound.
Instructor: Mohamed Eltabakh
Planning Problems On(C, A)‏ On(A, Table)‏ On(B, Table)‏ Clear(C)‏
Logic: Top-down proof procedure and Datalog
Class #19 – Monday, November 3
Class #20 – Wednesday, November 5
Integrated Systems Centre © Giovanni De Micheli – All rights reserved
CSE (c) S. Tanimoto, 2001 Search-Introduction
Graphplan/ SATPlan Chapter
Graphplan/ SATPlan Chapter
GraphPlan Jim Blythe.
Search.
Search.
CIS 720 Lecture 3.
An Introduction to Planning Graph
CIS 720 Lecture 3.
[* based in part on slides by Jim Blythe and Dan Weld]
CS137: Electronic Design Automation
Presentation transcript:

Heuristic Planning with Time and Resources --Sapa, TP4, and others

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

Sapa and TP4 Sapa TP4 Search Direction Search Space Forward chaining Branching Rule Extension Concurrency Path Cost Heuristic Integrating resource Forward chaining Backward chaining

Sapa and TP4 Sapa TP4 Search Direction Search Space Forward chaining Branching Rule Extension Concurrency Path Cost Heuristic Integrating resource Forward chaining Backward chaining

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

Sapa: Search Space The initial 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 The initial state S0=(P,M,II,Q,t) --P= (pi, to), piÎIp --M given resource constraints --Q empty, II empty

Sapa: Search Space The state S=(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 The state S=(P,M,II,Q,t) entails the goal G if --(pi, ti)ÎG,  (pi, tj)ÎP, tj<=ti, no event in deletes pi -- eÎQ adds pi at tj, tj<=ti

Sapa: Action Application 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 -- All instant-pre(A) |= P,M -- eff(A) not interfere with II and Q -- no eÎQ interferes with persistent-pre(A)

Sapa: branching rule 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 );

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

TP4: Search Space The initial state S0=? S0= (G, NULL) 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 The initial state S0=? S0= (G, NULL) The final state S ? {S= (E, NULL)|EIp}

TP4: Action Application 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 S=(E,{(aj,dj)},t) A set of actions SE is applicable in S if -- every action is compatible with each other; --pE, aSE, padd(a), a is compatible with bF

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’)

Sapa and TP4 Sapa TP4 Search Direction Search Space State world & state of search so far Branching Rule Sound & complete Sound & incomplete Extension Concurrency Path Cost Heuristic Integrating resource Forward chaining Backward chaining

Quiz 2: Concurrency qpre(a) !qdelayed-effect(b) What about ZENO? TGP?

Quiz 2: Concurrency qpre(a) !qdelayed-effect(b) What about ZENO? TGP?

Quiz 2: Concurrency qinstant-effect(a) !qdelayed-effect(b) What about ZENO? TGP?

Quiz 2: Concurrency qinstant-effect(a) !qdelayed-effect(b) What about ZENO? TGP?

Sapa and TP4 Sapa TP4 Easy? Limited? Search Direction Search Space State world & state of search so far Branching Rule Sound & complete Sound & incomplete Concurrency (temporal) Proposition lock (“holding”) Proposition lock Extension Easy? Limited? Path Cost Heuristic Integrating resource Forward chaining Backward chaining

Sapa and TP4 Sapa TP4 Search Direction Search Space State world & state of search so far Branching Rule Sound & complete Sound & incomplete Concurrency (temporal) Proposition lock (“holding”) Proposition lock Extension Heuristic Path Cost Integrating resource Forward chaining Backward chaining

Sapa: Extension? All (pre(a), -t1) |= P, M II = { (prea, t2 ) } 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 Effect? Delayed event Q Exogenous events? Delayed event Q 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 ) }

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 Effect? ? (which action should choose w/ affect exist partial plan) Exogenous events? (time stamp is relative to the goals) 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] }

Sapa and TP4 Sapa TP4 Easy? Limited? Search Direction Search Space State world & state of search so far Branching Rule Sound & complete Sound & incomplete Concurrency (temporal) Proposition lock (“holding”) Proposition lock Extension Easy? Limited? Path Cost Heuristic Integrating resource Forward chaining Backward chaining

Sapa and TP4 Sapa TP4 Easy? Limited? Search Direction Search Space State world & state of search so far Branching Rule Sound & complete Sound & incomplete Extension Easy? Limited? Concurrency (temporal) Proposition lock (“holding”) Proposition lock Heuristic Path Cost Integrating resource Forward chaining Backward chaining

Sapa: Heuristic Function 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 Max-span? t8 Min-slack? tg-t8 Max-slack? tg-t8 Sum-slack? 2*tg-t8 Sum-action? 5 Max-span? Min-slack? Max-slack? Sum-slack? Sum-action? Sum-duration?

TP4: Heuristic Functions

Sapa and TP4 Sapa TP4 Easy? Limited? Search Direction Search Space State world & state of search so far Branching Rule Sound & complete Sound & incomplete Extension Easy? Limited? Concurrency (temporal) Proposition lock (“holding”) Proposition lock Heuristic RTGP DP Path Cost depends c(S, S’)=dadv Integrating resource Forward chaining Backward chaining

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

Sapa and TP4 Sapa TP4 Easy? Limited? Search Direction Search Space State world & state of search so far Branching Rule Sound & complete Sound & incomplete Extension Easy? Limited? Concurrency (temporal) Proposition lock (“holding”) Proposition lock Heuristic RTGP DP Path Cost depends c(S, S’)=dadv Integrating resource Forward chaining Backward chaining

Resource Management Producible Consumable Reusable Shareable Non-shareable Limited-capacity Check spelling of “producable”

Sapa: resource management Producable, consumable, non-shareable Sum-action Sum-duration Shareable? Not allowed Continuous change? Linear Shareable ?

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

Sapa and TP4 Sapa TP4 Search Direction Forward chaining Backward chaining Search Space S=(P,M,II,Q,t) S=(E,{(aj,dj)},t) Branching Rule Sound complete Sound, incomplete Extension Easy? Limited? Concurrency Proposition lock Non-shareable resources Proposition lock (“holding”) Path Cost depends c(S, S’)=dadv Heuristic RTGP DP Integrating resource Easy if inadmissible hard

Quiz3: Continuous Change ZENO? Sapa? TGP & TP4?

Experiments performance TGP TP4 Sapa ZENO expressiveness

Comments?