An accident transfer power and ticket generation method, system, device and medium based on transfer power strategy

Abstract

The application discloses an accident power transfer and ticket generation method, system and device based on a power transfer strategy and a medium, and belongs to the technical field of accident power transfer and ticket generation, and comprises the following steps: constructing a real-time topology graph in response to the collection of power grid operation states; performing connected domain splitting on the power grid by taking the fault isolation boundary of the real-time topology graph as a blocking condition to obtain a power loss island set; traversing paths in the real-time topology graph by using a multi-level combination algorithm, and pruning in the traversal process according to a rule constraint system to obtain a feasible power transfer path set; and comprehensively sorting the feasible power transfer path set by using the rule constraint system to generate an operation ticket. The application removes paths that do not meet the determination condition while traversing and advancing, instead of performing centralized filtering after completing full traversal, so that the number of invalid paths entering the subsequent evaluation link is reduced.

Description

Technical Field

[0001] This invention relates to the field of accident-to-electricity transfer and ticketing technology, specifically to an accident-to-electricity transfer and ticketing method, system, equipment, and medium based on a transfer strategy. Background Technology

[0002] Path search typically relies on pre-established static topologies. However, static topologies cannot reflect changes in the operating status of power grid equipment, leading to the inclusion of equipment under maintenance, locked, or fault-isolated states as available nodes in path calculations. Furthermore, once the path search is complete, it's impossible to process different constraints hierarchically, resulting in many infeasible paths being eliminated only at the end of the search. This wastes computational resources and can easily lead to infeasible paths being output as feasible results due to incomplete rule coverage.

[0003] For example, when a fault occurs on a 10kV feeder under a 110kV substation, a sectionalizing switch in an adjacent section of the feeder is under maintenance and marked as out of power during the fault period. However, due to the reliance on a static topology graph, the maintenance status of this switch is not detected. During the path search process, the line segment corresponding to the maintenance switch is included as a valid edge in the search, ultimately outputting a path passing through the maintenance switch, and generating an operation ticket accordingly.

[0004] When on-site staff attempted to operate the switch according to the ticket, the switch was actually under maintenance and could not be operated, causing the power transfer plan to be interrupted and power to the power-loss area to be unable to be restored in a timely manner. Summary of the Invention

[0005] In view of the above-mentioned problems, the present invention provides a method, system, device and medium for accident power transfer and ticketing based on power transfer strategy.

[0006] Therefore, the technical problem solved by the present invention is that the existing static topology cannot reflect the changes in the operating status of power grid equipment, resulting in equipment under maintenance, locked or fault isolated being included as available nodes in the path calculation during the search process.

[0007] To address the aforementioned technical problems, this invention provides the following technical solution: a method for accident-related power transfer and ticket generation based on a power transfer strategy, comprising the following steps: encapsulating power transfer rules in layers using a constructed hierarchical digital rule base to form a rule constraint system; constructing a real-time topology graph in response to the acquisition of power grid operating status; locating fault isolation boundaries in the real-time topology graph, and using the fault isolation boundaries as blocking conditions to split the power grid into connected components, obtaining a set of power outage islands; limiting the path search space with the set of power outage islands, traversing paths in the real-time topology graph using a multi-level combination algorithm, and pruning during the traversal process according to the rule constraint system, obtaining a set of feasible power transfer paths; and comprehensively sorting the set of feasible power transfer paths using the rule constraint system to generate an operation ticket.

[0008] As a preferred embodiment of the accident transfer and ticketing method based on the transfer strategy described in this invention, the step of performing the layered encapsulation includes: dividing the transfer rules into a hard constraint layer, a strategy optimization layer, and a protection adaptation layer according to their constraint properties; encapsulating the rules of the hard constraint layer into decision conditions through first-level conditions; encapsulating the rules of the strategy optimization layer into evaluation conditions through a target weighted evaluation function; encapsulating the rules of the protection adaptation layer into verification conditions through protection setting mapping; and constructing the rule constraint system through the encapsulated rules of the decision conditions, evaluation conditions, and verification conditions.

[0009] As a preferred embodiment of the accident power transfer and ticketing method based on the power transfer strategy described in this invention, the step of encapsulating the rules of the hard constraint layer into decision conditions includes: modeling the rules of the hard constraint layer into multiple Boolean predicates according to the electrical constraint type; parameterizing the constraint thresholds of the multiple Boolean predicates; and incorporating the configured multiple Boolean predicates into the rule constraint system.

[0010] As a preferred embodiment of the accident power transfer and ticketing method based on power transfer strategy described in this invention, the step of constructing the real-time topology graph includes: establishing a topology graph model with power grid equipment as nodes and electrical connection relationships between power grid equipment as edges; updating the state attributes of each node and edge in the topology graph model in response to the acquisition of power grid operating status, thereby forming the real-time topology graph; and storing the real-time topology graph in a hybrid manner combining adjacency matrix and adjacency list.

[0011] As a preferred embodiment of the fault transfer and ticketing method based on the transfer strategy described in this invention, the step of performing connected component splitting of the power grid includes: in the real-time topology graph, determining the fault section through multi-source alarm signals, and generating a fault isolation boundary based on the fault section; using the fault isolation boundary as the blocking condition, and combining the state attributes of each node in the real-time topology graph, performing connected component splitting of the real-time topology graph to obtain an initial island set; and performing validity filtering on the initial island set to obtain the power outage island set.

[0012] As a preferred embodiment of the accident power transfer and ticketing method based on the power transfer strategy described in this invention, the step of traversing the path in the real-time topology graph includes: using multiple search algorithms to form the multi-level combination algorithm, wherein the multiple search algorithms perform parallel traversal of the path search space from multiple search dimensions; merging and deduplicating the traversal results of the multiple search algorithms; and pruning the path in real time according to the rule constraint system during the traversal process, and outputting the set of feasible power transfer paths.

