A Multi-Stage Real-Time Fast Search Method for Closed-Loop Paths Based on Grid Hierarchical Partitioning Characteristics

Abstract

Prior to switching operations, the dispatch automation system is required to be able to search for closed-loop paths quickly in real time. In order to improve the efficiency of closed-loop path search, this paper proposes a multi-stage real-time fast search method for closed-loop paths based on the characteristics of power grid hierarchical partitioning. First, we divide the closed-loop judgement process into three phases: initialization, acceptance of the closed-loop judgement command, and post-operation. Then, we define three types of nodes, including root nodes, same-layer contact nodes, and common nodes, and construct path data models for each type of node in accordance with the node liaison relationship in grid hierarchical zoning. In the initialization phase, we design a method for the automatic generation of real-time nodal path data models and study a hierarchical partitioned closed-loop path search method based on a nodal path data model for the phase of accepting closed-loop judgement commands. Next, we design a fast local correction method for nodal path models after the switch closure and disconnection operations in the post-operation idle phase are performed. Finally, a real power grid model is used as an example to test the above closed-loop path search method, which improves the search efficiency by eight times compared with the conventional breadth-first search method. The method is applicable to real large and complex power grids.