A Comparison of Nature Inspired Intelligent Optimization Methods in Aerial Spray Deposition Management Lei Wu Master’s Thesis Artificial Intelligence Center.

Slides:



Advertisements
Similar presentations
1 Machine Learning: Lecture 4 Artificial Neural Networks (Based on Chapter 4 of Mitchell T.., Machine Learning, 1997)
Advertisements

CS6800 Advanced Theory of Computation
Tetris – Genetic Algorithm Presented by, Jeethan & Jun.
Genetic Algorithms Contents 1. Basic Concepts 2. Algorithm
FOREST PLANNING USING PSO WITH A PRIORITY REPRESENTATION P.W. Brooks and W.D. Potter Institute for Artificial Intelligence, University of Georgia, USA.
Artificial Neural Networks - Introduction -
Biologically Inspired AI (mostly GAs). Some Examples of Biologically Inspired Computation Neural networks Evolutionary computation (e.g., genetic algorithms)
CPSC 322, Lecture 16Slide 1 Stochastic Local Search Variants Computer Science cpsc322, Lecture 16 (Textbook Chpt 4.8) February, 9, 2009.
Spie98-1 Evolutionary Algorithms, Simulated Annealing, and Tabu Search: A Comparative Study H. Youssef, S. M. Sait, H. Adiche
1 Lecture 8: Genetic Algorithms Contents : Miming nature The steps of the algorithm –Coosing parents –Reproduction –Mutation Deeper in GA –Stochastic Universal.
Introduction to Genetic Algorithms Yonatan Shichel.
Genetic Algorithms and Their Applications John Paxton Montana State University August 14, 2003.
Artificial Intelligence Genetic Algorithms and Applications of Genetic Algorithms in Compilers Prasad A. Kulkarni.
Intro to AI Genetic Algorithm Ruth Bergman Fall 2002.
Genetic Algorithms Nehaya Tayseer 1.Introduction What is a Genetic algorithm? A search technique used in computer science to find approximate solutions.
Intro to AI Genetic Algorithm Ruth Bergman Fall 2004.
Chapter 6: Transform and Conquer Genetic Algorithms The Design and Analysis of Algorithms.
Genetic Algorithms Overview Genetic Algorithms: a gentle introduction –What are GAs –How do they work/ Why? –Critical issues Use in Data Mining –GAs.
Optimization of thermal processes2007/2008 Optimization of thermal processes Maciej Marek Czestochowa University of Technology Institute of Thermal Machinery.
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.
Genetic Algorithm.
A Genetic Algorithms Approach to Feature Subset Selection Problem by Hasan Doğu TAŞKIRAN CS 550 – Machine Learning Workshop Department of Computer Engineering.
Genetic Algorithms and Ant Colony Optimisation
Efficient Model Selection for Support Vector Machines
An Approach of Artificial Intelligence Application for Laboratory Tests Evaluation Ş.l.univ.dr.ing. Corina SĂVULESCU University of Piteşti.
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.
Integrating Neural Network and Genetic Algorithm to Solve Function Approximation Combined with Optimization Problem Term presentation for CSC7333 Machine.
Genetic algorithms Prof Kang Li
Optimization in Engineering Design Georgia Institute of Technology Systems Realization Laboratory Mixed Integer Problems Most optimization algorithms deal.
NEURAL NETWORKS FOR DATA MINING
Zorica Stanimirović Faculty of Mathematics, University of Belgrade
Boltzmann Machine (BM) (§6.4) Hopfield model + hidden nodes + simulated annealing BM Architecture –a set of visible nodes: nodes can be accessed from outside.
An Introduction to Genetic Algorithms Lecture 2 November, 2010 Ivan Garibay
Genetic Algorithms Genetic Algorithms – What are they? And how they are inspired from evolution. Operators and Definitions in Genetic Algorithms paradigm.
Genetic Algorithms Introduction Advanced. Simple Genetic Algorithms: Introduction What is it? In a Nutshell References The Pseudo Code Illustrations Applications.
Genetic Algorithms. Evolutionary Methods Methods inspired by the process of biological evolution. Main ideas: Population of solutions Assign a score or.
Akram Bitar and Larry Manevitz Department of Computer Science
1 Genetic Algorithms and Ant Colony Optimisation.
Edge Assembly Crossover
Genetic Algorithms What is a GA Terms and definitions Basic algorithm.
Improving the Genetic Algorithm Performance in Aerial Spray Deposition Management University of Georgia L. Wu, W.D. Potter, K. Rasheed USDA Forest Service.
Genetic Algorithms. 2 Overview Introduction To Genetic Algorithms (GAs) GA Operators and Parameters Genetic Algorithms To Solve The Traveling Salesman.
Probabilistic Algorithms Evolutionary Algorithms Simulated Annealing.
EE749 I ntroduction to Artificial I ntelligence Genetic Algorithms The Simple GA.
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.
Innovative and Unconventional Approach Toward Analytical Cadastre – based on Genetic Algorithms Anna Shnaidman Mapping and Geo-Information Engineering.
D Nagesh Kumar, IIScOptimization Methods: M8L5 1 Advanced Topics in Optimization Evolutionary Algorithms for Optimization and Search.
An Introduction to Genetic Algorithms Lecture 2 November, 2010 Ivan Garibay
Genetic Algorithms. Underlying Concept  Charles Darwin outlined the principle of natural selection.  Natural Selection is the process by which evolution.
Artificial Intelligence By Mr. Ejaz CIIT Sahiwal Evolutionary Computation.
1 Comparative Study of two Genetic Algorithms Based Task Allocation Models in Distributed Computing System Oğuzhan TAŞ 2005.
Genetic Algorithms An Evolutionary Approach to Problem Solving.
Genetic Algorithms And other approaches for similar applications Optimization Techniques.
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.
March 1, 2016Introduction to Artificial Intelligence Lecture 11: Machine Evolution 1 Let’s look at… Machine Evolution.
Presented By: Farid, Alidoust Vahid, Akbari 18 th May IAUT University – Faculty.
 Negnevitsky, Pearson Education, Lecture 12 Hybrid intelligent systems: Evolutionary neural networks and fuzzy evolutionary systems n Introduction.