[0013] As a preferred embodiment of the accident power transfer and ticket generation method based on power transfer strategy described in this invention, the step of generating the operation ticket includes: performing comprehensive calculation and synthesis on each path in the feasible power transfer path set using the multi-objective weighted evaluation function of the strategy optimization layer in the rule constraint system to obtain a comprehensive score; arranging the feasible power transfer path set according to the comprehensive score to obtain a path set sequence; setting a screening threshold, selecting the switching operation steps corresponding to the paths in the path set sequence that meet the screening threshold, and generating the operation ticket.

[0014] This invention provides an accident power transfer and ticketing system based on a power transfer strategy.

[0015] To solve the above-mentioned technical problems, the present invention provides the following technical solution: an accident power transfer and ticketing system based on power transfer strategy, comprising: a rule layering and encapsulation module, which encapsulates power transfer rules in layers to form a rule constraint system; The real-time topology building module constructs a real-time topology map in response to the acquisition of power grid operating status. The power outage area division module locates the fault isolation boundary based on the real-time topology map, and performs connected component splitting on the power grid using the fault isolation boundary as the blocking condition to obtain a set of power outage islands. The power transfer path search module defines the path search space by the set of power outage islands, traverses the paths in the real-time topology graph through a multi-level combination algorithm, and performs pruning during the traversal process according to the rule constraint system to obtain a set of feasible power transfer paths. The operation ticket generation module generates operation tickets by comprehensively sorting the set of feasible power transfer paths through the rule constraint system.

[0016] The present invention provides a computer device, including a memory and a processor. The memory stores a computer program, and the processor executes the computer program to implement the steps of the described method for accident power transfer and ticketing based on a power transfer strategy.

[0017] The present invention provides a computer-readable storage medium having a computer program stored thereon, wherein when the computer program is executed by a processor, it implements the steps of the aforementioned method for accident power transfer and ticketing based on a power transfer strategy.

[0018] The beneficial effects of this invention are as follows: In the input stage of path search, this invention constructs a real-time topology graph in response to the acquisition of the power grid operating status, and keeps the status attributes of each node and edge updated synchronously with the power grid operating status, ensuring that the topology graph participating in path search accurately reflects the actual status of each device. This allows the nodes and edges corresponding to maintenance equipment, interlocking equipment, and fault isolation sections to be accurately marked before path traversal, and they are no longer included in the search range as available paths.

[0019] In the path search process, this invention uses the fault isolation boundary in the real-time topology graph as a blocking condition to split the connected components, resulting in a set of power-out islands. The power-out island set limits the path search space, constraining the traversal range of the multi-level combination algorithm to the effective topology region electrically connected to the power-out area. During the traversal, the path is pruned according to the rule constraint system, eliminating paths that do not meet the judgment conditions as the traversal progresses, rather than filtering them all at once after the full traversal is completed, thus reducing the number of invalid paths entering the subsequent evaluation stage. Attached Figure Description

[0020] To more clearly illustrate the technical solutions of the embodiments of the present invention, the accompanying drawings used in the description of the embodiments will be briefly introduced below. Obviously, the accompanying drawings described below are only some embodiments of the present invention. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0021] Figure 1 This is a flowchart illustrating an accident power transfer and ticketing method based on a power transfer strategy, as provided in one embodiment of the present invention.

[0022] Figure 2 The following is an execution sequence diagram of a three-layer rule constraint system for an accident power transfer and ticketing method based on a power transfer strategy, provided as an embodiment of the present invention.

[0023] Figure 3This is a schematic diagram of fault isolation partitioning for an accident power transfer and ticketing method based on a power transfer strategy, provided as an embodiment of the present invention. Detailed Implementation

[0024] To make the present invention more apparent and understandable, the specific embodiments of the present invention will be described in detail below with reference to the accompanying drawings. Obviously, the described embodiments are only a part of the embodiments of the present invention, not all of them. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative effort should fall within the protection scope of the present invention.

[0025] Example 1, referring to Figure 1 This is one embodiment of the present invention, which provides a method for accident power transfer and ticketing based on a power transfer strategy, including the following steps: By constructing a hierarchical digital rule base, the power transfer rules are encapsulated in layers to form a rule constraint system.

[0026] In response to the acquisition of power grid operating status, a real-time topology map is constructed.

[0027] By locating the fault isolation boundary in the real-time topology map, and using the fault isolation boundary as the blocking condition, the power grid is split into connected components to obtain a set of power outage islands.

[0028] The path search space is defined by the set of power outage islands. The paths are traversed in the real-time topology graph through a multi-level combination algorithm. Pruning is performed during the traversal process according to the rule constraint system to obtain a set of feasible power transfer paths.

[0029] The feasible power transfer path set is comprehensively sorted using the aforementioned rule constraint system to generate an operation ticket.

[0030] Path search typically relies on pre-established static topologies. However, static topologies cannot reflect changes in the operating status of power grid equipment, leading to the inclusion of equipment under maintenance, locked, or fault-isolated states as available nodes in path calculations. Furthermore, once the path search is complete, it's impossible to process different constraints hierarchically, resulting in many infeasible paths being eliminated only at the end of the search. This wastes computational resources and can easily lead to infeasible paths being output as feasible results due to incomplete rule coverage.

[0031] In the input stage of path search, this invention constructs a real-time topology graph in response to the acquisition of power grid operating status, and keeps the status attributes of each node and edge updated synchronously with the power grid operating status, ensuring that the topology graph participating in path search accurately reflects the actual status of each device. This allows the nodes and edges corresponding to maintenance equipment, interlocking equipment, and fault isolation sections to be accurately marked before path traversal, and no longer included in the search range as available paths.

[0032] In the path search process, this invention uses the fault isolation boundary in the real-time topology graph as a blocking condition to split the connected components, resulting in a set of power-out islands. The power-out island set limits the path search space, constraining the traversal range of the multi-level combination algorithm to the effective topology region electrically connected to the power-out area. During the traversal, the path is pruned according to the rule constraint system, eliminating paths that do not meet the judgment conditions as the traversal progresses, rather than filtering them all at once after the full traversal is completed, thus reducing the number of invalid paths entering the subsequent evaluation stage.

