Beam-Stack Search - Beam-Stack Search: Integrating...

Info iconThis preview shows pages 1–12. Sign up to view the full content.

View Full Document Right Arrow Icon
Click to edit Master subtitle style 11/13/09 Beam-Stack Search: Integrating Backtracking with Beam Search Ring Zhou and Eric A. Hansen Presented by Paul Gross
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
11/13/09 Beam-Stack Search Overview Complete, anytime algorithm O( dw ) Memory Complexity l d = depth of optimal solution, w = beam width Uses novel beam stack structure l Stores most promising, unexpanded nodes at each level l Bounds, admissibly prunes sub-optimal nodes Outperforms l Breadth-first Branch and Bound (BFBnB)
Background image of page 2
11/13/09 Beam Search Algorithm Breadth-first approach l Bound level fringe size Size is beam width ( w ) Branches most w promising nodes at each level Width bound reduces complexity w = 2 . . . Goal State
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
11/13/09 Making Beam Search Complete Beam-Stack search l Builds off Breadth-first Beam Search Prune layers by beam width Each layer expands at most w nodes l Expand layers by f(n) bounds f(n) = g(n) + h(n) as in A*, where h(n) admissible l Beam Stack stores f(n) ranges for each layer Successor layer nodes have f(n) value in range l Backtracking pruned nodes by shifting f(n) ranges
Background image of page 4
Beam-stack Search Algorithm Stack Level Open Closed Node Beam Width ( w ) Upper f(n) Bound S Current Level Best Goal A B C 2 2 3 4 6 5 2 6 2 4 D E F G H I J 1 0 1 1 2 2 0 2 2 2 g(n) = V h(n) = V 3
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Beam-stack Search Algorithm Stack [ 0 , 10 ) Level Open Closed Node Beam Width ( w ) 2 Upper f(n) Bound 10 S Current Level Best Goal g(n) = V h(n) = V
Background image of page 6
Beam-stack Search Algorithm Stack 0 10 Level Open Closed 0 S Node S Beam Width ( w ) 2 Upper f(n) Bound 10 S Current Level 0 Best Goal g(n) = V h(n) = V
Background image of page 7

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Beam-stack Search Algorithm Stack 0 10 Level Open Closed 0 S 1 Node S Beam Width ( w ) 2 Upper f(n) Bound 10 S Current Level 0 Best Goal g(n) = V h(n) = V
Background image of page 8
Beam-stack Search Algorithm Stack 0 10 Level Open Closed 0 S 1 Node S Beam Width ( w ) 2 Upper f(n) Bound 10 S Current Level 0 Best Goal A 2 1 g(n) = V h(n) = V f(A) = g(A) + h(A) = 2 + 1 = 3
Background image of page 9

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Beam-stack Search Algorithm Stack 0 10 Level Open Closed 0 S 1 A Node S Beam Width ( w ) 2 Upper f(n) Bound 10 S Current Level 0 Best Goal A 2 1 g(n) = V h(n) = V f(A) = g(A) + h(A) = 2 + 1 = 3
Background image of page 10
Beam-stack Search Algorithm Stack 0
Background image of page 11

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 12
This is the end of the preview. Sign up to access the rest of the document.

This document was uploaded on 11/13/2009.

Page1 / 42

Beam-Stack Search - Beam-Stack Search: Integrating...

This preview shows document pages 1 - 12. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online