From Qualitative to Quantitative Dominance Pruning for Optimal - - PowerPoint PPT Presentation

from qualitative to quantitative dominance pruning for
SMART_READER_LITE
LIVE PREVIEW

From Qualitative to Quantitative Dominance Pruning for Optimal - - PowerPoint PPT Presentation

Qualitative Quantitative Finding Dominance Action Selection Pruning Experiments Conclusions From Qualitative to Quantitative Dominance Pruning for Optimal Planning Alvaro Torralba Saarland University HSDIP Workshop June 20, 2017


slide-1
SLIDE 1

Qualitative Quantitative Finding Dominance Action Selection Pruning Experiments Conclusions

From Qualitative to Quantitative Dominance Pruning for Optimal Planning

´ Alvaro Torralba Saarland University HSDIP Workshop June 20, 2017

´ Alvaro Torralba From Qualitative to Quantitative Dominance Pruning for Optimal Planning 1/19

slide-2
SLIDE 2

Qualitative Quantitative Finding Dominance Action Selection Pruning Experiments Conclusions

Outline

1

Qualitative Dominance

2

From Qualitative to Quantitative Dominance

3

Finding Dominance

4

Action Selection Pruning

5

Experiments

6

Conclusions

´ Alvaro Torralba From Qualitative to Quantitative Dominance Pruning for Optimal Planning 2/19

slide-3
SLIDE 3

Qualitative Quantitative Finding Dominance Action Selection Pruning Experiments Conclusions

Dominance

s t A B A B Compare states: Which one is better?

´ Alvaro Torralba From Qualitative to Quantitative Dominance Pruning for Optimal Planning 3/19

slide-4
SLIDE 4

Qualitative Quantitative Finding Dominance Action Selection Pruning Experiments Conclusions

Dominance

s t A B A B t dominates s: s t Compare states: Which one is better? : A T B

´ Alvaro Torralba From Qualitative to Quantitative Dominance Pruning for Optimal Planning 3/19

slide-5
SLIDE 5

Qualitative Quantitative Finding Dominance Action Selection Pruning Experiments Conclusions

Dominance

s t A B A B t dominates s: s t Compare states: Which one is better? : A T B s t

´ Alvaro Torralba From Qualitative to Quantitative Dominance Pruning for Optimal Planning 3/19

slide-6
SLIDE 6

Qualitative Quantitative Finding Dominance Action Selection Pruning Experiments Conclusions

Dominance

s t A B A B t dominates s: s t Compare states: Which one is better? : A T B s t t does not dominate s: s t

´ Alvaro Torralba From Qualitative to Quantitative Dominance Pruning for Optimal Planning 3/19

slide-7
SLIDE 7

Qualitative Quantitative Finding Dominance Action Selection Pruning Experiments Conclusions

Qualitative Dominance

Does t dominate s? →Yes/No answer

´ Alvaro Torralba From Qualitative to Quantitative Dominance Pruning for Optimal Planning 4/19

slide-8
SLIDE 8

Qualitative Quantitative Finding Dominance Action Selection Pruning Experiments Conclusions

Qualitative Dominance

Does t dominate s? →Yes/No answer Dominance Relation If s t, then h∗(s) ≥ h∗(t): t is at least as good as s

´ Alvaro Torralba From Qualitative to Quantitative Dominance Pruning for Optimal Planning 4/19

slide-9
SLIDE 9

Qualitative Quantitative Finding Dominance Action Selection Pruning Experiments Conclusions

Qualitative Dominance

Does t dominate s? →Yes/No answer Dominance Relation If s t, then h∗(s) ≥ h∗(t): t is at least as good as s Prune ns if there exists nt s.t. g(nt) ≤ g(ns) and s t Open or closed list

I

s1 s2 s3 s4 s1 s3 s5 s5 I s6 s7

´ Alvaro Torralba From Qualitative to Quantitative Dominance Pruning for Optimal Planning 4/19

slide-10
SLIDE 10

Qualitative Quantitative Finding Dominance Action Selection Pruning Experiments Conclusions

Qualitative Dominance

Does t dominate s? →Yes/No answer Dominance Relation If s t, then h∗(s) ≥ h∗(t): t is at least as good as s Prune ns if there exists nt s.t. g(nt) ≤ g(ns) and s t Open or closed list Closed list Parent →Never unload a package in any location other than its destination!

I

s1 s2 s3 s4 s1 s3 s5 s5 I s6 s7

´ Alvaro Torralba From Qualitative to Quantitative Dominance Pruning for Optimal Planning 4/19

slide-11
SLIDE 11