[0033] Example 2, refer to Figures 1-3 As an embodiment of the present invention, based on the previous embodiment, a method for accident power transfer and ticketing based on a power transfer strategy is provided, including the following steps: S1. By constructing a hierarchical digital rule base, the power transfer rules are encapsulated in layers to form a rule constraint system.

[0034] In this embodiment, the hierarchical digital rule base is a storage system that structures and organizes all the power transfer rules that need to be followed during the power grid transfer process.

[0035] The power transfer rules are derived from dispatching procedures, field operation experience, accident prevention measures, and protection setting specifications. By classifying and summarizing the power transfer rules according to their constraint nature, and solidifying similar rules into conditions that can participate in path search calculations in a unified encapsulation form, a rule constraint system that runs through the entire path search process is finally formed.

[0036] Reference Figure 2 As shown, the steps for layered encapsulation include S1.1 to S1.5: S1.1 Divide the power transfer rules into a hard constraint layer, a strategy optimization layer, and a protection adaptation layer according to the nature of the constraints.

[0037] In this embodiment, constraint nature refers to the type of role that the power transfer rules play in path search. That is, inviolable electrical safety boundary rules are classified into the hard constraint layer. The rules of the hard constraint layer participate in path filtering in the form of mandatory Boolean decisions, and any path that violates the rules of the hard constraint layer is directly eliminated. Rules involving multi-objective optimization decisions are incorporated into the strategy optimization layer, and the rules of the strategy optimization layer participate in path ranking in the form of a scoring function; Rules involving the adaptation and verification of secondary protection systems are incorporated into the protection adaptation layer, and the rules of the protection adaptation layer participate in path verification in the form of protection setting mapping.

[0038] In a certain regional power grid, a fault-related power transfer operation is required on a 10kV line. The dispatching regulations stipulate that the load rate of any line in the transfer path must not exceed 80% of its rated value. This regulation is an inviolable electrical safety boundary and falls under the hard constraint layer. The procedure also stipulates that the path with the fewest switching operations should be selected first. This provision belongs to the content of multi-objective optimization decision-making and is classified into the strategy optimization layer. The regulations also stipulate that after the power transfer, it is necessary to verify whether the protection settings of the adjacent lines match the new power flow direction. This provision belongs to the adaptation and verification content of the secondary protection system and is classified into the protection adaptation layer.

[0039] S1.2 Encapsulate the rules of the hard constraint layer into decision conditions through first-level conditions.

[0040] The steps of encapsulating the rules of the hard constraint layer into decision conditions include A1~A2: A1. Model the rules of the hard constraint layer as multiple Boolean predicates according to the electrical constraint type.

[0041] In this embodiment, the electrical constraint type refers to the category of electrical quantities targeted by the rules of the hard constraint layer, including equipment status, power flow over-limit, voltage over-limit, islanded connectivity, and fault isolation.

[0042] For each rule in the hard constraint layer, it is formalized into a corresponding Boolean predicate based on the type of electrical constraint it targets.

[0043] Boolean predicates are expressed in first-order predicate logic form, including predicate name, input variables and decision logic. The input variables are directly related to the state attributes of the corresponding nodes or edges in the real-time topology graph, and the decision logic describes the constraints that the input variables must satisfy.

[0044] The rules in the hard constraint layer are modeled according to the electrical constraint type. The equipment status class is modeled as the equipment maintenance interlocking predicate, the input variable is the equipment tag status, and the decision logic is that the equipment currently has no maintenance tag. The power flow over-limit model is a power flow over-limit predicate, with the input variable being the real-time line load rate, and the judgment logic being that the real-time load rate ≤ the rated current carrying capacity limit. The voltage over-limit class is modeled as a voltage over-limit predicate, with the input variable being the real-time bus voltage and the judgment logic being that the real-time voltage is within the acceptable voltage range. The island connectivity class is modeled as an island connectivity predicate, with the input variable being the topological connectivity after the power switch, and the decision logic being that no new power-loss islands are generated after the power switch. Fault isolation is modeled as a fault isolation predicate, with the input variable being the fault isolation markers of the nodes the path passes through, and the decision logic being that the path does not traverse the fault isolation section.

[0045] A2. Parameterize the constraint thresholds for multiple types of Boolean predicates and incorporate the configured multiple types of Boolean predicates into the rule constraint system.

[0046] Specifically, the rated current carrying capacity limit is extracted from the predicate decision logic, and the rated current carrying capacity limit is configured as 200A for the 10kV line and 600A for the 35kV line in the parameter table.

[0047] When the path search traverses to lines of different voltage levels, the power flow limit predicate dynamically reads the upper limit value of the current carrying capacity of the corresponding voltage level for judgment, without needing to modify the predicate logic itself.

[0048] When the rated current carrying capacity of the lines changes after the power grid is upgraded, only the corresponding values ​​need to be updated in the parameter table; the decision logic remains unchanged. After configuration, the five types of Boolean predicates, along with the parameter table, are incorporated into the rule constraint system.

[0049] S1.3. Encapsulate the rules of the strategy optimization layer into evaluation conditions through a target weighted evaluation function.

[0050] The objective-weighted evaluation function is a function that integrates multiple optimization objectives in the policy optimization layer into a single score value through a weighted summation. Its expression is: ,in, Let be the normalized score for the i-th optimization objective. Let be the weight coefficient corresponding to the i-th optimization objective. It is a single rating value.

[0051] Specifically, the strategy optimization layer includes two optimization objectives: minimizing the number of switching operations and maximizing the amount of power loss load restored. Under normal fault scenarios, the weight coefficients for both are 0.5, read from the weight mapping table.

