Design of robust power system controllers using linear matrix inequalities

Author(s):  
F. Escudero Scavoni ◽  
A.S. e Silva ◽  
A. Trofino Neto ◽  
J.M. Campagnolo
2018 ◽  
Vol 10 (10) ◽  
pp. 4-19
Author(s):  
Magomed G. GADZHIYEV ◽  
◽  
Misrikhan Sh. MISRIKHANOV ◽  
Vladimir N. RYABCHENKO ◽  
◽  
...  

2011 ◽  
Vol 354-355 ◽  
pp. 974-977 ◽  
Author(s):  
Jing Ma ◽  
Rui Guo ◽  
Tong Wang

An algorithm of mixed H2/H∞ based LMI algorithm for damping inter-area oscillations is investigated. A feedback controller is designed for such problem, which takes the uncertainty of power system parameter into account. In order to gain desired dynamic and steady state qualities, a pole-placement technique based on Linear Matrix Inequalities is used. At last, simulation of 4-machine 2-area system using this method is carried out, which proves the validity and robust of the designed controller. Different operating conditions are considered to validate the adaptability of this algorithm.


Author(s):  
Abbas Zabihi Zonouz ◽  
Mohammad Ali Badamchizadeh ◽  
Amir Rikhtehgar Ghiasi

In this paper, a new method for designing controller for linear switching systems with varying delay is presented concerning the Hurwitz-Convex combination. For stability analysis the Lyapunov-Krasovskii function is used. The stability analysis results are given based on the linear matrix inequalities (LMIs), and it is possible to obtain upper delay bound that guarantees the stability of system by solving the linear matrix inequalities. Compared with the other methods, the proposed controller can be used to get a less conservative criterion and ensures the stability of linear switching systems with time-varying delay in which delay has way larger upper bound in comparison with the delay bounds that are considered in other methods. Numerical examples are given to demonstrate the effectiveness of proposed method.


Author(s):  
Jeremy Nicola ◽  
Luc Jaulin

Linear matrix inequalities (LMIs) comprise a large class of convex constraints. Boxes, ellipsoids, and linear constraints can be represented by LMIs. The intersection of LMIs are also classified as LMIs. Interior-point methods are able to minimize or maximize any linear criterion of LMIs with complexity, which is polynomial regarding to the number of variables. As a consequence, as shown in this paper, it is possible to build optimal contractors for sets represented by LMIs. When solving a set of nonlinear constraints, one may extract from all constraints that are LMIs in order to build a single optimal LMI contractor. A combination of all contractors obtained for other non-LMI constraints can thus be performed up to the fixed point. The resulting propogation is shown to be more efficient than other conventional contractor-based approaches.


Sign in / Sign up

Export Citation Format

Share Document