Discrete Time Saturation Constrained Adaptive Pole Assignment Control

Author(s):  
Cishen Zhang
2006 ◽  
Vol 6 (3) ◽  
pp. 641-649
Author(s):  
B. Cantó ◽  
◽  
C. Coll ◽  
A. Herrero ◽  
E. Sánchez ◽  
...  

2017 ◽  
Vol 40 (6) ◽  
pp. 1956-1969 ◽  
Author(s):  
Junchang Zhai ◽  
Liqun Gao ◽  
Steven Li

This paper is concerned with robust pole assignment optimization for synthesizing feedback control systems via state feedback or observer-based output feedback in specified union regions using the harmony search algorithm. By using exact pole placement theory and the harmony search algorithm, robust pole assignment for linear discrete-time systems or linear continuous-time systems in union regions can be converted into a global dynamical optimization problem. The robust measured indices are derived for robust union region stability constraints and a robust [Formula: see text] performance. For the nonlinear, robust measured indices, a set of dynamic poles and the corresponding feedback controllers can be obtained by global dynamic optimization based on the harmony search algorithm and the idea of robust exact pole assignment. One key merit of the proposed approach is that the radius or the position of the sub-regions can be arbitrarily specified according to the transient performance request. Furthermore, the eigenstructure of the closed-loop system matrix can be optimized with better robustness for the proposed approach. Finally, the simulation results for a discrete-time system and a continuous-time system demonstrate the effectiveness and superiority of the proposed method.


Sign in / Sign up

Export Citation Format

Share Document