.png){kind=icon}
.png){kind=icon}
Return
Dynamic Collaborative Fireworks Algorithm and its applications in robust pole assignment optimization
.png){kind=icon}
PRE
AI
DOI：10.1016/j.asoc.2020.106999.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Pole assignment optimization is important for improving system stability. This paper considers the regional pole assignment optimization based on the swam intelligence optimization algorithm. Regular pole assignment cannot overcome the effect of system disturbance and cannot reach the best control performance. And the firework algorithm (FWA) often ignore valuable local search opportunity and its selection mechanism taken much computation effort. Therefore, a Dynamic Collaborative Fireworks Algorithm (DCFWA) which reserves the advantages of Fireworks Algorithm (FWA) is presented for solve these problems, and a few features of the proposed algorithm as follows. First, a new explosion radius scaling strategy is designed by adjusting the scaling coefficient according to the distribution of optimal value points, which effectively enhances the optimal firework's search capability. Second, a new offspring fireworks selection method is built for avoiding the algorithm falling into local optimum. Third, a new initialization method is embedded into the algorithm for improving global search capability. Some well-known algorithms and our proposed algorithm are applied to several types of pole assignment optimization of control systems. The comparison results indicate that the proposed algorithm does outperform the other ones. (c) 2020 Elsevier B.V. All rights reserved.
Keywords:
Pole assignment optimization
Dynamic Collaborative Firework Algorithm
Firework algorithm
Search capability
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6.6
Papers:
1.4W
Citations:
4.8W