Searcharxiv⌕ Search

arXiv subjects

Wenchuan Wu

Publications and source records attributed to Wenchuan Wu.

54 records · Page 3Linked to original sources

Stochastic Dispatch of Energy Storage in Microgrids: An Augmented Reinforcement Learning Approach

The dynamic dispatch (DD) of battery energy storage systems (BESSs) in microgrids integrated with volatile energy resources is essentially a multiperiod stochastic optimization problem (MSOP). Because the life span of a BESS is significantly affected by its charging and discharging behaviors, its lifecycle degradation costs should be incorporated into the DD model of BESSs, which makes it non-convex. In general, this MSOP is intractable. To solve this problem, we propose a reinforcement learning (RL) solution augmented with Monte-Carlo tree search (MCTS) and domain knowledge expressed as dispatching rules. In this solution, the Q-learning with function approximation is employed as the basic learning architecture that allows multistep bootstrapping and continuous policy learning. To improve the computation efficiency of randomized multistep simulations, we employed the MCTS to estimate the expected maximum action values. Moreover, we embedded a few dispatching rules in RL as probabilistic logics to reduce infeasible action explorations, which can improve the quality of the data-driven solution. Numerical test results show the proposed algorithm outperforms other baseline RL algorithms in all cases tested.

eess.SY↗

Two-stage Deep Reinforcement Learning for Inverter-based Volt-VAR Control in Active Distribution Networks

Model-based Vol/VAR optimization method is widely used to eliminate voltage violations and reduce network losses. However, the parameters of active distribution networks(ADNs) are not onsite identified, so significant errors may be involved in the model and make the model-based method infeasible. To cope with this critical issue, we propose a novel two-stage deep reinforcement learning (DRL) method to improve the voltage profile by regulating inverter-based energy resources, which consists of offline stage and online stage. In the offline stage, a highly efficient adversarial reinforcement learning algorithm is developed to train an offline agent robust to the model mismatch. In the sequential online stage, we transfer the offline agent safely as the online agent to perform continuous learning and controlling online with significantly improved safety and efficiency. Numerical simulations on IEEE test cases not only demonstrate that the proposed adversarial reinforcement learning algorithm outperforms the state-of-art algorithm, but also show that our proposed two-stage method achieves much better performance than the existing DRL based methods in the online application.

eess.SY↗

Linear Programming Contractor for Interval Distribution State Estimation Using RDM Arithmetic

State estimation (SE) of distribution networks heavily relies on pseudo measurements that introduce significant errors, since real-time measurements are insufficient. Interval SE models are regularly used, where true values of system states are supposed to be within the estimated ranges. However, conventional interval SE algorithms cannot consider the correlations of same interval variables in different terms of constraints, which results in overly conservative estimation results. In this paper, we propose a Linear Programming (LP) Contractor algorithm that uses a relative distance measure (RDM) interval operation to solve this problem. In the proposed model, measurement errors are assumed to be bounded into given sets, thus converting the state variables to RDM variables. In this case, the SE model is a non-convex model, and the solution credibility cannot be guaranteed. Therefore, each nonlinear measurement equation in the model is transformed into dual inequality linear equations using the mean value theorem. The SE model is finally reformulated as a linear programming contractor that iteratively narrows the upper and lower bounds of the system state variables. Numerical tests on IEEE three-phase distribution networks show that the proposed method outperforms the conventional interval-constrained propagation, modified Krawczyk-operator and optimization based interval SE methods.

eess.SY↗

An optimal dispatch scheme for DSO and prosumers by implementing three-phase distribution locational marginal prices

Since distribution system operator (DSO) cannot directly control prosumers with controllable resources,this paper proposes an optimal dispatch method of using three-phase distribution locational marginal prices (DLMPs) as effective economic signals to incentivize prosumers' behaviors. In the proposed three-phase DLMP model, DLMPs for both active power and reactive power are calculated. To alleviate the imbalance, congestions and voltage violations in active distribution networks (ADNs),the DSO and prosumers should be coordinated. We develop such a coordinated control scheme for the DSO and prosumers,in which the DSO generates and broadcasts three-phase DLMPs as price signals to induce prosumers' behaviors. We prove that given the DLMPs for active power and reactive power as settlement prices, the optimal dispatch of the ADN will also maximize the surplus of prosumers. Therefore, the power output of rational prosumers will match the optimal dispatch,resulting in better operational conditions of ADNs. Then the three-phase imbalance,congestions and voltage violations will be well reduced. Numerical tests demonstrate the effectiveness of the proposed approach.

