Genetic Algorithms Artificial Life

Slides:



Advertisements
Similar presentations
Tuesday, May 14 Genetic Algorithms Handouts: Lecture Notes Question: when should there be an additional review session?
Advertisements

Biologically Inspired AI (mostly GAs). Some Examples of Biologically Inspired Computation Neural networks Evolutionary computation (e.g., genetic algorithms)
COMP305. Part II. Genetic Algorithms. Genetic Algorithms.
Data Mining CS 341, Spring 2007 Genetic Algorithm.
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.
COMP 578 Genetic Algorithms for Data Mining Keith C.C. Chan Department of Computing The Hong Kong Polytechnic University.
Genetic Algorithms and Their Applications John Paxton Montana State University August 14, 2003.
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.
Intro to AI Genetic Algorithm Ruth Bergman Fall 2004.
Genetic Algorithms Overview Genetic Algorithms: a gentle introduction –What are GAs –How do they work/ Why? –Critical issues Use in Data Mining –GAs.
Brandon Andrews.  What are genetic algorithms?  3 steps  Applications to Bioinformatics.
Intro. ANN & Fuzzy Systems Lecture 36 GENETIC ALGORITHM (1)
Genetic algorithms Prof Kang Li
An Introduction to Genetic Algorithms Lecture 2 November, 2010 Ivan Garibay
Chapter 4.1 Beyond “Classic” Search. What were the pieces necessary for “classic” search.
Soft Computing A Gentle introduction Richard P. Simpson.
GENETIC ALGORITHM A biologically inspired model of intelligence and the principles of biological evolution are applied to find solutions to difficult problems.
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.
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. 2 Overview Introduction To Genetic Algorithms (GAs) GA Operators and Parameters Genetic Algorithms To Solve The Traveling Salesman.
Chapter 12 FUSION OF FUZZY SYSTEM AND GENETIC ALGORITHMS Chi-Yuan Yeh.
EE749 I ntroduction to Artificial I ntelligence Genetic Algorithms The Simple GA.
GENETIC ALGORITHM Basic Algorithm begin set time t = 0;
An Introduction to Genetic Algorithms Lecture 2 November, 2010 Ivan Garibay
Genetic Algorithms. Underlying Concept  Charles Darwin outlined the principle of natural selection.  Natural Selection is the process by which evolution.
The Implementation of Genetic Algorithms to Locate Highest Elevation By Harry Beddo.
Artificial Intelligence By Mr. Ejaz CIIT Sahiwal Evolutionary Computation.
Genetic Algorithm(GA)
Genetic Algorithm. Outline Motivation Genetic algorithms An illustrative example Hypothesis space search.
 Presented By: Abdul Aziz Ghazi  Roll No:  Presented to: Sir Harris.
Presented By: Farid, Alidoust Vahid, Akbari 18 th May IAUT University – Faculty.
Genetic Algorithm (Knapsack Problem)
Introduction to Genetic Algorithms
Using GA’s to Solve Problems
Chapter 14 Genetic Algorithms.
Genetic Algorithms.
Genetic Algorithms.
Cellular automata.
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)
Chapter 6: Genetic Algorithms
CSC 380: Design and Analysis of Algorithms
Evolutionary 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.
An evolutionary approach to solving complex problems
Genetic Algorithms overview
CS621: Artificial Intelligence
Modified Crossover Operator Approach for Evolutionary Optimization
Case Study: Genetic Algorithms
GENETIC ALGORITHMS & MACHINE LEARNING
Basics of Genetic Algorithms
EE368 Soft Computing Genetic Algorithms.
Boltzmann Machine (BM) (§6.4)
Searching by Constraint & Searching by Evolution
Searching for solutions: Genetic Algorithms
A Gentle introduction Richard P. Simpson
Introduction to Genetic Algorithm and Some Experience Sharing
Steady state Selection
Population Based Metaheuristics
CSC 380: Design and Analysis of Algorithms
GA.
Population Methods.
Presentation transcript:

Genetic Algorithms Artificial Life

Genetic Algorithms Inspired by biology Chromosomes Operations Contain genes Describe a entity algorithm Solution Operations Mutation Reproduction Natural selection

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

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 un related to quality It will work with mutation alone Adding crossover improves convergence

Ranking Methods Fitness: 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

G.A. Algorithm development Simulated biology

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

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

Boppers (cont.) Have chromosomes and are G.A. Chromosomes are highly structured Various areas of chromosome supply direct aspects of behavior!