Qualitative Quantitative Finding Dominance Action Selection Pruning Experiments Conclusions

Outline

1

Qualitative Dominance

2

From Qualitative to Quantitative Dominance

3

Finding Dominance

4

Action Selection Pruning

5

Experiments

6

Conclusions

´ Alvaro Torralba From Qualitative to Quantitative Dominance Pruning for Optimal Planning 5/19

slide-12
SLIDE 12

Qualitative Quantitative Finding Dominance Action Selection Pruning Experiments Conclusions

Quantitative Dominance

By how much t dominates s? →function D : S × S → R ∪ {−∞}

´ Alvaro Torralba From Qualitative to Quantitative Dominance Pruning for Optimal Planning 6/19

slide-13
SLIDE 13

Qualitative Quantitative Finding Dominance Action Selection Pruning Experiments Conclusions

Quantitative Dominance

By how much t dominates s? →function D : S × S → R ∪ {−∞} Dominance Function: D(s, t) ≤ h∗(s) − h∗(t)

´ Alvaro Torralba From Qualitative to Quantitative Dominance Pruning for Optimal Planning 6/19

slide-14
SLIDE 14

Qualitative Quantitative Finding Dominance Action Selection Pruning Experiments Conclusions

Quantitative Dominance

By how much t dominates s? →function D : S × S → R ∪ {−∞} Dominance Function: D(s, t) ≤ h∗(s) − h∗(t) D(s, t) =            C t is strictly closer to the goal than s (by at least C) t is at least as close as s −C t is at most C units of cost farther than s −∞ we know nothing

´ Alvaro Torralba From Qualitative to Quantitative Dominance Pruning for Optimal Planning 6/19

slide-15
SLIDE 15

Qualitative Quantitative Finding Dominance Action Selection Pruning Experiments Conclusions

Quantitative Dominance

By how much t dominates s? →function D : S × S → R ∪ {−∞} Dominance Function: D(s, t) ≤ h∗(s) − h∗(t) D(s, t) =            C t is strictly closer to the goal than s (by at least C) t is at least as close as s −C t is at most C units of cost farther than s −∞ we know nothing → Qualitative dominance is a special case if we use only 0 or −∞

´ Alvaro Torralba From Qualitative to Quantitative Dominance Pruning for Optimal Planning 6/19

slide-16
SLIDE 16

Qualitative Quantitative Finding Dominance Action Selection Pruning Experiments Conclusions

Leveraging Quantitative Dominance

Prune ns if there exists nt s.t. Qualitative g(nt) ≤ g(ns) and s t Quantitative

I

s1 s2 s3 s4 s1 s3 s5 s5 I s6 s7

´ Alvaro Torralba From Qualitative to Quantitative Dominance Pruning for Optimal Planning 7/19

slide-17
SLIDE 17

Qualitative Quantitative Finding Dominance Action Selection Pruning Experiments Conclusions

Leveraging Quantitative Dominance

Prune ns if there exists nt s.t. Qualitative g(nt) ≤ g(ns) and s t Quantitative D(s, t) + g(ns) − g(nt) ≥ 0 if D(s, t) ≥ 0

I

s1 s2 s3 s4 D(s4, s6) = 1 s1 s3 s5 s5 I s6 s7

´ Alvaro Torralba From Qualitative to Quantitative Dominance Pruning for Optimal Planning 7/19

slide-18
SLIDE 18

Qualitative Quantitative Finding Dominance Action Selection Pruning Experiments Conclusions

Leveraging Quantitative Dominance

Prune ns if there exists nt s.t. Qualitative g(nt) ≤ g(ns) and s t Quantitative D(s, t) + g(ns) − g(nt) ≥ 0 if D(s, t) ≥ 0 D(s, t) + g(ns) − g(nt) > 0 if D(s, t) < 0

I

s1 s2 s3 s4 D(s4, s6) = 1 s1 s3 s5 s5 I s6 s7 D(s7, I) = −1

´ Alvaro Torralba From Qualitative to Quantitative Dominance Pruning for Optimal Planning 7/19

slide-19
SLIDE 19

Qualitative Quantitative Finding Dominance Action Selection Pruning Experiments Conclusions

Outline

1

Qualitative Dominance

2

From Qualitative to Quantitative Dominance

3

Finding Dominance

4

Action Selection Pruning

5

Experiments

6

Conclusions

´ Alvaro Torralba From Qualitative to Quantitative Dominance Pruning for Optimal Planning 8/19

slide-20
SLIDE 20

Qualitative Quantitative Finding Dominance Action Selection Pruning Experiments Conclusions

Compositional Approach

