5 th Biennial Ptolemy Miniconference Berkeley, CA, May 9, 2003 Evolutionary Programming using Ptolemy II Greg Rohling Georgia Tech Research Institute Georgia.

Slides:



Advertisements
Similar presentations
© Negnevitsky, Pearson Education, Lecture 12 Hybrid intelligent systems: Evolutionary neural networks and fuzzy evolutionary systems Introduction.
Advertisements

Topic Outline ? Black-Box Optimization Optimization Algorithm: only allowed to evaluate f (direct search) decision vector x objective vector f(x) objective.
Slides from: Doug Gray, David Poole
MOEAs University of Missouri - Rolla Dr. T’s Course in Evolutionary Computation Matt D. Johnson November 6, 2006.
Evolving Cutting Horse and Sheepdog Behavior with a Simulated Flock Chris Beacham Computer Systems Research Lab 2009.
CSM6120 Introduction to Intelligent Systems Evolutionary and Genetic Algorithms.
21-May-15 Genetic Algorithms. 2 Evolution Here’s a very oversimplified description of how evolution works in biology Organisms (animals or plants) produce.
EvoNet Flying Circus Introduction to Evolutionary Computation Brought to you by (insert your name) The EvoNet Training Committee The EvoNet Flying Circus.
Modular Neural Networks CPSC 533 Franco Lee Ian Ko.
Artificial Learning Approaches for Multi-target Tracking Jesse McCrosky Nikki Hu.
Estimation of Distribution Algorithms Let’s review what have done in EC so far: We have studied EP and found that each individual searched via Gaussian.
EvoNet Flying Circus Introduction to Evolutionary Computation Brought to you by (insert your name) The EvoNet Training Committee The EvoNet Flying Circus.
Multi-Objective Evolutionary Algorithms Matt D. Johnson April 19, 2007.
Design of Autonomous Navigation Controllers for Unmanned Aerial Vehicles using Multi-objective Genetic Programming Gregory J. Barlow March 19, 2004.
1. 2 overview Background on video games Background on video games Neural networks Neural networks NE NE NEAT NEAT rtNEAT rtNEAT NERO NERO.
Evolutionary Computation Application Peter Andras peter.andras/lectures.
D Nagesh Kumar, IIScOptimization Methods: M1L4 1 Introduction and Basic Concepts Classical and Advanced Techniques for Optimization.
Intro to AI Genetic Algorithm Ruth Bergman Fall 2004.
A New Algorithm for Solving Many-objective Optimization Problem Md. Shihabul Islam ( ) and Bashiul Alam Sabab ( ) Department of Computer Science.
The Performance of Evolutionary Artificial Neural Networks in Ambiguous and Unambiguous Learning Situations Melissa K. Carroll October, 2004.
CHAPTER 12 ADVANCED INTELLIGENT SYSTEMS © 2005 Prentice Hall, Decision Support Systems and Intelligent Systems, 7th Edition, Turban, Aronson, and Liang.
Prepared by Barış GÖKÇE 1.  Search Methods  Evolutionary Algorithms (EA)  Characteristics of EAs  Genetic Programming (GP)  Evolutionary Programming.
Efficient Model Selection for Support Vector Machines
Evolving a Sigma-Pi Network as a Network Simulator by Justin Basilico.
Slides are based on Negnevitsky, Pearson Education, Lecture 12 Hybrid intelligent systems: Evolutionary neural networks and fuzzy evolutionary systems.
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.
High Performance, Pipelined, FPGA-Based Genetic Algorithm Machine A Review Grayden Smith Ganga Floora 1.
Neural and Evolutionary Computing - Lecture 5 1 Evolutionary Computing. Genetic Algorithms Basic notions The general structure of an evolutionary algorithm.
1/27 Discrete and Genetic Algorithms in Bioinformatics 許聞廉 中央研究院資訊所.
Evolving Virtual Creatures & Evolving 3D Morphology and Behavior by Competition Papers by Karl Sims Presented by Sarah Waziruddin.
FINAL EXAM SCHEDULER (FES) Department of Computer Engineering Faculty of Engineering & Architecture Yeditepe University By Ersan ERSOY (Engineering Project)
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.
Evolutionary Art with Multiple Expression Programming By Quentin Freeman.
Simulation in Wind Turbine Vibrations: A Data Driven Analysis Graduate Students: Zijun Zhang PI: Andrew Kusiak Intelligent Systems Laboratory The University.
Genetic Algorithms. 2 Overview Introduction To Genetic Algorithms (GAs) GA Operators and Parameters Genetic Algorithms To Solve The Traveling Salesman.
Biologically inspired algorithms BY: Andy Garrett YE Ziyu.
2/29/20121 Optimizing LCLS2 taper profile with genetic algorithms: preliminary results X. Huang, J. Wu, T. Raubenhaimer, Y. Jiao, S. Spampinati, A. Mandlekar,
A l a p a g o s : a generic distributed parallel genetic algorithm development platform Nicolas Kruchten 4 th year Engineering Science (Infrastructure.
Optimization Problems
Waqas Haider Bangyal 1. Evolutionary computing algorithms are very common and used by many researchers in their research to solve the optimization problems.
Multi-objective Topology Synthesis and FPGA Prototyping Framework of Application Specific Network-on-Chip m Akram Ben Ahmed Xinyu LI, Omar Hammami.
Introduction Genetic programming falls into the category of evolutionary algorithms. Genetic algorithms vs. genetic programming. Concept developed by John.
Chapter 2-OPTIMIZATION G.Anuradha. Contents Derivative-based Optimization –Descent Methods –The Method of Steepest Descent –Classical Newton’s Method.
Innovative and Unconventional Approach Toward Analytical Cadastre – based on Genetic Algorithms Anna Shnaidman Mapping and Geo-Information Engineering.
Introduction to GAs: Genetic Algorithms Quantitative Analysis: How to make a decision? Thank you for all pictures and information referred.
Neural and Evolutionary Computing - Lecture 9 1 Evolutionary Multiobjective Optimization  Particularities of multiobjective optimization  Multiobjective.
GAIA (Genetic Algorithm Interface Architecture) Requirements Analysis Document (RAD) Version 1.0 Created By: Charles Hall Héctor Aybar William Grim Simone.
CHEE825 Fall 2005J. McLellan1 Nonlinear Empirical Models.
Genetic Algorithm Dr. Md. Al-amin Bhuiyan Professor, Dept. of CSE Jahangirnagar University.
Genetic Programming Using Simulated Natural Selection to Automatically Write Programs.
Artificial Intelligence By Mr. Ejaz CIIT Sahiwal Evolutionary Computation.
Computacion Inteligente Least-Square Methods for System Identification.
Genetic Algorithms. Solution Search in Problem Space.
Project CS 116 Section 4 Deadline 04/28 11:59PM Points: 12.
Genetic Algorithm(GA)
Genetic Algorithm. Outline Motivation Genetic algorithms An illustrative example Hypothesis space search.
 Presented By: Abdul Aziz Ghazi  Roll No:  Presented to: Sir Harris.
 Negnevitsky, Pearson Education, Lecture 12 Hybrid intelligent systems: Evolutionary neural networks and fuzzy evolutionary systems n Introduction.
Evolutionary Computation Evolving Neural Network Topologies.
Power Magnetic Devices: A Multi-Objective Design Approach
Selected Topics in CI I Genetic Programming Dr. Widodo Budiharto 2014.
Genetic Algorithms.
USING MICROBIAL GENETIC ALGORITHM TO SOLVE CARD SPLITTING PROBLEM.
Presented by: Dr Beatriz de la Iglesia
Packet Classification with Evolvable Hardware Hash Functions
EE368 Soft Computing Genetic Algorithms.
RM-MEDA: A Regularity Model-Based Multiobjective Estimation of Distribution Algorithm BISCuit EDA Seminar
Presentation transcript:

5 th Biennial Ptolemy Miniconference Berkeley, CA, May 9, 2003 Evolutionary Programming using Ptolemy II Greg Rohling Georgia Tech Research Institute Georgia Institute of Technology

Ptolemy Miniconference 2 Evolutionary Algorithms (EA) Evolutionary Algorithms –Inspired by Holland 1975 –Mimic the processes of plant and animal evolution –Find a maximum of a complex function. New Gene Pool Fitness Evaluation MutationSelection Mating Child Genes Parental Genes Genes w/ Measure

Ptolemy Miniconference 3 Any multi-input, single output function Fun problems have multiple objectives –Pd, False Alarms Thus Multiple Objective Evolutionary Algorithms New Gene Pool Function Evaluation Mutation Natural Selection Mating Child Genes Parental Genes Genes w/ Measure Fitness Evaluation Genome Measure Genome Fitness Evaluation MOEA Technique Measure Multiple Objective Evolutionary Algorithms (MOEA)

Ptolemy Miniconference 4 Objective 1 Objective 2 Pareto Individuals Pareto Front MOEA – Pareto Optimality Pareto Optimal or Non-dominated –Not out-performed in every dimension by any single individual –Pareto Front Dominated or inferior –Outperformed by some other individual in EVERY objective

Ptolemy Miniconference 5 Evolutionary Programming (EP) Evolutionary Algorithms EA = Tuning parameters of an existing system EP = Deriving new systems by allowing tuning of parameters for components, AND allowing modification of system topology D1 D0 D1+ * * 3 Koza 1996

Ptolemy Miniconference 6 Flexible topology Feedback possible Domain Specific Functions Reusable components Layered on Ptolemy II Inputs Output Output Select Outputs TypeParams Inputs Function Genome TypeParams Inputs Function TypeParams Inputs Function EP: Block Diagram Approach

Ptolemy Miniconference 7 PRESTO Ptolemy II Training Data GTMOEA Search Space Generator List of Possible Elements Search Space MoML Generator XML Description MoML Description Objective Values P attern R ecognition E volutionary S ynthesis T hrough O ptimization

Ptolemy Miniconference 8 PRESTO: MoML Generator Ptolemy II Training Data GTMOEA MoML Generator XML Description MoML Description Objective Values GTMOEA produces XML description of location in search space MoML Generator produces MoML for Ptolemy II evaluation. –Reads Meta data description of Ptolemy II elements # of Ports Data types for ports Data type relations between ports Support for feedback # of input/output required Attributes Specified MoML description –Error Correction Feedback Data types Unconnected ports

Ptolemy Miniconference 9 PRESTO Example Desire: Build box that takes input of a ramp function and best meets 3 objectives Objective Space –3 sets of training data Noisy sinusoids –Minimize least square error Search Space –AddSubtract –Scaler –Constant –Multiplier –Sin/Cos

Ptolemy Miniconference 10 PRESTO Example Individual 6695, Good at Objective 2 Ptolemy II Description of System

Ptolemy Miniconference 11 Creating “Sub-Algorithms” for AAR44 Missile Warning Receiver Operational Flight Program (OFP) Wrapped C++ (Really just C) OFP with JNI to allow calls from within Ptolemy II Using Discrete Event Domain to force Wrapped components to be called in sequential order Targeting 3 areas of the OFP PRESTO Real World Effort

Ptolemy Miniconference 12 Training/Evaluation Data –Sensor and Navigation data –40 hrs of False Positive Data collected from flights –10s of Live fire missile shots –1000s of Simulated missile shots Objectives –Maximize Probability of detection Negative False Positive Count Time To Intercept Minimum Time To Intercept Average PRESTO Real World Effort

Ptolemy Miniconference 13 Tries many new ideas No preconceived notions Does not get discouraged with failure Works 24 hours a day 7 days a week Scalable Resulting Evolutionary Program can be graphically examined to understand algorithm evolved. PRESTO Advantages

Ptolemy Miniconference 14 MOEP - Requires evaluation of many (millions) of individuals Ptolemy II requires –3 seconds to startup –Ptolemy Simulation running over 400 times slower than the C++-only implementation PRESTO Disadvantages

Ptolemy Miniconference 15 Ptolemy II does a good job of error detection. How about adding default error correction? Ptolemy II Suggestions

Ptolemy Miniconference 16 Questions?