Towards the Automated Design of Phased Array Ultrasonic Transducers – Using Particle Swarms to find “Smart” Start Points Stephen Chen, York University.

Slides:



Advertisements
Similar presentations
Population-based metaheuristics Nature-inspired Initialize a population A new population of solutions is generated Integrate the new population into the.
Advertisements

1 An Adaptive GA for Multi Objective Flexible Manufacturing Systems A. Younes, H. Ghenniwa, S. Areibi uoguelph.ca.
Using Parallel Genetic Algorithm in a Predictive Job Scheduling
Problem Solving by Searching Copyright, 1996 © Dale Carnegie & Associates, Inc. Chapter 3 Spring 2007.
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.
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.
Hybridization of Search Meta-Heuristics Bob Buehler.
Department of Engineering, Control & Instrumentation Research Group 22 – Mar – 2006 Optimisation Based Clearance of Nonlinear Flight Control Laws Prathyush.
Optimization Methods One-Dimensional Unconstrained Optimization
Simulated Annealing 10/7/2005.
Evolutionary Computational Intelligence Lecture 8: Memetic Algorithms Ferrante Neri University of Jyväskylä.
Optimization Methods One-Dimensional Unconstrained Optimization
Coordinative Behavior in Evolutionary Multi-agent System by Genetic Algorithm Chuan-Kang Ting – Page: 1 International Graduate School of Dynamic Intelligent.
Metaheuristics The idea: search the solution space directly. No math models, only a set of algorithmic steps, iterative method. Find a feasible solution.
Genetic Algorithms Overview Genetic Algorithms: a gentle introduction –What are GAs –How do they work/ Why? –Critical issues Use in Data Mining –GAs.
Ranga Rodrigo April 6, 2014 Most of the sides are from the Matlab tutorial. 1.
Multimodal Optimization (Niching) A/Prof. Xiaodong Li School of Computer Science and IT, RMIT University Melbourne, Australia
1 Paper Review for ENGG6140 Memetic Algorithms By: Jin Zeng Shaun Wang School of Engineering University of Guelph Mar. 18, 2002.
Improved Search for Local Optima in Particle Swarm Optimization May 6, 2015 Huidae Cho Water Resources Engineer, Dewberry Consultants Part-Time Assistant.
Swarm Intelligence 虞台文.
More on coevolution and learning Jing Xiao April, 2008.
Optimization Problems - Optimization: In the real world, there are many problems (e.g. Traveling Salesman Problem, Playing Chess ) that have numerous possible.
Modern Heuristic Optimization Techniques and Potential Applications to Power System Control Mohamed A El-Sharkawi The CIA lab Department of Electrical.
PSO and its variants Swarm Intelligence Group Peking University.
1 IE 607 Heuristic Optimization Particle Swarm Optimization.
PSO and ASO Variants/Hybrids/Example Applications & Results Lecture 12 of Biologically Inspired Computing Purpose: Not just to show variants/etc … for.
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.
Thursday, May 9 Heuristic Search: methods for solving difficult optimization problems Handouts: Lecture Notes See the introduction to the paper.
Genetic Algorithms Przemyslaw Pawluk CSE 6111 Advanced Algorithm Design and Analysis
Particle Swarm Optimization James Kennedy & Russel C. Eberhart.
“Isolating Failure Causes through Test Case Generation “ Jeremias Rößler Gordon Fraser Andreas Zeller Alessandro Orso Presented by John-Paul Ore.
Regrouping Particle Swarm Optimization: A New Global Optimization Algorithm with Improved Performance Consistency Across Benchmarks George I. Evers Advisor:
Biologically inspired algorithms BY: Andy Garrett YE Ziyu.
Particle Swarm Optimization † Spencer Vogel † This presentation contains cheesy graphics and animations and they will be awesome.
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:
Parallel Genetic Algorithms By Larry Hale and Trevor McCasland.
Coevolutionary Automated Software Correction Josh Wilkerson PhD Candidate in Computer Science Missouri S&T.
Ab Initio Crystal Structure Prediction: High-throughput and Data Mining Dane Morgan Massachusetts Institute of Technology NSF Division of Materials Research.
An Evolution Strategy for Improving the Design of Phased Array Transducers Stephen Chen, York University Sarah Razzaqi, University of Toronto Vincent Lupien,
Solution approaches to the marker layout problem. Kath Dowsland Gower Optimal Algorithms Ltd.
Local Search. Systematic versus local search u Systematic search  Breadth-first, depth-first, IDDFS, A*, IDA*, etc  Keep one or more paths in memory.
Electromagnetically biased Self-assembly
An Improved Quantum-behaved Particle Swarm Optimization Algorithm Based on Culture V i   v i 1, v i 2,.. v iD  Gao X. Z 2, Wu Ying 1, Huang Xianlin.
Metaheuristics for the New Millennium Bruce L. Golden RH Smith School of Business University of Maryland by Presented at the University of Iowa, March.
Resource Optimization for Publisher/Subscriber-based Avionics Systems Institute for Software Integrated Systems Vanderbilt University Nashville, Tennessee.
 Introduction  Particle swarm optimization  PSO algorithm  PSO solution update in 2-D  Example.
