Titel: Efficient Design of Low-Order H-infinity Optimal Controllers Using Evolutionary Algorithms and a Bisection Approach
Sprache: English
Autor/Autorin: Popov, Andrey 
Werner, Herbert 
Schlagwörter: Robust Control;Evolutionary Algorithms;Ranking Selection;H-infinity;Bisection
Erscheinungsdatum: 2006
Quellenangabe: Proceedings of the 2006 IEEE International Conference on Computer Aided Control Systems Design
Zusammenfassung (englisch): 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.
URI: http://tubdok.tub.tuhh.de/handle/11420/249
DOI: 10.15480/882.247
Institut: Regelungstechnik E-14 
Dokumenttyp: InProceedings (Aufsatz / Paper einer Konferenz etc.)
Enthalten in den Sammlungen:tub.dok

Dateien zu dieser Ressource:
Datei Beschreibung GrößeFormat
CCA_CACSD_ISIC_2006_0520.pdf161,67 kBAdobe PDFMiniaturbild
Öffnen/Anzeigen
Zur Langanzeige

Seitenansichten

265
Letzte Woche
0
Letzten Monat
0
checked on 10.12.2018

Download(s)

134
checked on 10.12.2018

Google ScholarTM

Prüfe

Export

Alle Ressourcen in diesem Repository sind urheberrechtlich geschützt.