Evolutionary Computation Dean F. Hougen w/ contributions from Pedro Diaz-Gomez & Brent Eskridge Robotics, Evolution, Adaptation, and Learning Laboratory.

Slides:



Advertisements
Similar presentations
Population-based metaheuristics Nature-inspired Initialize a population A new population of solutions is generated Integrate the new population into the.
Advertisements

Biologically Inspired Computing: Operators for Evolutionary Algorithms
Biologically Inspired AI (mostly GAs). Some Examples of Biologically Inspired Computation Neural networks Evolutionary computation (e.g., genetic algorithms)
Genetic Algorithms. Some Examples of Biologically Inspired AI Neural networks Evolutionary computation (e.g., genetic algorithms) Immune-system-inspired.
Genetic Algorithms1 COMP305. Part II. Genetic Algorithms.
1 Lecture 8: Genetic Algorithms Contents : Miming nature The steps of the algorithm –Coosing parents –Reproduction –Mutation Deeper in GA –Stochastic Universal.
COMP305. Part II. Genetic Algorithms. Genetic Algorithms.
A new crossover technique in Genetic Programming Janet Clegg Intelligent Systems Group Electronics Department.
Introduction to Genetic Algorithms Yonatan Shichel.
Genetic Algorithms GAs are one of the most powerful and applicable search methods available GA originally developed by John Holland (1975) Inspired by.
Evolutionary Algorithms Simon M. Lucas. The basic idea Initialise a random population of individuals repeat { evaluate select vary (e.g. mutate or crossover)
Genetic Algorithms Learning Machines for knowledge discovery.
COMP305. Part II. Genetic Algorithms. Genetic Algorithms.
Artificial Intelligence Genetic Algorithms and Applications of Genetic Algorithms in Compilers Prasad A. Kulkarni.
Intro to AI Genetic Algorithm Ruth Bergman Fall 2002.
Genetic Algorithms Nehaya Tayseer 1.Introduction What is a Genetic algorithm? A search technique used in computer science to find approximate solutions.
CS 447 Advanced Topics in Artificial Intelligence Fall 2002.
Intro to AI Genetic Algorithm Ruth Bergman Fall 2004.
Chapter 6: Transform and Conquer Genetic Algorithms The Design and Analysis of Algorithms.
Genetic Programming. Agenda What is Genetic Programming? Background/History. Why Genetic Programming? How Genetic Principles are Applied. Examples of.
Genetic Algorithms Overview Genetic Algorithms: a gentle introduction –What are GAs –How do they work/ Why? –Critical issues Use in Data Mining –GAs.
Genetic Programming.
Slides are based on Negnevitsky, Pearson Education, Lecture 10 Evolutionary Computation: Evolution strategies and genetic programming n Evolution.
LOUKAS GEORGIOU and WILLIAM J. TEAHAN Artificial Intelligence and Intelligent Agents Research Group School of Computer Science, Bangor University, U.K.
Prepared by Barış GÖKÇE 1.  Search Methods  Evolutionary Algorithms (EA)  Characteristics of EAs  Genetic Programming (GP)  Evolutionary Programming.
Genetic Algorithm.
Genetic Algorithms and Ant Colony Optimisation
Computing & Information Sciences Kansas State University Friday, 21 Nov 2008CIS 530 / 730: Artificial Intelligence Lecture 35 of 42 Friday, 21 November.
Evolution Strategies Evolutionary Programming Genetic Programming Michael J. Watts
© Negnevitsky, Pearson Education, Lecture 10 Evolutionary Computation: Evolution strategies and genetic programming Evolution strategies Evolution.
CS 484 – Artificial Intelligence1 Announcements Lab 3 due Tuesday, November 6 Homework 6 due Tuesday, November 6 Lab 4 due Thursday, November 8 Current.
Lecture 8: 24/5/1435 Genetic Algorithms Lecturer/ Kawther Abas 363CS – Artificial Intelligence.
Applying Genetic Algorithm to the Knapsack Problem Qi Su ECE 539 Spring 2001 Course Project.
An Introduction to Genetic Algorithms Lecture 2 November, 2010 Ivan Garibay
Genetic Algorithms K.Ganesh Reasearch Scholar, Ph.D., Industrial Management Division, Humanities and Social Sciences Department, Indian Institute of Technology.
EE459 I ntroduction to Artificial I ntelligence Genetic Algorithms Kasin Prakobwaitayakit Department of Electrical Engineering Chiangmai University.
Kansas State University Department of Computing and Information Sciences CIS 732: Machine Learning and Pattern Recognition Friday, 16 February 2007 William.
G ENETIC A LGORITHMS Ranga Rodrigo March 5,
Artificial Intelligence Chapter 4. Machine Evolution.
Algorithms and their Applications CS2004 ( ) 13.1 Further Evolutionary Computation.
1 Genetic Algorithms and Ant Colony Optimisation.
Introduction to Genetic Algorithms. Genetic Algorithms We’ve covered enough material that we can write programs that use genetic algorithms! –More advanced.
Edge Assembly Crossover
Genetic Algorithms What is a GA Terms and definitions Basic algorithm.
ECE 103 Engineering Programming Chapter 52 Generic Algorithm Herbert G. Mayer, PSU CS Status 6/4/2014 Initial content copied verbatim from ECE 103 material.
EE749 I ntroduction to Artificial I ntelligence Genetic Algorithms The Simple GA.
Neural Networks And Its Applications By Dr. Surya Chitra.
An Introduction to Genetic Algorithms Lecture 2 November, 2010 Ivan Garibay
Genetic Algorithm Dr. Md. Al-amin Bhuiyan Professor, Dept. of CSE Jahangirnagar University.
Artificial Intelligence By Mr. Ejaz CIIT Sahiwal Evolutionary Computation.
1 Comparative Study of two Genetic Algorithms Based Task Allocation Models in Distributed Computing System Oğuzhan TAŞ 2005.
EVOLUTIONARY SYSTEMS AND GENETIC ALGORITHMS NAME: AKSHITKUMAR PATEL STUDENT ID: GRAD POSITION PAPER.
Genetic Algorithm. Outline Motivation Genetic algorithms An illustrative example Hypothesis space search.
Introduction to Genetic Algorithms
Genetic Algorithm in TDR System
Selected Topics in CI I Genetic Programming Dr. Widodo Budiharto 2014.
Genetic Algorithms.
Introduction to Evolutionary Computing
Evolution Strategies Evolutionary Programming
Evolution strategies and genetic programming
Basics of Genetic Algorithms (MidTerm – only in RED material)
Artificial Intelligence Chapter 4. Machine Evolution
GENETIC ALGORITHMS & MACHINE LEARNING
Basics of Genetic Algorithms
Artificial Intelligence Chapter 4. Machine Evolution
Searching for solutions: Genetic Algorithms
A Gentle introduction Richard P. Simpson
Beyond Classical Search
Coevolutionary Automated Software Correction
Presentation transcript:

Evolutionary Computation Dean F. Hougen w/ contributions from Pedro Diaz-Gomez & Brent Eskridge Robotics, Evolution, Adaptation, and Learning Laboratory (REAL Lab)‏ School of Computer Science University of Oklahoma

Outline Introduction to Evolutionary Computation Genetic Algorithms Genetic Programming “Real World” Example

Motivation for Evolutionary Computation (EC)‏ Science Understand evolutionary mechanisms mutation crossover co-evolution etc. Understand evolved characteristics behavior learning etc. Engineering Create better designs

Implementation of Evolutionary Computation (EC)‏ Inspired by biological evolution Required components: Replicators (genes)‏ Replication (copying)‏ Selection mechanism (survival)‏ Requirement: Replication must be high fidelity Result: Differential reproduction of replicators

Details of Biological Evolution Additional terminology Chromosome: A collection of genes Locus: A location within a chromosome Allele: A possible gene at a given locus Genotype: All the genes of an individual Phenotype: The expression of an individual's genes may be environmentally influenced

Details of Biological Evolution At what level does selection take place? Gene Chromosome Individual Species Genus Other Group (e.g., Family, family, colony)‏ Why does this matter to us?

EC Types Genetic Algorithms Genetic Programming Evolution Strategies Evolutionary Programming Grammatical Evolution Learning Classifier Systems Estimation of Distribution Systems Etc.

Genetic Algorithms (GAs)‏ Genes – bits, integers, floats, etc. Chromosome – array of genes, e.g.: Also called genotype or individual Note lack of distinction between: chromosome and genotype genotype and phenotype Locus – position in array Population – collection of individuals Generation – population at a given time

GA Operators 1 Crossover Example two point, two offspring Parents: 00001| | | |1111 Off-spring: 11111| |1111 ↕ 00001| |0010

GA Operators 2 Mutation Example single point mutation Original: ↓ Mutated:

GA Procedure – Steady State Randomly initialize population Repeat Selection Reproduction – Crossover Mutation Until solution found or resources exhausted

GA Procedure – Generational Randomly initialize population Repeat Selection Reproduction – Crossover Mutation Until new generation created Until solution found or resources exhausted

GA Selection Randomly initialize population Repeat Selection – using fitness function Reproduction – Crossover Mutation Until new generation created Until solution found or resources exhausted

GA Fitness Function Example: Onemax Chromosomes: label stringfitness A B C D

GA Selection label stringfitness A B C D Can do selection proportional to fitness: AABBBBBBCDDD Generate numbers from 1 to 12 Select corresponding parents

GA Selection label stringfitness A B C D Can do selection proportional to fitness: AABBBBBBCDDD Generate numbers from 1 to 12 (6, 10, 9, 6)‏ Select corresponding parents (B, D, C, B)‏

GA Procedure – Generational Randomly initialize population Repeat Selection Reproduction – Crossover – e.g., Probability 60% Mutation Until new generation created Until solution found or resources exhausted

GA Crossover Suppose one crossover Use selected chromosomes: B D Generate numbers from 1 to chromosome length (here 8)‏, say 1 and 5, and generate offspring: B'1|0110|110 D'0|1101|100

GA Procedure – Generational Randomly initialize population Repeat Selection Reproduction – Crossover Mutation – e.g., Probability 0.1% per gene Until new generation created Until solution found or resources exhausted

GA Mutation & Results Suppose no mutation, then population of next generation is: label stringfitness B' D' B C

Results of One Generation Has average population fitness gone up, gone down, or stayed the same? Why? Are we making progress? Why?

GA Procedure – Generational Randomly initialize population Repeat ✓ Repeat Selection Reproduction – Crossover Mutation Until new generation created Until solution found or resources exhausted

GA Procedure – Generational Randomly initialize population Repeat ✓ Repeat Selection Reproduction – Crossover Mutation Until new generation created Until solution found or resources exhausted – need a criterion, e.g., an individual has all ones

Genetic Programming (GP)‏ Genes – typically operators and operands Chromosome – typically tree of genes Also called genotype or individual Note lack of distinction between: chromosome and genotype genotype and phenotype Locus – not well defined Population – collection of individuals Generation – population at a given time

GP Individual Structure

GP Individual Complete

GP Crossover

GP Mutation

Artificial Ant: Problem Definition Navigate along food trail (Koza, 1992)‏ Trail has turns gaps maximum moves allowed Fitness – amount of uneaten food at run end

Non-Terminals IF-FOOD-AHEAD PROGN2 PROGN3 Artificial Ant: Setup Terminals MOVE (forward)‏ LEFT (turn)‏ RIGHT (turn)‏ All terminals modify state

Artificial Ant: Sante Fe Trail

Sante Fe Trail: Sample Solution (progn3 (if-food-ahead left (if-food-ahead (progn2 move left)‏ (if-food-ahead right right)‏ )‏ (if-food-ahead (progn2 move left)‏ (if-food-ahead right right)‏ )‏ (progn3 (if-food-ahead move right)‏ (progn2 move right)‏ (progn2 right left)‏ )‏

Artificial Ant: Los Altos Trail

Humie Example: Antenna Design NASA Space Technology 5 Mission Three micro-satellites exploring Earth’s magnetic fields Requirements: wide beam width circularly-polarized wave wide bandwidth Competitive bid selected human engineering team (contractor)‏ team created antenna design based on best engineering practices

Humie Example: Antenna Design NASA Space Technology 5 Mission In addition, different team used evolutionary computation methods Evolvable Systems Group at NASA Ames Research Center genetic algorithms genetic programming

Humie Example: Antenna Design NASA Space Technology 5 Mission Conventional design did not meet mission requirements required 5 person-months to complete Evolved designs did meet mission requirements required 3 person-months to complete

Questions?