HereBoy:
A Fast Evolutionary
Algorithm
Delon Levi
Docsity.com
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Guidelines and tips
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Fast Evolutionary - Embedded Intelligent Robotics - Lecture Slides, Slides of Robotics
This course is about robots intelligence. This lecture is one of many lectures on robots you can find in my uploads. Following key points are hint to specific topics of this lecture. Fast Evolutionary, Claims, Simulated, Significantly Better Scalability, Evolutionary Time, Number of Iterations, Genetic Algorithm, Population, Individuals, Generation
Typology: Slides
2012/2013
1 / 16
This page cannot be seen from the preview
Don't miss anything!
Related documents
Partial preview of the text
Download Fast Evolutionary - Embedded Intelligent Robotics - Lecture Slides and more Slides Robotics in PDF only on Docsity!
HereBoy:
A Fast Evolutionary
Algorithm
Delon Levi
Claims
- Up to
100X faster
than a
Genetic
- Up to Algorithm
10X faster
than a
Simulated
- Significantly better Scalability Annealing
Genetic Algorithm
Population of
Individuals
Survival of the
Fittest Reproduction
with Crossover
Generation
n+
Generation
n
15
60
20 48
Population of
Individuals
Simulated Annealing
1-Bit
Mutate
Score
Chromosome
Mutated
Chromosome
Evaluate
If Better
If Worse
Probability
Test
You still keep
worse
solutions with
some
probability
ocsity.co
Adaptive Mutation
Convergence
Adaptive Mutation
Chromosome
Mutation Bits =
αααα
= MaxMutationRate = UserFraction x ChromosomeBits
MaxScore - MaxCurrentScore
MaxScore
How many bits to
mutate?
Adaptive Search
Convergence
Acceptance
Probability
0.
Acceptance
Probability
0.
Acceptance
Probability
0.
A B C D E F
Adaptive Search
A
B
Search Probability =
ρ
= MaxSearchProbability = UserFraction
MaxScore - MaxCurrentScore
MaxScore
How to select the probability value?
Curve Optimization Results
Iterations Solving Binary F
99% Complete
100% Complete
x
σ
σ σ
σ
x
σσσσ
Genetic
Algorithm
Annealing Simulated
HereBoy
Easy and Hard Binary F6 Experiments
HereBoy
Simulated Annealing
Genetic
Algorithm
Scale Between
Number of
iterations
ocsity.co
Evolvable Hardware Experiment
Pattern Generation
Iteration = 0 Score = 800
Iteration = 3,
Score = 1,
Iteration = 65,
Score = 1,
Pattern Generator Circuit Statistics
10x
20x
Search Space Size
6400
25,
Probability of
Randomly Creating
100% Solution
Qualitative Comparison
HereBoy
Simulated Annealing
Genetic
Algorithm
Maximum Score