By Andrew Hilton Advisor: John Rieffel

Slides:

Advertisements

Similar presentations

Evolutionary Learning. Some Examples of Biologically Inspired AI Neural networks Evolutionary computation (e.g., genetic algorithms) Immune-system-inspired.

Advertisements

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.

Toward the Computer-Automated Design of Sophisticated Systems by Enabling Structural Organization Gregory S. Hornby Adaptive Control & Evolvable Systems.

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.

An EA for Box Pushing with a LEGO Mindstorms Robot By Sara L. Skroh December 5, 2003.

Design of Autonomous Navigation Controllers for Unmanned Aerial Vehicles using Multi-objective Genetic Programming Gregory J. Barlow March 19, 2004.

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 (GAs) by Jia-Huei Liao Source: Chapter 9, Machine Learning, Tom M. Mitchell, 1997 The Genetic Programming Tutorial Notebook

Crossover Operation with Different Parents Crossover Operation with Identical Parents.

Evolving "elementary sight" strategies in predators via Genetic programming ICBV Project Lior Becker.

Intro to AI Genetic Algorithm Ruth Bergman Fall 2004.

An Evolutionary Approach To Space Layout Planning Using Genetic Algorithm By: Hoda Homayouni.

Genetic Programming Dinesh Dharme Prateek Srivastav Pankhil Chheda

1 An Overview of Evolutionary Computation 조 성 배 연세대학교 컴퓨터과학과.

Department of Information Technology Indian Institute of Information Technology and Management Gwalior AASF hIQ 1 st Nov ‘09 Department of Information.

Grant Dick Department of Information Science, School of Business, University of Otago, Dunedin, NZ 21/11/2009Australasian.

CSI Evolutionary Computation Fall Semester, 2009.

Genetic algorithms Prof Kang Li

Artificial Life and Evolving Intelligence Laura M. Grabowski, Ph.D. Department of Computer Science The University of Texas-Pan American.

Evolving Scalable Soft Robots Senior Thesis Presentation Ben Berger Advisor: John Rieffel.

Lecture 8: 24/5/1435 Genetic Algorithms Lecturer/ Kawther Abas 363CS – Artificial Intelligence.

What is Genetic Programming? Genetic programming is a model of programming which uses the ideas (and some of the terminology) of biological evolution to.

Informatics I-586 – Artificial Life as an approach to Artificial Intelligence Scott McCaulay Applications of Artificial Life Methods in the Study of Music.

Genetic Algorithms K.Ganesh Reasearch Scholar, Ph.D., Industrial Management Division, Humanities and Social Sciences Department, Indian Institute of Technology.

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)

Neural and Evolutionary Computing - Lecture 9 1 Evolutionary Neural Networks Design  Motivation  Evolutionary training  Evolutionary design of the architecture.

CAP6938 Neuroevolution and Developmental Encoding Developmental Encoding Dr. Kenneth Stanley October 2, 2006.

Genetic Algorithms. Evolutionary Methods Methods inspired by the process of biological evolution. Main ideas: Population of solutions Assign a score or.

Genetic Algorithms ML 9 Kristie Simpson CS536: Advanced Artificial Intelligence Montana State University.

Evolving the goal priorities of autonomous agents Adam Campbell* Advisor: Dr. Annie S. Wu* Collaborator: Dr. Randall Shumaker** School of Electrical Engineering.

Autonomous Virtual Humans Tyler Streeter. Contents Introduction Introduction Implementation Implementation –3D Graphics –Simulated Physics –Neural Networks.

Chapter 12 FUSION OF FUZZY SYSTEM AND GENETIC ALGORITHMS Chi-Yuan Yeh.

CSI Evolutionary Computation Fall Semester, 2011.

Evolutionary Robotics The Genotype-to-Phenotype Map The genotype to phenotype map: the algorithm that transforms the genotype into the phenotype. Direct.

Self-Replicating Machines Source: NASA Conference Publication 2255 (1982), based on the Advanced Automation for Space Missions NASA/ASEE summer study Held.

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.

