Searcharxiv⌕ Search

arXiv subjects

Zhenyu Huang

Publications and source records attributed to Zhenyu Huang.

29 records · Page 2Linked to original sources

Dynamic State Estimation for Power System Control and Protection

Dynamic state estimation (DSE) accurately tracks the dynamics of a power system and provides the evolution of the system state in real-time. This paper focuses on the control and protection applications of DSE, comprehensively presenting different facets of control and protection challenges arising in modern power systems. It is demonstrated how these challenges are effectively addressed with DSE-enabled solutions. As precursors to these solutions, reformulation of DSE considering both synchrophasor and sampled value measurements and comprehensive comparisons of DSE and observers have been presented. The usefulness and necessity of DSE based solutions in ensuring system stability, reliable protection and security, and resilience by revamping of control and protection methods are shown through examples, practical applications, and suggestions for further development.

eess.SY↗

Roles of Dynamic State Estimation in Power System Modeling, Monitoring and Operation

Power system dynamic state estimation (DSE) remains an active research area. This is driven by the absence of accurate models, the increasing availability of fast-sampled, time-synchronized measurements, and the advances in the capability, scalability, and affordability of computing and communications. This paper discusses the advantages of DSE as compared to static state estimation, and the implementation differences between the two, including the measurement configuration, modeling framework and support software features. The important roles of DSE are discussed from modeling, monitoring and operation aspects for today's synchronous machine dominated systems and the future power electronics-interfaced generation systems. Several examples are presented to demonstrate the benefits of DSE on enhancing the operational robustness and resilience of 21st century power system through time critical applications. Future research directions are identified and discussed, paving the way for developing the next generation of energy management systems.

eess.SP↗

On the Efficiency of Solving Boolean Polynomial Systems with the Characteristic Set Method

An improved characteristic set algorithm for solving Boolean polynomial systems is proposed. This algorithm is based on the idea of converting all the polynomials into monic ones by zero decomposition, and using additions to obtain pseudo-remainders. Three important techniques are applied in the algorithm. The first one is eliminating variables by new generated linear polynomials. The second one is optimizing the strategy of choosing polynomial for zero decomposition. The third one is to compute add-remainders to eliminate the leading variable of new generated monic polynomials. By analyzing the depth of the zero decomposition tree, we present some complexity bounds of this algorithm, which are lower than the complexity bounds of previous characteristic set algorithms. Extensive experimental results show that this new algorithm is more efficient than previous characteristic set algorithms for solving Boolean polynomial systems.

cs.SC↗

Adaptive Power System Emergency Control using Deep Reinforcement Learning

Power system emergency control is generally regarded as the last safety net for grid security and resiliency. Existing emergency control schemes are usually designed off-line based on either the conceived "worst" case scenario or a few typical operation scenarios. These schemes are facing significant adaptiveness and robustness issues as increasing uncertainties and variations occur in modern electrical grids. To address these challenges, for the first time, this paper developed novel adaptive emergency control schemes using deep reinforcement learning (DRL), by leveraging the high-dimensional feature extraction and non-linear generalization capabilities of DRL for complex power systems. Furthermore, an open-source platform named RLGC has been designed for the first time to assist the development and benchmarking of DRL algorithms for power system control. Details of the platform and DRL-based emergency control schemes for generator dynamic braking and under-voltage load shedding are presented. Extensive case studies performed in both two-area four-machine system and IEEE 39-Bus system have demonstrated the excellent performance and robustness of the proposed schemes.

cs.LG↗

Comparative Study of Clustering Techniques for Real-Time Dynamic Model Reduction

Dynamic model reduction in power systems is necessary for improving computational efficiency. Traditional model reduction using linearized models or online analysis is not adequate to capture dynamic behaviors of the power system, especially with the new mix of intermittent generation and intelligent consumption making the power system more dynamic and non-linear. Real-time dynamic model reduction has emerged to fill this important need. This paper explores using clustering techniques to analyze real-time phasor measurements to identify groups of generators with similar behavior, as well as a representative generator from each group for dynamic model reduction. Two clustering techniques -- graph clustering and k-means -- are considered. These techniques are compared with a previously developed dynamic model reduction approach using Singular Value Decomposition. Two sample power grid data sets are used to test these different model reduction techniques. Based on the algorithms' relative performance, recommendations are provided for practical use.

physics.soc-ph↗

AMPS: An Augmented Matrix Formulation for Principal Submatrix Updates with Application to Power Grids

