제 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.

Slides:



Advertisements
Similar presentations
Ali Husseinzadeh Kashan Spring 2010
Advertisements

Jason Stredwick, MSU 2004 L-Systems Lindenmayer Systems algorithmicbotany.org.
Student : Mateja Saković 3015/2011.  Genetic algorithms are based on evolution and natural selection  Evolution is any change across successive generations.
Bio-Inspired Optimization. Our Journey – For the remainder of the course A brief review of classical optimization methods The basics of several stochastic.
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.
Date:2011/06/08 吳昕澧 BOA: The Bayesian Optimization Algorithm.
1. Elements of the Genetic Algorithm  Genome: A finite dynamical system model as a set of d polynomials over  2 (finite field of 2 elements)  Fitness.
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.
Genetic Algorithms Nehaya Tayseer 1.Introduction What is a Genetic algorithm? A search technique used in computer science to find approximate solutions.
Genetic Algorithm What is a genetic algorithm? “Genetic Algorithms are defined as global optimization procedures that use an analogy of genetic evolution.
16 November, 2005 Statistics in HEP, Manchester 1.
Coordinative Behavior in Evolutionary Multi-agent System by Genetic Algorithm Chuan-Kang Ting – Page: 1 International Graduate School of Dynamic Intelligent.
From Extropians to Evolutionary Robotics Simon D. Levy PHIL April 2013 What Machines (Don't) Tell Us About (Trans)Human Nature.
Genetic Algorithms Overview Genetic Algorithms: a gentle introduction –What are GAs –How do they work/ Why? –Critical issues Use in Data Mining –GAs.
Morphogenesis and Lindenmayer Systems (L-systems) Gabriela Ochoa
EVOLVING ANTS Enrique Areyan School of Informatics and Computing Indiana University January 24, 2012.
컴퓨터 그래픽스 분야의 캐릭터 자동생성을 위하여 인공생명의 여러 가지 방법론이 어떻게 적용될 수 있는지 이해
Evolutionary Algorithms BIOL/CMSC 361: Emergence Lecture 4/03/08.
Charles L. Karr Rodney Bowersox Vishnu Singh
Evolving a Sigma-Pi Network as a Network Simulator by Justin Basilico.
Adapting Simulated Behaviors For New Characters Jessica K. Hodgins and Nancy S. Pollard presentation by Barış Aksan.
Introduction to Genetic Algorithms and Evolutionary Computation
Evolution Strategies Evolutionary Programming Genetic Programming Michael J. Watts
Spacetime Constraints Revisited Joe Marks J. Thomas Ngo Using genetic algorithms to find solutions to spacetime constraint problems in 2D.
L-Systems and Procedural Plants CSE 3541 Matt Boggus.
More on coevolution and learning Jing Xiao April, 2008.
Lecture 8: 24/5/1435 Genetic Algorithms Lecturer/ Kawther Abas 363CS – Artificial Intelligence.
Different Varieties of Genetic Programming Je-Gun Joung.
Boltzmann Machine (BM) (§6.4) Hopfield model + hidden nodes + simulated annealing BM Architecture –a set of visible nodes: nodes can be accessed from outside.
What is Genetic Programming? Genetic programming is a model of programming which uses the ideas (and some of the terminology) of biological evolution to.
Evolutionary Robotics Using A Formal Grammar To Evolve Robot Bodies and Brains Hornby, G.S., Pollack, J. (2001) Creating high-level components with a generative.
제 6 주. 응용 -2: Graphics Artificial Life for Computer Graphics D. Terzopoulos, Communications of the ACM, vol. 42, no. 8, pp. 33~42, 1999 학습목표 Understanding.
Evolving Virtual Creatures & Evolving 3D Morphology and Behavior by Competition Papers by Karl Sims Presented by Sarah Waziruddin.
Neural and Evolutionary Computing - Lecture 9 1 Evolutionary Neural Networks Design  Motivation  Evolutionary training  Evolutionary design of the architecture.
Derivative Free Optimization G.Anuradha. Contents Genetic Algorithm Simulated Annealing Random search method Downhill simplex method.
Evolving Motor Techniques for Artificial Life Kelley Hecker Period 7.
Evolving Virtual Creatures by Karl Sims (1995) Adelein Rodriguez.
Autonomous Virtual Humans Tyler Streeter. Contents Introduction Introduction Implementation Implementation –3D Graphics –Simulated Physics –Neural Networks.
Genetic Algorithms CSCI-2300 Introduction to Algorithms
Edge Assembly Crossover
Chapter 12 FUSION OF FUZZY SYSTEM AND GENETIC ALGORITHMS Chi-Yuan Yeh.
1. Genetic Algorithms: An Overview  Objectives - Studying basic principle of GA - Understanding applications in prisoner’s dilemma & sorting network.
1. Genetic Algorithms: An Overview 4 학습목표 GA 의 기본원리를 파악하고, Prisoner’s dilemma 와 sorting network 에의 응용 및 이론적 배경을 이해한 다.
Emergent Design Martin HembergImperial College2004Emergent Design.
제 2 주. 인공생명의 개요 Research into models and algorithms of artificial life H. Jiyang, H. Haiying and F. Yongzhe, Artificial Intelligence in Engineering, vol.
Genetic Algorithm Dr. Md. Al-amin Bhuiyan Professor, Dept. of CSE Jahangirnagar University.
제 9 주. 응용 -4: Robotics Synthesis of Autonomous Robots through Evolution S. Nolfi and D. Floreano, Trends in Cognitive Science, vol. 6, no. 1, pp. 31~37,
Artificial Intelligence By Mr. Ejaz CIIT Sahiwal Evolutionary Computation.
Robot Intelligence Technology Lab. 10. Complex Hardware Morphologies: Walking Machines Presented by In-Won Park
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.
제 9 주. 응용 -4: Robotics Artificial Life and Real Robots R.A. Brooks, Proc. European Conference on Artificial Life, pp. 3~10, 1992 학습목표 시뮬레이션 로봇과 실제 로봇을.
An Evolutionary Algorithm for Neural Network Learning using Direct Encoding Paul Batchis Department of Computer Science Rutgers University.
Grammars, L-Systems Jim Whitehead UC Santa Cruz School of Engineering courses.soe.ucsc.edu/courses/cmps265/Spring14/01 23 Apr 2014.
Genetic Algorithm. Outline Motivation Genetic algorithms An illustrative example Hypothesis space search.
Presented By: Farid, Alidoust Vahid, Akbari 18 th May IAUT University – Faculty.
1 A genetic algorithm with embedded constraints – An example on the design of robust D-stable IIR filters 潘欣泰 國立高雄大學 資工系.
Evolutionary Computation Evolving Neural Network Topologies.
Introduction to genetic algorithm
Genetic Algorithm in TDR System
Genetic Algorithms.
Evolution Strategies Evolutionary Programming
USING MICROBIAL GENETIC ALGORITHM TO SOLVE CARD SPLITTING PROBLEM.
A Study of Genetic Algorithms for Parameter Optimization
Basics of Genetic Algorithms (MidTerm – only in RED material)
Methods and Materials (cont.)
EE368 Soft Computing Genetic Algorithms.
Review NNs Processing Principles in Neuron / Unit
Presentation transcript:

제 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 학습목표 그래픽분야의 인공생명 응용에 대한 실제적인 구현 예를 이해 함으로써 총정리 Creature construction  L-system  GA

개요 4 Virtual creature 의 역할 –Special effects and background characters 4 Evolutionary algorithm –Reduce difficulty and time to specify morphologies and behaviors 4 Limitation of conventional approach –Scalability beyond creatures with 50 components –Unnatural looking 4 Proposed method –Lindenmayer systems as the encoding of EA to create virtual creatures –Create creatures with hundreds of parts and more natural looking

Introduction 4 Factors to limit the richness of virtual worlds –Computing power  design ability 4 Evolutionary algorithms –Promising in automating the process of producing creatures –Direct encoding  one-to-one mapping No re-use, asymmetries, non-regularities  unnatural looking 4 Solution  graph structure (like Karl Sims) –Generative encoding for creatures –Developmental method with a set of grammatical re-writing rules –Fractal-like self-similarities  organic look & better scalability –Lindenmayer systems 4 Evolving controllers for pre-specified morphologies –Stimulus-response rules, neural controllers, genetic programs  oscillator circuits : with frequency and relative phase offset  recurrent neural networks

Methods: Overview 4 Components to produce moving creatures –Evolutionary algorithms: to optimize creature design Stochastic search & optimization inspired by natural evolution Iteratively replacing poor members with individual generated by applying variation to good members of population –L-systems: encoding to represent creatures for optimization Set of grammatical rewriting rules to model biological development Iteratively applying the rules to create complex string from simpler ones Characters for L-system  set of construction commands –Creature constructor: to construct creatures from encoding Follow string of construction commands to build creature piece by piece Evaluate how well it moves  pass the score to EA

Creature Constructor 4 Morphology –Bars connected by either fixed or actuated joints –Construction commands: specify how and where to attach bars to the existing design  LOGO-style turtle 4 Command language –Push and pop operators: [, ] Current location, orientation, relative phase offset –Turn left/right/up/down/clockwise/counter-clockwise(n) –Forward(n), Backward(n) –Revolute-1(n), Revolute-2(n) –Twist-180(n) –{, } : {forward(1)} (3)  forward (1) forward (1) forward (1) 4 L-system specification  constructor  behavior evaluation (quasi- dynamic simulator)

Parametric 0L-systems 4 Purpose –Compactly describe more natural-looking structures –Overcome overly regular designs from L-systems  G = (V, , , P) –:,  : Predecessor : condition  successor –Restricted condition: comparisons as to whether a production parameter is greater than a constant value

Evolutionary Algorithm 4 Initialization –Blank template of a fixed number of production rules –Push and pop, block replication symbols –Initial population consists of a variety of different solutions whose fitness is above the preset threshold 4 Mutation –Replacing one command with a random command –Perturbing parameter of a command by adding/subtracting a small value to it –Changing parameter equation to a production –Adding/deleting a block of commands in a successor –Changing condition equation 4 Recombination

Evolved Creatures 4 Evaluation function –Distance moved by the creature’s center of mass –Penalty proportional to distance covered by points that dragged along the ground  stepping and rolling motions encouraged 4 Interesting results : Fig. 2 –Roll along sideways : (a), (b), (c), (g) –Undulating sea-serpent : (d) –Inch-worm : (e) –Flipping of the creature : (f) –Pushing a coil : (h)  larger creatures –Four legs in an awkward walk : (i)  larger creatures

Midterm Exam : Take Home 4 Design the virtual creatures with evolving L-systems 4 Due date : April 29 4 Collaborators : maximum 3