genetic algorithms abhishek sharma-0691153004 piyush gupta -0651153004 department of instrumentation...
TRANSCRIPT
![Page 1: Genetic Algorithms Abhishek Sharma-0691153004 Piyush Gupta -0651153004 Department of Instrumentation & Control](https://reader036.vdocuments.net/reader036/viewer/2022083009/5697bf7d1a28abf838c84d32/html5/thumbnails/1.jpg)
Genetic AlgorithmsGenetic Algorithms
Abhishek Sharma-0691153004
Piyush Gupta -0651153004
Department of Instrumentation & Control
![Page 2: Genetic Algorithms Abhishek Sharma-0691153004 Piyush Gupta -0651153004 Department of Instrumentation & Control](https://reader036.vdocuments.net/reader036/viewer/2022083009/5697bf7d1a28abf838c84d32/html5/thumbnails/2.jpg)
What are Genetic Algorithms? What are Genetic Algorithms?
Genetic Algorithms (GAs)[1] are a global search method that emulates the process of natural evolution.
John Holland formally introduced this method in the United States in the 1970 at the University of Michigan.
![Page 3: Genetic Algorithms Abhishek Sharma-0691153004 Piyush Gupta -0651153004 Department of Instrumentation & Control](https://reader036.vdocuments.net/reader036/viewer/2022083009/5697bf7d1a28abf838c84d32/html5/thumbnails/3.jpg)
DescriptionDescription
The genetic algorithm starts with no knowledge of the correct solution and depends entirely on responses from its environment.
Work on the concept of global maxima & global minima.
![Page 4: Genetic Algorithms Abhishek Sharma-0691153004 Piyush Gupta -0651153004 Department of Instrumentation & Control](https://reader036.vdocuments.net/reader036/viewer/2022083009/5697bf7d1a28abf838c84d32/html5/thumbnails/4.jpg)
Genetic Algorithm Process Flow Chart
![Page 5: Genetic Algorithms Abhishek Sharma-0691153004 Piyush Gupta -0651153004 Department of Instrumentation & Control](https://reader036.vdocuments.net/reader036/viewer/2022083009/5697bf7d1a28abf838c84d32/html5/thumbnails/5.jpg)
Stages of a genetic algorithm:-
ReproductionCrossover Mutation
![Page 6: Genetic Algorithms Abhishek Sharma-0691153004 Piyush Gupta -0651153004 Department of Instrumentation & Control](https://reader036.vdocuments.net/reader036/viewer/2022083009/5697bf7d1a28abf838c84d32/html5/thumbnails/6.jpg)
ReproductionReproduction
During the reproduction phase the fitness value of each chromosome is assessed.
Just like in natural evolution, a fit chromosome has a higher probability of being selected for reproduction. An example of a common selection technique is the Roulette Wheel.
![Page 7: Genetic Algorithms Abhishek Sharma-0691153004 Piyush Gupta -0651153004 Department of Instrumentation & Control](https://reader036.vdocuments.net/reader036/viewer/2022083009/5697bf7d1a28abf838c84d32/html5/thumbnails/7.jpg)
CrossoverCrossover
The crossover operations swaps certain parts of the two selected strings bid to capture the good parts of old chromosomes and create better new ones.
Single Point & Multipoint crossover
Illustration of Single Point Crossover
Illustration of Multi Point Crossover
![Page 8: Genetic Algorithms Abhishek Sharma-0691153004 Piyush Gupta -0651153004 Department of Instrumentation & Control](https://reader036.vdocuments.net/reader036/viewer/2022083009/5697bf7d1a28abf838c84d32/html5/thumbnails/8.jpg)
MutationMutation
Using selection and crossover on their own will generate a large amount of different strings. There are two main problems with this:
1. Depending on the initial population chosen, there may not be enough diversity in the initial strings to ensure the Genetic Algorithm searches the entire problem space.
2. The Genetic Algorithm may converge on sub-optimum strings due to a bad choice of initial population.
![Page 9: Genetic Algorithms Abhishek Sharma-0691153004 Piyush Gupta -0651153004 Department of Instrumentation & Control](https://reader036.vdocuments.net/reader036/viewer/2022083009/5697bf7d1a28abf838c84d32/html5/thumbnails/9.jpg)
These problems may be overcome by the introduction of a mutation operator into the Genetic Algorithm. Mutation is the occasional random alteration of a value of a string position.
For example, if the GA chooses bit position 4 for mutation in the binary string 10000, the resulting string is 10010 as the fourth bit in the string is flipped.
![Page 10: Genetic Algorithms Abhishek Sharma-0691153004 Piyush Gupta -0651153004 Department of Instrumentation & Control](https://reader036.vdocuments.net/reader036/viewer/2022083009/5697bf7d1a28abf838c84d32/html5/thumbnails/10.jpg)
Applications of Genetic Algorithms Applications of Genetic Algorithms in Control Engineeringin Control Engineering
PID ControlAircraft Control (Pitch, Roll , Yaw)
![Page 11: Genetic Algorithms Abhishek Sharma-0691153004 Piyush Gupta -0651153004 Department of Instrumentation & Control](https://reader036.vdocuments.net/reader036/viewer/2022083009/5697bf7d1a28abf838c84d32/html5/thumbnails/11.jpg)
PID Control Using Genetic PID Control Using Genetic AlgorithmsAlgorithms
PID controllers algorithm are mostly used in feedback loops. PID controllers can be implemented in many forms.
[2]
![Page 12: Genetic Algorithms Abhishek Sharma-0691153004 Piyush Gupta -0651153004 Department of Instrumentation & Control](https://reader036.vdocuments.net/reader036/viewer/2022083009/5697bf7d1a28abf838c84d32/html5/thumbnails/12.jpg)
![Page 13: Genetic Algorithms Abhishek Sharma-0691153004 Piyush Gupta -0651153004 Department of Instrumentation & Control](https://reader036.vdocuments.net/reader036/viewer/2022083009/5697bf7d1a28abf838c84d32/html5/thumbnails/13.jpg)
0 10 20 30 40 50 60 70 80
0
0.2
0.4
0.6
0.8
1
1.2
1.4Optimized genetic algorithm step response
Time (sec)
Ampl
itude
![Page 14: Genetic Algorithms Abhishek Sharma-0691153004 Piyush Gupta -0651153004 Department of Instrumentation & Control](https://reader036.vdocuments.net/reader036/viewer/2022083009/5697bf7d1a28abf838c84d32/html5/thumbnails/14.jpg)
Aircraft Pitch ControlAircraft Pitch Control
[3]
![Page 15: Genetic Algorithms Abhishek Sharma-0691153004 Piyush Gupta -0651153004 Department of Instrumentation & Control](https://reader036.vdocuments.net/reader036/viewer/2022083009/5697bf7d1a28abf838c84d32/html5/thumbnails/15.jpg)
ConclusionConclusion
An optimized approach to a problem results in a better operation.
![Page 16: Genetic Algorithms Abhishek Sharma-0691153004 Piyush Gupta -0651153004 Department of Instrumentation & Control](https://reader036.vdocuments.net/reader036/viewer/2022083009/5697bf7d1a28abf838c84d32/html5/thumbnails/16.jpg)
ReferencesReferences
[1] An Introduction to Genetic Algorithms-MIT Press.
[2] A Dissertation by SAIFUDIN BIN MOHAMED IBRAHIM University of New South Wales.
[3] http://virtualskies.arc.nasa.gov/aerona utics/tutorial/motion.html
[4] University of Michigan.
![Page 17: Genetic Algorithms Abhishek Sharma-0691153004 Piyush Gupta -0651153004 Department of Instrumentation & Control](https://reader036.vdocuments.net/reader036/viewer/2022083009/5697bf7d1a28abf838c84d32/html5/thumbnails/17.jpg)
THANK YOUTHANK YOU