Presentation is loading. Please wait.

Presentation is loading. Please wait.

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

Similar presentations


Presentation on theme: "5 th Biennial Ptolemy Miniconference Berkeley, CA, May 9, 2003 Evolutionary Programming using Ptolemy II Greg Rohling Georgia Tech Research Institute Georgia."— Presentation transcript:

1 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 Greg.Rohling@gtri.gatech.edu

2 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

3 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)

4 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

5 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

6 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

7 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

8 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

9 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

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

11 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

12 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

13 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

14 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

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

16 Ptolemy Miniconference 16 Questions?


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

Similar presentations


Ads by Google