eess.SY↗

Human-like machine thinking: Language guided imagination

Human thinking requires the brain to understand the meaning of language expression and to properly organize the thoughts flow using the language. However, current natural language processing models are primarily limited in the word probability estimation. Here, we proposed a Language guided imagination (LGI) network to incrementally learn the meaning and usage of numerous words and syntaxes, aiming to form a human-like machine thinking process. LGI contains three subsystems: (1) vision system that contains an encoder to disentangle the input or imagined scenarios into abstract population representations, and an imagination decoder to reconstruct imagined scenario from higher level representations; (2) Language system, that contains a binarizer to transfer symbol texts into binary vectors, an IPS (mimicking the human IntraParietal Sulcus, implemented by an LSTM) to extract the quantity information from the input texts, and a textizer to convert binary vectors into text symbols; (3) a PFC (mimicking the human PreFrontal Cortex, implemented by an LSTM) to combine inputs of both language and vision representations, and predict text symbols and manipulated images accordingly. LGI has incrementally learned eight different syntaxes (or tasks), with which a machine thinking loop has been formed and validated by the proper interaction between language and vision system. The paper provides a new architecture to let the machine learn, understand and use language in a human-like way that could ultimately enable a machine to construct fictitious 'mental' scenario and possess intelligence.

cs.CL↗

Analytical Solution for Stochastic Unit Commitment Considering Wind Power Uncertainty with Gaussian Mixture Model

To capture the stochastic characteristics of renewable energy generation output, the chance-constrained unit commitment (CCUC) model is widely used. Conventionally, analytical solution for CCUC is usually based on simplified probability assumption or neglecting some operational constraints, otherwise scenar-io-based methods are used to approximate probability with heavy computation burden. In this paper, Gaussian mixture model (GMM) is employed to characterize the correlation between wind farms and probability distribution of their forecast errors. In our model, chance constraints including reserve sufficiency and branch power flow bounds are ensured to be satisfied with pre-determined probability. To solve this CCUC problem, we propose a Newton method based procedure to acquire the quantiles and transform chance constraints into deterministic constraints. Therefore, the CCUC model is efficiently solved as a mixed-integer quadratic programming problem. Numerical tests are performed on several systems to illustrate efficiency and scalability of the proposed method.

math.OC↗

Stochastic Real-time Power Dispatch with Large-scale Wind Power Integration and its Analytical solution

Real-time power dispatch (RTD) can coordinate wind farms, automatic generation control (AGC) units and non AGC units. In RTD, the probable wind power forecast errors (WPFE) should be appropriately formulated to ensure system security with high probability and minimize operational cost. Previous studies and our onsite tests show that Cauchy distribution (CD) effectively fits the leptokurtic feature of small timescale WPFE distributions. In this paper, we propose a chance-constrained real time dispatch (CCRTD) model with the WPFE represented by CD. Since the CD is stable and has promising mathematical characteristics, the proposed CCRTD model can be analytically transformed to a convex optimization problem considering the dependence among wind farms outputs. Moreover, the proposed model incorporates an affine control strategy compatible with AGC systems. This strategy makes the CCRTD adaptively take into account both the additional power ramping requirement and power variation on transmission lines caused by WPFE in RTD stage. Numerical test results show that the proposed method is reliable and effective. Meanwhile it is very efficient and suitable for real-time application.

math.OC↗

A Water Mass Method and Its Application to Integrated Heat and Electricity Dispatch Considering Thermal Dynamics

