Emergent Design Martin HembergImperial College2004Emergent Design.

Slides:



Advertisements
Similar presentations
Population-based metaheuristics Nature-inspired Initialize a population A new population of solutions is generated Integrate the new population into the.
Advertisements

1 An Adaptive GA for Multi Objective Flexible Manufacturing Systems A. Younes, H. Ghenniwa, S. Areibi uoguelph.ca.
Tetris – Genetic Algorithm Presented by, Jeethan & Jun.
Biologically Inspired AI (mostly GAs). Some Examples of Biologically Inspired Computation Neural networks Evolutionary computation (e.g., genetic algorithms)
Genetic Algorithms. Some Examples of Biologically Inspired AI Neural networks Evolutionary computation (e.g., genetic algorithms) Immune-system-inspired.
Genetic Algorithms1 COMP305. Part II. Genetic Algorithms.
Introduction to Genetic Algorithms Yonatan Shichel.
BlueJam Genetic Programming and Evolutionary Algorithms Capturing Creativity with Algorithmic Music Evolutionary Music Composition Machine Learning and.
Genetic Algorithms Learning Machines for knowledge discovery.
Simulation Models as a Research Method Professor Alexander Settles.
Genetic Algorithms Nehaya Tayseer 1.Introduction What is a Genetic algorithm? A search technique used in computer science to find approximate solutions.
Genetic Programming. Agenda What is Genetic Programming? Background/History. Why Genetic Programming? How Genetic Principles are Applied. Examples of.
The Performance of Evolutionary Artificial Neural Networks in Ambiguous and Unambiguous Learning Situations Melissa K. Carroll October, 2004.
Image Registration of Very Large Images via Genetic Programming Sarit Chicotay Omid E. David Nathan S. Netanyahu CVPR ‘14 Workshop on Registration of Very.
Genetic Algorithms Overview Genetic Algorithms: a gentle introduction –What are GAs –How do they work/ Why? –Critical issues Use in Data Mining –GAs.
Prepared by Barış GÖKÇE 1.  Search Methods  Evolutionary Algorithms (EA)  Characteristics of EAs  Genetic Programming (GP)  Evolutionary Programming.
Evolutionary algorithms
Evolutionary Algorithms BIOL/CMSC 361: Emergence Lecture 4/03/08.
Adapting Convergent Scheduling Using Machine Learning Diego Puppin*, Mark Stephenson †, Una-May O’Reilly †, Martin Martin †, and Saman Amarasinghe † *
A Comparison of Nature Inspired Intelligent Optimization Methods in Aerial Spray Deposition Management Lei Wu Master’s Thesis Artificial Intelligence Center.
Soft Computing Lecture 18 Foundations of genetic algorithms (GA). Using of GA.
1 Evolvability Analysis for Evolutionary Robotics Sung-Bae Cho Yonsei University, Korea.
Emergent Design Martin Hemberg Imperial College London Architectural Association.
Evolution Strategies Evolutionary Programming Genetic Programming Michael J. Watts
Improved Gene Expression Programming to Solve the Inverse Problem for Ordinary Differential Equations Kangshun Li Professor, Ph.D Professor, Ph.D College.
Intro. ANN & Fuzzy Systems Lecture 36 GENETIC ALGORITHM (1)
L-Systems and Procedural Plants CSE 3541 Matt Boggus.
Lecture 8: 24/5/1435 Genetic Algorithms Lecturer/ Kawther Abas 363CS – Artificial Intelligence.
Zorica Stanimirović Faculty of Mathematics, University of Belgrade
Genetic Algorithms Michael J. Watts
ART – Artificial Reasoning Toolkit Evolving a complex system Marco Lamieri Spss training day
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.
Neural and Evolutionary Computing - Lecture 9 1 Evolutionary Neural Networks Design  Motivation  Evolutionary training  Evolutionary design of the architecture.
I Robot.
Genetic Algorithms Przemyslaw Pawluk CSE 6111 Advanced Algorithm Design and Analysis
Chapter 9 Genetic Algorithms.  Based upon biological evolution  Generate successor hypothesis based upon repeated mutations  Acts as a randomized parallel.
09/20/04 Introducing Proteins into Genetic Algorithms – CSIMTA'04 Introducing “Proteins” into Genetic Algorithms Virginie LEFORT, Carole KNIBBE, Guillaume.
Introduction to Genetic Algorithms. Genetic Algorithms We’ve covered enough material that we can write programs that use genetic algorithms! –More advanced.
Genetic Algorithms Genetic algorithms provide an approach to learning that is based loosely on simulated evolution. Hypotheses are often described by bit.
1. Genetic Algorithms: An Overview  Objectives - Studying basic principle of GA - Understanding applications in prisoner’s dilemma & sorting network.
Evolutionary Design (2) Boris Burdiliak. Topics Representation Representation Multiple objectives Multiple objectives.
CITS7212: Computational Intelligence An Overview of Core CI Technologies Lyndon While.
D Nagesh Kumar, IIScOptimization Methods: M8L5 1 Advanced Topics in Optimization Evolutionary Algorithms for Optimization and Search.
제 6 주. 응용 -2: Graphics Evolving L-systems to Generate Virtual Creatures G.S. Hornby and J.B. Pollack, Computers & Graphics, vol. 25, pp. 1041~1048, 2001.
1 Autonomic Computer Systems Evolutionary Computation Pascal Paysan.
A field of study that encompasses computational techniques for performing tasks that require intelligence when performed by humans. Simulation of human.
An Introduction to Genetic Algorithms Lecture 2 November, 2010 Ivan Garibay
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.
Estimation of Distribution Algorithm and Genetic Programming Structure Complexity Lab,Seoul National University KIM KANGIL.
Genetic Algorithms And other approaches for similar applications Optimization Techniques.
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.
Introduction to genetic algorithm
Genetic Algorithm in TDR System
Genetic Algorithms.
Introduction to Evolutionary Computing
Evolution Strategies Evolutionary Programming
C.-S. Shieh, EC, KUAS, Taiwan
Boltzmann Machine (BM) (§6.4)
Genetic Algorithm Soft Computing: use of inexact t solution to compute hard task problems. Soft computing tolerant of imprecision, uncertainty, partial.
Population Based Metaheuristics
Coevolutionary Automated Software Correction
Presentation transcript:

