Current Slide

Small screen detected. You are viewing the mobile version of SlideWiki. If you wish to edit slides you will need to use a larger device.


  • Definition Progression
      Let (P,A,I,G) be a task. Progression is the quadruple (S, s0, succ, Sol):
    • S = 2P is the set of all subsets of P,
    • s0 = I,
    • succ : S → 2S is defined by succ(s) = {s0 ∈ S | ∃a ∈ A: pre(a) ⊆ s, s0 = result(s, ‹a›)}
    • Sol = {s ∈ S | G ⊆ s}
  • Progression algorithm:
  1. Start from initial state
  2. Find all actions whose preconditions are true in the initial state (applicable actions)
  3. Compute effects of actions to generate successor states
  4. Repeat steps 2-3, until a new state satisfies the goal
      Progression explores only states that are reachable from I ; they may not be relevant for G

Speaker notes:

Content Tools


There are currently no sources for this slide.