Currently, most district heating networks are running in a heat-setting mode, limiting the adjustment of the electrical power of combined heat and power (CHP) units. By considering the electrical power system (EPS) and district heating system (DHS) together, the peak regulatory capability of CHP units can be improved and renewable energy accommodation can be promoted. In this paper, a tractable integrated heat and electricity dispatch (IHED) model is described that addresses the thermal dynamic characteristics of pipelines and buildings to increase flexibility. To deal with the complexity of the optimization model, a water mass method (WMM) for pipeline thermal dynamics is proposed. Benefiting from the WMM, the proposed IHED model is an ordinary, non-linear model. An iterative algorithm based on the generalized Benders decomposition, and a sequential approach combined with the iterative algorithm and IPOPT, are proposed to solve the IHED model. Compared with a steady state model without thermal dynamics, considering the thermal dynamic characteristics in the DHS can further expand the peak regulatory capabilities of CHP units. The WMM is tested in the thermal dynamic simulations compared to an existing node method and a commercial simulation software. And the proposed solution strategy is verified in a small-scale system and a practical system. The simulation results of case studies are discussed to demonstrate the feasibility and economy of the dispatch model proposed here.

eess.SY↗

Recover Feasible Solutions for SOCP Relaxation of Optimal Power Flow Problems in Mesh Networks

Convex relaxation methods have been studied and used extensively to obtain an optimal solution to the optimal power flow (OPF) problem. Meanwhile, convex relaxed power flow equations are also prerequisites for efficiently solving a wide range of problems in power systems including mixed-integer nonlinear programming (MINLP) and distributed optimization. When the exactness of convex relaxations is not guaranteed, it is important to recover a feasible solution for the convex relaxation methods. This paper presents an alternative convex optimization (ACP) approach that can efficiently recover a feasible solution from the result of second-order cone programming (SOCP) relaxed OPF in mesh networks. The OPF problem is first formulated as a difference-of-convex (DC) programming problem, then efficiently solved by a penalty convex concave procedure (CCP). CCP iteratively linearizes the concave parts of the power flow constraints and solves a convex approximation of the DCP problem. Numerical tests show that the proposed method can find a global or near-global optimal solution to the AC OPF problem, and outperforms those semidefinite programming (SDP) based algorithms.

eess.SY↗

Robust Capacity Assessment of Distributed Generation in Unbalanced Distribution Networks Incorporating ANM Techniques

To settle a large-scale integration of renewable distributed generations (DGs), it requires to assess the maximal DG hosting capacity of active distribution networks (ADNs). For fully exploiting the ability of ADNs to accommodate DG, this paper proposes a robust comprehensive DG capacity assessment method considering three-phase power flow modelling and active network management (ANM) techniques. The two-stage adjustable robust optimization is employed to tackle the uncertainties of load demands and DG outputs. With our method, system planners can obtain the maximum penetration level of DGs with their optimal sizing and sitting decisions. Meanwhile, the robust optimal ANM schemes can be generated for each operation time period, including network reconfiguration, on-load-tap-changers regulation, and reactive power compensation. In addition, a three-step optimization algorithm is proposed to enhance the accuracy of DG capacity assessment results. The optimality and robustness of our method are validated via numerical tests on an unbalanced IEEE 33-bus distribution system.

eess.SY↗

Optimal Residential Demand Response Considering the Operational Constraints of Unbalanced Distribution Networks

As a typical approach of demand response (DR), direct load control (DLC) enables load service entity (LSE) to adjust electricity usage of home-end customers for peak shaving during DLC event. Households are connected in low voltage distribution networks, which is three phase unbalanced. However, existing works have not considered the network constraints and operational constraints of three phase unbalanced distribution systems, thus may ending up with decisions that deviate from reality or even infeasible in real world. This paper proposes residential DLC considering associated constraints of three phase unbalanced distribution networks. Numerical tests on a modified IEEE benchmark system demonstrate the effectiveness of the method.

math.OC↗

Robust Reactive Power Optimization and Voltage Control Method for Active Distribution Networks via Dual Time-scale Coordination