Emergent Design Martin HembergImperial College2004Emergent Design

Who's that guy and what's he doing up there? ● Martin Hemberg ● Developed Genr8 with the Emergent Design Group (EDG) ● Work at Emergent Design + Technologies (EmTech) Architectural Association (AA) Martin HembergImperial College2004Emergent Design

Agenda ● Motivation ● Evolutionary Computation (EC) ● Artificial Life (Alife) – EC and Alife combine well for design tasks ● Example applications Design Evolutionary Computation Artificial Life Emergent Design Martin HembergImperial College2004Emergent Design

Motivation, Architecture ● Break new grounds in architecture – ED uses a different logic ● Natural form has aesthetic and functional values ● Hard to obtain using ordinary methods Martin HembergImperial College2004Emergent Design

Motivation, Computer Science ● Application of EC – Exploration, not optimisation – Fitness evaluation ● Use computers creatively – Beyond CAD-tools – Requires new algorithms Martin HembergImperial College2004Emergent Design

Evolutionary Computation ● Optimisation method – Randomized ● Inspired by natural evolution – Population adaption generation by generation ● Comes in many flavours: GA, GP, ES, GE, etc Martin HembergImperial College2004Emergent Design

Neo Darwinian Evolution ● Survival of the fittest ● Selection on phenotype – Through environment ● Genotypic inheritance ● Reproduction ● Blind variation Martin HembergImperial College2004Emergent Design

Artificial Evolution Pseudocode for an EA: generation = 0; initialize population; while generation child; mutate child; insert child into next generation’s population; endfor; generation++; update current population endwhile; Iterate by generation Fitness biased selection Inheritance Variation Martin HembergImperial College2004Emergent Design

Selection ● Selection ensures that fitter individuals have a higher probability of being selected for the next generation – Tournament – Proportional Martin HembergImperial College2004Emergent Design

Fitness ● A leap from natural evolution ● A quantified numerical value is assigned to each member ● Try each member on the problem and rank them or quantify their performance Martin HembergImperial College2004Emergent Design

Fitness Evaluation ● How to assign fitness according to aesthetic criteria? – EA are good at finding optimal solutions – Need to figure out what to optimize ● Open problem Martin HembergImperial College2004Emergent Design

Fitness Evaluation, strategies ● Rule based – Hard to define and encode rules ● Learn user preference with neural network – Too many parameters, fails in practice ● User acts as fitness function – Human fatigue, short runs ● Co-evolve critics Martin HembergImperial College2004Emergent Design

Fitness Evaluation, my view ● Put the user in the loop ● Create tools with the designer in mind – Make them open-ended – Can't predict user's need and context ● Parameterized fitness function – User has high level control of evaluation – Fitness emerges as a combination of factors Martin HembergImperial College2004Emergent Design