Consider a partition of the problem: Θ1, . . . , Θk {1, . . . , k} is a label-dominance simulation if, whenever s i t: Goal-respecting: s ∈ SG

i implies that t ∈ SG i

For all s

l

− → s′ in Θi, there exists t l′ − → t′ in Θi s.t.:

1

s′ i t′,

2

c(l′) ≤ c(l), and

3

l′ dominates l elsewhere

´ Alvaro Torralba From Qualitative to Quantitative Dominance Pruning for Optimal Planning 9/19

slide-21
SLIDE 21

Qualitative Quantitative Finding Dominance Action Selection Pruning Experiments Conclusions

Compositional Approach

Consider a partition of the problem: Θ1, . . . , Θk {1, . . . , k} is a label-dominance simulation if, whenever s i t: Goal-respecting: s ∈ SG

i implies that t ∈ SG i

For all s

l

− → s′ in Θi, there exists t l′ − → t′ in Θi s.t.:

1

s′ i t′,

2

c(l′) ≤ c(l), and

3

l′ dominates l elsewhere

: A T B : Identity

´ Alvaro Torralba From Qualitative to Quantitative Dominance Pruning for Optimal Planning 9/19

slide-22
SLIDE 22

Qualitative Quantitative Finding Dominance Action Selection Pruning Experiments Conclusions

Compositional Approach

Consider a partition of the problem: Θ1, . . . , Θk {1, . . . , k} is a label-dominance simulation if, whenever s i t: Goal-respecting: s ∈ SG

i implies that t ∈ SG i

For all s

l

− → s′ in Θi, there exists t l′ − → t′ in Θi s.t.:

1

s′ i t′,

2

c(l′) ≤ c(l), and

3

l′ dominates l elsewhere

: A T B : Identity → s t iff ∀i ∈ [1, k] si i ti

´ Alvaro Torralba From Qualitative to Quantitative Dominance Pruning for Optimal Planning 9/19

slide-23
SLIDE 23

Qualitative Quantitative Finding Dominance Action Selection Pruning Experiments Conclusions

Quantifying Label-Dominance Simulation

For all s

l

− → s′ in Θi, there exists t l′ − → t′ in Θi s.t.:

1

s′ i t′,

2

c(l′) ≤ c(l), and

3

l′ dominates l elsewhere

´ Alvaro Torralba From Qualitative to Quantitative Dominance Pruning for Optimal Planning 10/19

slide-24
SLIDE 24

Qualitative Quantitative Finding Dominance Action Selection Pruning Experiments Conclusions

Quantifying Label-Dominance Simulation

For all s

l

− → s′ in Θi, there exists t l′ − → t′ in Θi s.t.:

1

s′ i t′,

2

c(l′) ≤ c(l), and

3

l′ dominates l elsewhere {D1, . . . , Dk} is a quantitative LD simulation for {Θ1, . . . , Θk} if: Di(s, t) ≤ min

s

l

− →s′ max

t

l′

− →t′ Di(s′, t′) + c(l) − c(l′) +

  • j=i

DL

j (l, l′)

D(s, t) =

  • i∈[1,k]

Di(si, ti)

´ Alvaro Torralba From Qualitative to Quantitative Dominance Pruning for Optimal Planning 10/19

slide-25
SLIDE 25

Qualitative Quantitative Finding Dominance Action Selection Pruning Experiments Conclusions

Discovering negative dominance

s t A B A B We can always drive between s and t: D(t, s) = D(s, t) = −1

´ Alvaro Torralba From Qualitative to Quantitative Dominance Pruning for Optimal Planning 11/19

slide-26
SLIDE 26

Qualitative Quantitative Finding Dominance Action Selection Pruning Experiments Conclusions

Discovering negative dominance

s t A B A B We can always drive between s and t: D(t, s) = D(s, t) = −1 τ-label: no preconditions or negative side effects elsewhere s

l

− → s′ can be simulated by a path t τ − →∗u l′ − → u′ τ − →∗t′ : DP(A, T) = DP(T, B) = +1 : DT(A, B) = DT(B, A) = −1

´ Alvaro Torralba From Qualitative to Quantitative Dominance Pruning for Optimal Planning 11/19

slide-27
SLIDE 27

Qualitative Quantitative Finding Dominance Action Selection Pruning Experiments Conclusions

Outline

1

Qualitative Dominance

2

From Qualitative to Quantitative Dominance

3

Finding Dominance

4

Action Selection Pruning

5

Experiments

6

Conclusions

´ Alvaro Torralba From Qualitative to Quantitative Dominance Pruning for Optimal Planning 12/19

