An Evolution Strategy for Improving the Design of Phased Array Transducers Stephen Chen, York University Sarah Razzaqi, University of Toronto Vincent Lupien,

Slides:



Advertisements
Similar presentations
Scalable and Dynamic Quorum Systems Moni Naor & Udi Wieder The Weizmann Institute of Science.
Advertisements

ECE 471/571 - Lecture 13 Gradient Descent 10/13/14.
Optimization with Constraints
Test Automation Success: Choosing the Right People & Process
1 An Adaptive GA for Multi Objective Flexible Manufacturing Systems A. Younes, H. Ghenniwa, S. Areibi uoguelph.ca.
Problem Solving by Searching Copyright, 1996 © Dale Carnegie & Associates, Inc. Chapter 3 Spring 2007.
Control Structure Selection for a Methanol Plant using Hysys/Unisim
Architecture for Exploring Large Design Spaces John R. Josephson, B. Chandrasekaran, Mark Carroll, Naresh Iyer, Bryon Wasacz, Qingyuan Li, Giorgio Rizzoni,
P. Venkataraman Mechanical Engineering P. Venkataraman Rochester Institute of Technology DETC2014 – 35148: Continuous Solution for Boundary Value Problems.
The Ideal Angle Beam Probes for DGS Evaluation Wolf Kleinert, York Oberdoerfer, Gerhard Splitt, GE Sensing & Inspection Technologies GmbH, Huerth, Germany.
Tuesday, May 14 Genetic Algorithms Handouts: Lecture Notes Question: when should there be an additional review session?
1 IRNDT Inc. Curved Composite Patent UNITED STATES PATENT NUMBER 7,293,461.
Precision AC Current Measurement Technique Guildline Instruments Limited.
Online Performance Auditing Using Hot Optimizations Without Getting Burned Jeremy Lau (UCSD, IBM) Matthew Arnold (IBM) Michael Hind (IBM) Brad Calder (UCSD)
Chapter 4 DECISION SUPPORT AND ARTIFICIAL INTELLIGENCE
Genetic Algorithms for Bin Packing Problem Hazem Ali, Borislav Nikolić, Kostiantyn Berezovskyi, Ricardo Garibay Martinez, Muhammad Ali Awan.
EvoNet Flying Circus Introduction to Evolutionary Computation Brought to you by (insert your name) The EvoNet Training Committee The EvoNet Flying Circus.
GREEDY RANDOMIZED ADAPTIVE SEARCH PROCEDURES Reporter : Benson.
Evolution of descent directions Alejandro Sierra Escuela Politécnica Superior Universidad Autónoma de Madrid Iván Santibáñez Koref Bionik und Evolutionstechnik.
Project Presentation: March 9, 2006
Optimization Methods One-Dimensional Unconstrained Optimization
Optimizing RDF Chain Queries using Genetic Algorithms DBDBD 2010 Alexander Hogenboom, Viorel Milea, Flavius Frasincar, and Uzay Kaymak Erasmus University.
Optimization Methods One-Dimensional Unconstrained Optimization
Algorithms and Data Structures Hash Tables and Associative Arrays.
Metaheuristics The idea: search the solution space directly. No math models, only a set of algorithmic steps, iterative method. Find a feasible solution.
1 Ion Optics Simulations What it is. How it’s useful. The SIMION ion optics software. –How it works. –Limitations and cautions –Demonstrations and examples.
Ranga Rodrigo April 6, 2014 Most of the sides are from the Matlab tutorial. 1.
A Genetic Algorithms Approach to Feature Subset Selection Problem by Hasan Doğu TAŞKIRAN CS 550 – Machine Learning Workshop Department of Computer Engineering.
Test Organization and Management
© 2008 The MathWorks, Inc. ® ® Parallel Computing with MATLAB ® Silvina Grad-Freilich Manager, Parallel Computing Marketing
Improved Search for Local Optima in Particle Swarm Optimization May 6, 2015 Huidae Cho Water Resources Engineer, Dewberry Consultants Part-Time Assistant.
Cristian Urs and Ben Riveira. Introduction The article we chose focuses on improving the performance of Genetic Algorithms by: Use of predictive models.
Fourer et al., The NEOS Benchmarking Service INFORMS International, Puerto Rico, July 8-11, INFORMS International Session MC07, July 9, 2007 The.
Optimization Problems - Optimization: In the real world, there are many problems (e.g. Traveling Salesman Problem, Playing Chess ) that have numerous possible.
Lecture 5. Niching and Speciation (2) 4 학습목표 진화로 얻어진 해의 다양성을 확보하기 위한 대표 적인 방법에 대해 이해한다.
1 Hybrid-Formal Coverage Convergence Dan Benua Synopsys Verification Group January 18, 2010.
Major objective of this course is: Design and analysis of modern algorithms Different variants Accuracy Efficiency Comparing efficiencies Motivation thinking.
Site Completion Preliminary Assessment Site Inspection Remedial Investigation Feasibility Study Remedial Design Remedial Action LTRA O&M Site Identified.
Evolving Virtual Creatures & Evolving 3D Morphology and Behavior by Competition Papers by Karl Sims Presented by Sarah Waziruddin.
Heuristic Optimization Methods Greedy algorithms, Approximation algorithms, and GRASP.
FORS 8450 Advanced Forest Planning Lecture 11 Tabu Search.
“Isolating Failure Causes through Test Case Generation “ Jeremias Rößler Gordon Fraser Andreas Zeller Alessandro Orso Presented by John-Paul Ore.
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,
Stochastic greedy local search Chapter 7 ICS-275 Spring 2009.
Particle Swarm Optimization † Spencer Vogel † This presentation contains cheesy graphics and animations and they will be awesome.
Mining Evolutionary Model MEM Rida E. Moustafa And Edward J. Wegman George Mason University Phone:
Coevolutionary Automated Software Correction Josh Wilkerson PhD Candidate in Computer Science Missouri S&T.
Towards the Automated Design of Phased Array Ultrasonic Transducers – Using Particle Swarms to find “Smart” Start Points Stephen Chen, York University.
© 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 1 Prototyping.
Population Based Optimization for Variable Operating Points Alan L. Jennings & Ra úl Ordóñez, ajennings1ajennings1,
, Dan Peterson Apparent inconsistencies and other issues in the xBSM measurements of IBS Scans We have studied the pinhole and CodedAperture.
Application Development in Engineering Optimization with Matlab and External Solvers Aalto University School of Engineering.
Evolutionary Computation Evolving Neural Network Topologies.
Bounded Nonlinear Optimization to Fit a Model of Acoustic Foams
University of Colorado Boulder APPM 4380 October 10th, 2016
Particle Swarm Optimization with Partial Search To Solve TSP
Discrete ABC Based on Similarity for GCP
<Student’s name>
Digital Optimization Martynas Vaidelys.
Who cares about implementation and precision?
Optimal Risk Selection Using Cat Models
Farmers to Enter Food Hubs, Groceries, Restaurants and Cooperatives
Objective of This Course
Logistic Regression & Parallel SGD
Multi-Objective Optimization with possible application in SuperKEKB(in progress) Y. Zhang, D. Zhou
Artificial Bee Colony Algorithm
The Coordination of Parallel Search with Common Components
Rohan Yadav and Charles Yuan (rohany) (chenhuiy)
Area Coverage Problem Optimization by (local) Search
Presentation transcript:

