CS 730/730W/830: Intro AI Beyond STRIPS Hierarchy Wheeler Ruml - - PowerPoint PPT Presentation

▶
cs 730 730w 830 intro ai
SMART_READER_LITE
LIVE PREVIEW

CS 730/730W/830: Intro AI Beyond STRIPS Hierarchy Wheeler Ruml - - PowerPoint PPT Presentation

CS 730/730W/830: Intro AI Beyond STRIPS Hierarchy Wheeler Ruml (UNH) Lecture 18, CS 730 1 / 15 Beyond STRIPS Comparison Extensions Setting Break Hierarchy Beyond STRIPS Wheeler Ruml (UNH) Lecture 18, CS 730 2 / 15


slide-1
SLIDE 1

CS 730/730W/830: Intro AI

Beyond STRIPS Hierarchy

Wheeler Ruml (UNH) Lecture 18, CS 730 – 1 / 15

slide-2
SLIDE 2

Beyond STRIPS

Beyond STRIPS ■ Comparison ■ Extensions ■ Setting ■ Break Hierarchy

Wheeler Ruml (UNH) Lecture 18, CS 730 – 2 / 15

slide-3
SLIDE 3

Comparison

Beyond STRIPS ■ Comparison ■ Extensions ■ Setting ■ Break Hierarchy

Wheeler Ruml (UNH) Lecture 18, CS 730 – 3 / 15

Forward: states

■

+ state known: strong heuristic, expressivity

■

− irrelevant states Backward: sets of states

■

+ relevant states

■

− partial states: larger space, weaker heuristic, expressivity Partial-order: plans

■

+ small space

■

+/− least commitment

■

− poor heuristics

slide-4
SLIDE 4

STRIPS Extensions

Beyond STRIPS ■ Comparison ■ Extensions ■ Setting ■ Break Hierarchy

Wheeler Ruml (UNH) Lecture 18, CS 730 – 4 / 15

negated goals: no problem with CWA disjunctive precondition: for regression, just branch conditional effects: for regression, if we need the effect, plan for the condition universal preconditions and effects: just ground goals and preconditions

slide-5
SLIDE 5

Setting

Beyond STRIPS ■ Comparison ■ Extensions ■ Setting ■ Break Hierarchy

Wheeler Ruml (UNH) Lecture 18, CS 730 – 5 / 15

STRIPS assumes static, deterministic world, discrete time, single discrete actions. 1. time, resources 2. concurrent actions 3. abstraction: hierarchical planning 4. uncertainty: eg, disjunctive effects 5. temporally extended goals 6. execution monitoring, replanning 7. continuous state 8. multiple (self-interested) agents

slide-6
SLIDE 6

Break

Beyond STRIPS ■ Comparison ■ Extensions ■ Setting ■ Break Hierarchy

Wheeler Ruml (UNH) Lecture 18, CS 730 – 6 / 15

■

asst 8

■

asst 9 Tue Apr 7

■

wildcard vote Thu Apr 2

slide-7
SLIDE 7

Hierarchy

Beyond STRIPS Hierarchy ■ Hierarchy ■ HTNs ■ HTN Example ■ HGNs ■ HGN Example ■ DAO ■ Class Outline ■ EOLQs

Wheeler Ruml (UNH) Lecture 18, CS 730 – 7 / 15

slide-8
SLIDE 8

The Many Forms of Hierarchy

Beyond STRIPS Hierarchy ■ Hierarchy ■ HTNs ■ HTN Example ■ HGNs ■ HGN Example ■ DAO ■ Class Outline ■ EOLQs

Wheeler Ruml (UNH) Lecture 18, CS 730 – 8 / 15

■

task decomposition/refinement

■

actions = goals for lower level

■

actions = restrictions for lower level

■

actions = hueristic for lower level

slide-9
SLIDE 9

Hierarchical Task Networks

Beyond STRIPS Hierarchy ■ Hierarchy ■ HTNs ■ HTN Example ■ HGNs ■ HGN Example ■ DAO ■ Class Outline ■ EOLQs

Wheeler Ruml (UNH) Lecture 18, CS 730 – 9 / 15

■

states, tasks, methods, actions

■

actions: preconditions, effects

■

methods: preconditions, subtasks

■

‘goal’: complete decomposition into primitive actions downward refinement: high-level guaranteed to refine into legal primitives planning is semi-decidable, plan verification is NP-hard SHOP2 planner

slide-10
SLIDE 10

HTN Example: Logistics

Beyond STRIPS Hierarchy ■ Hierarchy ■ HTNs ■ HTN Example ■ HGNs ■ HGN Example ■ DAO ■ Class Outline ■ EOLQs

Wheeler Ruml (UNH) Lecture 18, CS 730 – 10 / 15

actions: Drive, Load, Unload method: MovePackageByTruck(p,s,d, t) pre: At(p,s) post: At(p,d) subtasks: Drive(t, s), Load(p,t,s), Drive(t,d), Unload(p,t,d)

slide-11
SLIDE 11

Hierarchical Goal Networks (IJCAI, 2013)

Beyond STRIPS Hierarchy ■ Hierarchy ■ HTNs ■ HTN Example ■ HGNs ■ HGN Example ■ DAO ■ Class Outline ■ EOLQs

Wheeler Ruml (UNH) Lecture 18, CS 730 – 11 / 15

■

  • perators as in STRIPS

■

goal network: partially-ordered set of DNF formulas over literals

■

method: preconditions and subgoals. postconditions are last subgoal.

■

subgoal: conjunction of literals planner branches on:

■

progressing state using applicable actions

■

‘decomposing’ problem using applicable methods applicable in state and relevant to goal methods are only for search guidance!

slide-12
SLIDE 12

HGN Example: Logistics

Beyond STRIPS Hierarchy ■ Hierarchy ■ HTNs ■ HTN Example ■ HGNs ■ HGN Example ■ DAO ■ Class Outline ■ EOLQs

Wheeler Ruml (UNH) Lecture 18, CS 730 – 12 / 15

actions: Drive, Load, Unload method: MovePackageByTruck(p,s,d, t) pre: At(p,s) subgoals: At(t, s), In(p,t), At(t,d), At(p,d)

slide-13
SLIDE 13

Example: Dragon Age: Origins

Beyond STRIPS Hierarchy ■ Hierarchy ■ HTNs ■ HTN Example ■ HGNs ■ HGN Example ■ DAO ■ Class Outline ■ EOLQs

Wheeler Ruml (UNH) Lecture 18, CS 730 – 13 / 15

slide-14
SLIDE 14

Class Outline

Beyond STRIPS Hierarchy ■ Hierarchy ■ HTNs ■ HTN Example ■ HGNs ■ HGN Example ■ DAO ■ Class Outline ■ EOLQs

Wheeler Ruml (UNH) Lecture 18, CS 730 – 14 / 15

1. search: heuristics, CSPs, games 2. knowledge representation: FOL, resolution 3. planning: STRIPS, MDPs 4. learning: supervised, unsupervised 5. uncertainty: particle filters, HMMs

slide-15
SLIDE 15

EOLQs

Beyond STRIPS Hierarchy ■ Hierarchy ■ HTNs ■ HTN Example ■ HGNs ■ HGN Example ■ DAO ■ Class Outline ■ EOLQs

Wheeler Ruml (UNH) Lecture 18, CS 730 – 15 / 15

■

What question didn’t you get to ask today?

■

What’s still confusing?

■

What would you like to hear more about? Please write down your most pressing question about AI and put it in the box on your way out. Thanks!