Self-adaptive tripping strategy based on Dijkstra algorithm for wide-area protection
DOI：10.7667/PSPC171208
Key Words:tripping strategy  graph theory  Dijkstra algorithm  wide-area protection
Author NameAffiliationE-mail
ZHAO Jianwen School of Electrical and Control Engineering, Xi’an University of Science and Technology, Xi’an 710054, China  
ZHANG Guangxiao School of Electrical and Control Engineering, Xi’an University of Science and Technology, Xi’an 710054, China  
TONG Xiaoyang School of Electrical Engineering, Xi’an Jiaotong University, Chengdu 610031, China xytong@swjtu.cn 
Hits: 3203
Download times: 1199
Abstract:In order to minimize the range of fault isolation and achieve the rapid self-adaptive trip of large-scale interconnected power grid, a wide-area self-adaptive tripping strategy based on graph theory search technology is proposed. Starting from the graph theory perspective, the protected element-circuit breaker adjacency matrix and circuit breaker adjacency matrix are set up, and the adjacency matrix is modified based on the operation state of the circuit breaker; with fault element or failure circuit breaker as source point, circuit breaker paths connected with source point is obtained through Dijkstra algorithm. Finally, self-adaptive tripping strategy is established by the distance values and paths. According to the examples analysis, the method proposed can be used to achieve the online search of tripping circuit breaker based on the real-time topological structure of the power grid, fault element position and circuit breaker state, and the tripping strategy can be used to meet the coordination requirements of wide-area protection. This work is supported by Industry Key Research Foundation of Shaanxi Province (No. 2015GY049).
View Full Text  View/Add Comment  Download reader