Swarm Intelligence. Content Overview Swarm Particle Optimization (PSO) – Example Ant Colony Optimization (ACO)
CEng 713, Evolutionary Computation, Lecture Notes parallel Evolutionary Computation.
Evolutionary Algorithms Jim Whitehead
CSCI 4310 Lecture 10: Local Search Algorithms
Particle Swarm Optimization with Partial Search To Solve TSP
Heuristic Optimization Methods
Particle Swarm Optimization
PSO -Introduction Proposed by James Kennedy & Russell Eberhart in 1995
Dr. Ashraf Abdelbar American University in Cairo
C.-S. Shieh, EC, KUAS, Taiwan
Who cares about implementation and precision?
Machine Learning for dotNET Developer Bahrudin Hrnjica, MVP
Objective of This Course
Multi-Objective Optimization
Constrained Molecular Dynamics as a Search and Optimization Tool
A Tutorial (Complete) Yiming
The Coordination of Parallel Search with Common Components
Stephen Chen York University
Area Coverage Problem Optimization by (local) Search
Presentation transcript:

Towards the Automated Design of Phased Array Ultrasonic Transducers – Using Particle Swarms to find “Smart” Start Points Stephen Chen, York University Sarah Razzaqi, University of Queensland Vincent Lupien, Acoustic Ideas Inc.

June 26, 2007IEA/AIE 2007 Phased Array Ultrasonic Transducers  A non-mechanical way to direct an energy beam  Useful for Non-Destructive Evaluation

June 26, 2007IEA/AIE 2007 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

June 26, 2007IEA/AIE 2007 Continuum Probe Designer™ Components  Cost function generator uses exclusive patent- pending technology to design an optimized probe

June 26, 2007IEA/AIE 2007 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”

June 26, 2007IEA/AIE 2007 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

June 26, 2007IEA/AIE 2007 An Evolution Strategy for the Optimization Solver (CEC2006)  Standard (1+λ)-ES with λ = 3  Performs significantly better than gradient descent (i.e. fmincon )  Note: fmincon takes about an hour and uses about 300 evaluations

June 26, 2007IEA/AIE 2007 Evolution Strategy vs. fmincon  Tested on one expert selected and 29 random start points  ES results are much better and more consistent  ES results are still not good enough fmincon (1+λ)-ES

June 26, 2007IEA/AIE 2007 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

June 26, 2007IEA/AIE 2007 “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

June 26, 2007IEA/AIE 2007 Analyzing “Smart” Start Points  Is perceived correlation significant?  From 120 random start points, apply the (1+λ)-ES to the 30 worst and best 30 Worst30 Best30 Worst30 Best

June 26, 2007IEA/AIE 2007 “Smart” Start Points on the TSP  Is correlation an obvious/trivial observation?  Correlation does not exist on TSP 30 Worst30 Best30 Worst30 Best 1230%1128%11% 18%16%1.3%2.4%

June 26, 2007IEA/AIE 2007 Coarse Search does not Help on TSP  Coarse search for better starting points does not improve the performance of two- opt on the TSP Four parallel “Smart” start pts 9.2%8.8% 1.1%1.4%

June 26, 2007IEA/AIE 2007 Improve Coarse Search  Generate 50 random points  Use best 4 to seed 4 PSOs  Design PSOs to favour exploration over convergence

June 26, 2007IEA/AIE 2007 PSO vs. Random Search to find “Smart” Start Points  PSO finds even better start points  Improved “smart” start points lead to an even better performance Random search PSO

June 26, 2007IEA/AIE 2007 Exploiting Global Convexity  Search space is globally convex  Seek centre of search space by coordinating individual ESs with crossover PSO With Crossover

June 26, 2007IEA/AIE 2007 Current Work  Exploring Coarse Search – Greedy Search Inspired by WoSP (CEC2005) Different from memetic algorithms (which apply greedy search to every search point) Useful for expensive evaluations Useful for non-globally convex search spaces

June 26, 2007IEA/AIE 2007 Rastrigin function  Globally convex  Average value of each “well” is directly related to the quality of the local optima

June 26, 2007IEA/AIE 2007 Schwefel function  NOT globally convex  Average value of each “well” should still be directly related to the quality of the local optima

June 26, 2007IEA/AIE 2007 Summary  Achieved important level of performance on benchmark test suite for a difficult real-world problem  Demonstrated potential of coarse search-greedy search combinations