Evolutionary Computation Evolving Neural Network Topologies.
Genetic Algorithms.
Evolutionary Algorithms Jim Whitehead
GENETIC ALGORITHMS & MACHINE LEARNING
Introduction to Artificial Intelligence Lecture 11: Machine Evolution
EE368 Soft Computing Genetic Algorithms.
Boltzmann Machine (BM) (§6.4)
GA.
Presentation transcript:

A Comparison of Nature Inspired Intelligent Optimization Methods in Aerial Spray Deposition Management Lei Wu Master’s Thesis Artificial Intelligence Center University of Georgia Major Professor: Walter D Potter Committe: Donald Nute Khaled M Rasheed

Presentation Overview Introduction –Aerial Spray Deposition Problem –Genetic Algorithms –SAGA Development of Intelligent Optimization Methods –SAGA2 (Spray Advisor using Genetic Algorithm version 2) –SAGA2NN (Spray Advisor using Genetic Algorithm version 2 with Neural Network) –SAGADO (Spray Advisor using GADO) –SASA (Spray Advisor using Simulated Annealing) Results Conclusion

Aerial Spray Deposition Problem AGDISP (Agricultural Dispersal) aerial spray simulation model predicts the deposition of spray material released from an aircraft. The prediction is based on a set of spray parameter values. The total combination of possible spray parameters generates a huge search space (NP hard). AGDISP returns three spray output values: VMD (the deposition composed of Volume Median Diameter), drift fraction, and COV (the Coefficient of Variance). The goal is to minimize the difference between the output VMD and the desired VMD, minimize the drift fraction, and minimize the COV.

Genetic Algorithms Genetic algorithms are inspired by Darwin's theory of natural selection and based on the principle of survival of the fittest Basic components of genetic algorithms – A representation of solutions to the problem – A way to create an initial population – A fitness function to evaluate the solutions – A selection mechanism to pick parents for reproduction, and crossover and mutation operators to alter the genetic composition of offspring – Values for the parameters of genetic algorithms

