Local beam search is an algorithm that maintains a limited set (beam) of the best candidates solutions found during its search. It generates the successors of the current candidates and selects the best k successors to proceed to the next iteration. Two examples are provided where the beam is set to 2 and 3 respectively. The algorithm terminates when a solution state is found among the successors or no improvement is seen after exploring all successors.

1. LOCAL BEAM SEARCH EXAMPLES

2. Local Beam Search
Algorithm:
function BEAM_SEARCH(problem, k) returns a solution state
start with k randomly generated states
loop
generate all successors of all k states
if any of them is a solution then return it
else select the k best successors
Subscribe

3. Subscribe
Example-1
Beam= 2
S
A B
C E F
D
I
H
G J
K L N
M
7 10
5
6
9
6
8
7
4
5
2 0 1
3
Frontier List Explored List
AB
HJ
S
SAB
LN
SABCE
SABCEHJ
CE
SABCEHJLN

4. Subscribe
A
D
B C
G E F
H
16
12 15
15
14
16 13
Frontier List Explore List
Example-2
Beam= 3
I J K L M
2
3 0 1 3
A
BCD
HEF
JKM
ABCD
ABCDHEF
ABCDHEFJKM

5. Thanks For
Watching
Reference:
Artificial Intelligence
A Modern Approach Third Edition
Peter Norvig and Stuart J. Russell
Subscribe
Like
Share

6. OMega TechEd
About the Channel
This channel helps you to prepare for BSc IT and BSc computer science subjects.
In this channel we will learn Business Intelligence ,Artificial Intelligence, Digital Electronics,
Internet OF Things Python programming , Data-Structure etc.
Which is useful for upcoming university exams.
Gmail: omega.teched@gmail.com
Social Media Handles:
omega.teched
megha_with
Subscribe