Estimating the utility harmonic impedance of a point of common coupling (PCC) is of significance to harmonic emission level evaluation. The most existing methods for estimating the utility harmonic impedance are based on the assumptions that the background harmonic fluctuates in a small range, and the customer harmonic impedance is much larger than the utility harmonic impedance, etc. However, in modern power grid, due to the influence of filter and reactive power compensator, those assumptions are not always satisfied. Just depending on the stochastic characteristic of the utility harmonic current, this article proposes a method for estimating the utility harmonic impedance based on semiparametric estimation. The input of the proposed method is the measured voltage and current at the PCC. The kernel density estimation method, one of the nonparametric methods, is used to depict the probability distribution characteristics of the utility harmonic current, and the impedance is obtained according to maximum likelihood estimation (MLE) criterion. The performance of the proposed method is verified by simulation experiments and field-measured data. The results validate that the proposed method outperforms the existing methods when the background harmonic is fluctuating and the utility harmonic impedance is close to the customer harmonic impedance.
19 March 2024 in IEEE Transactions on Power Delivery
With the advancement of new power systems, an increasing number of new energy power stations and nonlinear loads are connecting to the grid. This has led to a more serious problem of harmonic pollution, with an increase in harmonic sources within the power grid. Estimating the harmonic impedance on the utility side is crucial for assessing harmonic emissions and evaluating harmonic contributions. However, existing methods have some shortcomings in terms of estimation accuracy and robustness. This paper proposes a method for estimating harmonic impedance on utility side based on the Laplace mixture model (LMM) to address these issues. In the proposed method, the LMM of the utility side harmonic current is formulated, and the harmonic impedance on the utility side is subsequently estimated using the maximum likelihood estimation (MLE) and expectation maximization (EM) algorithms. The proposed method demonstrates high estimation accuracy, as it exhibits smaller estimation errors in both simulation and field test cases compared to other estimation methods. Furthermore, even when background harmonics are significant, the proposed method maintains its accuracy.
4 December 2023 in IEEE Transactions on Instrumentation and Measurement
As power systems move toward cleanliness, environmental friendliness and convenience, harmonic pollution is becoming an increasingly serious problem. Determining the location of harmonic sources is the primary task to solve the problem. Existing harmonic location methods usually require known accurate network harmonic impedance parameters, which are difficult to meet in engineering practice. In view of this, this article proposes a harmonic source location method under unknown harmonic network parameters. In the proposed methodology, firstly, we use the measured data and constructed network model to achieve posteriori estimation of harmonic admittance and node voltages inference, then obtain the estimation of harmonic currents and mixture matrix by Independent Component Analysis (ICA). Ultimately, localization of harmonic sources is realized by coding matrix based on the posteriori estimation of harmonic admittance and mixture matrix. Compared with the traditional methods, this method more fully utilizes the known information and achieves good results.
Point clouds scanned by three-dimensional lasers may be multidirectional affine transformed when the specifications for the products, laser scanners, and thermal expansion are incompatible. If a point cloud is out of order in such a case, many existing algorithms may not be suitable to solve the problem. Therefore, this paper proposes a multidirectional affine registration (MDAR) algorithm based on the statistical characteristics and shape features of point clouds. First, we transform the problem into a problem of finding certain matrix eigenvalues. In addition, the similarity of the global vector features is introduced, and the scaling factor is calculated by maximizing the similarity. Finally, using the estimated affine factors, the multidirectional affine registration is transformed into a rigid registration. Simulation results show that the MDAR algorithm has better accuracy and less time consumption than several existing algorithms.
Regitering point clouds quickly and accurately has always been a challenging task. In recent years, Gaussian mixture model is easy to be optimized and therefore widely used, especially in point cloud registration. Without the exponential part, the Cauchy kernel is easier to calculate than the Gaussian kernel, but the Cauchy mixture model is difficult to be optimized. In this paper, point cloud registration is transformed into kernel density estimation by the Cauchy mixture model. Moreover, we use the logarithmic inequality and the Minorize-Maximization algorithm to optimize the Cauchy mixture model successfully. In the experiment, compared with several other algorithms, our method quickly and accurately registers point clouds.