No abstract

A non-intrusive load monitoring (NILM) process is intended to allow for the separation of individual appliances from an aggregated energy reading in order to estimate the operation of individual loads. In the past, electricity meters specified only active power readings, for billing purposes, thus limiting NILM capabilities. Recent progress in smart metering technology has introduced cost-effective, household-consumer-grade metering products, which can produce multiple features with high accuracy. In this paper, a new method is proposed for applying a BIRCH (balanced iterative reducing and clustering using hierarchies) algorithm as part of a multi-dimensional load disaggregation solution based on the extraction of multiple features from a smart meter. The method uses low-frequency meter reading and constructs a multi-dimensional feature space with adaption to smart meter parameters and is useful for type I as well as type II loads with the addition of timers. This new method is described as energy disaggregation in NILM by means of multi-dimensional BIRCH clustering (DNB). It is simple, fast, uses raw meter sampling, and does not require preliminary training or powerful hardware. The algorithm is tested using a private dataset and a public dataset.

Power flow calculations are an essential stage in many planning and control applications for distribution systems.To use these in control applications, however, the calculation time needs to be improved, and this can be done by the use of a trained ANN. This paper presents the considerations for constructing ANNs for DSs, and describes a method for training the system in order to support switching events representing a change in topology. The solutions for three DSs, balanced as well as unbalanced, are presented and the various considerations affecting the most appropriate ANN construction are discussed. The results are compared to the solution from the classical complex Newton-Raphson and the fixed-point iterative methods. The solutions have very high precision and good results are found for switched laterals. The computational performance is also compared and an improvement of two orders of magnitude is observed.

This paper presents a novel modular voltage control algorithm for optimal scheduling of a distribution system’s load tap changers to minimize the number of tap changes while maintaining a voltage deviation (VD) around a desired target. To this end, a bi-objective optimal voltage regulation (OVR) problem is addressed in two distinct stages. First, the operational constraint on the load tap changer is removed to form a single-objective OVR problem relating to the voltage. The solution obtained in this stage is ultimately utilized to determine the penalty value assigned to the distance from the optimal (solely in terms of voltage) control value. In the second stage, the optimal scheduling problem is formulated as a minimum-cost-path problem, which can be efficiently solved via dynamic programming. This approach allows the identification of optimal scheduling that considers both the voltage-related objective as well as the number of load tap changer switching operations with no added computational burden beyond that of a simple voltage optimization problem. The method imposes no restriction on the load tap changer’s operation and is tested under two different target functions on the standard IEEE-123 test case. The first attains a nominal voltage with a 0.056 p.u. voltage deviation and the second is the well-known conservation voltage reduction (CVR) case with a 0.17 p.u. voltage deviation. The method is compared to an evolutionary-based algorithm and shows significant improvement in the voltage deviation by a factor of 3.5 as well as a computation time acceleration of two orders of magnitude. The paper demonstrates the effectiveness and potential of the proposed method as a key feature in future cutting-edge OVR methods.