slide-28
SLIDE 28

Qualitative Quantitative Finding Dominance Action Selection Pruning Experiments Conclusions

Action Selection Pruning

If s a − → s′ and D(s, s′) ≥ c(a) then a starts an optimal plan from s.

´ Alvaro Torralba From Qualitative to Quantitative Dominance Pruning for Optimal Planning 13/19

slide-29
SLIDE 29

Qualitative Quantitative Finding Dominance Action Selection Pruning Experiments Conclusions

Action Selection Pruning

If s a − → s′ and D(s, s′) ≥ c(a) then a starts an optimal plan from s. A B A B A B A B

load(p1) load(p2) drive ´ Alvaro Torralba From Qualitative to Quantitative Dominance Pruning for Optimal Planning 13/19

slide-30
SLIDE 30

Qualitative Quantitative Finding Dominance Action Selection Pruning Experiments Conclusions

Action Selection Pruning

If s a − → s′ and D(s, s′) ≥ c(a) then a starts an optimal plan from s. A B A B A B A B

load(p1) load(p2) drive

Prune every other successor Reduce branching factor to 1!

´ Alvaro Torralba From Qualitative to Quantitative Dominance Pruning for Optimal Planning 13/19

slide-31
SLIDE 31

Qualitative Quantitative Finding Dominance Action Selection Pruning Experiments Conclusions

Action Selection Pruning

If s a − → s′ and D(s, s′) ≥ c(a) then a starts an optimal plan from s. A B A B A B A B

load(p1) load(p2) drive

Prune every other successor Reduce branching factor to 1! In our example. If possible:

load a package unload a package in its destination

→Branch only over drive actions!

´ Alvaro Torralba From Qualitative to Quantitative Dominance Pruning for Optimal Planning 13/19

slide-32
SLIDE 32

Qualitative Quantitative Finding Dominance Action Selection Pruning Experiments Conclusions

Outline

1

Qualitative Dominance

2

From Qualitative to Quantitative Dominance

3

Finding Dominance

4

Action Selection Pruning

5

Experiments

6

Conclusions

´ Alvaro Torralba From Qualitative to Quantitative Dominance Pruning for Optimal Planning 14/19

slide-33
SLIDE 33

Qualitative Quantitative Finding Dominance Action Selection Pruning Experiments Conclusions

Dramatic Pruning Power in Blind Search!

Driverlog

13

Logistics

17

Miconic

24

Nomystery

693

Parcprinter

815

Rovers

30

Satellite

91

Woodworking

1627

  • D

D + AS AS + p Pruning Ratio

  • wrt. baseline

´ Alvaro Torralba From Qualitative to Quantitative Dominance Pruning for Optimal Planning 15/19

slide-34
SLIDE 34

Qualitative Quantitative Finding Dominance Action Selection Pruning Experiments Conclusions

Dramatic Pruning Power in Blind Search!

Driverlog

13 21

Logistics

17 149

Miconic

24 325

Nomystery

693 891

Parcprinter

815 955

Rovers

30 396

Satellite

91 143

Woodworking

1627 2820

  • D

D + AS AS + p Pruning Ratio

  • wrt. baseline

´ Alvaro Torralba From Qualitative to Quantitative Dominance Pruning for Optimal Planning 15/19

slide-35
SLIDE 35

Qualitative Quantitative Finding Dominance Action Selection Pruning Experiments Conclusions

Dramatic Pruning Power in Blind Search!

Driverlog

13 21 27

Logistics

17 149 166

Miconic

24 325 376

Nomystery

693 891 10538

Parcprinter

815 955 3542

Rovers

30 396 1065

Satellite

91 143 143

Woodworking

1627 2820 10795

  • D

D + AS AS + p Pruning Ratio

  • wrt. baseline

´ Alvaro Torralba From Qualitative to Quantitative Dominance Pruning for Optimal Planning 15/19

slide-36
SLIDE 36

Qualitative Quantitative Finding Dominance Action Selection Pruning Experiments Conclusions

Dramatic Pruning Power in Blind Search!

Driverlog

13 21 27 7

Logistics

17 149 166 46

Miconic

24 325 376 143

Nomystery

693 891 10538 1,249

Parcprinter

815 955 3542 943

Rovers

30 396 1065 204

Satellite

91 143 143 40

Woodworking

1627 2820 10795 2,618

  • D

D + AS AS + p Pruning Ratio

  • wrt. baseline

´ Alvaro Torralba From Qualitative to Quantitative Dominance Pruning for Optimal Planning 15/19

slide-37
SLIDE 37

