Please use this identifier to cite or link to this item:
Title: Evolution of artificial neural network controller for a boost converter
Keywords: Evolutionary Algorithms,Genetic Algorithms, Particle Swarm Optimization, boost converter, neural networks
Issue Date: 16-Oct-2008
Citation: VASANTH SUBRAMANYAM (2008-10-16). Evolution of artificial neural network controller for a boost converter. ScholarBank@NUS Repository.
Abstract: This paper introduces a Dual layered Particle Swarm Optimization Algorithm (DLPSO), an evolutionary algorithm proposed to design an Artificial Neural Network (ANN). The algorithm evolves the architecture of the ANN and trains its weights simultaneously. Different from the other techniques previously used, the proposed algorithm evolves the architecture along with the weights in two different layers. Tested on a non-linear system, typically a boost converter, the DLPSO evolves an optimal ANN controller to produce more efficient and robust results than the conventional control techniques used. The performance of the DLPSO based ANN controller is compared to that of a conventional PI controller at different operating points of the non-linear system. The tests show that the evolved controller performs equal to or better than the conventional techniques in terms of overshoot voltages and settling times for small and large signal input transients. Also, a comparison between the applicability of a PSO and a Real-Valued Genetic Algorithm for the training of weights is presented which shows that the PSO is faster and more efficient as a learning algorithm. Moreover, the proposed approach fully automates the neural network generation process, thus removing the need for time consuming manual design.
Appears in Collections:Master's Theses (Open)

Show full item record
Files in This Item:
File Description SizeFormatAccess SettingsVersion 
Thesis_Vasanth_Subramanyam.pdf1.61 MBAdobe PDF



Page view(s)

checked on Nov 25, 2018


checked on Nov 25, 2018

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.