An Evolution Strategy for Improving the Design of Phased Array Transducers Stephen Chen, York University Sarah Razzaqi, University of Toronto Vincent Lupien, Acoustic Ideas Inc.

July 21, 2006CEC 2006 Phased Array Transducers  A non-mechanical way to direct an energy beam  Useful for Non-Destructive Evaluation

July 21, 2006CEC 2006 Continuum Probe Designer™  Product of Acoustic Ideas Inc.  Automated design tool that creates an optimized probe for a given inspection task  Removes “art” of design

July 21, 2006CEC 2006 Continuum Probe Designer™ Components  Cost function generator uses exclusive patent- pending technology to design an optimized probe

July 21, 2006CEC 2006 Optimization Solver  The optimized probe is developed for a given probe geometry  Finding the best probe geometry is another optimization task  In this paper, the probe designer is treated as a “cost function generator”

July 21, 2006CEC 2006 Optimization Objective  Probe costs are directly related to the number of elements used in a design  Existing instrumentation can only control 32 independent channels at a time

July 21, 2006CEC 2006 Benchmark Optimization Solver  Cost function generator is implemented in MATLAB®  fmincon from MATLAB® Optimization Toolbox initially used for the optimization solver  fmincon uses gradient descent  fmincon performs very inconsistently

July 21, 2006CEC 2006 An Evolution Strategy for the Optimization Solver  Standard (1+λ)-ES  fmincon uses about 300 function evaluations on average  Want about 100 generations to allow for convergence  Therefore, λ = 3

July 21, 2006CEC 2006 Evolution Strategy Development  Tested σ = to 0.01  Consistently better with larger sigma

July 21, 2006CEC 2006 Evolution Strategy vs. fmincon  Tested on one expert guess and 29 random start points  ES results are vastly superior and more consistent  ES results are still not good enough fmincon (1+λ)-ES

July 21, 2006CEC 2006 Independent Parallel Runs  High standard deviation suggests that using multiple runs will lead to easy improvements  Results are better, but still not good enough (1+λ)-ES Four parallel

July 21, 2006CEC 2006 “Smart” start points  High correlation between ES solution and quality of random start point  Use random search to find “smart” points  Better results again Four parallel “Smart” start pts

July 21, 2006CEC 2006 Current Work  Need to get to 30/30 feasible solutions Make Continuum Probe Designer™ suitable for non-expect users – i.e. feasible solutions from any random/non-expert start point  Using WoSP to find “smart” start points

July 21, 2006CEC 2006 WoSP  Waves of Swarm Particles  Each wave finds/explores another local optima  Standard particle swarm explores one optima exhaustively  WoSP works well with a local optimizer Use local optimizer to “finish” each wave

July 21, 2006CEC 2006 Summary  Evolution Strategy works better than gradient descent in very noisy search spaces  Effect of sigma on ES convergence rate suggests a noisy search space  Relationship between quality of start and end points supports using “smart” start points