2. Local Beam Search
Unlike Hill-climbing, local beam search keep
track of k states rather than just one.
It starts with k randomly generated states.
At each step, all the successors of all the
states are generated.
If any one is a goal, the algorithm halts,
otherwise it selects the k best successors
from the complete list and repeats.
Subscribe
3. Subscribe
A
j K E F H
B D
C
C
K=2
14 13
15
8
9
10
Limitation:
It only explore best ‘k’ nodes that mean lack of diversity to remove this
problem Stochastic Beam search came into picture.
Instead of choosing the best k from the pool of candidate successors, stochastic
beam search chooses k successors at random, with the probability of choosing
a given successor being an increasing function of its value.
4. Genetic Algorithm
A genetic algorithm (or GA) is a variant of stochastic
beam search in which successor states are generated
by combining two parent states rather than by
modifying a single state.
A genetic algorithm is a search heuristic that is
inspired by theory of biological evolution.
This algorithm reflects the process of natural
selection where the fittest individuals are selected
for reproduction in order to produce offspring of
the next generation.
It is frequently used to find optimal or near-
optimal solutions to difficult problems.
Subscribe
9. 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