DocumentCode
3040304
Title
The new algorithm for grounding grid fault diagnosis
Author
Qiu, Qirong ; Yu, Ting
Author_Institution
Sch. of Math. & Phys., North China Electr. Power Univ., Beijing, China
fYear
2011
fDate
26-28 July 2011
Firstpage
2719
Lastpage
2723
Abstract
Grounding grid is commonly installed in the substation. When it´s damaged, not only restoring and improving work affects the production, but also it is difficult to carry this work out. In this paper, a new method to solve the problem of grounding grid fault diagnosis is given. Due to the characteristics of grounding grid fault diagnosis, PSO is used. As the particle produced by evolution rules of the PSO often does not meet the constraints, to improve the feasibility of particles, we translate the renewal of particle into nonlinear least squares with the simple bound constrained optimization, and then convert this problem into a constrained quadratic programming by using Gauss-Newton method in the evolutionary process. But for grounding grid fault diagnosis problem, the Hesse matrix of constrained quadratic programming may be non-full rank, so we adopt regular splitting in order to achieve rapid solution. To prevent premature happen, when some particles are near enough to the optimal particle, we renew it by the way the initial particle is generated to increase the diversity of the swarm. The algorithm proposed here could solve the multi-solution problem when accessible nodes are not enough, so we can find out corrosion state of the grounding grid.
Keywords
earthing; fault diagnosis; least squares approximations; particle swarm optimisation; power grids; quadratic programming; substations; Gauss-Newton method; Hesse matrix; PSO; constrained quadratic programming; corrosion state; evolutionary process; fault diagnosis; grounding grid; nonlinear least squares; particle swarm optimization; particles feasibility; simple bound constrained optimization; substation; swarm diversity; Fault diagnosis; Grounding; Mathematical model; Particle swarm optimization; Quadratic programming; Resistance; PSO; accessible nodes; bound constrained; grounding grid; quadratic programming; regular splitting;
fLanguage
English
Publisher
ieee
Conference_Titel
Multimedia Technology (ICMT), 2011 International Conference on
Conference_Location
Hangzhou
Print_ISBN
978-1-61284-771-9
Type
conf
DOI
10.1109/ICMT.2011.6002576
Filename
6002576
Link To Document