Evolutionary Algorithms

Slides:



Advertisements
Similar presentations
Logical and Artificial Intelligence in Games Lecture 14
Advertisements

Genetic Algorithms Chapter 3. A.E. Eiben and J.E. Smith, Introduction to Evolutionary Computing Genetic Algorithms GA Quick Overview Developed: USA in.
CSM6120 Introduction to Intelligent Systems Evolutionary and Genetic Algorithms.
Tuesday, May 14 Genetic Algorithms Handouts: Lecture Notes Question: when should there be an additional review session?
Biologically Inspired AI (mostly GAs). Some Examples of Biologically Inspired Computation Neural networks Evolutionary computation (e.g., genetic algorithms)
EvoNet Flying Circus Introduction to Evolutionary Computation Brought to you by (insert your name) The EvoNet Training Committee The EvoNet Flying Circus.
Genetic Algorithms1 COMP305. Part II. Genetic Algorithms.
Evolutionary Computation Introduction Peter Andras s.
Genetic Algorithms GAs are one of the most powerful and applicable search methods available GA originally developed by John Holland (1975) Inspired by.
Genetic Algorithms and Their Applications John Paxton Montana State University August 14, 2003.
Evolutionary Computation Application Peter Andras peter.andras/lectures.
CS 447 Advanced Topics in Artificial Intelligence Fall 2002.
Genetic Algorithms Overview Genetic Algorithms: a gentle introduction –What are GAs –How do they work/ Why? –Critical issues Use in Data Mining –GAs.
Evolutionary Intelligence
SOFT COMPUTING (Optimization Techniques using GA) Dr. N.Uma Maheswari Professor/CSE PSNA CET.
CS 484 – Artificial Intelligence1 Announcements Lab 4 due today, November 8 Homework 8 due Tuesday, November 13 ½ to 1 page description of final project.
Intro. ANN & Fuzzy Systems Lecture 36 GENETIC ALGORITHM (1)
Genetic algorithms Prof Kang Li
Boltzmann Machine (BM) (§6.4) Hopfield model + hidden nodes + simulated annealing BM Architecture –a set of visible nodes: nodes can be accessed from outside.
An Introduction to Genetic Algorithms Lecture 2 November, 2010 Ivan Garibay
Evolving Virtual Creatures & Evolving 3D Morphology and Behavior by Competition Papers by Karl Sims Presented by Sarah Waziruddin.
1 “Genetic Algorithms are good at taking large, potentially huge search spaces and navigating them, looking for optimal combinations of things, solutions.
Soft Computing A Gentle introduction Richard P. Simpson.
Derivative Free Optimization G.Anuradha. Contents Genetic Algorithm Simulated Annealing Random search method Downhill simplex method.
EE459 I ntroduction to Artificial I ntelligence Genetic Algorithms Kasin Prakobwaitayakit Department of Electrical Engineering Chiangmai University.
Evolutionary Computation Dean F. Hougen w/ contributions from Pedro Diaz-Gomez & Brent Eskridge Robotics, Evolution, Adaptation, and Learning Laboratory.
G ENETIC A LGORITHMS Ranga Rodrigo March 5,
Learning by Simulating Evolution Artificial Intelligence CSMC February 21, 2002.
1 Genetic Algorithms K.Ganesh Introduction GAs and Simulated Annealing The Biology of Genetics The Logic of Genetic Programmes Demo Summary.
Genetic Algorithms Przemyslaw Pawluk CSE 6111 Advanced Algorithm Design and Analysis
Introduction to Genetic Algorithms. Genetic Algorithms We’ve covered enough material that we can write programs that use genetic algorithms! –More advanced.
Genetic Algorithms. 2 Overview Introduction To Genetic Algorithms (GAs) GA Operators and Parameters Genetic Algorithms To Solve The Traveling Salesman.
1 Autonomic Computer Systems Evolutionary Computation Pascal Paysan.
Genetic Search Algorithms Matt Herbster. Why Another Search?  Designed in the 1950s, heavily implemented under John Holland (1970s)  Genetic search.
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.
Genetic Algorithms. Solution Search in Problem Space.
Genetic Algorithms And other approaches for similar applications Optimization Techniques.
Genetic Algorithm. Outline Motivation Genetic algorithms An illustrative example Hypothesis space search.
Presented By: Farid, Alidoust Vahid, Akbari 18 th May IAUT University – Faculty.
Introduction to Genetic Algorithms
Chapter 14 Genetic Algorithms.
Genetic Algorithm in TDR System
Genetic Algorithms.
Introduction to Evolutionary Computing
Cellular automata.
Evolution Strategies Evolutionary Programming
Artificial Intelligence Methods (AIM)
Genetic Algorithms GAs are one of the most powerful and applicable search methods available GA originally developed by John Holland (1975) Inspired by.
Introduction to Genetic Algorithm (GA)
C.-S. Shieh, EC, KUAS, Taiwan
Artificial Intelligence Project 2 Genetic Algorithms
Intelligent Systems and Soft Computing
Genetic Algorithms GAs are one of the most powerful and applicable search methods available GA originally developed by John Holland (1975) Inspired by.
Basics of Genetic Algorithms (MidTerm – only in RED material)
Genetic Algorithms Artificial Life
GENETIC ALGORITHMS & MACHINE LEARNING
Basics of Genetic Algorithms
Boltzmann Machine (BM) (§6.4)
Searching by Constraint & Searching by Evolution
Searching for solutions: Genetic Algorithms
A Gentle introduction Richard P. Simpson
Evolution by Means of Natural Selection
Traveling Salesman Problem by Genetic Algorithm
Genetic Algorithm Soft Computing: use of inexact t solution to compute hard task problems. Soft computing tolerant of imprecision, uncertainty, partial.
Steady state Selection
Beyond Classical Search
Population Based Metaheuristics
Presentation transcript:

