Abstract
A direct numerical method for optimal feedback control design of general nonlinear systems is presented in this chapter. The problem is generally infinite dimensional. In order to convert it to a finite dimensional optimization problem, a collocation type method is proposed. The collocation approach is based on approximating the control input function as a series of given base functions with unknown coefficients. Then, the optimal control problem is converted to the problem of finding a finite set of coefficients. To solve the resulting optimization problem, a new nature-inspired optimization paradigm known as Moth Flame Optimizer (MFO) is used. Validation and evaluating of accuracy of the method are performed via implementing it on some well known benchmark problems. Investigations presented in this chapter reveals the efficiency of the method and its benefits with respect to other numerical approaches. The chapter also consideres an in-depth literratur review and analysis of MFO.
| Original language | English |
|---|---|
| Title of host publication | Studies in Computational Intelligence |
| Publisher | Springer Verlag |
| Pages | 143-166 |
| Number of pages | 24 |
| DOIs | |
| Publication status | Published - 1 Jan 2020 |
| Externally published | Yes |
Publication series
| Name | Studies in Computational Intelligence |
|---|---|
| Volume | 811 |
| ISSN (Print) | 1860-949X |
UN SDGs
This output contributes to the following UN Sustainable Development Goals (SDGs)
-
SDG 3 Good Health and Well-being
-
SDG 7 Affordable and Clean Energy
-
SDG 9 Industry, Innovation, and Infrastructure
-
SDG 11 Sustainable Cities and Communities
-
SDG 12 Responsible Consumption and Production
-
SDG 13 Climate Action
-
SDG 17 Partnerships for the Goals
Fingerprint
Dive into the research topics of 'Moth-flame optimization algorithm: Theory, literature review, and application in optimal nonlinear feedback control design'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver