Distributed topology processing solution for distributed controls in distribution automation systems. Issue 3 (1st February 2017)

• Record Type: Journal Article
• Authors: Zhu, Zhengyi; Xu, Bingyin; Brunner, Christoph; Guise, Laurent; Han, GuoZheng
• Is Part Of: IET generation, transmission & distribution. Volume 11:Issue 3(2017)
• Page Start: 776
• Page End: 784
• Publication Date: 2017-02-01
• Subjects: distributed control -- power distribution control -- power distribution reliability -- power grids -- graph theory -- fault location -- power system restoration; distributed topology processing -- distribution automation system -- distributed control device -- active distribution network -- system reliability enhancement -- system flexibility enhancement -- real‐time topology information transfer -- distributed operation -- master station computational burden reduction -- distributed applications -- grid topology reduction -- undirected graph -- graph connectivity algorithm -- Lagrange multiplier method -- subtask allocation -- neighbour‐to‐neighbour communication -- fault location scheme -- service restoration scheme -- fault isolation scheme; Electric power production -- Periodicals; Electric power transmission -- Periodicals; Electric power distribution -- Periodicals; 621.3105
• DOI: 10.1049/iet-gtd.2016.0421
• Languages: English
• ISSNs: 1751-8687

Abstract

Abstract : In the environment of active distribution network, more distributed control devices are deployed to enhance the system reliability and flexibility. The master station of the distribution automation system is required to transfer real‐time topology information to numerous field devices for implementing the distributed operations. To reduce the computational burden of the master station and to make it more autonomous for the distributed agents to utilise the topology information, this study proposes a fully distributed solution to topology processing for the distributed applications. It reduces the grid topology to an undirected graph, divides it into subgraphs and executes a distributed adaptation of graph connectivity algorithm to solve the problem. The algorithm uses the Lagrange multiplier method to optimise the subtask allocation and neighbour‐to‐neighbour communications to compute the graph connectivity. The configuration technique and the usage are presented to illustrate the distributed approach. The algorithm is applied in a fault location, isolation and service restoration scheme to demonstrate its effectiveness. It is compared with the centralised method to highlight the improved performances. Test results show that the algorithm can recognise changes in real‐time topology correctly and has significant advantages.