1 / 33

Decision Making Under Uncertainty Lec #2: Planning with Knowledge

Decision Making Under Uncertainty Lec #2: Planning with Knowledge. UIUC CS 598: Section EA Professor: Eyal Amir Spring Semester 2005. Based on slides by José Luis Ambite, and…

cain
Download Presentation

Decision Making Under Uncertainty Lec #2: Planning with Knowledge

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. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. Decision Making Under UncertaintyLec #2: Planning with Knowledge UIUC CS 598: Section EA Professor: Eyal AmirSpring Semester 2005 Based on slides by José Luis Ambite, and… Paolo Traverso’s (http://sra.itc.it/people/traverso/) tutorial: http://prometeo.ing.unibs.it/sschool/slides/traverso/traverso-slides.ps.gz, Some slides from http://www-2.cs.cmu.edu/~mmv/planning/handouts/BDDplanning.pdfby Rune Jensen http://www.itu.dk/people/rmj

  2. State Space: Blocks World

  3. State-Transition Systems:Planning Domains A planning domain D is a 4-tuple <F, S, A, R>: • F is a finite set of Fluents • S  2F is a finite set of states • A is a finite set of actions • R  S x A x S is a transition relation Action a  A is executable in s  S if s’ R(s, a, s’)

  4. State-Transition Systems: (Deterministic) Planning Domain Example: • F = {loaded, locked} • S = {(loaded locked), (loaded locked), (loaded locked), (loaded locked)} • A = {lock, unlock, load, unload} • R = { [(loaded locked) unlock (loaded locked)], [(loaded locked) lock (loaded locked)], [(loaded locked) load (loaded locked)], [(loaded locked) unload (loaded locked)], [(loaded locked) lock (loaded locked)], [(loaded locked) unlock (loaded locked)] }

  5. G I State-Transition Systems:Planning Problem A planning problem P for a planning Domain D=<F S A R> is a 3-tuple <D, I, G>: • I  S is the set of initial states • G  S is the set of goal states

  6. State-Transition Systems: Plan • A plan  for a planning problem P=<I, G, D> in a planning domain D = <F, S, A, R> is a set of state-action pairs: • {(s, a) : s  S, a  A, a executable in s} • at least one (s, a) with s  I • Goal achieving plan (informally): • for each state-action pairs (s, a), either a leads from s to the goal, R(s, a)  G, or a leads from s to a state s’ such that (s’, a’)   and a’ leads from s’ to the goal R(s’, a’)  G, and so on.  = {(2, load), (3, lock)}

  7. Backward image (regress set of states) Remove Visited Planning Algorithm (Regression) I

  8. Backward image (regress set of states) Remove Visited Planning Algorithm (Regression) I G

  9. Planning via Symbolic Model Checking • Problem: Realistic planning domains often have large state spaces • Idea: exploit the work on symbolic model checking based on Ordered Binary Decision Diagrams (OBDD’s) • OBDD’s: • Canonical form for propositional formulas • Efficient! • Polynomial boolean operations: O(1  2) = O(|1| |2|) • Constant time equality

  10. The Model Checking Problem Determine whether a formula is true in a model • A domain of interest is described by a semantic model • A desired property of the domain is described by a logical formula • Check if the domain satisfy the desired property by checking whether the formula is true in the model Motivation: Formal verification of dynamic systems

  11. Variable ordering Is important OBDD example:

  12. Planning via Model CheckingSymbolic Representation • Action represented by assigning true to the corresponding variable • Transition t = <s a s’> encoded as (t) = (s) ^ (a) ^ (s’) • Transition relation T encoded as disjunction of all the transitions (T)= VtT (t)

  13. Planning Algorithm (regression) I G

  14. Planning Algorithm (regression) • OneStepPlan(S) in the regression algorithm is the backward image of the set of states S. • Can computed as the QBF formula: x’ (States(x’)  R(x, a, x’)) • Quantified Boolean Formula (QBF): x (x y) = (0 y)  (1 y) x (x y) = (0 y)  (1 y)

  15. Planning as model checking

  16. Planning as Model Checking

  17. Homework • Read readings for next time: on website

More Related