[0052] For candidate path A, the normalized score for the number of switching operations is 0.8, the normalized score for the amount of power loss and load restoration is 0.6, and the comprehensive score F = 0.5 × 0.8 + 0.5 × 0.6 = 0.70; For candidate path B, the two normalized scores are 0.6 and 0.9 respectively, and the comprehensive score F = 0.5 × 0.6 + 0.5 × 0.9 = 0.75. It can be seen that the comprehensive score of path B is higher than that of path A, and it ranks higher in the comprehensive ranking, thus entering the operation ticket generation stage first.

[0053] S1.4. Encapsulate the rules of the protection adaptation layer into verification conditions through protection value mapping.

[0054] Among them, protection setting mapping refers to establishing the correspondence between the setting parameters of power grid equipment and its associated protection devices, storing the protection action setting, protection direction, reclosing status and blocking logic of each device as structured records, and establishing a mapping table with the unique identifier of the device as an index.

[0055] During encapsulation, each rule in the protection adaptation layer is transformed into a verification condition for querying and comparing based on the above mapping table. The verification condition is invoked after the path is determined. For each device involved in the path, its protection setting mapping is queried one by one to verify whether the protection configuration of each device in the path is compatible with the new operating mode under scenarios such as changes in power flow direction after power transfer, loop closing, and cross-regional power supply.

[0056] A candidate power transfer path passes through 10kV line L1. The protection device for line L1 is directional overcurrent protection, and the protection direction is set from the substation bus to the end of the line.

[0057] Under normal operating conditions, the power flow direction of line L1 is consistent with the protection direction. After the power transfer, line L1, acting as a tie line, receives power from the adjacent substation in reverse direction, and the power flow direction changes to run from the end of the line towards the substation bus. A check of the protection setting mapping for line L1 reveals that the actual power flow direction is opposite to the protection direction, indicating a risk of misjudgment of the protection direction.

[0058] S1.5. The rule constraint system is formed by encapsulating the judgment conditions, evaluation conditions and verification conditions.

[0059] During a 10kV line fault power transfer, the path search identified 20 candidate paths.

[0060] During the traversal, the decision criteria call Boolean predicates for real-time pruning of each path node by node. Among them, 12 paths are removed because the power flow limit predicate or maintenance blocking predicate fails the decision, and the remaining 8 paths form a set of feasible power transfer paths.

[0061] The evaluation criteria calculate the comprehensive score of the target weighted evaluation function for each of the eight paths, and rank them from highest to lowest comprehensive score, selecting the top three paths to proceed to the next stage.

[0062] The verification conditions are used to check the protection setting mapping of each of the three paths one by one for adaptation verification. One path has the risk of misjudgment of protection direction and is marked with a risk. The remaining two paths are verified by the complete rule constraint system and submitted to the operation ticket generation stage as the final feasible power transfer path.

[0063] S2. Respond to the acquisition of power grid operating status and construct a real-time topology map.

[0064] The steps for constructing a real-time topology graph include S2.1 to S2.3: S2.1. Establish a topology graph model with power grid equipment as nodes and electrical connections between power grid equipment as edges.

[0065] In this embodiment, the topology graph model is represented by a graph structure G(V,E), where V is the set of nodes and E is the set of edges. Each node in the node set corresponds to a power grid device, and the node's status attributes include a unique device identifier, device type, rated parameters, current operating status, and maintenance tag. Power grid equipment includes busbars, circuit breakers, sectionalizing switches, tie switches, distribution transformers, and load nodes.

[0066] Each edge in the edge set corresponds to an electrical connection between two power grid devices. The state attributes of the edge include line impedance, rated current carrying capacity, thermal stability capacity, the open / closed status of the switches at both ends connected, and the current voltage level. Electrical connections include line connections, busbar connections, and switch bay connections.

[0067] For example, a 110kV substation has two 10kV feeders. Feeder 1 is led out from bus B1 via circuit breaker CB1 and connected to load nodes L1 and L2 via sectionalizing switches SW1 and SW2. Feeder 2 is led out from bus B2 via circuit breaker CB2 and connected to the end of feeder 1 via tie switch SW3.

[0068] When establishing the topology model, create a node for each of the nine devices B1, B2, CB1, CB2, SW1, SW2, SW3, L1, and L2, and record the device type and rated parameters of each node. Establish an edge for each of the electrical connection relationships between B1 and CB1, CB1 and SW1, SW1 and SW2, SW2 and L1, SW2 and L2, and SW3 and the end of feeder 2, and record the line impedance and rated current carrying capacity of each edge.

[0069] S2.2 In response to the acquisition of the power grid operating status, the state attributes of each node and edge in the topology graph model are updated to form a real-time topology graph.

[0070] In this embodiment, the sources of power grid operation status data include remote signaling and telemetry data from the monitoring system, real-time status signals from distribution automation terminals, and equipment tagging information from the maintenance management system.

[0071] When the switching equipment changes position, update the operating status attribute of the corresponding node, and update the opening / closing status attribute of each side associated with that node. When equipment is tagged to enter maintenance status, update the maintenance tag attribute of the corresponding node to unavailable; When the power flow or voltage of the line changes, update the real-time power flow attributes of the corresponding edge. When the protection device is activated, it triggers an immediate update of the state attributes of the relevant nodes and edges.

[0072] The topology model after the state attributes are updated is the real-time topology. The state attributes of each node and edge in the real-time topology are consistent with the current operating state of the power grid.

[0073] Specifically, during normal operation, the monitoring system collects data showing that SW1 is in the closed state and SW3 is in the open state. Correspondingly, the operating status attribute of the SW1 node in the topology graph model is updated to "closed and available" and the open / closed status attribute of the edge between SW1 and SW2 is "connected". The operating status attribute of node SW3 is "open," and the open / closed status attribute of the corresponding edge of SW3 is "disconnected." The maintenance management system detects that SW2 has been tagged for maintenance. This data update changes the maintenance tag attribute of node SW2 to "unavailable," and all associated edges of SW2 are simultaneously marked as unavailable.

[0074] S2.3 Store the real-time topology graph using a hybrid approach combining adjacency matrix and adjacency list.

