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

Slides:



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

Using Parallel Genetic Algorithm in a Predictive Job Scheduling
1 Evolutionary Computational Inteliigence Lecture 6b: Towards Parameter Control Ferrante Neri University of Jyväskylä.
Tuesday, May 14 Genetic Algorithms Handouts: Lecture Notes Question: when should there be an additional review session?
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.
1 Wendy Williams Metaheuristic Algorithms Genetic Algorithms: A Tutorial “Genetic Algorithms are good at taking large, potentially huge search spaces and.
Genetic Algorithms for Bin Packing Problem Hazem Ali, Borislav Nikolić, Kostiantyn Berezovskyi, Ricardo Garibay Martinez, Muhammad Ali Awan.
Genetic Algorithms1 COMP305. Part II. Genetic Algorithms.
Efficient Moving Object Segmentation Algorithm Using Background Registration Technique Shao-Yi Chien, Shyh-Yih Ma, and Liang-Gee Chen, Fellow, IEEE Hsin-Hua.
EvoNet Flying Circus Introduction to Evolutionary Computation Brought to you by (insert your name) The EvoNet Training Committee The EvoNet Flying Circus.
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
Genetic Algorithms: A Tutorial
FEATURE EXTRACTION FOR JAVA CHARACTER RECOGNITION Rudy Adipranata, Liliana, Meiliana Indrawijaya, Gregorius Satia Budhi Informatics Department, Petra Christian.
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.
A Budget Constrained Scheduling of Workflow Applications on Utility Grids using Genetic Algorithms Jia Yu and Rajkumar Buyya Grid Computing and Distributed.
1 Evolutionary Growth of Genomes for the Development and Replication of Multi-Cellular Organisms with Indirect Encodings Stefano Nichele and Gunnar Tufte.
1 Paper Review for ENGG6140 Memetic Algorithms By: Jin Zeng Shaun Wang School of Engineering University of Guelph Mar. 18, 2002.
Java Software Solutions Lewis and Loftus Chapter 10 1 Copyright 1997 by John Lewis and William Loftus. All rights reserved. Graphical User Interfaces --
Evolution Strategies Evolutionary Programming Genetic Programming Michael J. Watts
Hierarchical Distributed Genetic Algorithm for Image Segmentation Hanchuan Peng, Fuhui Long*, Zheru Chi, and Wanshi Siu {fhlong, phc,
GA-Based Feature Selection and Parameter Optimization for Support Vector Machine Cheng-Lung Huang, Chieh-Jen Wang Expert Systems with Applications, Volume.
Genetic Algorithms Genetic Algorithms – What are they? And how they are inspired from evolution. Operators and Definitions in Genetic Algorithms paradigm.
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.
FINAL EXAM SCHEDULER (FES) Department of Computer Engineering Faculty of Engineering & Architecture Yeditepe University By Ersan ERSOY (Engineering Project)
GENETIC ALGORITHM A biologically inspired model of intelligence and the principles of biological evolution are applied to find solutions to difficult problems.
Learning by Simulating Evolution Artificial Intelligence CSMC February 21, 2002.
Last lecture summary. SOM supervised x unsupervised regression x classification Topology? Main features? Codebook vector? Output from the neuron?
DYNAMIC FACILITY LAYOUT : GENETIC ALGORITHM BASED MODEL
Introduction to Genetic Algorithms. Genetic Algorithms We’ve covered enough material that we can write programs that use genetic algorithms! –More advanced.
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.
Evolutionary Design (2) Boris Burdiliak. Topics Representation Representation Multiple objectives Multiple objectives.
Evolutionary Art (What we did on our holidays) David Broadhurst Dan Costelloe Lynne Jones Pantelis Nasikas Joanne Walker.
Solving Function Optimization Problems with Genetic Algorithms September 26, 2001 Cho, Dong-Yeon , Tel:
Introduction Genetic programming falls into the category of evolutionary algorithms. Genetic algorithms vs. genetic programming. Concept developed by John.
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.
Application of the GA-PSO with the Fuzzy controller to the robot soccer Department of Electrical Engineering, Southern Taiwan University, Tainan, R.O.C.
Affinity Based Model of Multicellular Development Oisín Mac Aodha 4ECE 02/04/2007.
Agenda  INTRODUCTION  GENETIC ALGORITHMS  GENETIC ALGORITHMS FOR EXPLORING QUERY SPACE  SYSTEM ARCHITECTURE  THE EFFECT OF DIFFERENT MUTATION RATES.
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.
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.
Grid-Based Genetic Algorithm Approach to Colour Image Segmentation Marco Gallotta Keri Woods Supervised by Audrey Mbogho.
An Evolutionary Algorithm for Neural Network Learning using Direct Encoding Paul Batchis Department of Computer Science Rutgers University.
Genetic Algorithm. Outline Motivation Genetic algorithms An illustrative example Hypothesis space search.
Genetic (Evolutionary) Algorithms CEE 6410 David Rosenberg “Natural Selection or the Survival of the Fittest.” -- Charles Darwin.
Intelligent Database Systems Lab 國立雲林科技大學 National Yunlin University of Science and Technology 1 Intelligent Exploration for Genetic Algorithms Using Self-Organizing.
Genetic Algorithm (Knapsack Problem)
Genetic Algorithm in TDR System
Genetic Algorithms.
Evolution Strategies Evolutionary Programming
Artificial Intelligence Methods (AIM)
Bulgarian Academy of Sciences
Balancing of Parallel Two-Sided Assembly Lines via a GA based Approach
An evolutionary approach to solving complex problems
Example: Applying EC to the TSP Problem
○ Hisashi Shimosaka (Doshisha University)
Dr. Kenneth Stanley February 6, 2006
Aiman H. El-Maleh Sadiq M. Sait Syed Z. Shazli
EE368 Soft Computing Genetic Algorithms.
Traveling Salesman Problem by Genetic Algorithm
Presentation transcript:

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

Aim of Project To compare and contrast the use of Direct and Indirect Encoding methods to evolve shapes To develop a visually impressive GUI to demonstrate the evolving shapes in real time To facilitate user input of evolution parameters in the developed GUI

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

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

Flowchart of a Genetic Algorithm

GA Structure using Direct Encoding

The Scalability Problem As the size of the problem increases it reaches a point where the GA will become too inefficient to run (shown by the table below) It is therefore necessary to implement an alternative encoding method to combat the problem of scalability Phenotype Grid SizeNo. of bitsApproximate Generations 2x241 4x4166 8x x ,000+

Implicit Embryogeny An Embryogeny is a process of growth where genotypes are mapped onto phenotypes Implicit Embryogeny is a process which uses interacting rules to solve complex problems Each genotype consists of a number of rules, and each rule has a precondition and an action If the preconditions are met, i.e. they exceed a preset threshold, the action is carried out. The growth is carried out in a phenotype grid

Implicit Embryogeny Flowchart

GA Structure using Indirect Encoding

Program Design A Java based experimental platform has been developed as part of this project Used to visually demonstrate how the shape is evolving in Real Time Genetic Algorithm cycles through the generations in a background process Used to carry out experiments to demonstrate the differences between direct and indirect encoding methods

GUI Design

GUI Main Panel The main panel of this GUI displays two grids the one on the right displays the target phenotype shape the one on the left displays the current mapping of the genotype to phenotype The target phenotype can be selected from a number of predefined shapes which are hard coded into the application

GUI Main Panel

GUI Parameters Panel The user can select if the phenotype grid should be developed using a direct or an indirect encoding method Only text fields relevant to the current encoding technique are editable It is dependant of the selection of a radio button which determines which text fields are masked and which can be edited Changes in these values can have a significant effect on the results of the GA

GUI Parameters Panel

Results from Experiments The experiments were performed ten times in order to obtain the average performance GA performs well without the use of an embryogeny for smaller grid sizes but it does not scale well Results show the improved performance with the implementation of using an embryogeny 4x4 Grid = 16 bits8x8 Grid = 64 bits16x16 Grid = 64 bits MethodAverage Fitness No Embryogeny Implicit Embyrogeny

Conclusions Use of indirect encoding methods to evolve shapes proved to show a much higher level of performance It has also proven that the scalability problem does not affect the evolution of a phenotype which used Implicit Embryogeny to develop the desired shape. This encoding method does have its disadvantages It does not retain the same diversity possessed by a phenotype evolved without using an embryogeny

Questions?