Evolutionary Algorithms

Techniques that harness evolution Broad range of applications Genetic algorithms Darwinian Process A characteristic pattern Pattern can be copied Occasional variations Competition for limited territory Multifaceted environment Next round of variations based on success

Definitions Genotype Phenotype DNA Mutation (copy errors) Fitness Function

Genetic Representation Phenotype == Genotype Discrete, real, tree Growth and cellular differentiation

Genetic operators Crossover Mutation One point Multiple point P for a location is 0.01 (higher than nature)

Winston’s example Kookie flour sugar Chromosome: Mutation – choose a gene and change it Crossover – Fitness: Probability of survival related to quality of the cookie

Algorithm Create a population Mutate one or more genes producing new offspring Mate one or more pairs Remove from population by fitness Iterate!

Design constraints Number of chromosomes in population Mutation rate Cost of large numbers Low numbers slow evolution Mutation rate Too high can cause out of control systems Mating rules Fitness, proximity Can chromosome have multiple occurrences in a population?

With Kookie Selection rule It will work with mutation alone Higher qualities survive Randomly keep a small number unrelated to quality It will work with mutation alone Adding crossover improves convergence

Ranking Methods Fitness as relative quality: Rank Method Given qi as the quality measure of the i’th entity Fi = qi / (Sj qj) Rank Method Eliminates bias toward the “best” and reduces bias due to measurement scale Rank the candidates by fitness Choose a probability, p, of choosing the highest ranking Pi = p * (1.00 – ( P1 + P2 + P3 …Pi-1))

Ranking (cont.) Survival of the Most Diverse Need a diversity measure It is good to be different! Need a diversity measure Sort by the combination of diversity and quality The use rank method

Examples See Kosa Digital Design – encode FSA Analog Design Tree of build instructions Components as Genes: type Values Connections

CHC Algorithm Larry J. Eshelman Use crossover and elitist selection When converged population appears, then mutate! (Cataclysm)

Artificial Life Study aspects of “life” in a simulated environment Allow experiments we cannot do in real life Allows us to abstract from life and life properties Grow AI?

Self Replication John Von Neumann (1951) Cellular Automata Life – Turing computable Self replicator

Tierra System Thomas Ray Organism are built of instructions is a ”core” 32 instructions encoded in 5 bits Work by pattern matching Simulated enzymes and proteins

Spontaneous Generation Andrew Paragellis Instruction sequences Mutation Random seeding Self replicators emerged

Artificial Life Lab Rudy Rucker Boppers Artificial Life Lab Rudy Rucker

Boppers Simple bug-like creatures Turing Machine based <current state, read color, write color, new state, turn> Cycle is move in current direction Compute next state, write color and turn

Creatures Turmite Boids – Turboid Two dimension Turing machine actions based on locations of surrounding boids No internal state Turboid Hybrid of the two

Genetics Have chromosomes and are G.A. Chromosomes are highly structured Various areas of chromosome supply direct aspects of behavior!

Windrose

Turmite DNA IQ = number of states Turn table - size of windrose State (indexed by read color): Next State Table (8 * IQ) Turn Table (8 * IQ) Write Color Table (8 * IQ) Total size is 24 * IQ

Turmite Enzymes Body icon Trail Nodes Trail lines Base speed Bopper type Windrose IQ

Boids Based on Reynolds Boid Flocking rules Collision Avoidance Velocity Matching Flock Centering

Boid DNA 18 bytes for 11 varibles 4 byte size integers: WatchTwoFlag = watch one or two closest MaxSpeed CruiseDistance - distance from flock mate NearWallDistance - closest distance allowed

Boid DNA (cont.) 7 real parameters RealSpeed CopyWeight = fly parallel to neighbor CenterWeight = move to center of flock AttackWeight = attack other flock FleeWeight = run from other flock VeerWeight = fly away from wall Acceleration

TurBoid Features of both! DNA is like turmite First 18 bytes of DNA Turmite state table Boid parameters

Summary