[0075] The adjacency matrix stores the connectivity relationships between nodes in the real-time topology graph in the form of a two-dimensional array. The element value in the i-th row and j-th column of the matrix indicates whether there is an electrical connection between node i and node j. When the corresponding edge is in a connected state, the element value is recorded as the line impedance value of that edge; when the corresponding edge is in a disconnected or unavailable state, the element value is recorded as infinity.

[0076] The adjacency list stores all adjacent nodes and the state attributes of the corresponding edges of each node in the form of a linked list. Each node corresponds to one linked list, and each record in the linked list contains the unique identifier of the adjacent node and the complete state attributes of the connecting edge.

[0077] Adjacency matrices are used to quickly determine the connectivity between any two nodes during path traversal, while adjacency lists are used to efficiently enumerate all adjacent nodes of a specified node during path traversal.

[0078] For example, the real-time topology graph contains 9 nodes. The adjacency matrix is ​​built as a 9×9 two-dimensional array.

[0079] The edge between B1 and CB1 is connected, and the impedance value of the line segment connected in the B1 row and CB1 column of the matrix is ​​recorded as 0.05Ω. SW2 is marked as unavailable due to maintenance, and the corresponding element values ​​between SW1 and SW2, SW2 and L1, and SW2 and L2 in the matrix are all recorded as infinity; SW3 is in the open state, and the value of the corresponding row and column element of SW3 in the matrix is ​​recorded as infinity.

[0080] In the adjacency list, the linked list of node CB1 records the state attributes of two adjacent nodes B1 and SW1 and their corresponding edges; the linked list of node SW1 records one available adjacent node of CB1, and SW2 does not appear in the valid records of SW1's adjacency list because it is unavailable.

[0081] S3. By locating the fault isolation boundary in the real-time topology map, and using the fault isolation boundary as the blocking condition, the power grid is split into connected domains to obtain a set of power outage islands.

[0082] The steps for splitting the power grid into connected components include S3.1 to S3.3: S3.1 In the real-time topology map, the faulty section is determined by multi-source alarm signals, and a fault isolation boundary is generated based on the faulty section.

[0083] In this embodiment, the multi-source alarm signals include remote signaling change signals, overcurrent alarm signals, voltage drop signals, zero-sequence fault signals, and protection action signals collected by the SCADA system. These multi-source alarm signals are time-aligned using millisecond-level timestamps, and alarm signals with similar timestamps are grouped into the same fault event, eliminating duplicate alarms caused by communication jitter and signal aliasing between different fault events. For the grouped fault events, combined with the status attributes of each node in the real-time topology diagram, the fault segment is located using the segment current difference method: the fault current amplitude collected by each segment terminal on the line involved in the fault event is compared, and the segment where the current difference between the upstream and downstream segments exceeds a preset threshold is determined as the fault segment. After the fault segment is determined, the nearest operable switch nodes at both ends of the fault segment are identified in the real-time topology diagram. The upstream operable switch node is marked as the upstream isolation point, and the downstream operable switch node is marked as the downstream isolation point. The upstream and downstream isolation points together form a fault isolation boundary, and all nodes and edges within the fault isolation boundary are marked as unavailable.

[0084] Specifically, at a certain moment, SCADA collected three alarm signals: CB1 overcurrent alarm, SW1 downstream voltage drop alarm, and L1 power failure alarm. The timestamps of these three alarm signals were all within 50ms, and they were grouped into the same fault event.

[0085] The fault currents collected by the segment terminals on the upstream and downstream sides of SW1 are compared. The current on the upstream side of SW1 is 850A, and the current on the downstream side of SW1 is close to zero. The current difference exceeds the preset threshold of 500A, and it is determined that the fault section is located in the line section between the downstream side of SW1 and L1.

[0086] In the real-time topology map, the nearest operable switch nodes at both ends of the faulty section are identified as SW1 (upstream isolation point) and L1-side end switch (downstream isolation point). The fault isolation boundary is formed by SW1 and L1-side end switch. The nodes and edges within the fault isolation boundary are marked as unavailable.

[0087] S3.2 Using the fault isolation boundary as the blocking condition, and combining the state attributes of each node in the real-time topology graph, the connected component of the real-time topology graph is split to obtain the initial island set.

[0088] Connectivity partitioning uses the fault isolation boundary as the blocking condition, removing all nodes and edges within the fault isolation boundary from the connectivity of the real-time topology graph, and then performing connectivity partition traversal on the remaining nodes.

[0089] The connected component traversal uses a breadth-first traversal algorithm. Starting from any unassigned node, nodes that are directly adjacent to it and whose edges are connected are included in the same connected component, until no new nodes can be added to the connected component. This continues until all nodes in the real-time topology graph belong to a certain connected domain.

[0090] In this embodiment, after the fault isolation boundary is determined, the nodes and edges corresponding to the fault section from the downstream side of SW1 to L1 are removed from the connectivity relationship.

[0091] Then, starting from B1, CB1 and SW1 are successively included in the same connected region. The downstream side of SW1 cannot be extended further due to the fault isolation boundary. The traversal of this connected region ends and is marked as a live region. Starting from L2, the edge between L2 and SW2 cannot be extended because the maintenance tag status of SW2 is unavailable. L2 forms a separate connected component, which is not connected to the active node and is marked as a power outage area. Starting from B2, CB2 and SW3 (which cannot be extended in the open state) are included in the energized connectivity domain; nodes within the fault section are marked as fault isolation areas.

[0092] S3.3 Filter the initial island set for validity to obtain the power-off island set.

[0093] It is important to know that validity filtering removes connected components that do not contain any load nodes in the node set. If there are no loads in the connected component that need to be restored to power, there is no need to switch power. Alternatively, it can be to remove connected components in which all nodes in the node set have unusable state attributes, and where all internal devices of the connected component are unusable due to faults or maintenance, making power switching impossible. Alternatively, connected components marked as energized areas can be removed. These connected components are already under normal power supply and do not require power conversion. After performing validity filtering on all connected components in the initial island set, the remaining de-energized connected components constitute the de-energized island set.

