Please use this identifier to cite or link to this item:
Fulltext available Open Access
Title: Efficient Design of Low-Order H-infinity Optimal Controllers Using Evolutionary Algorithms and a Bisection Approach
Language: English
Authors: Popov, Andrey 
Werner, Herbert 
Keywords: Robust Control;Evolutionary Algorithms;Ranking Selection;H-infinity;Bisection
Issue Date: 2006
Source: Proceedings of the 2006 IEEE International Conference on Computer Aided Control Systems Design
Abstract (english): This paper considers a hybrid evolutionary algebraic approach to the non-convex problem of designing low-order H-infinity optimal controllers. It is shown that using the closed-loop H-infinity norm as fitness measure in a population-based, evolutionary search does not require the computation of the H-infinity norm for each controller of the population. Instead, the fact that evolutionary algorithms assign fitness measures to individuals based on a ranking is exploited and a bisection approach is proposed that allows to trade accuracy that is not needed against computational efficiency without loosing information. Three design examples are used to illustrate the improvement in computational speed achieved with the proposed method. Copyright note: ©20xx IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
DOI: 10.15480/882.247
Institute: Regelungstechnik E-14 
Type: InProceedings (Aufsatz / Paper einer Konferenz etc.)
License: In Copyright In Copyright
Appears in Collections:Publications with fulltext

Files in This Item:
File Description SizeFormat
CCA_CACSD_ISIC_2006_0520.pdf161,67 kBAdobe PDFThumbnail
Show full item record

Page view(s)

Last Week
Last month
checked on Sep 27, 2020


checked on Sep 27, 2020

Google ScholarTM


Note about this record


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