Department of Electronic Engineering NUIG Direct Evolution of Patterns using Genetic Algorithms By: John Brennan Supervisor: John Maher.

Slides:



Advertisements
Similar presentations
Department of Electronic Engineering NUIG Evolving Shapes using Direct & Indirect Encodings By: John Brennan Supervisor: John Maher.
Advertisements

Multi-cellular paradigm The molecular level can support self- replication (and self- repair). But we also need cells that can be designed to fit the specific.
Using Parallel Genetic Algorithm in a Predictive Job Scheduling
CSM6120 Introduction to Intelligent Systems Evolutionary and Genetic Algorithms.
Genetic Algorithms Representation of Candidate Solutions GAs on primarily two types of representations: –Binary-Coded –Real-Coded Binary-Coded GAs must.
EvoNet Flying Circus Introduction to Evolutionary Computation Brought to you by (insert your name) The EvoNet Training Committee The EvoNet Flying Circus.
A GENETIC ALGORITHM APPROACH TO SPACE LAYOUT PLANNING OPTIMIZATION Hoda Homayouni.
Genetic Algorithms for Bin Packing Problem Hazem Ali, Borislav Nikolić, Kostiantyn Berezovskyi, Ricardo Garibay Martinez, Muhammad Ali Awan.
Parallelized Evolution System Onur Soysal, Erkin Bahçeci Erol Şahin Dept. of Computer Engineering Middle East Technical University.
Genetic Algorithms1 COMP305. Part II. Genetic Algorithms.
EvoNet Flying Circus Introduction to Evolutionary Computation Brought to you by (insert your name) The EvoNet Training Committee The EvoNet Flying Circus.
Paper Title Your Name CMSC 838 Presentation. CMSC 838T – Presentation Motivation u Problem paper is trying to solve  Characteristics of problem  … u.
Genetic Algorithms GAs are one of the most powerful and applicable search methods available GA originally developed by John Holland (1975) Inspired by.
Genetic Algorithm for Variable Selection
Interactive Optimization by Genetic Algorithms Cases: Lighting Patterns and Image Enhancement Janne Koljonen Electrical Engineering and Automation, University.
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.
Genetic Algorithms: A Tutorial
Introduction to Programming Prof. Rommel Anthony Palomino Department of Computer Science and Information Technology Spring 2011.
Development in hardware – Why? Option: array of custom processing nodes Step 1: analyze the application and extract the component tasks Step 2: design.
Genetic Algorithm.
1 Evolutionary Growth of Genomes for the Development and Replication of Multi-Cellular Organisms with Indirect Encodings Stefano Nichele and Gunnar Tufte.
Department of Telecommunications MASTER THESIS Nr. 610 INTELLIGENT TRADING AGENT FOR POWER TRADING BASED ON THE REPAST TOOLKIT Ivana Pranjić.
1 Paper Review for ENGG6140 Memetic Algorithms By: Jin Zeng Shaun Wang School of Engineering University of Guelph Mar. 18, 2002.
A Comparison of Nature Inspired Intelligent Optimization Methods in Aerial Spray Deposition Management Lei Wu Master’s Thesis Artificial Intelligence Center.
SOFT COMPUTING (Optimization Techniques using GA) Dr. N.Uma Maheswari Professor/CSE PSNA CET.
Evolution Strategies Evolutionary Programming Genetic Programming Michael J. Watts
GA-Based Feature Selection and Parameter Optimization for Support Vector Machine Cheng-Lung Huang, Chieh-Jen Wang Expert Systems with Applications, Volume.
What is Genetic Programming? Genetic programming is a model of programming which uses the ideas (and some of the terminology) of biological evolution to.
Genetic Algorithms Genetic Algorithms – What are they? And how they are inspired from evolution. Operators and Definitions in Genetic Algorithms paradigm.
Fuzzy Genetic Algorithm
Evolving Virtual Creatures & Evolving 3D Morphology and Behavior by Competition Papers by Karl Sims Presented by Sarah Waziruddin.
1 Machine Learning: Lecture 12 Genetic Algorithms (Based on Chapter 9 of Mitchell, T., Machine Learning, 1997)
1 “Genetic Algorithms are good at taking large, potentially huge search spaces and navigating them, looking for optimal combinations of things, solutions.
FINAL EXAM SCHEDULER (FES) Department of Computer Engineering Faculty of Engineering & Architecture Yeditepe University By Ersan ERSOY (Engineering Project)
Evolutionary Art with Multiple Expression Programming By Quentin Freeman.
Last lecture summary. SOM supervised x unsupervised regression x classification Topology? Main features? Codebook vector? Output from the neuron?
Genetic Algorithms ML 9 Kristie Simpson CS536: Advanced Artificial Intelligence Montana State University.
1 Genetic Algorithms K.Ganesh Introduction GAs and Simulated Annealing The Biology of Genetics The Logic of Genetic Programmes Demo Summary.
Genetic Algorithms An Example Genetic Algorithm Procedure GA{ t = 0; Initialize P(t); Evaluate P(t); While (Not Done) { Parents(t) = Select_Parents(P(t));
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.
Evolutionary Design (2) Boris Burdiliak. Topics Representation Representation Multiple objectives Multiple objectives.
Genetic Algorithms. The Basic Genetic Algorithm 1.[Start] Generate random population of n chromosomes (suitable solutions for the problem) 2.[Fitness]
Chia Y. Han ECECS Department University of Cincinnati Kai Liao College of DAAP University of Cincinnati Collective Pavilions A Generative Architectural.
Solving Function Optimization Problems with Genetic Algorithms September 26, 2001 Cho, Dong-Yeon , Tel:
Chapter 9 Genetic Algorithms Evolutionary computation Prototypical GA
Innovative and Unconventional Approach Toward Analytical Cadastre – based on Genetic Algorithms Anna Shnaidman Mapping and Geo-Information Engineering.
D Nagesh Kumar, IIScOptimization Methods: M8L5 1 Advanced Topics in Optimization Evolutionary Algorithms for Optimization and Search.
Authors: Soamsiri Chantaraskul, Klaus Moessner Source: IET Commun., Vol.4, No.5, 2010, pp Presenter: Ya-Ping Hu Date: 2011/12/23 Implementation.
Genetic algorithms: A Stochastic Approach for Improving the Current Cadastre Accuracies Anna Shnaidman Uri Shoshani Yerach Doytsher Mapping and Geo-Information.
Ch 20. Parameter Control Ch 21. Self-adaptation Evolutionary Computation vol. 2: Advanced Algorithms and Operators Summarized and presented by Jung-Woo.
1 Comparative Study of two Genetic Algorithms Based Task Allocation Models in Distributed Computing System Oğuzhan TAŞ 2005.
Advanced AI – Session 6 Genetic Algorithm By: H.Nematzadeh.
CAP6938 Neuroevolution and Artificial Embryogeny Real-time NEAT Dr. Kenneth Stanley February 22, 2006.
Multi-cellular paradigm The molecular level can support self- replication (and self- repair). But we also need cells that can be designed to fit the specific.
Genetic Algorithms. Solution Search in Problem Space.
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.
Genetic Algorithm (Knapsack Problem)
Introduction to Genetic Algorithms
Genetic Algorithms.
Evolution Strategies Evolutionary Programming
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)
An evolutionary approach to solving complex problems
VISUAL BASIC – CHAPTER ONE NOTES An Introduction to Visual Basic
Aiman H. El-Maleh Sadiq M. Sait Syed Z. Shazli
EE368 Soft Computing Genetic Algorithms.
Genetic Algorithm Soft Computing: use of inexact t solution to compute hard task problems. Soft computing tolerant of imprecision, uncertainty, partial.
Presentation transcript:

Department of Electronic Engineering NUIG Direct Evolution of Patterns using Genetic Algorithms By: John Brennan Supervisor: John Maher

Overview Project Specifications Project Specifications Introduction to Genetic Algorithms Introduction to Genetic Algorithms Flowchart of a Genetic Algorithm Flowchart of a Genetic Algorithm Implicit Embryogeny Implicit Embryogeny Program Design Program Design GUI Design GUI Design GA Parameters GA Parameters

Project Specifications Review of Implicit Embryogeny proposed by Kumar plus 2 other authors Review of Implicit Embryogeny proposed by Kumar plus 2 other authors Write a Java GA to solve 1s max problem Write a Java GA to solve 1s max problem Demonstrate some Java 2D GUI features Demonstrate some Java 2D GUI features Extend the developed GUI to include GA functionality Extend the developed GUI to include GA functionality Design and verify demonstrator of Implicit Embryogeny Design and verify demonstrator of Implicit Embryogeny Include Implicit Embryogeny within the developed GUI Include Implicit Embryogeny within the developed GUI Add additional frame to user to define target phenotype Add additional frame to user to define target phenotype Compare and contrast directly evolved patterns with implicitly derived patterns Compare and contrast directly evolved patterns with implicitly derived patterns Further modify the GUI to integrate in the DEV1 algorithm Further modify the GUI to integrate in the DEV1 algorithm

Introduction to Genetic Algorithms A Genetic Algorithm is a programming technique that imitates biological evolution to solve complex problems A Genetic Algorithm is a programming technique that imitates biological evolution to solve complex problems A GA performs the following: A GA performs the following: It takes a set of potential solutions (a population) It takes a set of potential solutions (a population) Using a selection mechanism new offspring are created from nominated parents Using a selection mechanism new offspring are created from nominated parents Genetic Operators are carried out on the offspring Genetic Operators are carried out on the offspring The fitness of the modified offspring is evaluated The fitness of the modified offspring is evaluated New offspring replaces previous population (a generation) New offspring replaces previous population (a generation)

Flowchart of a Genetic Algorithm GenomeStringFitness A B C Genetic Operators F() Fitness Function Population Altered Offspring Generate Offspring Selection Mechanism - Roulette Wheel - Tournament Evaluated Offspring Generate Parents

Implicit Embryogeny An Embryogeny is a process of growth where genotypes (evolved parameter values) are mapped onto phenotypes (solutions to problems) An Embryogeny is a process of growth where genotypes (evolved parameter values) are mapped onto phenotypes (solutions to problems) Implicit embrogenies uses interacting rules to solve complex problems Implicit embrogenies uses interacting rules to solve complex problems The flow of activation is dynamic, parallel and adaptive The flow of activation is dynamic, parallel and adaptive This project will use a developmental encoding coding to evolve tessellating tiles similar to work completed by Kumar and Bentely This project will use a developmental encoding coding to evolve tessellating tiles similar to work completed by Kumar and Bentely The scalability problem will also be demonstrated as the problem size increases (by increasing the size of the phenotype grid) The scalability problem will also be demonstrated as the problem size increases (by increasing the size of the phenotype grid)

Program Design GUI – to be visually impressive and user friendly GUI – to be visually impressive and user friendly Execute Genetic Algorithms and display results in real time Execute Genetic Algorithms and display results in real time Include frames to perform the following: Include frames to perform the following: Allow user to graphically view GA progress in real time Allow user to graphically view GA progress in real time User can input GA parameters User can input GA parameters Allow user to define target phenotype Allow user to define target phenotype Integrate DEV1 Algorithm Integrate DEV1 Algorithm To be programmed/designed in Java using J2SE and Java Swing To be programmed/designed in Java using J2SE and Java Swing

GUI Design The main display of this program illustrates the ideal evolved tessellated tiles vs. the current output of the processing Genetic Algorithm The progress of the evolving pattern will be displayed in real time as the GA is executed

GA Parameters As explained, the user will be able to input specific parameters for the Genetic Algorithm The GA will be executed according to these constraints Further development will integrate DEV1 Algorithm