[0094] In this embodiment, energized region 1 (B1-CB1-SW1) is marked as energized region and is eliminated according to the third type of elimination rule; energized region 2 (B2-CB2) is marked as energized region and is eliminated according to the third type of elimination rule; all nodes in the fault isolation region (downstream of SW1 to L1) are marked as unavailable and are eliminated according to the second type of elimination rule; de-energized region 1 (L2) contains load node L2 and L2's status attribute is available, does not meet any elimination rule, and is retained.

[0095] S4. The path search space is limited by the set of power outage islands. The path is traversed in the real-time topology graph through a multi-level combination algorithm. Pruning is performed during the traversal according to the rule constraint system to obtain a set of feasible power conversion paths.

[0096] The steps for traversing paths in the real-time topology graph include S4.1 to S4.3: S4.1. A multi-level combination algorithm is composed of multiple search algorithms, and the multiple search algorithms perform parallel traversal of the path search space from multiple search dimensions.

[0097] In this embodiment, refer to Figure 3 As shown, the power failure connectivity domain in the power failure island set starts at L2, ends at the B2 bus in the adjacent energized area as the backup power supply, and the fault isolation area and SW2 maintenance area are restricted areas, thus determining the path search space.

[0098] For example, the breadth-first search algorithm starts from L2, expands the real-time topology graph layer by layer to include all nodes reachable from L2, and enumerates the path P1 from SW3 to B2 and the path P2 from other connecting switches to B2. Alternatively, the shortest path search algorithm uses the impedance of each side line as a weight to calculate the path with the minimum impedance weight between L2 and B2, and outputs that path P1 (total impedance 0.12Ω) is better than path P2 (total impedance 0.21Ω). It also includes a depth-first search algorithm that delves vertically along the branches to identify the nested path P3 via the backup communication channel on the B1 side.

[0099] S4.2 Merge and remove duplicates from the traversal results of multiple search algorithms.

[0100] The path is uniquely identified by the sequence of nodes it traverses. Paths with identical node sequences in the candidate path set are considered duplicate paths, and only one is retained; the rest are discarded. After deduplication, each path in the candidate path set corresponds to a unique traversal path with a single node sequence in the real-time topology graph.

[0101] After merging the traversal results of the three search algorithms, the candidate path set contains a total of 5 path records: path P1 and P2 output by the breadth-first search algorithm, path P1 output by the shortest path search algorithm, and paths P1, P2, and P3 output by the depth-first search algorithm.

[0102] Deduplication is performed using the node sequence as a unique identifier: P1 appears 3 times in the results of the three types of algorithms, so 1 is retained; P2 appears once in the results of the breadth-first search algorithm and the depth-first search algorithm, so 1 is retained; P3 appears only once, so it is retained.

[0103] After deduplication, the candidate path set contains three unique paths with node sequences P1, P2, and P3.

[0104] S4.3 During the traversal, the path is pruned in real time according to the rule constraint system, and a set of feasible transfer paths is output.

[0105] Real-time pruning refers to the process of performing Boolean judgments on the current path based on the decision conditions in the rule constraint system whenever the traversal progresses to a new node in the real-time topology graph during the traversal of multiple search algorithms, without waiting for the entire traversal to be completed before performing centralized filtering.

[0106] Specifically, when traversing to each new node, the various Boolean predicates in the rule constraint system are called sequentially to perform Boolean judgments on the state attributes of the newly added nodes and edges in the current path: If the current new node or new edge triggers any Boolean predicate output failure, then the current path is terminated at that node, and subsequent nodes of the path are no longer traversed. If all Boolean predicates output "pass", the current path continues to extend to the next node.

[0107] When the traversal reaches the search endpoint, the path is included in the feasible power conversion path set after being evaluated by all Boolean predicates. After all traversals and pruning are completed, the feasible power conversion path set is output.

[0108] In this embodiment, P1, P2, and P3 in the candidate path set are pruned in real time: When traversing P1, proceed sequentially to node SW3, call multiple Boolean predicates for judgment. The operating status attribute of node SW3 is that the circuit breaker is available, the maintenance tag is none, the power flow limit predicate determines that the line load rate after the power transfer is 65%, which is lower than the rated value of 80%, the voltage limit predicate determines that the voltage on the L2 side is within the qualified range, all Boolean predicate outputs pass, P1 extends to the endpoint B2, and is included in the set of feasible power transfer paths; When traversing P2, the process proceeds to the intermediate node SW4 in the path. The power flow limit predicate is called to determine the load rate. After the power transfer, the load rate of the line where SW4 is located is 92%, which exceeds the rated value of 80%. The Boolean predicate output fails. The traversal of P2 is terminated with SW4 as the pruning point. P2 is not included in the set of feasible power transfer paths. When traversing P3, if the path reaches the middle node, the island connectivity predicate will be switched to power after the island is switched to power. A new power-off island will be generated on the B1 side. The Boolean predicate output will not pass, and P3 will be pruned and removed.

[0109] S5. The feasible power transfer path set is comprehensively sorted through the rule constraint system to generate operation tickets.

[0110] The steps for generating an operation ticket include S5.1 to S5.3: S5.1 Using the multi-objective weighted evaluation function of the strategy optimization layer in the rule constraint system, perform comprehensive calculations on each path in the feasible power transfer path set to obtain a comprehensive score.

[0111] According to step S1, the expression for the multi-objective weighted evaluation function is: ,in, Let be the normalized score for the i-th optimization objective. Let be the weight coefficient corresponding to the i-th optimization objective. It is a rating value.

[0112] The optimization objectives include five categories: power outage load restoration amount, number of switching operations, electrical transmission distance, line loss, and equipment overload risk. The normalized score of each optimization objective is calculated from the actual index value of the corresponding path according to the normalization rules of each optimization objective.

