Name
Abstract | ||
|---|---|---|
We reduce stability robustness analysis for linear, time-invariant, discrete-time systems to a search problem and attack the problem using genetic algorithms. We describe the problem framework and the modifications that needed to be made to the canonical genetic algorithm for successful application to robustness analysis. Our results show that genetic algorithms can successfully test a sufficient condition for instability in uncertain linear systems with nonlinear polynomial structures. Three illustrative examples demonstrate the new approach |
Year | DOI | Venue |
|---|---|---|
1999 | 10.1109/3468.784176 | Systems, Man and Cybernetics, Part A: Systems and Humans, IEEE Transactions |
Keywords | Field | DocType |
discrete time systems,genetic algorithms,linear systems,robust control,search problems,uncertain systems,canonical genetic algorithm,linear time-invariant discrete-time systems,nonlinear polynomial structures,robust stability analysis,sufficient condition,uncertain linear systems | Mathematical optimization,Linear system,Control theory,Computer science,Robustness (computer science),Genetic representation,Discrete time and continuous time,Search problem,Robust control,Quality control and genetic algorithms,Genetic algorithm | Journal |
Volume | Issue | ISSN |
29 | 5 | 1083-4427 |
Citations | PageRank | References |
11 | 0.92 | 7 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Fadali, M.S. | 1 | 11 | 0.92 |
| Yongmian Zhang | 2 | 381 | 18.78 |
| Louis, S.J. | 3 | 11 | 0.92 |