Graph-Based Temporary Ground Wire Management in Distribution Network

Abstract

It requires a large number of temporary ground wires for maintenance tasks in distribution network. Because the temporary ground wires can be grounded anywhere, it is difficult to check their states and control them. Currently solutions are generally expensive in city-scale. This paper presents a method that integrates the complex monitor, control and communication modules into a pocket computer key. The abundant of ground wires are controlled by a simple electric lock, which will downgrade the cost of whole system. This paper also proposed a graph-base temporary ground wire management algorithm, which utilizes the Boolean adjacent matrix to determine the ground operations. The experiment results show that algorithm is more efficiency the baseline of the Topological Analysis Algorithm and the Logic-based Analysis Algorithm.