SAGA SAGA applies the simple genetic algorithm to heuristically search for an optimal set of input parameters needed to achieve a certain aerial spray deposition. SAGA sends a set of spray parameters to AGDISP, which is used to calculate the spray output. Based on the fitness function values mapped from the spray output values, SAGA attempts to evolve an improved set of parameters. This is a multi-objective optimization problem, where a weighted- sum approach is applied. Fitness = 100  [50  (1.0 – DriftFraction) + 25  (1 -COV) + 25  VMDTerm], where VMDTerm = 1.0 – abs(1.0 – VMD/VMDCenter)

SAGA2 SAGA2 is developed from SAGA, and tries to get a better solution than SAGA. The improvement of SAGA2 –SAGA2 replaces the original generational genetic algorithm with a steady-state genetic algorithm. –SAGA2 replaces the original roulette wheel selection with tournament selection. –SAGA2 combines several kinds of crossover and mutation operators, and applies them with different probabilities. The implementation of SAGA2

The interface of SAGA2 the interface to customize genetic algorithm parameters the main interface the interface to preset spray parameters

SAGA2NN SAGA2NN is developed from SAGA2, and tries to shorten the time required to get a useful solution. The improvement of SAGA2NN –SAGA2NN generates the initial population from a large pool of individuals. –SAGA2NN does various crossover and mutation operations for each crossover and mutation, and selects the one with the highest fitness as the candidate. SAGA2NN uses a neural network to approximate the fitness during the above process.

Neural Networks Neural networks are inspired by the biological nervous system. The most popular neural network is the backpropagation network. –A backpropagation network is a fully connected, layered, feedforward neural network. –A forward pass determines the network's actual output, and a backward pass determines how the weights should be changed based on the difference between the actual output and the target output. –The weight is changed in the direction where the error surface goes down most steeply, and the amount of change is determined by the learning law: c t =  c t-1 -(1-  )  d t, where c t is the current weight change, c t-1 is the previous weight change, d t is the current derivative of the error with respect to the weight,  is the learning rate, and  is the momentum.

The Neural Network in SAGA2NN Data collecting Network training Function mapping

SAGADO SAGADO is developed by applying GADO (Genetic Algorithm for Design Optimization), a general-purpose approach to solving the parametric design problem, in this problem. –A steady-state genetic algorithm is used. –The selection scheme is ranking selection. –The replacement strategy is a crowding technique. –Several crossover and mutation operators are used, in which the most important one is guided crossover. –The screen module saves time by avoiding the expensive evaluation of points that are unlikely to correspond to good designs. –An adaptive penalty method is used for handling constraints. The implementation of SAGADO

SASA SASA is developed by applying simulated annealing in this problem. –Simulated annealing is inspired by physical annealing of solids. –Basic algorithm of simulated annealing: successively generate a random move in the neighborhood of the state, accept the move if it leads to a solution with lower energy than the current solution, otherwise accept it with probability e -δ/T, where δ is the change of energy and T is the current temperature. The implementation of SASA –The energy of a solution is the opposite of its fitness –The cooling schedule adopted is geometric cooling. The temperature is updated using the formula: T i+1 = αT i, where α denotes the cooling factor.

Results We ran these methods on several practical spray parameter specifications provided by Forest Service managers. The maximum fitness values SAGA2 and SAGADO achieved are better than SAGA in every parameter setting. SAGA2NN obtains much better maximum fitness value in the first few hundred evaluations. Its lead is offset later, but it takes far fewer evaluations to converge. SAGA, SAGA2, SAGA2NN and SAGADO all greatly outperform SASA.

Example of Experiments

Evolution Process of Some Parameter Settings

Conclusion Careful choice of the genetic algorithm type, the selection mechanism, and the crossover and mutation operators can boost the genetic algorithm performance. Applying a neural network to the genetic algorithm saves time, but does not achieve a much better result. The advantage of the neural network may be counteracted by premature convergence of the genetic algorithm. Genetic algorithms perform better than simulated annealing in an extremely complicated domain, such as aerial spray deposition management. In aerial spray practice, if time is abundant, we recommend using SAGADO to do the optimization; if time is limited, we recommend using SAGA2NN.