[0113] For each path in the set of feasible power transfer paths, the normalized scores of the five optimization objectives are calculated in sequence, and then substituted into the multi-objective weighted evaluation function to calculate the comprehensive score F. The comprehensive score F is the basis for the comprehensive ranking of the path in the current operating scenario.

[0114] The feasible power transfer path set includes path P1. The current operating scenario is a conventional fault scenario; the weight coefficients for the five optimization objectives are read from the weight mapping table: The weights for power loss load restoration are 0.3, the number of switching operations are 0.25, the electrical transmission distance is 0.2, the line loss is 0.15, and the equipment overload risk is 0.1.

[0115] For P1, calculate the normalized scores for each optimization objective: P1 can restore all lost power load, and the normalized score for the amount of lost power load restored is 1.0; P1 needs to operate SW3 once, and the normalized score for the number of switch operations is 0.9; the normalized score for the electrical transmission distance of P1 is 0.8; the normalized score for the line loss of P1 is 0.85; and the normalized score for the equipment overload risk of P1 is 0.95.

[0116] Substituting into the multi-objective weighted evaluation function, the calculation formula is expressed as 0.3×1.0+0.25×0.9+0.2×0.8+0.15×0.85+0.1×0.95=0.908, and the comprehensive score of P1 is 0.908.

[0117] S5.2 Arrange the feasible power conversion path set according to the comprehensive score to obtain the path set sequence.

[0118] Suppose that in another accidental power transfer scenario, the feasible power transfer path set includes three paths Pa, Pb, and Pc, with comprehensive scores of 0.908, 0.856, and 0.856, respectively.

[0119] Arranged from highest to lowest overall score, Pa has the highest overall score and ranks first. Pb and Pc have the same overall score of 0.856. According to the secondary rule, the number of switch operations is compared. Pb requires 2 switch operations, while Pc requires 3 switch operations. Pb ranks second and Pc ranks third.

[0120] The path set sequence is finally arranged as Pa, Pb, Pc, and each path record includes a node sequence, a comprehensive score, and a verification result label.

[0121] S5.3 Set the screening threshold, take the switch operation steps corresponding to the paths in the path set sequence that meet the screening threshold, and generate operation tickets.

[0122] The screening threshold refers to the conditions that must be met to extract the path used to generate the operation ticket from the path set sequence, including the lower limit threshold of the comprehensive score and the upper limit threshold of the number of output paths.

[0123] The lower limit threshold for the comprehensive score is used to exclude paths with excessively low comprehensive scores or whose power transfer effect does not meet operational requirements; the upper limit threshold for the number of output paths is used to limit the number of paths entering the operation ticket generation stage, so as to avoid an excessive number of operation tickets that would increase the decision-making burden of dispatchers.

[0124] Paths with a comprehensive score below the lower threshold are not included in the operation ticket generation; once the number of included paths reaches the upper threshold of the output path count, the remaining paths in the path set sequence are no longer processed. For each path that meets the screening threshold, the execution order of the switching operation steps is determined according to the path's node sequence and the state attributes of each node and edge in the real-time topology graph, following the principle of separation before merging. The switching operation steps and execution order are then integrated to generate an operation ticket.

[0125] The lower threshold for the overall score is set to 0.80, and the upper threshold for the number of output paths is set to 2. The path set sequence is checked sequentially: if the Pa overall score is 0.908, which is higher than 0.80, it is included in the operation ticket generation; currently, only 1 path has been included, which is below the upper limit. The Pb comprehensive score of 0.856 is higher than 0.80, so it is included in the operation ticket generation. The current number of included is 2, which has reached the upper limit threshold, so Pc will no longer be processed.

[0126] For the path corresponding to Pa, SW3 is currently in the open state. SW3 needs to be closed to connect the power supply path from L2 to B2. According to the principle of opening first and closing later, it is confirmed that there is no need for the upstream to be opened. The operation steps are to close SW3 and generate operation ticket one. For the path corresponding to Pb, based on the node sequence, it is determined that SW5 needs to be separated and then SW6 needs to be merged. The operation steps are as follows: separate SW5, merge SW6, and generate operation ticket two.

[0127] The final outputs are Operation Ticket 1 and Operation Ticket 2.

[0128] Example 3 is an embodiment of the present invention. This embodiment provides an accident power transfer and ticketing system based on power transfer strategy, including a rule layering and encapsulation module, which encapsulates the power transfer rules in layers to form a rule constraint system. The real-time topology building module constructs a real-time topology map in response to the acquisition of power grid operating status. The power outage area division module locates the fault isolation boundary based on the real-time topology map, and performs connected component splitting on the power grid using the fault isolation boundary as the blocking condition to obtain a set of power outage islands. The power transfer path search module defines the path search space by the set of power outage islands, traverses the paths in the real-time topology graph through a multi-level combination algorithm, and performs pruning during the traversal process according to the rule constraint system to obtain a set of feasible power transfer paths. The operation ticket generation module generates operation tickets by comprehensively sorting the set of feasible power transfer paths through the rule constraint system.

[0129] This embodiment also provides an electronic device applicable to an accident power transfer and ticketing method based on a power transfer strategy, comprising: a memory and a processor; the memory is used to store computer-executable instructions, and the processor is used to execute the computer-executable instructions to implement an accident power transfer and ticketing method based on a power transfer strategy as proposed in the above embodiment.

[0130] This embodiment also provides a storage medium storing a computer program that, when executed by a processor, implements an accident power transfer and ticketing method based on a power transfer strategy as proposed in the above embodiments.

[0131] The storage medium proposed in this embodiment and the method for implementing an accident power transfer and ticketing based on a power transfer strategy proposed in the above embodiments belong to the same inventive concept. Technical details not described in detail in this embodiment can be found in the above embodiments, and this embodiment has the same beneficial effects as the above embodiments.