We present AMPS, an augmented matrix approach to update the solution to a linear system of equations when the matrix is modified by a few elements within a principal submatrix. This problem arises in the dynamic security analysis of a power grid, where operators need to perform N - k contingency analysis, i.e., determine the state of the system when exactly k links from N fail. Our algorithms augment the matrix to account for the changes in it, and then compute the solution to the augmented system without refactoring the modified matrix. We provide two algorithms, a direct method, and a hybrid direct-iterative method for solving the augmented system. We also exploit the sparsity of the matrices and vectors to accelerate the overall computation. We analyze the time complexity of both algorithms, and show that it is bounded by the number of nonzeros in a subset of the columns of the Cholesky factor that are selected by the nonzeros in the sparse right-hand-side vector. Our algorithms are compared on three power grids with PARDISO, a parallel direct solver, and CHOLMOD, a direct solver with the ability to modify the Cholesky factors of the matrix. We show that our augmented algorithms outperform PARDISO (by two orders of magnitude), and CHOLMOD (by a factor of up to 5). Further, our algorithms scale better than CHOLMOD as the number of elements updated increases. The solutions are computed with high accuracy. Our algorithms are capable of computing N - k contingency analysis on a 778 thousand bus grid, updating a solution with k = 20 elements in 16 milliseconds on an Intel Xeon processor.

cs.CE↗

Adaptive Adjustment of Noise Covariance in Kalman Filter for Dynamic State Estimation

Accurate estimation of the dynamic states of a synchronous machine (e.g., rotor s angle and speed) is essential in monitoring and controlling transient stability of a power system. It is well known that the covariance matrixes of process noise (Q) and measurement noise (R) have a significant impact on the Kalman filter s performance in estimating dynamic states. The conventional ad-hoc approaches for estimating the covariance matrixes are not adequate in achieving the best filtering performance. To address this problem, this paper proposes an adaptive filtering approach to adaptively estimate Q and R based on innovation and residual to improve the dynamic state estimation accuracy of the extended Kalman filter (EKF). It is shown through the simulation on the two-area model that the proposed estimation method is more robust against the initial errors in Q and R than the conventional method in estimating the dynamic states of a synchronous machine.

eess.SY↗

Decentralized Robust Control for Damping Inter-area Oscillations in Power Systems

As power systems become more and more interconnected, the inter-area oscillations has become a serious factor limiting large power transfer among different areas. Underdamped (Undamped) inter-area oscillations may cause system breakup and even lead to large-scale blackout. Traditional damping controllers include Power System Stabilizer (PSS) and Flexible AC Transmission System (FACTS) controller, which adds additional damping to the inter-area oscillation modes by affecting the real power in an indirect manner. However, the effectiveness of these controllers is restricted to the neighborhood of a prescribed set of operating conditions. In this paper, decentralized robust controllers are developed to improve the damping ratios of the inter-area oscillation modes by directly affecting the real power through the turbine governing system. The proposed control strategy requires only local signals and is robust to the variations in operation condition and system topology. The effectiveness of the proposed robust controllers is illustrated by detailed case studies on two different test systems.

eess.SY↗

A Monomial-Oriented GVW for Computing Gröbner Bases

The GVW algorithm, presented by Gao et al., is a signature-based algorithm for computing Gröbner bases. In this paper, a variant of GVW is presented. This new algorithm is called a monomial-oriented GVW algorithm or mo-GVW algorithm for short. The mo-GVW algorithm presents a new frame of GVW and regards {\em labeled monomials} instead of {\em labeled polynomials} as basic elements of the algorithm. Being different from the original GVW algorithm, for each labeled monomial, the mo-GVW makes efforts to find the smallest signature that can generate this monomial. The mo-GVW algorithm also avoids generating J-pairs, and uses efficient methods of searching reducers and checking criteria. Thus, the mo-GVW algorithm has a better performance during practical implementations.

cs.SC↗

Efficient Characteristic Set Algorithms for Equation Solving in Finite Fields and Applications in Cryptanalysis

Efficient characteristic set methods for computing solutions of polynomial equation systems in a finite field are proposed. The concept of proper triangular sets is introduced and an explicit formula for the number of solutions of a proper and monic (or regular) triangular set is given. An improved zero decomposition algorithm which can be used to reduce the zero set of an equation system in general form to the union of zero sets of monic proper triangular sets is proposed. As a consequence, we can give an explicit formula for the number of solutions of an equation system. Bitsize complexity for the algorithm is given in the case of Boolean polynomials. We also give a multiplication free characteristic set method for Boolean polynomials, where the sizes of the polynomials are effectively controlled. The algorithms are implemented in the case of Boolean polynomials and extensive experiments show that they are quite efficient for solving certain classes of Boolean equations.

cs.SC↗

Estimation of the WECC System Inertia Using Observed Frequency Transients

Computer models being developed to understand the interaction between demand-response technology, power system deregulation and market transformation depend in part on understanding the relationship between system frequency and load-control. Frequency, load, and plant outage events data collected over the last several years have permitted analysis to determine the Western Electricity Coordination Council (WECC) system's inertia during each event. This data was used to evaluate the relationship of system inertia to total load, which is used to model system response to load curtailment programs in next generation power system simulations.

nlin.CD↗