Evolutionary Robotics NEAT / HyperNEAT Stanley, K.O., Miikkulainen (2001) Evolving Neural Networks through Augmenting Topologies. Competing Conventions:

Slides:



Advertisements
Similar presentations
© Negnevitsky, Pearson Education, Lecture 12 Hybrid intelligent systems: Evolutionary neural networks and fuzzy evolutionary systems Introduction.
Advertisements

Biologically Inspired Computing: Operators for Evolutionary Algorithms
Exact and heuristics algorithms
Genetic Algorithms, Part 2. Evolving (and co-evolving) one-dimensional cellular automata to perform a computation.
Neuro-Evolution of Augmenting Topologies Ben Trewhella.
Genetic Algorithms. Some Examples of Biologically Inspired AI Neural networks Evolutionary computation (e.g., genetic algorithms) Immune-system-inspired.
Non-Linear Problems General approach. Non-linear Optimization Many objective functions, tend to be non-linear. Design problems for which the objective.
Evolving Neural Network Agents in the NERO Video Game Author : Kenneth O. Stanley, Bobby D. Bryant, and Risto Miikkulainen Presented by Yi Cheng Lin.
An EA for Box Pushing with a LEGO Mindstorms Robot By Sara L. Skroh December 5, 2003.
1. 2 overview Background on video games Background on video games Neural networks Neural networks NE NE NEAT NEAT rtNEAT rtNEAT NERO NERO.
Genetic Algorithm What is a genetic algorithm? “Genetic Algorithms are defined as global optimization procedures that use an analogy of genetic evolution.
Chapter 6: Transform and Conquer Genetic Algorithms The Design and Analysis of Algorithms.
Coordinative Behavior in Evolutionary Multi-agent System by Genetic Algorithm Chuan-Kang Ting – Page: 1 International Graduate School of Dynamic Intelligent.
Evolving Motor Techniques for Artificial Life Kelley Hecker, Period 7.
Prepared by Barış GÖKÇE 1.  Search Methods  Evolutionary Algorithms (EA)  Characteristics of EAs  Genetic Programming (GP)  Evolutionary Programming.
Genetic Algorithms and Ant Colony Optimisation
Evolving a Sigma-Pi Network as a Network Simulator by Justin Basilico.
Slides are based on Negnevitsky, Pearson Education, Lecture 12 Hybrid intelligent systems: Evolutionary neural networks and fuzzy evolutionary systems.
Introduction to Genetic Algorithms and Evolutionary Computation
Soft Computing Lecture 18 Foundations of genetic algorithms (GA). Using of GA.
SOFT COMPUTING (Optimization Techniques using GA) Dr. N.Uma Maheswari Professor/CSE PSNA CET.
Neural Network Hopfield model Kim, Il Joong. Contents  Neural network: Introduction  Definition & Application  Network architectures  Learning processes.
CAP6938 Neuroevolution and Developmental Encoding Working with NEAT Dr. Kenneth Stanley September 27, 2006.
Genetic Algorithms Michael J. Watts
Soft Robotics Evolve the body and brain of `soft’ robots. N Cheney, R MacCurdy, J Clune, H Lipson. Unshackling Evolution: Evolving Soft Robots with Multiple.
Arindam K. Das CIA Lab University of Washington Seattle, WA MINIMUM POWER BROADCAST IN WIRELESS NETWORKS.
More on Heuristics Genetic Algorithms (GA) Terminology Chromosome –candidate solution - {x 1, x 2,...., x n } Gene –variable - x j Allele –numerical.
EE459 I ntroduction to Artificial I ntelligence Genetic Algorithms Kasin Prakobwaitayakit Department of Electrical Engineering Chiangmai University.
CAP6938 Neuroevolution and Developmental Encoding Real-time NEAT Dr. Kenneth Stanley October 18, 2006.
Mike Taks Bram van de Klundert. About Published 2005 Cited 286 times Kenneth O. Stanley Associate Professor at University of Central Florida Risto Miikkulainen.
1 Genetic Algorithms and Ant Colony Optimisation.
G ENETIC A LGORITHM. S IMULATED E VOLUTION We need the following Representation of an individual Fitness Function Reproduction Method Selection Criteria.
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
Evolving Motor Techniques for Artificial Life Kelley Hecker, Period 7.
 Based on observed functioning of human brain.  (Artificial Neural Networks (ANN)  Our view of neural networks is very simplistic.  We view a neural.
Introduction to Genetic Algorithms. Genetic Algorithms We’ve covered enough material that we can write programs that use genetic algorithms! –More advanced.
Genetic Algorithms What is a GA Terms and definitions Basic algorithm.
Pac-Man AI using GA. Why Machine Learning in Video Games? Better player experience Agents can adapt to player Increased variety of agent behaviors Ever-changing.
Genetic Algorithms. The Basic Genetic Algorithm 1.[Start] Generate random population of n chromosomes (suitable solutions for the problem) 2.[Fitness]
CITS7212: Computational Intelligence An Overview of Core CI Technologies Lyndon While.
CAP6938 Neuroevolution and Developmental Encoding Evolving Adaptive Neural Networks Dr. Kenneth Stanley October 23, 2006.
CAP6938 Neuroevolution and Artificial Embryogeny Evolving Adaptive Neural Networks Dr. Kenneth Stanley March 1, 2006.
GENETIC ALGORITHM Basic Algorithm begin set time t = 0;
Innovative and Unconventional Approach Toward Analytical Cadastre – based on Genetic Algorithms Anna Shnaidman Mapping and Geo-Information Engineering.
CAP6938 Neuroevolution and Developmental Encoding Intro to Neuroevolution Dr. Kenneth Stanley September 18, 2006.
Evolutionary Robotics The Genotype-to-Phenotype Map The genotype to phenotype map: the algorithm that transforms the genotype into the phenotype. Direct.
N- Queens Solution with Genetic Algorithm By Mohammad A. Ismael.
The Standard Genetic Algorithm Start with a “population” of “individuals” Rank these individuals according to their “fitness” Select pairs of individuals.
CAP6938 Neuroevolution and Artificial Embryogeny Approaches to Neuroevolution Dr. Kenneth Stanley February 1, 2006.
CAP6938 Neuroevolution and Artificial Embryogeny Evolutionary Computation Theory Dr. Kenneth Stanley January 25, 2006.
Robot Intelligence Technology Lab. 10. Complex Hardware Morphologies: Walking Machines Presented by In-Won Park
CAP6938 Neuroevolution and Artificial Embryogeny Real-time NEAT Dr. Kenneth Stanley February 22, 2006.
An Evolutionary Algorithm for Neural Network Learning using Direct Encoding Paul Batchis Department of Computer Science Rutgers University.
George Yauneridge.  Machine learning basics  Types of learning algorithms  Genetic algorithm basics  Applications and the future of genetic algorithms.
Evolutionary Design of the Closed Loop Control on the Basis of NN-ANARX Model Using Genetic Algoritm.
March 1, 2016Introduction to Artificial Intelligence Lecture 11: Machine Evolution 1 Let’s look at… Machine Evolution.
Presented By: Farid, Alidoust Vahid, Akbari 18 th May IAUT University – Faculty.
 Negnevitsky, Pearson Education, Lecture 12 Hybrid intelligent systems: Evolutionary neural networks and fuzzy evolutionary systems n Introduction.
Evolving CPPNs to Grow Three- Dimensional Physical Structures Joshua E. Auerbach Josh C. Bongard GECCO 2010 – Portland, Oregon Evolving CPPNs to Grow Three-Dimensional.
CAP6938 Neuroevolution and Artificial Embryogeny Real-time NEAT Dr. Kenneth Stanley February 22, 2006.
Genetic Algorithm (Knapsack Problem)
Dr. Kenneth Stanley January 30, 2006
HyperNetworks Engın denız usta
Dr. Kenneth Stanley September 13, 2006
Dr. Kenneth Stanley September 25, 2006
Multy- Objective Differential Evolution (MODE)
Dr. Kenneth Stanley September 20, 2006
Introduction to Artificial Intelligence Lecture 11: Machine Evolution
Dr. Kenneth Stanley February 6, 2006
Presentation transcript:

Evolutionary Robotics NEAT / HyperNEAT Stanley, K.O., Miikkulainen (2001) Evolving Neural Networks through Augmenting Topologies. Competing Conventions: Two neural networks: Both encode the same function; Have different conventions for doing so. No matter how they’re crossed, their children will lack information.

Evolutionary Robotics NEAT / HyperNEAT Stanley, K.O., Miikkulainen (2001) Evolving Neural Networks through Augmenting Topologies. Genetic encoding of neural networks in (N)euro(e)evolution of (A)ugmenting (T)opologies: (NEAT)

Evolutionary Robotics NEAT / HyperNEAT Stanley, K.O., Miikkulainen (2001) Evolving Neural Networks through Augmenting Topologies. Historical Markings: Keep a global counter; every time a neuron or synapse is added, assign the value of the counter, and increment it. Genes/synapses can be disabled, but remain in the genome.

Evolutionary Robotics NEAT / HyperNEAT Stanley, K.O., Miikkulainen (2001) Evolving Neural Networks through Augmenting Topologies. NEAT designed so That crossover is (1)Algorithmically simple and (2) Produces children that are similar to their parents.

Evolutionary Robotics NEAT / HyperNEAT Stanley, K.O., Miikkulainen (2001) Evolving Neural Networks through Augmenting Topologies. Take two parent NNs: Line up connection genes according to their historical markings. For matching genes, copy either gene into child at random. Disjoint genes (those in the middle without a partner gene) Excess genes (those at the end)

Evolutionary Robotics NEAT / HyperNEAT Clune, J. et al. (2009) Evolving Coordinated Quadruped Gaits with the HyperNEAT Generative Encoding HyperNEAT: Evolves neural networks (compositional pattern-producing networks) that produce regular patterns spatially:

Evolutionary Robotics NEAT / HyperNEAT Clune, J. et al. (2009) Evolving Coordinated Quadruped Gaits with the HyperNEAT Generative Encoding HyperNEAT: HyperNEAT “paints” regular patterns on to a hypercube. The dimensionality of the hypercube is determined by the dimension of the input coordinates.

Evolutionary Robotics NEAT / HyperNEAT Clune, J. et al. (2009) Evolving Coordinated Quadruped Gaits with the HyperNEAT Generative Encoding HyperNEAT can be used to “paint” weights on to synapses of a second neural network. Requires that each neuron and synapse have a 3D location:

Evolutionary Robotics NEAT / HyperNEAT Clune, J. et al. (2009) Evolving Coordinated Quadruped Gaits with the HyperNEAT Generative Encoding HyperNEAT can be used to “paint” weights on to synapses of a second neural network. …why do this, if NEAT already evolves neural networks?

Evolutionary Robotics NEAT / HyperNEAT Clune, J. et al. (2009) Evolving Coordinated Quadruped Gaits with the HyperNEAT Generative Encoding Compare HyperNEAT to NEAT: FT-NEAT: Fixed Topology NEAT. Use same NN as in HyperNEAT; allow for mutation and crossover, but not the addition/removal of neurons/synapses.

Evolutionary Robotics NEAT / HyperNEAT Clune, J. et al. (2009) Evolving Coordinated Quadruped Gaits with the HyperNEAT Generative Encoding Results from evolving locomotion.

Evolutionary Robotics NEAT / HyperNEAT Clune, J. et al. (2009) Evolving Coordinated Quadruped Gaits with the HyperNEAT Generative Encoding HyperNEAT repeatedly finds regular gaits; FT-NEAT does not.

Evolutionary Robotics NEAT / HyperNEAT Clune, J. et al. (2009) Evolving Coordinated Quadruped Gaits with the HyperNEAT Generative Encoding For mutations, mean fitness of children compared to parents: HyperNEAT: FT-NEAT: but HyperNEAT tends to create more fit children than FT-NEAT...why? It also creates much worse children, but these are discarded.

Evolutionary Robotics NEAT / HyperNEAT Clune, J. et al. (2009) Evolving Coordinated Quadruped Gaits with the HyperNEAT Generative Encoding If children are produced by crossover… In HyperNEAT, offspring tend to be more like their parents than in FT-NEAT. …why?