CN108334691B - Visual automatic drawing method for power distribution network - Google Patents
Visual automatic drawing method for power distribution network Download PDFInfo
- Publication number
- CN108334691B CN108334691B CN201810088113.XA CN201810088113A CN108334691B CN 108334691 B CN108334691 B CN 108334691B CN 201810088113 A CN201810088113 A CN 201810088113A CN 108334691 B CN108334691 B CN 108334691B
- Authority
- CN
- China
- Prior art keywords
- node
- relation
- station
- established
- feeder
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F30/00—Computer-aided design [CAD]
- G06F30/10—Geometric CAD
- G06F30/18—Network design, e.g. design based on topological or interconnect aspects of utility systems, piping, heating ventilation air conditioning [HVAC] or cabling
Abstract
A visual automatic drawing method for a power distribution network comprises the following steps: s1, reading the CIM model file, analyzing and converting the CIM model file into a hierarchical structure, and generating an original topological graph of the power distribution network, wherein the original topological graph of the power distribution network is stored by taking a graph database as a carrier; s2, finding out the topological relation between the equipment and the branch according to the original topological graph of the power distribution network, and generating a feeder diagram; s3, finding out communication relations among the feeders according to the feeder graphs of all the distribution stations in the communication area, and generating a distribution network communication graph; s4, extracting graph data of the original topological graph, the feeder graph and the distribution network communication graph of the distribution network, establishing connection lines between nodes according to the graph data, and rendering the appearance of the graph. The method can automatically update and generate the power grid topological graph according to the change of the power grid topological data; the automatic visual display of the power grid topological graph is realized, the real-time monitoring and analysis of the power grid condition are facilitated, and the human resources and time required by drawing in the traditional mode are saved.
Description
Technical Field
The invention belongs to the technical field of automation, and particularly relates to a visual automatic drawing method for a power distribution network.
Background
The visualization of the power distribution network is a basic support for power grid operation monitoring and manual analysis, and the current power distribution network drawing mainly adopts a manual mode and a man-machine interaction drawing mode, for example, the Chinese patent application with the application number of 201210271369.7, namely 'a method and a system for constructing a power grid topological graph', and the construction of the power grid topological graph is completed according to the operation of electronic equipment by a user. In the documents "high research, etc.," CIM-based graphical power grid topology modeling and analysis ", the" university of fertilizer industry "journal, vol.33 No.5, May 2010", a method for automatically establishing connections based on manually drawing and laying out device primitives is disclosed.
However, the visualization of the distribution network is done in a manual drawing (including human-computer interaction), although it is possible to statically observe the topology of the power grid at a certain moment and observe the state changes on the power grid at that moment. However, the real topology of the power distribution network can be changed continuously along with the network optimization and debugging in the actual operation, and the graph change based on real-time data cannot be achieved by a manual drawing mode.
Disclosure of Invention
The invention aims to: the method can automatically update and generate a power grid topological graph according to the change of power grid topological data, and realize real-time visual display.
In order to achieve the purpose, the visual automatic drawing method for the power distribution network comprises the following steps:
s1, reading the CIM model file, analyzing and converting the CIM model file into a hierarchical structure, and generating an original topological graph of the power distribution network, wherein the original topological graph of the power distribution network is stored by taking a graph database as a carrier;
s2, finding out the topological relation between the equipment and the branch according to the original topological graph of the power distribution network, and generating a feeder diagram;
s3, finding out communication relations among the feeders according to the feeder graphs of all the distribution stations in the communication area, and generating a distribution network communication graph;
s4, extracting graph data of the original topological graph, the feeder graph and the distribution network communication graph of the distribution network, establishing connection lines between nodes according to the graph data, and rendering the appearance of the graph.
The preferred scheme of the invention is as follows: the specific steps of step S1 include:
s11, analyzing the CIM to generate a corresponding XML model tree, hierarchically organizing the XML model tree according to the concerned first-layer element objects, setting the associated element objects in the XML model tree, and converting the original flat structure of the CTM model file into a hierarchical structure;
s12, establishing a mapping relation from the connection point ID to the model object and from the station ID to the model object;
and S13, starting from the outgoing line breaker of each feeder line of the plant station, traversing the model tree in a wide range to find the associated object by combining the mapping from the connection point ID to the model object, and ending when another outgoing line breaker or leaf node is encountered.
More preferably, all objects of interest to the XML model tree include: radio direction finder, ac line, base voltage, connection point, isolator, feeder, fuse, geographical area, power transformer, resource type, sub-geographical area, power station, terminal, joint, electrode, wiring, load break switch and bus; the first-tier element object includes: alternating current lines, circuit breakers, disconnectors, fuses, power transformers, electrodes, wiring, load switches, busbars and connection points.
More preferably, in step S13, if there is only one associated object, the "ConnLine" relationship is directly created; if the number of the associated objects exceeds one, a branch point is created first, then the branch point and each associated object are sequentially created to form a 'ConnLine' relationship, and after the creation of the association relationship between the branch point and all the associated objects is completed, the branch point is removed from the mapping set from the connection point ID to the model object.
Preferably, the specific step of step S2 includes:
s21, finding out all outgoing line breakers from the original topological graph of the power distribution network, creating an outgoing line breaker node on each outgoing line breaker, traversing a model tree to find related feeder lines and stations, creating corresponding feeder line nodes and station nodes, and establishing an SGfeeder relation from the outgoing line breaker nodes to the feeder line nodes and an SGstation relation from the outgoing line breaker nodes to the station nodes;
s22, performing depth-first recursion traversal, and creating a starting node, a hit node and an incidence relation between the starting node and the hit node of each recursion in the recursion process;
s23, acquiring the name of a communication area where the outgoing line breaker is located, and setting communication area attributes for all points and edges found in the whole recursion process;
s24, additionally establishing an SGSubsttation relationship between the feeder node and the station node.
More preferably, in step S21, the next node is found from the outgoing breaker, and the next node includes any one of the following:
if the next node is a line, adding the line into the path, and continuing to perform recursive traversal from the current line;
and if the next node is a branch point, finding the node associated with the branch point, and continuing the recursive traversal from each associated node in the loop.
More preferably, in step S22, the start node, the hit node, and the association relationship between the start node and the hit node of each round of recursion are created, and the corresponding recursion mode further includes any one of the following:
the hit node is a Breaker (outgoing Line Breaker) node, a Breaker node is created, a Line relation from a start node to the Breaker node is created, if the ACLineSegment passes through a path, the attribute of the Line relation is copied to a newly-established Line relation and an SGfeeder relation between the current Breaker node and a feeder node, whether the use attribute of the Breaker node is connected or not is further judged, if yes, the recursive traversal is ended, and if not, the recursive traversal is continued from the Breaker node;
the hit node is an 'ACLINE section' node, whether two different types of ACLINE sections pass through a path or not is judged, if yes, a 'ConnectivtityNode' node and a LINE relation from a starting node to a connecting node are established, meanwhile, the passing ACLINE section attribute is copied to a newly-established LINE relation, otherwise, the next node of the ACLINE section is found out, if the next node does not exist, a 'ConnectivtityNode' node is established, the name attribute of the node is set as the name of a LINE section, meanwhile, the LINE relation from the starting node to the node is established, the SGfeeder relation between the current node and the feeder node is ended, recursive traversal is ended, if the next node exists, the ACLINE section is added into the path, and recursive traversal is continued from the ACLINE section;
the hit node is a 'connectivttynode' node, the branch node is created, the LINE relation from the start node to the branch node is established, if the ACLIESegment passes through the path, the attribute of the hit node is copied to the newly-established LINE relation and the SGfeeder relation between the current branch node and the feeder node, the next node set of the branch node is searched, the next node set is circulated, recursive traversal is continued, and if the next node is a LINESegment, the next node needs to be added into the traversal path;
the hit node is a 'load break switch' node, a load switch node is created, a LINE relation from a start node to the load switch node is established, if the ACLineSegment passes through a path, the attribute of the load switch node is copied to a newly-established LINE relation, a sub-station to which the load switch belongs is searched, a sub-station node is created, an SGSubsttation relation from the load switch node to the sub-station node is established, an SGfeeder relation between the current load switch node and a feeder node is established, a branch node connected with the load switch is searched, a ConnLine relation between the branch node, the load switch and the branch node is established, an SGSubsttation relation between the branch node and the sub-station node is established, and an SGfeeder relation between the branch node and the feeder node is established; if the current sub-station is a distribution transformer, searching a transformer connected with the branch node, creating a transformer node, establishing a ConnLine relationship between the transformer node and the branch node, establishing an SGSubsttation relationship between the transformer node and the sub-station node, establishing an SGFeeder relationship between the transformer node and the feeder node, if the current sub-station is a switching station, a ring main unit and a branch box, searching a bus connected with the branch node, creating a bus node, establishing the ConnLine relationship between the bus node and the branch node, establishing the SGSubsttation relationship between the bus node and the sub-station node, and establishing an SGFeeder relationship between the bus node and the feeder node; further searching other load switch nodes connected with the current branch point, circulating each load switch node, creating the load switch node, creating a ConnLine relation between the load switch node and the branch node, creating an SGSubstistation relation between the load switch node and the sub-station node, creating an SGfeeder relation between the load switch node and the feeder node, finding out a next node set of the load switch node, circulating a next node set, continuing recursive traversal, and if the next node is a Linesegment, adding the next node set into a traversal path;
the hit node is a 'Transformer' node, the transformation node is created, the LINE relation from the starting node to the transformation node is established, if the ACLIESegment passes through the path, the attribute of the LINE relation is copied to a newly-established LINE relation, and the SGfeeder relation between the current node and the feeder node is established; if the distribution transformer is a box transformer, further finding out the sub-station to which the distribution transformer belongs, creating a sub-station node, establishing an SGSubsttation relationship from the distribution transformer node to the sub-station node and an SGfeeder relationship from the sub-station node to a feeder node, and ending recursive traversal; if the box transformer is not the box transformer, directly ending the recursion traversal;
the hit node is a 'Substation' node, the Substation node is created, a LINE relation from the start node to the Substation node is established, if the path passes through the ACLINE section, the attribute of the node is copied to the newly-established LINE relation, an SGfeeder relation between the current Substation node and the feeder node is established, and the recursive traversal is finished;
the hit node is a BusbarSection (bus) node, the bus node is created, a LINE relation from a start node to the bus node is established, if the ACLineSegment passes through a path, the attribute of the bus node is copied to a newly-established LINE relation, a sub-station to which the current bus node belongs is searched, a sub-station node is created, an SGSubsttation relation between the start node and the sub-station node is established, an SGSubsttation relation between the current bus node and the sub-station node is established, an SGfeeder relation between the current sub-station node and a feeder node is established, an SGfeeder relation between the current bus node and the feeder node is established, and recursive traversal is finished.
Preferably, the specific step of step S3 includes:
s31, finding out all outgoing line breakers, creating an outgoing line breaker node on each outgoing line breaker, traversing the model tree to find the associated feeder, setting the name and mRID of the feeder as the name and mRID of the outgoing line breaker node, finding out the station associated with the outgoing line breaker, creating a station node, and establishing an SGSubsttation relationship from the outgoing line breaker node to the station node;
s32, carrying out breadth-first recursive traversal, and recording all paths discovered by each recursive traversal in the recursive process;
s33, acquiring the name of a communication area where the outgoing line breaker is located, and setting communication area attributes for all points and edges found in the whole recursion process;
s34, supplementing the mrID connection character string of the point ignored on the middle node path with the type of connectivityNode.
More preferably, the nodes on each path in the loop processing step S32 include any one of the following:
the node is an intermediate node, if the type of the intermediate node is a ConnectivityNode node, a connecting node is created, if other nodes pass through the path, the mrID connecting character string is set to pathIDS attribute, the SGfeeder relation from the starting node to the connecting node is established, and the mrID of the node is added into the mrID connecting character string;
if the hit node is a Breaker node, creating the Breaker node, establishing an SGfeeder relationship from the start node to the Breaker node, if the hit node passes through other nodes on the path, setting a pathIDS attribute for an mRID connection character string of the Breaker node, judging whether the use attribute of the Breaker is contact, if so, ending the recursive traversal, otherwise, continuing the recursive traversal from the Breaker node;
if the hit node is a 'ConnectivityNode' node with a branch box, finding a related bus node, finding a related substistion branch box node according to the bus node, creating the branch box node, if the path passes through other nodes, setting an mrID connection character string of the branch box node to a pathIDS attribute, establishing an SGfeeder relation from a start node to a substistion sub-plant node, and continuing recursive traversal from the branch node;
the method comprises the steps that a node is an end node, if a hit node is a 'load break switch' node of a box transformer, a branch box, a ring main unit and a switching station, a related substition Substation node is found, a substition Substation node is created, if other nodes pass through on a path, an mrID connection character string of the substition Substation node is set to a path attribute, an SGfeeder relation from a start node to the substition Substation node is established, other load switches are searched, and if each load switch exists in a cycle, recursive traversal is continued.
More preferably, in step S34, the intermediate nodes of all types of connectivtynodes are cycled, and from each connectivtynode intermediate node, a deep traversal is performed, each passing node is found, and mRID thereof is spliced into a connection string to supplement pathIDS attributes of the intermediate nodes.
The invention has the beneficial effects that: the CIM model file is analyzed and converted into a hierarchical structure, the hierarchical structure is gradually analyzed into an original topological graph, a feeder line graph and a distribution network communication graph of the distribution network, connection lines among nodes are established through graph data of the original topological graph, the feeder line graph and the distribution network communication graph of the distribution network, the appearance of the graph is rendered, and automatic visual display of the topological graph of the distribution network is achieved; the method can automatically update and generate the power grid topological graph according to the change of the power grid topological data; the real-time monitoring and analysis of the power grid condition are facilitated, and human resources and time required by drawing in a traditional mode are saved.
Drawings
The invention will be further described with reference to the accompanying drawings.
FIG. 1 is a schematic flow diagram of the process of the present invention;
fig. 2 is a technical principle explanatory diagram of the present invention.
Detailed Description
Referring to fig. 1 and 2, the present invention provides a visual automatic drawing method for a distribution network, which includes the following steps:
s1, reading the CIM model file, analyzing and converting the CIM model file into a hierarchical structure, and generating an original topological graph of the power distribution network, wherein the original topological graph of the power distribution network is stored by taking a graph database as a carrier;
s2, finding out the topological relation between the equipment and the branch according to the original topological graph of the power distribution network, and generating a feeder diagram;
s3, finding out communication relations among the feeders according to the feeder graphs of all the distribution stations in the communication area, and generating a distribution network communication graph;
s4, extracting graph data of the original topological graph, the feeder graph and the distribution network communication graph of the distribution network, establishing connection lines between nodes according to the graph data, and rendering the appearance of the graph.
The operation rules, modes, etc. of the above steps S1-S4 will be described in detail
The specific steps of step S1 include:
s11, analyzing the CIM to generate a corresponding XML model tree, hierarchically organizing the XML model tree according to the concerned first-layer element objects, setting the associated element objects in the XML model tree, and converting the original flat structure of the CTM model file into a hierarchical structure;
s12, establishing a mapping relation from the connection point ID to the model object and from the station ID to the model object;
and S13, starting from the outgoing line breaker of each feeder line of the plant station, traversing the model tree in a wide range to find the associated object by combining the mapping from the connection point ID to the model object, and ending when another outgoing line breaker or leaf node is encountered.
All objects of interest to the XML model tree include: the system comprises a radio direction finder RDF, an AC line ACLINE section, a base voltage BaseVoltage, a Breaker, a connection point ConnectiontNode, a disconnecting switch disconnect, a Feeder, a Fuse, a geographical region Geographic region, a power transformer PowerTransformer, a resource type PSRType, a sub-geographical region SubGeographic region, a power station substention, a Terminal Terminal, a joint Junction, an electrode Pole, a wiring ConnLine, a load switch LoadBreakSwitch and a bus Busbrasaction;
the first-tier element object includes: AC line AC, Breaker, Disconnector disconnect, Fuse, power transformer, electrode Pole, connection ConnLine, load Breaker switch, bus BusbarSection and connection point ConnectionTyNode;
other elements removed: radio direction finder Substation, Feeder, base voltage BaseVoltage, connection point connectitive node, resource type PSRType, joint connection, Terminal, geographic region Geographaer region and sub-geographic region SubGeographaer region.
In step S13, if there is only one associated object, a "ConnLine" relationship is directly created; if the number of the associated objects exceeds one, a branch point is created first, then the branch point and each associated object are sequentially created to form a 'ConnLine' relationship, and after the creation of the association relationship between the branch point and all the associated objects is completed, the branch point is removed from the mapping set from the connection point ID to the model object.
The specific steps of step S2 include:
s21, finding out all outgoing line breakers from the original topological graph of the power distribution network, creating an outgoing line breaker node on each outgoing line breaker, traversing a model tree to find related feeder lines and stations, creating corresponding feeder line nodes and station nodes, and establishing an SGfeeder relation from the outgoing line breaker nodes to the feeder line nodes and an SGstation relation from the outgoing line breaker nodes to the station nodes;
s22, performing depth-first recursion traversal, and creating a starting node, a hit node and an incidence relation between the starting node and the hit node of each recursion in the recursion process;
s23, acquiring the name of a communication area where the outgoing line breaker is located, and setting communication area attributes for all points and edges found in the whole recursion process;
s24, additionally establishing an SGSubsttation relationship between the feeder node and the station node.
In step S21, a next node is found from the outgoing line breaker, where the next node includes any one of the following:
if the next node is a line, adding the line into the path, and continuing to perform recursive traversal from the current line;
and if the next node is a branch point, finding the node associated with the branch point, and continuing the recursive traversal from each associated node in the loop.
In step S22, a start node, a hit node, and an association relationship between the start node and the hit node are created for each round of recursion, and a corresponding recursion mode further includes any one of the following:
the hit node is a Breaker (outgoing Line Breaker) node, a Breaker node is created, a Line relation from a start node to the Breaker node is created, if the ACLineSegment passes through a path, the attribute of the Line relation is copied to a newly-established Line relation and an SGfeeder relation between the current Breaker node and a feeder node, whether the use attribute of the Breaker node is connected or not is further judged, if yes, the recursive traversal is ended, and if not, the recursive traversal is continued from the Breaker node;
the hit node is an 'ACLINE section' node, whether two different types of ACLINE sections pass through a path or not is judged, if yes, a 'ConnectivtityNode' node and a LINE relation from a starting node to a connecting node are established, meanwhile, the passing ACLINE section attribute is copied to a newly-established LINE relation, otherwise, the next node of the ACLINE section is found out, if the next node does not exist, a 'ConnectivtityNode' node is established, the name attribute of the node is set as the name of a LINE section, meanwhile, the LINE relation from the starting node to the node is established, the SGfeeder relation between the current node and the feeder node is ended, recursive traversal is ended, if the next node exists, the ACLINE section is added into the path, and recursive traversal is continued from the ACLINE section;
the hit node is a 'connectivttynode' node, the branch node is created, the LINE relation from the start node to the branch node is established, if the ACLIESegment passes through the path, the attribute of the hit node is copied to the newly-established LINE relation and the SGfeeder relation between the current branch node and the feeder node, the next node set of the branch node is searched, the next node set is circulated, recursive traversal is continued, and if the next node is a LINESegment, the next node needs to be added into the traversal path;
the hit node is a 'load break switch' node, a load switch node is created, a LINE relation from a start node to the load switch node is established, if the ACLineSegment passes through a path, the attribute of the load switch node is copied to a newly-established LINE relation, a sub-station to which the load switch belongs is searched, a sub-station node is created, an SGSubsttation relation from the load switch node to the sub-station node is established, an SGfeeder relation between the current load switch node and a feeder node is established, a branch node connected with the load switch is searched, a ConnLine relation between the branch node, the load switch and the branch node is established, an SGSubsttation relation between the branch node and the sub-station node is established, and an SGfeeder relation between the branch node and the feeder node is established; if the current sub-station is a distribution transformer, searching a transformer connected with the branch node, creating a transformer node, establishing a ConnLine relationship between the transformer node and the branch node, establishing an SGSubsttation relationship between the transformer node and the sub-station node, establishing an SGFeeder relationship between the transformer node and the feeder node, if the current sub-station is a switching station, a ring main unit and a branch box, searching a bus connected with the branch node, creating a bus node, establishing the ConnLine relationship between the bus node and the branch node, establishing the SGSubsttation relationship between the bus node and the sub-station node, and establishing an SGFeeder relationship between the bus node and the feeder node; further searching other load switch nodes connected with the current branch point, circulating each load switch node, creating the load switch node, creating a ConnLine relation between the load switch node and the branch node, creating an SGSubstistation relation between the load switch node and the sub-station node, creating an SGfeeder relation between the load switch node and the feeder node, finding out a next node set of the load switch node, circulating a next node set, continuing recursive traversal, and if the next node is a Linesegment, adding the next node set into a traversal path;
the hit node is a 'Transformer' node, the transformation node is created, the LINE relation from the starting node to the transformation node is established, if the ACLIESegment passes through the path, the attribute of the LINE relation is copied to a newly-established LINE relation, and the SGfeeder relation between the current node and the feeder node is established; if the distribution transformer is a box transformer, further finding out the sub-station to which the distribution transformer belongs, creating a sub-station node, establishing an SGSubsttation relationship from the distribution transformer node to the sub-station node and an SGfeeder relationship from the sub-station node to a feeder node, and ending recursive traversal; if the box transformer is not the box transformer, directly ending the recursion traversal;
the hit node is a 'Substation' node, the Substation node is created, a LINE relation from the start node to the Substation node is established, if the path passes through the ACLINE section, the attribute of the node is copied to the newly-established LINE relation, an SGfeeder relation between the current Substation node and the feeder node is established, and the recursive traversal is finished;
the hit node is a BusbarSection (bus) node, the bus node is created, a LINE relation from a start node to the bus node is established, if the ACLineSegment passes through a path, the attribute of the bus node is copied to a newly-established LINE relation, a sub-station to which the current bus node belongs is searched, a sub-station node is created, an SGSubsttation relation between the start node and the sub-station node is established, an SGSubsttation relation between the current bus node and the sub-station node is established, an SGfeeder relation between the current sub-station node and a feeder node is established, an SGfeeder relation between the current bus node and the feeder node is established, and recursive traversal is finished.
The specific steps of step S3 include:
s31, finding out all outgoing line breakers, creating an outgoing line breaker node on each outgoing line breaker, traversing the model tree to find the associated feeder, setting the name and mRID of the feeder as the name and mRID of the outgoing line breaker node, finding out the station associated with the outgoing line breaker, creating a station node, and establishing an SGSubsttation relationship from the outgoing line breaker node to the station node;
s32, carrying out breadth-first recursive traversal, and recording all paths discovered by each recursive traversal in the recursive process;
s33, acquiring the name of a communication area where the outgoing line breaker is located, and setting communication area attributes for all points and edges found in the whole recursion process;
s34, supplementing the mrID connection character string of the point ignored on the middle node path with the type of connectivityNode.
The nodes on each path in the loop processing step S32 include any one of the following:
the node is an intermediate node, if the type of the intermediate node is a ConnectivityNode node, a connecting node is created, if other nodes pass through the path, the mrID connecting character string is set to pathIDS attribute, the SGfeeder relation from the starting node to the connecting node is established, and the mrID of the node is added into the mrID connecting character string;
if the hit node is a Breaker node, creating the Breaker node, establishing an SGfeeder relationship from the start node to the Breaker node, if the hit node passes through other nodes on the path, setting a pathIDS attribute for an mRID connection character string of the Breaker node, judging whether the use attribute of the Breaker is contact, if so, ending the recursive traversal, otherwise, continuing the recursive traversal from the Breaker node;
if the hit node is a 'ConnectivityNode' node with a branch box, finding a related bus node, finding a related substistion branch box node according to the bus node, creating the branch box node, if the path passes through other nodes, setting an mrID connection character string of the branch box node to a pathIDS attribute, establishing an SGfeeder relation from a start node to a substistion sub-plant node, and continuing recursive traversal from the branch node;
the method comprises the steps that a node is an end node, if a hit node is a 'load break switch' node of a box transformer, a branch box, a ring main unit and a switching station, a related substition Substation node is found, a substition Substation node is created, if other nodes pass through on a path, an mrID connection character string of the substition Substation node is set to a path attribute, an SGfeeder relation from a start node to the substition Substation node is established, other load switches are searched, and if each load switch exists in a cycle, recursive traversal is continued.
In step S34, the intermediate nodes of all types of connectivtynodes are cycled, and from each connectivtynode intermediate node, a deep traversal is performed, each passing node is found out, and mRID thereof is spliced into a connection character string to supplement pathIDS attributes of the intermediate nodes.
According to the method, a CIM model file is analyzed and converted into a hierarchical structure, the CIM model file is gradually analyzed into an original topological graph, a feeder line graph and a distribution network communication graph of a distribution network, a connection line between nodes is established through graph data of the original topological graph, the feeder line graph and the distribution network communication graph of the distribution network, the appearance of the graph is rendered, and automatic visual display of the topological graph of the distribution network is achieved; the method can automatically update and generate the power grid topological graph according to the change of the power grid topological data; the real-time monitoring and analysis of the power grid condition are facilitated, and human resources and time required by drawing in a traditional mode are saved.
In addition to the above embodiments, the present invention may have other embodiments. All technical solutions formed by adopting equivalent substitutions or equivalent transformations fall within the protection scope of the claims of the present invention.
Claims (7)
1. A visual automatic drawing method for a power distribution network is characterized by comprising the following steps:
s1, reading the CIM model file, analyzing and converting the CIM model file into a hierarchical structure, and generating an original topological graph of the power distribution network, wherein the original topological graph of the power distribution network is stored by taking a graph database as a carrier;
s2, finding out the topological relation between the equipment and the branch according to the original topological graph of the power distribution network, and generating a feeder diagram;
s3, finding out communication relations among the feeders according to the feeder graphs of all the distribution stations in the communication area, and generating a distribution network communication graph;
s4, extracting graph data of the original topological graph, the feeder graph and the power distribution network communication graph of the power distribution network, establishing connection lines between nodes according to the graph data, and rendering the appearance of the graph;
the specific steps of step S2 include:
s21, finding out all outgoing line breakers from the original topological graph of the power distribution network, creating an outgoing line breaker node on each outgoing line breaker, traversing a model tree to find related feeder lines and stations, creating corresponding feeder line nodes and station nodes, and establishing an SGfeeder relation from the outgoing line breaker nodes to the feeder line nodes and an SGstation relation from the outgoing line breaker nodes to the station nodes;
s22, performing depth-first recursion traversal, and creating a starting node, a hit node and an incidence relation between the starting node and the hit node of each recursion in the recursion process;
s23, acquiring the name of a communication area where the outgoing line breaker is located, and setting communication area attributes for all points and edges found in the whole recursion process;
s24, additionally establishing an SGSubsttation relationship between the feeder node and the station node;
in step S21, a next node associated with the outgoing line breaker is found, where the next node includes any one of the following:
if the next node is a line, adding the line into the path, and continuing to perform recursive traversal from the current line;
if the next node is a branch point, finding out the node associated with the branch point, and circulating to continue recursive traversal from each associated node;
in step S22, a start node, a hit node, and an association relationship between the start node and the hit node are created for each round of recursion, and a corresponding recursion mode further includes any one of the following:
the hit node is a Breaker outgoing Line Breaker node, a Breaker node is created, a Line relation from a start node to the Breaker node is created, if the path passes through ACLLINESegment, the attribute of the link is copied to a newly-established Line relation and an SGfeeder relation between the current Breaker node and a feeder node, whether the use attribute of the Breaker node is connected or not is further judged, if yes, the recursive traversal is ended, and if not, the recursive traversal is continued from the Breaker node;
the hit node is an 'ACLIEsegment feeder LINE segment' node, whether two different types of ACLIEsegmentes pass through a path is judged, if yes, a 'connectivtityNode connection' node and the LINE relation between a starting node and a connecting node are established, meanwhile, the passing ACLiesegmente attribute is copied to a newly established LINE relation, otherwise, the next node of the ACLiesegmentes is found out, if the next node does not exist, a 'connectivtityNode ending' node is established, the name attribute of the node is set as the name of a LINE segment, meanwhile, the LINE relation between the starting node and the node is established, the SGfeeder relation between the current node and the feeder LINE node is ended, recursive traversal is ended, if the next node exists, the ACLiesegmentes are added into the path, and traversal is continued from the ACLiesegmentes;
the hit node is a 'connectivttynode branch' node, the branch node is created, the LINE relation from the start node to the branch node is established, if the ACLIESegment passes through the path, the attribute of the hit node is copied to the newly-established LINE relation and the SGfeeder relation between the current branch node and the feeder node, the next node set of the branch node is searched, the next node set is circulated, recursive traversal is continued, and if the next node is a LINESegment, the next node needs to be added into the traversal path;
the hit node is a 'LoadBreakSwitch load switch' node, a load switch node is created, a LINE relation from a start node to the load switch node is established, if the ACLineSegment passes through the path, the attribute of the load switch node is copied to a newly-established LINE relation, a sub-station to which the load switch belongs is searched, a sub-station node is created, an SGSubsttation relation from the load switch node to the sub-station node is established, an SGfeeder relation between the current load switch node and a feeder node is established, a branch node connected with the load switch is searched, a ConnLine relation between the branch node, the load switch and the branch node is established, an SGSubsttation relation between the branch node and the sub-station node is established, and an SGfeeder relation between the branch node and the feeder node is established; if the current sub-station is a distribution transformer, searching a transformer connected with the branch node, creating a transformer node, establishing a ConnLine relationship between the transformer node and the branch node, establishing an SGSubsttation relationship between the transformer node and the sub-station node, establishing an SGFeeder relationship between the transformer node and the feeder node, if the current sub-station is a switching station, a ring main unit and a branch box, searching a bus connected with the branch node, creating a bus node, establishing the ConnLine relationship between the bus node and the branch node, establishing the SGSubsttation relationship between the bus node and the sub-station node, and establishing an SGFeeder relationship between the bus node and the feeder node; further searching other load switch nodes connected with the current branch point, circulating each load switch node, creating the load switch node, creating a ConnLine relation between the load switch node and the branch node, creating an SGSubstistation relation between the load switch node and the sub-station node, creating an SGfeeder relation between the load switch node and the feeder node, finding out a next node set of the load switch node, circulating a next node set, continuing recursive traversal, and if the next node is a Linesegment, adding the next node set into a traversal path;
the hit node is a 'Transformer distribution' node, the distribution node is created, the LINE relation between the start node and the distribution node is established, if the ACLINE information passes through the path, the attribute of the distribution node is copied to a newly-established LINE relation, and the SGfeeder relation between the current node and the feeder node is established; if the distribution transformer is a box transformer, further finding out the sub-station to which the distribution transformer belongs, creating a sub-station node, establishing an SGSubsttation relationship from the distribution transformer node to the sub-station node and an SGfeeder relationship from the sub-station node to a feeder node, and ending recursive traversal; if the box transformer is not the box transformer, directly ending the recursion traversal;
the hit node is a 'Substation' node, the Substation node is created, a LINE relation from the start node to the Substation node is established, if the ACLINE is processed on the path, the attribute of the node is copied to the newly-established LINE relation, an SGfeeder relation between the current Substation node and the feeder node is established, and the recursive traversal is finished;
the method comprises the steps that a hit node is a BusbarSection bus node, the bus node is created, the LINE relation from a start node to the bus node is established, if the ACLineSegment passes through a path, the attribute of the bus node is copied to a newly-established LINE relation, a sub-station to which the current bus node belongs is searched, a sub-station node is created, the SGSubsttation relation between the start node and the sub-station node is established, the SGSubsttation relation between the current bus node and the sub-station node is established, the SGfeeder relation between the current sub-station node and a feeder node is established, the SGfeeder relation between the current bus node and the feeder node is established, and recursive traversal is finished.
2. The visual automatic drawing method for power distribution networks according to claim 1, wherein the specific steps of step S1 include:
s11, analyzing the CIM to generate a corresponding XML model tree, hierarchically organizing the XML model tree according to the concerned first-layer element objects, setting the related element objects in the XML model tree, and converting the original flat structure of the CTM model file into a hierarchical structure;
s12, establishing a mapping relation from the connection point ID to the model object and from the station ID to the model object;
and S13, starting from the outgoing line breaker of each feeder line of the plant station, traversing the model tree in a wide range to find the associated object by combining the mapping from the connection point ID to the model object, and ending when another outgoing line breaker or leaf node is encountered.
3. The visual automatic drawing method for power distribution network according to claim 2, wherein all objects of interest of the XML model tree include: radio direction finder, ac line, base voltage, connection point, isolator, feeder, fuse, geographical area, power transformer, resource type, sub-geographical area, power station, terminal, joint, electrode, wiring, load break switch and bus; the first layer element object includes: alternating current lines, circuit breakers, disconnectors, fuses, power transformers, electrodes, wiring, load switches, busbars and connection points.
4. The visual automatic power distribution network drawing method according to claim 2, wherein in step S13, if there is only one associated object, a "ConnLine" relationship is directly created; if the number of the associated objects exceeds one, a branch point is created first, then the branch point and each associated object are sequentially created to form a 'ConnLine' relationship, and after the creation of the association relationship between the branch point and all the associated objects is completed, the branch point is removed from the mapping set from the connection point ID to the model object.
5. The visual automatic drawing method for power distribution networks according to claim 1, wherein the specific steps of step S3 include:
s31, finding out all outgoing line breakers, creating an outgoing line breaker node on each outgoing line breaker, traversing the model tree to find the associated feeder, setting the name and mRID of the feeder as the name and mRID of the outgoing line breaker node, finding out the station associated with the outgoing line breaker, creating a station node, and establishing an SGSubsttation relationship from the outgoing line breaker node to the station node;
s32, carrying out breadth-first recursive traversal, and recording all paths discovered by each recursive traversal in the recursive process;
s33, acquiring the name of a communication area where the outgoing line breaker is located, and setting communication area attributes for all points and edges found in the whole recursion process;
s34, supplementing the mrID connection character string of the point ignored on the middle node path with the type of connectivityNode.
6. The method according to claim 5, wherein the nodes on each path in the step S32 of loop processing include any one of the following:
the node is an intermediate node, if the type of the intermediate node is a ConnectivityNode node, a connecting node is created, if other nodes pass through the path, the mrID connecting character string is set to pathIDS attribute, the SGfeeder relation from the starting node to the connecting node is established, and the mrID of the node is added into the mrID connecting character string;
if the hit node is a 'Breaker outgoing line Breaker' node, creating a Breaker node, establishing an SGfeeder relation from the start node to the Breaker node, if the hit node passes through other nodes on the path, setting a path ID (media identifier) attribute for an mrID (media identifier) connection character string of the Breaker node, judging whether the use attribute of the Breaker is contact, if so, ending the recursive traversal, otherwise, continuing the recursive traversal from the Breaker node;
if the hit node is a 'ConnectivityNode branch' node with a branch box, finding a related bus node, finding a related substistion branch box node according to the bus node, creating the branch box node, if the path passes through other nodes, setting an mrID connection character string of the branch box node to a pathIDS attribute, establishing an SGfeeder relation from a start node to a substistion sub-plant node, and continuing recursive traversal from the branch node;
the nodes are end nodes, if the hit nodes are 'load break switch in station' nodes of a box transformer, a branch box, a ring main unit and a switch station, the associated substition Substation nodes are found, the substition Substation nodes are created, if other nodes pass through on the path, mrID connection character strings of the substition Substation nodes are set to pathIDS attributes, SGfeeder relations from the start nodes to the substition Substation nodes are established, other load switches are searched, and if each load switch in the loop exists, recursive traversal is continued.
7. The method as claimed in claim 5, wherein in step S34, all types of connectivity node intermediate nodes are cycled, and from each connectivity node intermediate node, a deep traversal is performed to find each node passing through, and mRID of each node is concatenated into a concatenated string to supplement pathIDS attribute of the intermediate node.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810088113.XA CN108334691B (en) | 2018-01-30 | 2018-01-30 | Visual automatic drawing method for power distribution network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810088113.XA CN108334691B (en) | 2018-01-30 | 2018-01-30 | Visual automatic drawing method for power distribution network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108334691A CN108334691A (en) | 2018-07-27 |
| CN108334691B true CN108334691B (en) | 2021-11-23 |
Family
ID=62926530
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810088113.XA Active CN108334691B (en) | 2018-01-30 | 2018-01-30 | Visual automatic drawing method for power distribution network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108334691B (en) |
Families Citing this family (15)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112948572A (en) * | 2019-12-11 | 2021-06-11 | 中国科学院沈阳计算技术研究所有限公司 | Method for visually displaying equipment information and relation of power system through knowledge graph |
| CN111444587B (en) * | 2020-02-27 | 2022-08-12 | 国网信通亿力科技有限责任公司 | Electric power graph drawing method based on automatic drawing technology |
| CN111293690B (en) * | 2020-03-18 | 2021-05-04 | 石家庄科林云能信息科技有限公司 | Distribution line real-time topology analysis method based on matrix |
| CN111310291B (en) * | 2020-03-20 | 2022-02-15 | 常州东瑞电力软件有限公司 | Power distribution network system diagram generation method |
| CN111428376A (en) * | 2020-03-31 | 2020-07-17 | 贵州电网有限责任公司 | CIM (common information model) -based power distribution network feeder contact mode identification method and system |
| CN111783261B (en) * | 2020-05-27 | 2024-01-02 | 杭州阳斯信息技术有限公司 | Automatic regulation method for power grid graph based on geographical routing |
| CN111914376A (en) * | 2020-07-16 | 2020-11-10 | 深圳供电局有限公司 | Method and device for automatically constructing power grid bus mode diagram and storage medium |
| CN112100285B (en) * | 2020-08-06 | 2024-04-09 | 国网上海能源互联网研究院有限公司 | Topology analysis method, device and storage medium of power distribution network model |
| CN112383044B (en) * | 2020-09-15 | 2022-08-26 | 国电南瑞科技股份有限公司 | Power grid model comparison method and device based on hierarchical topological structure |
| CN112286884B (en) * | 2020-11-04 | 2023-04-18 | 国网湖南省电力有限公司 | Method, system and medium for automatically generating topology of ring main unit of power distribution network |
| CN113468708B (en) * | 2021-09-06 | 2022-06-14 | 广东电网有限责任公司湛江供电局 | Power distribution network auxiliary planning method and system based on CIM (common information model) |
| CN113541320B (en) * | 2021-09-17 | 2022-01-25 | 广东电网有限责任公司东莞供电局 | Power grid power failure and restoration visual monitoring method and system and storage medium |
| CN114780186B (en) * | 2022-04-02 | 2023-12-15 | 国电南瑞科技股份有限公司 | Method and system for rapidly generating comprehensive information description file based on switch station |
| CN115358030B (en) * | 2022-07-07 | 2023-10-13 | 国网江苏省电力有限公司徐州供电分公司 | Topology structure generation method and system based on distribution network line data |
| CN116628275B (en) * | 2023-07-25 | 2023-10-20 | 国网信息通信产业集团有限公司 | Method for realizing bidirectional conversion between graph database and standardized topology |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102663181A (en) * | 2012-03-28 | 2012-09-12 | 广东电网公司佛山供电局 | Automatic drawing method of distribution network diagram |
| CN102760248A (en) * | 2012-07-31 | 2012-10-31 | 象山县供电局 | Method and system for constructing power grid topological graph |
| CN103150425A (en) * | 2013-02-06 | 2013-06-12 | 上海交通大学 | Automatic generation method used for single line diagram of distribution network and based on topological hierarchy |
| CN105404967A (en) * | 2015-11-09 | 2016-03-16 | 广东电网有限责任公司惠州供电局 | Power distribution network automatic planning method and system |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8706468B2 (en) * | 2011-09-20 | 2014-04-22 | General Electric Company | Method and program product for validation of circuit models for phase connectivity |
-
2018
- 2018-01-30 CN CN201810088113.XA patent/CN108334691B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102663181A (en) * | 2012-03-28 | 2012-09-12 | 广东电网公司佛山供电局 | Automatic drawing method of distribution network diagram |
| CN102760248A (en) * | 2012-07-31 | 2012-10-31 | 象山县供电局 | Method and system for constructing power grid topological graph |
| CN103150425A (en) * | 2013-02-06 | 2013-06-12 | 上海交通大学 | Automatic generation method used for single line diagram of distribution network and based on topological hierarchy |
| CN105404967A (en) * | 2015-11-09 | 2016-03-16 | 广东电网有限责任公司惠州供电局 | Power distribution network automatic planning method and system |
Non-Patent Citations (4)
| Title |
|---|
| 基于CIM模型的配电网单线图自动生成研究;闫红漫 等;《华东电力》;20141231;第2502-2505页 * |
| 基于CIM的图形化电网拓扑建模与分析;高研 等;《合肥工业大学学报》;20100531;第657-660页 * |
| 基于层次结构及模型驱动的配电网图形自动生成;陈连杰 等;《电力系统自动化》;20150110;第226-232页 * |
| 配网单线图自动生成算法的研究与应用;王姣姣;《万方数据》;20171103;第15-46页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108334691A (en) | 2018-07-27 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108334691B (en) | Visual automatic drawing method for power distribution network | |
| CN106650161B (en) | Electrical single line diagram mapping method and system based on power grid GIS | |
| CN105429291B (en) | The correlating method of intelligent substation primary connection figure and electrical secondary system logic connectivity diagram | |
| CN105226647B (en) | A kind of high-performance electrical network real-time topology analysis method | |
| CN108152663A (en) | A kind of electrical power distribution network fault location method and device | |
| CN109286188B (en) | 10kV power distribution network theoretical line loss calculation method based on multi-source data set | |
| CN111160868A (en) | Unified distribution network frame topology construction method based on graph fusion technology | |
| CN111461520B (en) | Intelligent analysis method for distribution network line automatic switch distribution | |
| CN105449676A (en) | Regional node network generating method and system of power distribution network | |
| CN109933634B (en) | Power system graph drawing method based on power radiation range | |
| CN105869064A (en) | Power distribution automation terminal-oriented topology generation method and system | |
| CN102403718A (en) | Generating method for power grid topological relationship based on Arcgis | |
| CN106229974B (en) | A method of the electric power networks rapid topology analysis based on chart database | |
| CN109038554B (en) | Intelligent power distribution terminal local topology generation method | |
| CN108536764B (en) | Topology and island analysis method and device based on temporary topology analysis table | |
| CN113486487B (en) | Automatic acquisition method for geographical wiring logic structure diagram based on digital power grid | |
| Lendák et al. | Electric power system one-line diagram generation with branch and bound algorithm | |
| CN110377944A (en) | A kind of power distribution network topological construction method and system towards battalion with fusion | |
| CN106786527B (en) | Distribution network loop closing risk analysis method based on provincial and allocation integration | |
| CN106159943B (en) | A method of the Power Network Topology Analysis based on social networks | |
| Duan et al. | Topology modeling of distribution network based on open-source GIS | |
| CN107885962A (en) | The method that power automatic system carries out measuring modeling based on CIM | |
| CN108596502B (en) | Method for simplifying geographic model of power grid to power distribution network planning service model | |
| Chen et al. | Hierarchical distribution network topology formulation and dimensionality reduction using homeomorphism transformation | |
| CN106022956A (en) | Region protection differential ring boundary circuit breaker dynamic search method |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CP02 | Change in the address of a patent holder |
Address after: 215123 c607, No. 99, Ren'ai Road, Suzhou Industrial Park, Suzhou City, Jiangsu Province Patentee after: YIMAIKE (SUZHOU) INFORMATION TECHNOLOGY Co.,Ltd. Address before: 215123 c607, No. 99, Ren'ai Road, Suzhou Industrial Park, Nanjing, Jiangsu Patentee before: YIMAIKE (SUZHOU) INFORMATION TECHNOLOGY Co.,Ltd. |
|
| CP02 | Change in the address of a patent holder |