In distribution networks, there are slow controlling devices and fast controlling devices for Volt-VAR regulation. These slow controlling devices, such as capacitors or voltage regulators, cannot be operated frequently and should be scheduled tens of minutes ahead (Hereafter named as slow control). Since of the uncertainties in predicting the load and distributed generation, the voltage violations cannot be eliminated by fast controlling devices with improper schedule of the slow controlling devices. In this paper we propose dual time-scale coordination for the Volt-VAR control scheme, corresponding to slow and fast control. In the case of slow control, a robust voltage and reactive power optimization model is developed. This guarantees that subsequent fast controls can maintain the system's voltage security if the uncertain parameters vary within predefined limits. This nonconvex optimization problem is relaxed to a mix integer second order conic problem, and the dual form of its sub-problem is also derived. Then a column-and-constraint generation algorithm was used to solve the robust convexified model. A conventional deterministic optimization model can be used to determine the fast control mechanism. Numerical tests were conducted on a real distribution feeder in China, a balanced IEEE 69-bus and unbalanced 123-bus benchmark distribution networks. The simulation results show that solving the deterministic model is not always feasible and voltage violation may occur. The robust model was shown to be effective with respect to all possible scenarios in the uncertainty set, with little compromise in terms of network losses.

eess.SY↗

Coordinated Multi-area Economic Dispatch via Critical Region Projection

A coordinated economic dispatch method for multi-area power systems is proposed. Choosing boundary phase angles as coupling variables, the proposed method exploits the structure of critical regions in local problems defined by active and inactive constraints. For a fixed boundary state given by the coordinator, local operators compute the coefficients of critical regions containing the boundary state and of the optimal cost functions then communicate them to the coordinator who in turn optimizes the boundary state to minimize the overall cost. By iterating between local operators and the coordinator, the proposed algorithm converges to the global optimal solution in finite steps, and it requires limited information sharing.

math.OC↗

Performance Analysis of Sparse Recovery Models for Bad Data Detection and State Esti-mation in Electric Power Networks

This paper investigates the sparse recovery models for bad data detection and state estimation in power networks. Two sparse models, the sparse L1-relaxation model (L1-R) and the multi-stage convex relaxation model (Capped-L1), are compared with the weighted least absolute value (WLAV) in the aspects of the bad data processing capacity and the computational efficiency. Numerical tests are conducted on power systems with linear and nonlinear measurements. Based on numerical tests, the paper evaluates the performance of these robust state estimation mod-els. Furthermore, suggestion on how to select parameter of sparse recovery models is also given when they are used in elec-tric power networks.

math.OC↗

An Exact Linearization Method for OLTC of Transformer in Branch Flow Model

The branch flow based optimal power flow(OPF) problem in radianlly operated distribution networks can be exactly relazed to a second order cone programming (SOCP) model without considering transformers. However, the introdution of nonlinear transformer models will make the OPF model non-convex. This paper presents an exact linearized transformer's OLTC model to keep the OPF model convex via binary expanstion scheme and big-M method. Validity of the proposed method is verified using IEEE 33-bus test system.

eess.SY↗

Distributed Robust Bilinear State Estimation for Power Systems with Nonlinear Measurements

This paper proposes a fully distributed robust state-estimation (D-RBSE) method that is applicable to multi-area power systems with nonlinear measurements. We extend the recently introduced bilinear formulation of state estimation problems to a robust model. A distributed bilinear state-estimation procedure is developed. In both linear stages, the state estimation problem in each area is solved locally, with minimal data exchange with its neighbors. The intermediate nonlinear transformation can be performed by all areas in parallel without any need of inter-regional communication. This algorithm does not require a central coordinator and can compress bad measurements by introducing a robust state estimation model. Numerical tests on IEEE 14-bus and 118-bus benchmark systems demonstrate the validity of the method.

eess.SY↗

A Fully Distributed Reactive Power Optimization and Control Method for Active Distribution Networks

This paper proposes a fully distributed reactive power optimization algorithm that can obtain the global optimum of non-convex problems for distribution networks without a central coordinator. Second-order cone (SOC) relaxation is used to achieve exact convexification. A fully distributed algorithm is then formulated corresponding to the given division of areas based on an alternating direction method of multipliers (ADMM) algorithm, which is greatly simplified by exploiting the structure of active distribution networks (ADNs). The problem is solved for each area with very little interchange of boundary information between neighboring areas. The standard ADMM algorithm is extended using a varying penalty parameter to improve convergence. The validity of the method is demonstrated via numerical simulations on an IEEE 33-node distribution network, a PG&E 69-node distribution system, and an extended 137-node system.

math.OC↗