No Arabic abstract
During the last decades, significant advances have been made in the area of power system stability and control. Nevertheless, when this analysis is carried out by means of decentralized conditions in a general network, it has been based on conservative assumptions such as the adoption of lossless networks. In the current paper, we present a novel approach for decentralized stability analysis and control of power grids through the transformation of both the network and the bus dynamics into the system reference frame. In particular, the aforementioned transformation allows us to formulate the network model as an input-output system that is shown to be passive even if the networks lossy nature is taken into account. We then introduce a broad class of bus dynamics that are viewed as multivariable input/output systems compatible with the network formulation, and appropriate passivity conditions are imposed on those that guarantee stability of the power network. We discuss the opportunities and advantages offered by this approach while explaining how this allows the inclusion of advanced models for both generation and power flows. Our analysis is verified through applications to the Two Area Kundur and the IEEE 68-bus test systems with both primary frequency and voltage regulation mechanisms included.
Dynamical systems, for instance in model predictive control, often contain unknown parameters, which must be determined during system operation. Online or on-the-fly parameter identification methods are therefore necessary. The challenge of online methods is that one must continuously estimate parameters as experimental data becomes available. The existing techniques in the context of time-dependent partial differential equations exclude the case where the system depends nonlinearly on the parameters.Based on a model reference adaptive system approach, we present an online parameter identification method for nonlinear infinite-dimensional evolutionary system.
We consider the problem of distributed secondary frequency regulation in power networks such that stability and an optimal power allocation are attained. This is a problem that has been widely studied in the literature, and two main control schemes have been proposed, usually referred to as primal-dual and distributed averaging proportional-integral (DAPI) respectively. However, each has its limitations, with the former requiring knowledge of uncontrollable demand, which can be difficult to obtain in real time, and with the existing literature on the latter being based on static models for generation and demand. We propose a novel control scheme that overcomes these issues by making use of generation measurements in the control policy. In particular, our analysis allows distributed stability and optimality guarantees to be deduced with practical measurement requirements and permits a broad range of linear generation dynamics, that can be of higher order, to be incorporated in the power network. We show how the controller parameters can be selected in a computationally efficient way by solving appropriate linear matrix inequalities (LMIs). Furthermore, we demonstrate how the proposed analysis applies to several examples of turbine governor models. The practicality of our analysis is demonstrated with simulations on the Northeast Power Coordinating Council (NPCC) 140-bus system that verify that our proposed controller achieves convergence to the nominal frequency and an economically optimal power allocation.
Understanding the feasible power flow region is of central importance to power system analysis. In this paper, we propose a geometric view of the power system loadability problem. By using rectangular coordinates for complex voltages, we provide an integrated geometric understanding of active and reactive power flow equations on loadability boundaries. Based on such an understanding, we develop a linear programming framework to 1) verify if an operating point is on the loadability boundary, 2) compute the margin of an operating point to the loadability boundary, and 3) calculate a loadability boundary point of any direction. The proposed method is computationally more efficient than existing methods since it does not require solving nonlinear optimization problems or calculating the eigenvalues of the power flow Jacobian. Standard IEEE test cases demonstrate the capability of the new method compared to the current state-of-the-art methods.
This paper develops a grey-box approach to small-signal stability analysis of complex power systems that facilitates root-cause tracing without requiring disclosure of the full details of the internal control structure of apparatus connected to the system. The grey-box enables participation analysis in impedance models, which is popular in power electronics and increasingly accepted in power systems for stability analysis. The Impedance participation factor is proposed and defined in terms of the residue of the whole-system admittance matrix. It is proved that, the so defined impedance participation factor equals the sensitivity of the whole-system eigenvalue with respect to apparatus impedance. The classic state participation factor is related to the impedance participation factor via a chain-rule. Based on the chain-rule, a three-layer grey-box approach, with three degrees of transparency, is proposed for root-cause tracing to different depths, i.e. apparatus, states, and parameters, according to the available information. The association of impedance participation factor with eigenvalue sensitivity points to the re-tuning that would stabilize the system. The impedance participation factor can be measured in the field or calculated from the black-box impedance spectra with little prior knowledge required.
Electric power distribution systems will encounter fluctuations in supply due to the introduction of renewable sources with high variability in generation capacity. It is therefore necessary to provide algorithms that are capable of dynamically finding approximate solutions. We propose two semi-distributed algorithms based on ADMM and discuss their advantages and disadvantages. One of the algorithms computes a feasible approximate of the optimal power allocation at each instance. We require coordination between the nodes to guarantee feasibility of each of the iterates. We bound the distance from the approximate solutions to the optimal solution as a function of the variation in optimal power allocation. Finally, we verify our results via experiments.