[0132] Based on the above description of the implementation methods, those skilled in the art can clearly understand that the present invention can be implemented using software and necessary general-purpose hardware, and of course, it can also be implemented using hardware, but in many cases the former is a better implementation method. Based on this understanding, the technical solution of the present invention, or the part that contributes to the prior art, can be embodied in the form of a software product. This computer software product can be stored in a computer-readable storage medium, such as a computer floppy disk, read-only memory (ROM), random access memory (RAM), flash memory, hard disk, or optical disk, etc., including several instructions to cause a computer device (which may be a personal computer, server, or network device, etc.) to execute the methods of the various embodiments of the present invention.

[0133] It should be noted that the above embodiments are only used to illustrate the technical solutions of the present invention and are not intended to limit it. Although the present invention has been described in detail with reference to preferred embodiments, those skilled in the art should understand that modifications or equivalent substitutions can be made to the technical solutions of the present invention without departing from the spirit and scope of the technical solutions of the present invention, and all such modifications or substitutions should be covered within the scope of the claims of the present invention.

Claims

1. A method for accident power transfer and ticketing based on a power transfer strategy, characterized in that, Includes the following steps: By constructing a hierarchical digital rule base, the power transfer rules are encapsulated in layers to form a rule constraint system; In response to the acquisition of power grid operating status, a real-time topology map is constructed; By locating the fault isolation boundary in the real-time topology map, and using the fault isolation boundary as the blocking condition, the power grid is split into connected components to obtain a set of power outage islands. The path search space is defined by the set of power outage islands. The paths are traversed in the real-time topology graph through a multi-level combination algorithm. Pruning is performed during the traversal process according to the rule constraint system to obtain a set of feasible power transfer paths. The feasible power transfer path set is comprehensively sorted using the aforementioned rule constraint system to generate an operation ticket.

2. The method for accident power transfer and ticketing based on a power transfer strategy as described in claim 1, characterized in that, The steps for constructing the real-time topology graph include: A topology graph model is established using power grid equipment as nodes and the electrical connections between power grid equipment as edges. In response to the acquisition of power grid operating status, the state attributes of each node and edge in the topology graph model are updated to form the real-time topology graph; The real-time topology graph is stored using a hybrid approach combining adjacency matrices and adjacency lists.

3. The method for accident power transfer and ticketing based on a power transfer strategy as described in claim 2, characterized in that, The steps for performing connected component splitting of the power grid include: In the real-time topology map, fault sections are determined by multi-source alarm signals, and fault isolation boundaries are generated based on the fault sections; Using the fault isolation boundary as the blocking condition, and combining the state attributes of each node in the real-time topology graph, the real-time topology graph is split into connected components to obtain an initial set of isolated islands. The initial island set is filtered for validity to obtain the power-off island set.

4. The method for accident power transfer and ticketing based on a power transfer strategy as described in claim 3, characterized in that, The steps of traversing the path in the real-time topology graph include: The multi-level combination algorithm is composed of multiple types of search algorithms, and the multiple types of search algorithms perform parallel traversal of the path search space from multiple search dimensions; The traversal results of the various search algorithms are merged and deduplicated. During the traversal, the path is pruned in real time according to the rule constraint system, and the set of feasible power transfer paths is output.

5. The method for accident power transfer and ticketing based on a power transfer strategy as described in claim 4, characterized in that, The steps for generating the operation ticket include: Using the multi-objective weighted evaluation function of the strategy optimization layer in the rule constraint system, a comprehensive score is obtained by comprehensively calculating each path in the feasible power transfer path set; Based on the comprehensive score, the feasible power conversion path set is arranged to obtain a path set sequence; Set a screening threshold, select the switch operation steps corresponding to the paths in the path set sequence that meet the screening threshold, and generate the operation ticket.

6. The method for accident power transfer and ticketing based on a power transfer strategy as described in claim 5, characterized in that, The steps for performing the layered encapsulation include: The power transfer rules are divided into a hard constraint layer, a strategy optimization layer, and a protection adaptation layer according to their constraint properties. The rules of the hard constraint layer are encapsulated into decision conditions through first-level conditions; The rules of the strategy optimization layer are encapsulated into evaluation conditions through a target weighted evaluation function; The rules of the protection adaptation layer are encapsulated into verification conditions through protection setting mapping; The rule constraint system is formed by encapsulating the judgment conditions, evaluation conditions, and verification conditions.

7. The method for accident power transfer and ticketing based on a power transfer strategy as described in claim 6, characterized in that, The step of encapsulating the rules of the hard constraint layer into decision conditions includes: The rules of the hard constraint layer are modeled as multiple Boolean predicates according to the electrical constraint type; The constraint thresholds of the various Boolean predicates are parameterized, and the configured Boolean predicates are incorporated into the rule constraint system.

8. An accident power transfer and ticketing system based on a power transfer strategy, employing the accident power transfer and ticketing method based on a power transfer strategy as described in any one of claims 1 to 7, characterized in that, include: The rule layering and encapsulation module encapsulates the power conversion rules in layers to form a rule constraint system; The real-time topology building module constructs a real-time topology map in response to the acquisition of power grid operating status. The power outage area division module locates the fault isolation boundary based on the real-time topology map, and performs connected component splitting on the power grid using the fault isolation boundary as the blocking condition to obtain a set of power outage islands. The power transfer path search module defines the path search space by the set of power outage islands, traverses the paths in the real-time topology graph through a multi-level combination algorithm, and performs pruning during the traversal process according to the rule constraint system to obtain a set of feasible power transfer paths. The operation ticket generation module generates operation tickets by comprehensively sorting the set of feasible power transfer paths through the rule constraint system.

9. A computer device comprising a memory and a processor, wherein the memory stores a computer program, characterized in that, When the processor executes the computer program, it implements the steps of the accident power transfer and ticketing method based on the power transfer strategy according to any one of claims 1 to 7.

10. A computer-readable storage medium having a computer program stored thereon, characterized in that, When the computer program is executed by the processor, it implements the steps of the accident power transfer and ticketing method based on the power transfer strategy according to any one of claims 1 to 7.

Images