What is Artificial Life How does life arise from the non-living? What are the potentials and limits of living systems? How is life related to mind, machines, and culture? Martin HembergImperial College2004Emergent Design

Two definitions of emergence ● The whole is greater than the sum of the parts ● Emergence is the phenomenon wherein complex, interesting high-level function is produced as a result of combining simple low-level mechanisms in simple ways. ● Examples include brain, society Martin HembergImperial College2004Emergent Design

Alife and EC for Design ● Evolutionary computation – Creative and generative qualities – Discovery and adaptation more than optimization ● ALife – Agents interacting with environment can model elements of design and conditions of the problem – Emergent properties in outcome from bottom-up approach The ‘fit’ is powerful and good, but not perfect Martin HembergImperial College2004Emergent Design

Surface Component System ● Simple growth model – Select tiles from a predefined set – Rules for which tiles are allowed ● Incorporates structural analysis in the EA Martin HembergImperial College2004Emergent Design

Using the tool ● Implemented as a MEL script ● FEA in Ansys Martin HembergImperial College2004Emergent Design

Geometric Fitness criteria ● Fast and easy to evaluate and understand – Number of support points – Support point distance – Height – Holes Martin HembergImperial College2004Emergent Design

Structural Fitness criteria ● FEA is computationally costly – Don't evaluate each generation Martin HembergImperial College2004Emergent Design

Genr8 – A Design Tool for Surface Generation ● Combines EC and an organic growth model ● Surface are grown in a reactive simulated physical environment Martin HembergImperial College2004Emergent Design

Lindenmayer Systems ● Organic growth model ● Widely applied to model plant growth in computer graphics ● L-systems are important in formal language theory Martin HembergImperial College2004Emergent Design

Rewriting systems ● A set of production rules are repeatedly applied to a seed ● Rules are expressed as a grammar Seed:a Rule:a->ab b->ba Martin HembergImperial College2004Emergent Design

Turtle Graphics ● Turtle graphics is a way to visualize the grammar – Rules are interpreted as instructions for moving and drawing in 3D space Seed:a Rule:a->a+a--a+a Angle:60 Martin HembergImperial College2004Emergent Design

Plant Models ● Operators “[“ (push state on stack) and “]” (pop state from stack) allows branching – Time delay – Stochasticity – Environmen (tropism) Seed:a Rule:a->a[+a]a Angle:45 Martin HembergImperial College2004Emergent Design

Map L-Systems a -> d[~a]b a b d a b -> b b b c -> b[-~a]b ba b c d -> c dc seed d c b a c b b bb a a d bb b b d c a b b b b b b b a c d b b b b b b b a b b b d c b b b b b b b Bb b c Martin HembergImperial College2004Emergent Design

HEMLS ● 3D ● Scaling ● More complex productions – Context sensitivity – Time variation – Stochastic Martin HembergImperial College2004Emergent Design

Environment ● Forces – Attractors – Repellors – Gravity ● Boundary Martin HembergImperial College2004Emergent Design

Evolution ● Search the universe of possible surfaces – Find a grammar corresponding to the surface that the designer has in mind – Explore the universe to find interesting forms Martin HembergImperial College2004Emergent Design

Grammatical Evolution ● Automatic generation of grammars – Very hard to construct by hand ● Many constraints -> problematic for GP ● Grammatical Evolution allows any language – Use Backus-Naur Form (BNF) to map linear genome into a grammar – Genetic operations are separated from language Martin HembergImperial College2004Emergent Design

Mappings ● Genr8 contains several mappings – Increases the complexity ● Individuals represented by linear genome ● Selection on the phenotype that is expressed through an environment Martin HembergImperial College2004Emergent Design

Design Evaluation and Fitness ● Fitness function with multiple parameters – Size – Smoothness – Soft boundary – Subdivisions – Symmetry – Undulation Martin HembergImperial College2004Emergent Design

Fitness Criteria ● User determines target values and weight for the criteria – Multiparameter optimization – Trade-off between criteria – Population gives a family of solutions Martin HembergImperial College2004Emergent Design

Interruption, Intervention and Resumption (IIR) ● Traditionally, EA are monolithic ● User can guide the evolution by interacting and interfering – Allows for greater control – The tool cooperates with the user Martin HembergImperial College2004Emergent Design

Using Genr8 ● Set up environment ● Define fitness criteria and other parameters ● Run a few generations ● Analyze the results, adjust parameters and environment Martin HembergImperial College2004Emergent Design

More on Emergent Design ● Genr8 website ● EDG website ● EmTech website ● Martin HembergImperial College2004Emergent Design