Evolving CPPNs to Grow Three- Dimensional Physical Structures Joshua E. Auerbach Josh C. Bongard GECCO 2010 – Portland, Oregon Evolving CPPNs to Grow Three-Dimensional.

Genetic Algorithm (Knapsack Problem)

CSE 4705 Artificial Intelligence

-A introduction with an example

Selected Topics in CI I Genetic Programming Dr. Widodo Budiharto 2014.

Genetic Algorithms.

Introduction to Evolutionary Computing

Evolutionary Algorithms Jim Whitehead

Andrew Danise Advisor: Prof. John Rieffel

CAP6938 Neuroevolution and Artificial Embryogeny Artificial Embryogeny

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.

Daniil Chivilikhin and Vladimir Ulyantsev

Genetic Algorithms GAs are one of the most powerful and applicable search methods available GA originally developed by John Holland (1975) Inspired by.

Advanced Artificial Intelligence Evolutionary Search Algorithm

Yu-Chi Ho Jonathan T. Lee Harvard University Sep. 7, 2000

Genetic Algorithms Artificial Life

Evolutionary Robotics and Open-Ended Design Automation

دانشگاه صنعتی امیرکبیر

GENETIC ALGORITHMS & MACHINE LEARNING

Evolving Logical-Linear Edge Detector with Evolutionary Algorithms

Dr. Unnikrishnan P.C. Professor, EEE

EE368 Soft Computing Genetic Algorithms.

A Gentle introduction Richard P. Simpson

Machine Learning: UNIT-4 CHAPTER-2

Applications of Genetic Algorithms TJHSST Computer Systems Lab

Lecture 4. Niching and Speciation (1)

Coevolutionary Automated Software Correction

Presentation transcript:

By Andrew Hilton Advisor: John Rieffel Evolving “Skate Guts” By Andrew Hilton Advisor: John Rieffel

Biological Motivation

What properties of biologically inspired optimization problems lead to the evolution of “interesting” 3D shapes?

Why Genetic Algorithms? Gregory. S. Hornby, Jason D. Lohn, and Derek S. Linden. 2011. Computer-automated evolution of an x-band antenna for nasa's space technology 5 mission. Evol. Comput. 19, 1 (March 2011), 1-23. DOI=http://dx.doi.org/10.1162/EVCO_a_00005 http://www.demo.cs.brandeis.edu/pr/evo_design/static.html

Why Genetic Algorithms? M. Toussaint: Demonstrating the Evolution of Complex Genetic Representations: An Evolution of Artificial Plants. In Genetic and Evolutionary Computation Conf. (GECCO 2003), 86-97, 2003.

A Face-Encoded Tetrahedral Grammar Smith, S., and Rieffel, J. (2010) "A Face-Encoding Grammar for the Generation of Tetrahedral-Mesh Soft Bodies". Proceedings of the 12th International Conference on the Synthesis and Simulation of Living Systems (ALIFE12). MIT Press. 414--420.

Implementation Python 3 Removed Subdivide Added Rest STL Outputs Reimplemented Grammar System Built Evolutionary System Python 3 Removed Subdivide Added Rest STL Outputs Uniform Cross Fine and Coarse Mutation Multiprocess Support

What kinds of measures of fitness lead to qualitatively interesting 3D shapes?

Some Results - Surface Area / Bounded Volume A → relabel(A) B → rest( ) C → relabel(A) D → relabel(A) E → relabel(E) F → relabel(E) Generations : 100 Population : 50 Time : 10

Some Results - Bounded Volume / Convex Hull Volume A → grow(DFA) B → rest( ) C → rest( ) D → rest( ) E → relabel(A) F → relabel(F) Generations : 25 Population : 20 Time : 8

Some Results - Max Convex Hull Volume A → grow(ADD) B → relabel(A) C → grow(CFD) D → grow(DEE) E → grow(FFC) F → grow(DCF) Generations : 25 Population : 20 Time : 8

Some Results - Bounded Volume / # Faces A → grow(ABD) B → rest( ) C → relabel(E) D → grow(BED) E → relabel(E) F → relabel(D) Generations : 50 Population : 25 Time : 8

What this means...

Any Questions?