Qualitative Quantitative Finding Dominance Action Selection Pruning Experiments Conclusions

Great Pruning Power in LM-Cut!

Driverlog

1.4

Logistics

1.4

Nomystery

4

Parcprinter

7

Rovers

2.3

Satellite

2.1

Woodworking

5.8

  • D

D + AS AS + p Pruning Ratio

  • wrt. baseline

´ Alvaro Torralba From Qualitative to Quantitative Dominance Pruning for Optimal Planning 16/19

slide-38
SLIDE 38

Qualitative Quantitative Finding Dominance Action Selection Pruning Experiments Conclusions

Great Pruning Power in LM-Cut!

Driverlog

1.4 4.3

Logistics

1.4 81.2

Nomystery

4 45

Parcprinter

7 79

Rovers

2.3 12.2

Satellite

2.1 2.9

Woodworking

5.8 52

  • D

D + AS AS + p Pruning Ratio

  • wrt. baseline

´ Alvaro Torralba From Qualitative to Quantitative Dominance Pruning for Optimal Planning 16/19

slide-39
SLIDE 39

Qualitative Quantitative Finding Dominance Action Selection Pruning Experiments Conclusions

Great Pruning Power in LM-Cut!

Driverlog

1.4 4.3 4.3

Logistics

1.4 81.2 83.9

Nomystery

4 45 53

Parcprinter

7 79 95

Rovers

2.3 12.2 14.8

Satellite

2.1 2.9 2.9

Woodworking

5.8 52 77

  • D

D + AS AS + p Pruning Ratio

  • wrt. baseline

´ Alvaro Torralba From Qualitative to Quantitative Dominance Pruning for Optimal Planning 16/19

slide-40
SLIDE 40

Qualitative Quantitative Finding Dominance Action Selection Pruning Experiments Conclusions

Great Pruning Power in LM-Cut!

Driverlog

1.4 4.3 4.3 1.8

Logistics

1.4 81.2 83.9 30.2

Nomystery

4 45 53 18

Parcprinter

7 79 95 29

Rovers

2.3 12.2 14.8 5.1

Satellite

2.1 2.9 2.9 2

Woodworking

5.8 52 77 3

  • D

D + AS AS + p Pruning Ratio

  • wrt. baseline

´ Alvaro Torralba From Qualitative to Quantitative Dominance Pruning for Optimal Planning 16/19

slide-41
SLIDE 41

Qualitative Quantitative Finding Dominance Action Selection Pruning Experiments Conclusions

Coverage

Blind LM-cut B AS + p POR B AS + p POR Driverlog 20 7 9 10 7 13 13 13 13 Floortile 40 2 11 16 2 13 16 16 13 Logistics 63 12 21 27 12 26 26 33 27 Miconic 150 55 60 77 50 141 141 142 141 Nomystery 20 8 16 20 8 14 20 20 14 Openstacks 100 49 51 55 50 47 51 52 49 Parcprinter 50 16 32 44 50 31 35 48 50 Pathwaysnoneg 30 4 4 5 4 5 5 5 5 Rovers 40 6 8 8 7 7 9 10 10 Satellite 36 6 6 6 6 7 10 12 12 Sokoban 50 41 43 43 39 50 49 49 50 TPP 30 6 6 6 6 7 7 8 6 Trucksstrips 30 6 8 8 6 10 10 10 10 Visitall 40 12 13 12 12 15 16 15 15 Woodworking 50 11 30 38 24 29 48 50 46 Zenotravel 20 8 9 9 8 13 13 13 13 Total 1612 610 659 738 613 835 856 896 881

´ Alvaro Torralba From Qualitative to Quantitative Dominance Pruning for Optimal Planning 17/19

slide-42
SLIDE 42

Qualitative Quantitative Finding Dominance Action Selection Pruning Experiments Conclusions

Outline

1

Qualitative Dominance

2

From Qualitative to Quantitative Dominance

3

Finding Dominance

4

Action Selection Pruning

5

Experiments

6

Conclusions

´ Alvaro Torralba From Qualitative to Quantitative Dominance Pruning for Optimal Planning 18/19

slide-43
SLIDE 43

Qualitative Quantitative Finding Dominance Action Selection Pruning Experiments Conclusions

Conclusions

Quantitative Dominance:

Bound difference in goal distance between states Useful for dominance and action selection pruning Good results and even more potential to be unleashed!

Future work:

New ways to discover (quantitative) dominance More efficient ways to perform dominance pruning New uses for dominance

´ Alvaro Torralba From Qualitative to Quantitative Dominance Pruning for Optimal Planning 19/19