Intelligent mapping method, device and equipment for low-voltage feeder lines in distribution network based on S-shaped layout and medium

Abstract

The embodiment of the invention provides an intelligent mapping method, device and equipment for low-voltage feeder lines in a distribution network based on S-shaped layout and a medium, relates to the technical field of power distribution networks, and aims to draw an S-shaped layout diagram by utilizing feeder line model data and configuration information of the power distribution network to obtain the S-shaped layout diagram corresponding to the feeder line model data, so that automatic mapping can be realized. Moreover, in the graph drawing process, drawing is performed according to the first primitive nodes in the target path, when one of the first primitive nodes is connected with at least one second primitive node, a sub-branch connected with the first primitive node is drawn, and drawing parameters are dynamically adjusted through a preset calculation model. And classifying the primitives of the subsequent batch into a certain sub-graph by selecting a sub-graph algorithm to draw the sub-graph, and after the sub-graph is drawn, returning to the target path from an outlet of the sub-graph to continue drawing until the S-shaped layout graph is obtained, so that the main branch and the sub-branch can be drawn, and the accuracy of automatic graph drawing can be improved.

Description

Technical Field

[0001] The present invention relates to the technical field of distribution network, and in particular to an intelligent mapping method, device, equipment and medium for low-voltage feeder lines in a distribution network based on an S-shaped layout. Background Art

[0002] Distribution network graphics are numerous and large in size, and their parameters are frequently modified. The traditional manual drawing method is not only inefficient, error-prone, time-consuming and labor-intensive, but also often leads to untimely modifications as distribution lines are transformed, resulting in inconsistencies between the finished drawings and the actual situation, which brings operational risks to distribution network dispatching.

[0003] The current mainstream mapping technology based on distribution network topology data is mainly aimed at simple single-line diagrams, and can only present good results when the single-line diagrams have few branches and the ring network diagrams on the feeders are not many. If there are more branches and more ring network cabinets are included, the presentation effect will be relatively poor, and it cannot be displayed efficiently and intuitively in the distribution network system. A lot of adjustments are still needed when the mapping is applied to actual projects.

[0004] The patent with application number CN202310080901.5 obtains operating data from its own distribution network system and generates a cross-fishbone layout self-healing index map with business parameters based on the data to facilitate subsequent operation and maintenance. However, this method fails to solve the problem of equipment layout optimization.

[0005] Therefore, an intelligent mapping method, device, equipment and medium for low voltage feeder lines in a distribution network based on an S-type layout are proposed. Summary of the invention

[0006] In view of this, the object of the present invention is to provide a method, device, equipment and medium for intelligent mapping of low-voltage feeder lines in a distribution network based on an S-shaped layout, so as to enable automatic mapping, and the automatic mapping layout effect is more compact and reasonable.

[0007] In the first aspect, an embodiment of the present invention provides a method for intelligent mapping of low-voltage feeders in a distribution network based on an S-shaped layout, including: a data acquisition step: acquiring distribution network CIM feeder model data and configuration information, and converting the distribution network CIM feeder model data into graph element node information and its connection information; a path search step: based on the graph element node information, determining the root node in the graph element node, and starting from the root node to find the target path for mapping, the target path includes the root node and multiple first graph element nodes in the graph element node; a branch drawing step: mapping based on the configuration information, the connection information and the target path Drawing, if the target path is connected to a sub-branch of the second primitive node, then turn to drawing the sub-branch connected to the current first primitive node; dynamic drawing step: input the drawing parameters of the current first primitive node and the drawing information of the drawn first primitive node combination into a preset calculation model, dynamically adjust the drawing parameters of the next first primitive node, and determine the position of the next first primitive node based on the adjusted drawing parameters; sub-graph drawing step: based on the sub-graph selection algorithm, classify the subsequent batches of primitives into a sub-graph to draw the sub-graph, and after the sub-graph is drawn, return to the target path from the sub-graph to continue drawing until an S-shaped layout diagram is obtained.

[0008] In a possible implementation, the searching for a target path to form a graph starting from the root node includes: starting from the root node, traversing multiple paths that can be formed by the primitive nodes through a depth-first search algorithm; and selecting the path with the most primitive nodes from the multiple paths as the target path.

[0009] In a possible implementation, the first primitive node in the target path is drawn along a first direction, and the turning to draw the sub-branch connected to the current first primitive node includes: turning to draw the sub-branch connected to the first primitive node along a second direction, and the first direction is perpendicular to the second direction.

[0010] In a possible implementation, the drawing parameters of the current first primitive node and the drawing information of the drawn first primitive node combination are input into a preset computing model, and the drawing parameters of the next first primitive node are dynamically adjusted, including: after the drawing of the current first primitive node is completed, the current drawing parameters are obtained, and the current drawing parameters include the current drawing direction, global trend direction, full-image width and height, coordinate extreme values, and drawing progress; the drawing information of the drawn first primitive node combination is obtained, and the drawing information includes local width and height, coordinate extreme values, and primitive attributes, and the drawing information is obtained through pre-drawing; the current drawing parameters and the drawing information of the drawn first primitive node combination are input into the preset computing model to obtain the next drawing parameters of the next first primitive node output by the preset computing model, and the next drawing parameters include the next drawing direction and the next drawing coordinates; and the next first primitive node is drawn according to the next drawing parameters.

[0011] In a possible implementation, the method also includes: if it is determined based on the next drawing coordinate that the connection direction between the current first primitive node and the next first primitive node is different from the current drawing direction, then the current first primitive node is recorded as a line turning point, so that after the primitive nodes are all drawn and the layout is completed, a connection line between the primitive nodes is drawn based on the connection information, wherein the direction of the connection line at the line turning point changes.

[0012] In a possible implementation, during the drawing process, the algorithm based on selecting subgraphs classifies subsequent batches of primitives into a subgraph to draw a subgraph, and after the subgraph is drawn, a line is drawn from the subgraph to return to the target path to continue drawing until an S-shaped layout diagram is obtained, including: when drawing the current first primitive node, based on the primitive attributes of the first primitive node and the current drawing progress, it is determined whether at least one of multiple preset conditions is met, and the multiple preset conditions correspond one-to-one to multiple subgraph drawing methods; if at least one of the multiple preset conditions is met, the current first primitive node and at least one subsequent first primitive node are subgraphed by the subgraph drawing method corresponding to one of the at least one preset conditions, and after the subgraph is drawn, a line is drawn from the subgraph to continue drawing the target path; if any of the multiple preset conditions is not met, the next first primitive node is drawn.

[0013] In a possible implementation, after obtaining the S-shaped layout diagram corresponding to the feeder model data, the method further includes: determining whether a length ratio of the S-shaped layout diagram satisfies a preset ratio, wherein the length ratio includes a ratio between a length in a horizontal direction and a length in a vertical direction; if the length ratio of the S-shaped layout diagram does not satisfy the preset ratio, adjusting the S-shaped layout diagram to obtain an adjusted S-shaped layout diagram; wherein the adjustment process includes the following steps: adjusting the length of the S-shaped layout diagram along the target direction according to the first step in sequence until the first length of the S-shaped layout diagram along the target direction is determined. , wherein the first length is obtained by adjusting according to the first step length, the difference between the length ratio of the S-shaped layout diagram under the first length and the preset ratio is not greater than the difference between the length ratio of the S-shaped layout diagram under other lengths and the preset ratio, the other lengths are obtained by adjusting according to the first step length, and the target direction includes the horizontal direction or the vertical direction; on the basis of the first length, the length of the S-shaped layout diagram along the target direction is adjusted in sequence according to the second step length until the length ratio of the S-shaped layout diagram meets the preset ratio, and the second step length is smaller than the first step length.

[0014] In the second aspect, an embodiment of the present invention provides an intelligent mapping device for low-voltage feeders in a distribution network based on an S-shaped layout, including: an acquisition module for acquiring distribution network CIM feeder model data and configuration information, and converting the distribution network CIM feeder model data into graph element node information and its connection information; a path finding module for determining a root node in a graph element node based on the graph element node information, and starting from the root node to find a target path for mapping, wherein the target path includes the root node and a plurality of first graph element nodes in the graph element node; a branch drawing module for mapping based on the configuration information, the connection information and the target path. Drawing, if the target path is connected to a sub-branch of the second primitive node, then turn to drawing the sub-branch connected to the current first primitive node; a dynamic drawing module, used to input the drawing parameters of the current first primitive node and the drawing information of the drawn first primitive node combination into a preset calculation model, dynamically adjust the drawing parameters of the next first primitive node, and determine the position of the next first primitive node based on the adjusted drawing parameters; a sub-graph drawing module, used to classify subsequent batches of primitives into a sub-graph based on a sub-graph selection algorithm to draw a sub-graph, and after the sub-graph is drawn, return to the target path from the sub-graph to continue drawing until an S-shaped layout diagram is obtained.

[0015] In a third aspect, an embodiment of the present invention provides an electronic device, including a processor and a memory, wherein the memory stores computer-executable instructions that can be executed by the processor, and the processor executes the computer-executable instructions to implement the above method.

[0016] In a fourth aspect, an embodiment of the present invention provides a computer-readable storage medium, wherein the computer-readable storage medium stores computer-executable instructions. When the computer-executable instructions are called and executed by a processor, the computer-executable instructions prompt the processor to implement the above method.

[0017] The embodiments of the present invention bring the following beneficial effects: (1) Automatic feeder mapping can effectively solve the problems of large workload, low efficiency and easy errors in manual drawing, greatly improve the efficiency of distribution network construction and enhance the underlying security of the system.

[0018] (2) The sub-diagram combination scheme adapts to the actual needs of distribution network feeders, solves the problem that the existing scheme is too inefficient to handle the complex situations of distribution network feeders, expands the application scope of mapping, and improves the practicality of feeder automatic mapping.

[0019] (3) The width adjustment solution improves the display effect of the graphics, making the graphics more intuitive and compact, and improving the user experience.

[0020] Other features and advantages of the present invention will be described in the following description, and partly become apparent from the description, or understood by practicing the present invention. The purpose and other advantages of the present invention are realized and obtained by the structures particularly pointed out in the description, claims and drawings.

[0021] In order to make the above-mentioned objects, features and advantages of the present invention more obvious and easy to understand, preferred embodiments are given below and described in detail with reference to the accompanying drawings. BRIEF DESCRIPTION OF THE DRAWINGS

[0022] Figure 1 A schematic diagram of a cross fishbone layout drawn for related technology; Figure 2 A schematic diagram of a flow chart of a method for intelligently mapping low-voltage feeder lines in a distribution network based on an S-shaped layout provided by an embodiment of the present invention; Figure 3 A full schematic diagram including a ring network cabinet diagram provided for an embodiment of the present invention; Figure 4 A schematic diagram of a flow chart of another method for intelligently mapping low-voltage feeder lines in a distribution network based on an S-shaped layout provided by an embodiment of the present invention; Figure 5 An S-shaped layout diagram drawn for an embodiment of the present invention; Figure 6 A schematic diagram of the structure of a device provided by an embodiment of the present invention; Figure 7 A schematic diagram of the structure of an electronic device provided by an embodiment of the present invention.

[0023] In order to more clearly illustrate the specific implementation methods of the present invention or the technical solutions in the prior art, the drawings required for use in the specific implementation methods or the description of the prior art will be briefly introduced below. Obviously, the drawings described below are some implementation methods of the present invention. For those skilled in the art, other drawings can be obtained based on these drawings without paying any creative work. DETAILED DESCRIPTION

[0024] In order to make the purpose, technical solution and advantages of the embodiments of the present invention clearer, the technical solution of the present invention will be clearly and completely described below in conjunction with the accompanying drawings. Obviously, the described embodiments are part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative work are within the scope of protection of the present invention.

[0025] In related technologies, operating data can be obtained from the distribution network system itself and a cross-shaped fishbone layout self-healing index map with business parameters can be generated based on the data to facilitate subsequent operation and maintenance. Figure 1 As shown, Figure 1 A schematic diagram of a cross fishbone layout drawn for related technology.

[0026] However, the existing automatic mapping layout is not compact and reasonable enough, and cannot be displayed efficiently and intuitively in the distribution network system. A lot of adjustments are still needed before the mapping can be applied to actual projects.

[0027] In view of this, an embodiment of the present invention provides a method, device, equipment and medium for intelligent mapping of low voltage feeders in a distribution network based on an S-shaped layout, which can automatically map and improve the compactness and rationality of the mapping layout, thereby providing efficient and intuitive display.

[0028] In general, the embodiments of the present invention make the layout of the drawing compact and reasonable through width optimization and sub-graph combination, so that the drawing can be more conveniently applied to the low-voltage distribution network system. Specifically, the present invention is an automatic drawing method for arranging connected graphics elements. Find the starting node from the model data, find the longest node path from the starting node as the main line and draw it step by step. When encountering multiple sub-nodes connected, change the direction and use the sub-node as the starting node to layout the sub-line, and optimize the overall drawing layout by combining sub-graph schemes and width adjustment schemes.

[0029] For ease of understanding, the embodiment of the present invention first describes the intelligent mapping method for low-voltage feeder lines in a distribution network based on an S-shaped layout. Figure 2 As shown, Figure 2 The present invention provides a flow chart of a method for intelligently mapping low-voltage feeder lines in a distribution network based on an S-shaped layout. Figure 2 The method shown can be executed by an electronic device, such as Figure 2 The methods shown may include: S210: Acquire distribution network CIM feeder model data and configuration information, and convert the distribution network CIM feeder model data into graph element node information and its connection information.

[0030] Among them, the feeder model data can be the data of the Common Information Model (CIM) in the IEC61970 standard specification. The attributes of the feeder may include feeder identification, voltage level, operating status and other information. Among them, feeder identification: the name or number that uniquely identifies the feeder. Voltage level: the voltage level of the feeder, such as 110kV, 220kV, etc. The operating status includes current, voltage, power or switch status. Other information includes protection configuration, measurement data, etc. The relationship between feeders may include connection relationships, such as the starting point, the end point, and the connected equipment. Through the connected equipment, it can be known which devices the feeder is connected to, such as circuit breakers, switches, etc.

[0031] The configuration information may include graphics configuration information and measurement configuration information. The graphics configuration information is used to indicate the size of the presented content, such as indicating the size of the presented primitive node. The measurement configuration information may indicate the measurement data of the presented primitive node, and the measurement data may include parameters or power status (such as switch status, voltage, current, etc.).

[0032] The information of the primitive node may include a unique identifier of the primitive node and attributes of the primitive node, etc. The attributes of the primitive node may be voltage level, operating status, and other information. In this embodiment, the primitive node may refer to a device connected to the feeder.

[0033] S220. Based on the primitive node information, determine the root node in the primitive nodes, and start from the root node to find a target path for forming a graph, wherein the target path includes the root node and a plurality of first primitive nodes in the primitive nodes.

[0034] Among them, the root node can be understood as the starting point. Specifically, it can be the starting point of the whole map or the local starting point, which is not limited here. Exemplarily, the transformer outlet point can be used as the root node. Then, the target path of the map is found starting from the root node. Among them, the target path can be understood as the main branch of the map. In the process of drawing the map, the nodes on the target path can be mainly drawn. When other conditions are met, the sub-branches or sub-maps are drawn, and then the nodes on the target path are returned to for drawing until the map is completed. Exemplarily, it can be determined whether the node is a transformer outlet point by the attributes and types of the primitive node.

[0035] S230, drawing a graph based on the configuration information, the connection information and the target path. If the target path is connected to a sub-branch of the second primitive node, then turning to drawing the sub-branch connected to the current first primitive node.

[0036] Among them, the sub-branch can be understood as a branch drawn with the first primitive node as the root node. In this step, when drawing the main branch, turn to drawing the sub-branch connected to the first primitive node, and after the sub-branch is drawn, continue drawing the target path with the first primitive node until the last first primitive node in the target path is drawn. In this way, the main branch and the sub-branch can be accurately drawn.

[0037] S240, inputting the drawing parameters of the current first primitive node and the drawing information of the drawn first primitive node combination into a preset calculation model, dynamically adjusting the drawing parameters of the next first primitive node, and determining the position of the next first primitive node based on the adjusted drawing parameters.

[0038] In this embodiment, by dynamically adjusting the drawing parameters of the next first primitive node, the compactness of the formed S-shaped layout graph can be improved.

[0039] S250, classifying subsequent batches of graphics elements into a certain subgraph based on a subgraph selection algorithm to draw the subgraph, and after the subgraph is drawn, returning to the target path from the subgraph exit line to continue drawing until an S-shaped layout diagram is obtained.

[0040] In this embodiment, a subgraph algorithm is selected to classify subsequent batches of primitives into a certain subgraph to draw the subgraph, and after the subgraph is drawn, the line from the subgraph is returned to the target path to continue drawing, so that the standardization of the obtained S-shaped layout diagram can be improved. In this embodiment, classifying subsequent batches of primitives into a certain subgraph can be understood as classifying subsequent batches of primitives into the same subgraph.

[0041] Specifically, in this embodiment, the layout and drawing of the primitive nodes are performed based on the configuration information and the target path, and then the drawn primitive nodes are connected based on the connection relationship, so as to obtain the connection relationship between the primitive nodes. Moreover, after the drawing of the graph is completed, the primitive measurement information is matched according to the measurement configuration information passed in by the drawing, and the measurement points and initial data are automatically added to the corresponding primitives, so that the drawing can be directly applied in the distribution network project.

[0042] The embodiment of the present invention comprises a data acquisition step: acquiring distribution network CIM feeder model data and configuration information, and converting the distribution network CIM feeder model data into graph element node information and its connection information; a path search step: determining a root node in the graph element node based on the graph element node information, and starting from the root node to search for a target path for graph formation, wherein the target path includes the root node and a plurality of first graph element nodes in the graph element node; a branch drawing step: drawing a graph based on the configuration information, the connection information and the target path, and if the target path is connected to a sub-branch of a second graph element node, turning to drawing a sub-branch connected to the current first Sub-branches connected by graph element nodes; dynamic drawing step: inputting the drawing parameters of the current first graph element node and the drawing information of the drawn first graph element node combination into a preset calculation model, dynamically adjusting the drawing parameters of the next first graph element node, and determining the position of the next first graph element node based on the adjusted drawing parameters; sub-graph drawing step: based on the sub-graph selection algorithm, classifying subsequent batches of graph elements into a certain sub-graph to draw the sub-graph, and after the sub-graph is drawn, returning to the target path from the sub-graph to continue drawing until an S-shaped layout diagram is obtained, which can improve the compactness and standardization of the S-shaped layout diagram, and can intuitively reflect the main branch and sub-branch.

[0043] In a possible implementation, the step of searching for a target path to form a graph starting from the root node includes: Starting from the root node, multiple paths that can be formed by the primitive nodes are traversed by a depth-first search algorithm; and the path with the most primitive nodes is selected from the multiple paths as the target path.

[0044] Depth-First Search (DFS) is an algorithm for traversing or searching a tree or graph. The DFS algorithm starts from a vertex of the graph and traverses along the depth direction of the tree until a leaf node is visited, and then backtracks to the previous node to continue searching for unvisited adjacent nodes until all nodes are visited. The DFS algorithm can be implemented using a recursive or explicit stack. In this embodiment, the multiple paths that can be formed by the primitive nodes can be understood as the multiple branches that can be formed by the primitive nodes, and then the path with the most primitive nodes is selected from the multiple paths as the target path, that is, the longest path is used as the target path, which is equivalent to saying that the shorter path is used as a sub-branch, so that the resulting graph can be made more compact.

[0045] In another possible implementation, one of the paths may be randomly selected as the main branch, thus improving the efficiency of mapping.

[0046] In a possible implementation, the first primitive node in the target path is drawn along a first direction, and the turning to draw a sub-branch connected to the current first primitive node includes: Turn to draw a sub-branch connected to the first primitive node along a second direction, and the first direction is perpendicular to the second direction.

[0047] The first direction is perpendicular to the second direction, and specifically, the first direction is perpendicular to the second direction. For example, when drawing the main branch left and right, turn to draw the sub-branch up and down, and when drawing the main branch up and down, turn to draw the sub-branch left and right.

[0048] In this embodiment, the first primitive nodes in the target path are drawn along the first direction; when one of the first primitive nodes is connected to at least one second primitive node, the sub-branch connected to the first primitive node is drawn along the second direction, and the first direction is perpendicular to the second direction. In this way, the sub-branches are drawn in different directions, thereby improving the compactness of the resulting drawing, and facilitating knowing whether the node is on the main branch or the sub-branch through the arrangement direction of the nodes in the drawing.

[0049] It should be noted that, after the sub-branch is drawn, the drawing of the target path is continued with the first primitive node, which means that the drawing of the target path is continued in the first direction.

[0050] In another possible implementation, the drawing direction may not be changed, that is, the sub-branch may continue to be drawn in the first direction, and after the sub-branch is drawn, the remaining part of the main branch may be drawn in the second direction.

[0051] In a possible implementation, during the drawing process, the drawing parameters of the current first primitive node and the drawing information of the drawn first primitive node combination are input into a preset calculation model, and the drawing parameters of the next first primitive node are dynamically adjusted, including: After drawing the current first primitive node, current drawing parameters are obtained, the current drawing parameters including the current drawing direction, the global trend direction, the width and height of the entire graph, the maximum coordinate value, and the drawing progress; drawing information of the drawn first primitive node combination is obtained, the drawing information including the local width and height, the extreme coordinate value, and the primitive attribute, the drawing information is obtained through pre-drawing; the current drawing parameters and the drawing information of the drawn first primitive node combination are input into a preset calculation model to obtain the next drawing parameters of the next first primitive node output by the preset calculation model, the next drawing parameters including the next drawing direction and the next drawing coordinates; and the next first primitive node is drawn according to the next drawing parameters.

[0052] The primitive attributes may include: primitives to be drawn, primitive types (such as circuit breakers), and primitive sizes, etc. The drawn first primitive node combination may be a collection of one or more drawn first primitive nodes.

[0053] In this embodiment, specifically, after drawing the current primitive node, the system needs to collect a series of "current drawing parameters", which are used to guide the subsequent drawing process. These parameters include: Current drawing direction: refers to the directionality of the current primitive node when drawing, such as from left to right, from top to bottom, etc. Global trend direction: This refers to the overall trend direction of the entire graphic or layout, such as the overall arrangement from top to bottom, or flowing from left to right. Full image width and height: refers to the width and height of the entire graphical interface. Coordinate maximum value: refers to the maximum and minimum values ​​of the coordinate range of all primitive nodes in the current drawing process, which helps to determine the boundaries of the graphics. Drawing progress: indicates the degree of completion of the current drawing process relative to the overall task.

[0054] Next, the system needs to obtain the "drawing information" of each first primitive node that has been drawn (or pre-drawn) before. This information is crucial for subsequent drawing because it provides specific characteristics of each primitive node, including: Local width and height: the width and height of each primitive node itself. Coordinate extremes: the maximum and minimum values ​​of the coordinate range of each primitive node on the canvas. Primitive attributes: other characteristics of the primitive node, such as color, transparency, border style, etc. This information is usually obtained through the pre-drawing process, which is a simulation or calculation of the graphic elements before actual drawing to determine their position and attributes.

[0055] With the current drawing parameters and drawing information of each primitive node, the system inputs these data into a "preset calculation model". This model is built based on algorithms or machine learning technology to predict and calculate the drawing parameters of the next primitive node.

[0056] After the preset calculation model processes the input data, it outputs the "next drawing parameters", which guide how to draw the next primitive node. The next drawing parameters include: Next drawing direction: the direction along which the next primitive node should be drawn. Next drawing coordinates: the specific location of the next primitive node on the canvas.

[0057] Finally, the system starts drawing the next first primitive node according to the next drawing parameter output by the preset calculation model. This process is repeated until all primitive nodes are drawn to form the final graphical interface.

[0058] It should be noted that when the calculation model is preset during training, its input can be drawing direction, trend direction, full image width and height, coordinate maximum value, drawing progress, local width and height, coordinate extreme value and primitive attributes, and the next preset drawing parameter is used as a label and the output of the model to calculate the loss, thereby completing the training. Optionally, it can also be a model with preset experience values.

[0059] In general, this embodiment combines the intelligent width optimization solution to dynamically adjust the drawing parameters during drawing to achieve a more optimal S-shaped layout. When arranging the drawing primitives in step 3, the current arrangement drawing parameters, such as local direction, global direction, local width and height, global width and height, XY coordinate extreme values, drawing progress, subsequent primitive attributes, etc., are recorded in real time as input data to calculate the optimal subsequent primitive arrangement drawing parameters, and the arrangement drawing parameters such as arrangement drawing direction, subsequent primitive drawing coordinates, line turning points, etc. are adjusted according to the obtained parameter results to further arrange the subsequent primitive arrangement connections, so that the final global layout is an S-shaped compact layout.

[0060] In this embodiment, after drawing the current first primitive node, the current drawing parameters are obtained, and the current drawing parameters include the current drawing direction, global trend direction, full map width and height, coordinate extreme values, and drawing progress; the drawing information of each first primitive node is obtained, and the drawing information includes local width and height, coordinate extreme values, and primitive attributes, and the drawing information is obtained through pre-drawing; the current drawing parameters and the drawing information of each first primitive node are input into a preset calculation model to obtain the next drawing parameters of the next first primitive node output by the preset calculation model, and the next drawing parameters include the next drawing direction and the next drawing coordinates; the next first primitive node is drawn according to the next drawing parameters, which can further improve the compactness of the drawing.

[0061] In another possible implementation, drawing may be performed in one direction all the time, which can reduce the time required for drawing and improve drawing efficiency.

[0062] In a possible implementation, the method further includes: If it is determined based on the next drawing coordinate that the connection direction between the current first primitive node and the next first primitive node is different from the current drawing direction, the current first primitive node is recorded as a line turning point, so that after the primitive nodes are all drawn and laid out, a connecting line between the primitive nodes is drawn based on the connection information, wherein the direction of the connecting line at the line turning point changes.

[0063] In this embodiment, before drawing each primitive node, it is checked whether the connection direction between the current first primitive node and the next first primitive node is consistent with the current drawing direction, that is, it is checked whether the drawing of the next first primitive node requires a new row or a new column (if the current drawing direction is in the row direction, it is determined whether to start a new row, if the current drawing direction is in the column direction, it is determined whether to start a new column, the row direction can be understood as the length direction, and the column direction can be understood as the width direction). If it is inconsistent, it means that there is a line turn here, so the current primitive node is marked as a line turn buried point. In addition to the basic drawing information, it is also necessary to record the specific information of these turning buried points, such as the angle of the turn, the direction change, etc. This information will be used in the subsequent drawing of the connecting lines. In this way, after the primitive nodes are all drawn and the layout is completed, the connecting lines between the primitive nodes are drawn based on the connection information, and the direction of the connecting lines at the line turning buried points changes, so that the accuracy of the connection can be improved.

[0064] In a possible implementation, during the drawing process, the sub-graph selection algorithm classifies subsequent batches of graphics elements into a sub-graph to draw the sub-graph, and after the sub-graph is drawn, returns to the target path from the sub-graph to continue drawing until an S-shaped layout graph is obtained, including: When drawing the current first primitive node, based on the primitive attributes of the first primitive node and the current drawing progress, determine whether at least one of multiple preset conditions is met, and the multiple preset conditions correspond one-to-one to multiple sub-graph drawing methods; if at least one of the multiple preset conditions is met, sub-graph drawing is performed on the current first primitive node and at least one subsequent first primitive node through the sub-graph drawing method corresponding to one of the at least one preset condition, and after the sub-graph drawing is completed, a line is drawn from the sub-graph to continue drawing the target path; if any of the multiple preset conditions is not met, the next first primitive node is drawn.

[0065] Optionally, multiple sub-graph drawing methods may include but are not limited to a switchgear / ring main cabinet sub-graph method, a distribution room / user station sub-graph method, a transformer sub-graph method, etc. The subsequent first graph element node may be a node to be drawn after the current first graph element node.

[0066] It should be noted that if at least two of the multiple preset conditions are met, the sub-graph drawing method with the highest priority can be selected from the sub-graph drawing methods corresponding to the at least two preset conditions based on the priority of the sub-graph drawing method to draw the sub-graph.

[0067] See also Figure 3 , Figure 3A full schematic diagram including a ring network cabinet diagram is provided for an embodiment of the present invention. Figure 3 The schematic diagram shown includes the substation, outgoing line identification, circuit breaker, substation, switch, user access point and ring network cabinet diagram.

[0068] Optionally, you can determine whether to classify subsequent batches of graphics into a sub-map based on the graphics attribute characteristics (the graphics attributes of the current graphics and subsequent graphics) and the drawing progress characteristics. Specifically, you can analyze the attributes of each graphics element, such as type, voltage level, and device. According to the attribute characteristics, classify the graphics elements into corresponding categories, such as switchgear, transformers, lines, etc. Then, track the drawing progress to understand the currently drawn graphics elements and the graphics elements to be drawn. According to the drawing progress, determine whether to create a new sub-map or continue drawing in the current sub-map. Then, according to the graphics element category and drawing requirements, select the appropriate sub-map method.

[0069] Specifically, the sub-image module is loaded at startup, and the sub-image drawing method set is loaded from it. Then, the primitive attribute characteristics and drawing progress characteristics before drawing the primitive position enter the sub-image judgment. In the sub-image modules that meet the sub-image judgment conditions, the sub-image drawing method with the highest priority is selected according to the module priority. Then, the primitives in the sub-image module are drawn downward according to the connection relationship and the layout method until the elements of the sub-image are drawn. Draw subsequent primitives. Connect the entry and exit lines between ordinary primitives and sub-images. Ordinary primitives can be understood as primitives that are not drawn according to the sub-image drawing method.

[0070] For example, the preset condition corresponding to the distribution room sub-diagram method may be: the current element type is busbar, and the subsequent elements are the same container. The preset condition corresponding to the switchgear / ring main unit sub-diagram method may be: the current element type is ring main unit / switch, and the subsequent elements are the same container.

[0071] In this embodiment, when drawing the current first primitive node, based on the primitive attributes of the first primitive node and the current drawing progress, it is determined whether at least one of multiple preset conditions is met, and the multiple preset conditions correspond one-to-one to multiple sub-graph drawing methods; if at least one of the multiple preset conditions is met, the current first primitive node and at least one subsequent first primitive node are sub-graphed by the sub-graph drawing method corresponding to one of the at least one preset conditions, and after the sub-graph drawing is completed, a line is drawn from the sub-graph to continue drawing the target path; if any of the multiple preset conditions is not met, the next first primitive node is drawn, so that multiple first primitive nodes according to the sub-graph drawing method can be drawn according to the sub-graph drawing method, which can improve the accuracy of the final drawing.

[0072] In a possible implementation, after obtaining the S-shaped layout diagram, the method further includes: Determine whether the length ratio of the S-shaped layout diagram meets a preset ratio, wherein the length ratio includes a ratio between a length in a horizontal direction and a length in a vertical direction; if the length ratio of the S-shaped layout diagram does not meet the preset ratio, adjust the S-shaped layout diagram to obtain an adjusted S-shaped layout diagram; wherein the adjustment process includes the following steps: Adjust the length of the S-shaped layout diagram along the target direction according to the first step length in sequence until the first length of the S-shaped layout diagram along the target direction is determined, wherein the first length is obtained by adjusting according to the first step length, and the difference between the length ratio of the S-shaped layout diagram under the first length and the preset ratio is not greater than the difference between the length ratio of the S-shaped layout diagram under other lengths and the preset ratio, the other lengths are obtained by adjusting according to the first step length, and the target direction includes the horizontal direction or the vertical direction; on the basis of the first length, adjust the length of the S-shaped layout diagram along the target direction according to the second step length in sequence until the length ratio of the S-shaped layout diagram meets the preset ratio, and the second step length is smaller than the first step length.

[0073] For example, the horizontal length can be understood as length, and the vertical length can be understood as width, and the ratio between the horizontal length and the vertical length can be understood as the aspect ratio. Whether the length ratio satisfies the preset ratio can be whether the difference between the length ratio and the preset ratio is less than the difference threshold. The difference threshold can be set as needed, for example, to 0.1 or 0, which is not limited here.

[0074] For example, assuming that the preset ratio is 3:2, the length is 4000, and the width is 2000, then the width is adjusted according to the first step of 100. When the width is 2500, it is found that the length-to-width ratio is closest to the preset ratio, and the width is adjusted according to the second step of 10 until the length ratio of the S-shaped layout meets the preset ratio. In addition, the length can also be adjusted, for example, the length is reduced according to the first step.

[0075] It should be understood that, according to the first step length adjustment, the length along the target direction may be increased or decreased according to the first step length.

[0076] In this embodiment, the graphics can be fine-tuned by the divide-and-conquer method. Specifically, the width adjustment primitive position is adjusted in steps of 100 and the aspect ratio is calculated, and two widths that make the aspect ratio of the graphics closest to the preset value (such as 3:2) are found in the hundred-level pixels. At the optimal width of the hundred-level pixels, the width adjustment primitive is adjusted in steps of 10 and the aspect ratio is calculated to find the optimal width of the ten-level pixels, and the final image is obtained.

[0077] For ease of understanding, the following embodiment provides another embodiment for exemplary description. Figure 4 As shown, Figure 4 A schematic diagram of another method for intelligently mapping low-voltage feeder lines in a distribution network based on an S-shaped layout provided by an embodiment of the present invention. Figure 4 The methods shown may include: S401, start drawing.

[0078] In this embodiment, an instruction to start drawing may be obtained, or feeder model data and configuration information may be obtained.

[0079] S402: Find the outgoing line switch of the substation as the root node.

[0080] For this step, please refer to the relevant description of S230.

[0081] S403: Find the longest path to the root node as the main branch.

[0082] For this step, please refer to the relevant description of S230.

[0083] S404: All nodes on the longest path.

[0084] This step may refer to the relevant description of S230. The node in this embodiment may be called a first primitive node.

[0085] S405: Traverse the longest path starting from the root node.

[0086] For this step, please refer to the relevant description of S230.

[0087] S406, current node.

[0088] S407: Are there any nodes left?

[0089] If there is no node, end the current recording. If there is still a node, determine whether the width should be adjusted.

[0090] S408, end the current cycle.

[0091] S409: Whether to adjust the width.

[0092] The width adjustment in this step can be an adjustment of whether to wrap the line, and you can refer to the description of obtaining the "next drawing parameter" according to the "current drawing parameter". If the connection direction between the current node and the next node is different from the current drawing direction, the width adjustment is performed, that is, wrapping the line or column to continue drawing.

[0093] S410: Adjust drawing parameters.

[0094] The adjustment of the drawing parameter in this step may be to adjust the width, that is, to continue drawing by wrapping a row or a column.

[0095] S411. Determine whether there is a subgraph algorithm that meets the conditions.

[0096] The sub-graph algorithm may also be referred to as a sub-graph drawing method. The preset conditions and specific sub-graph algorithms may refer to the description of the above embodiment.

[0097] S412: Select a subgraph algorithm.

[0098] The method of selecting the subgraph algorithm may refer to the description of the above embodiment.

[0099] S413, draw a subgraph.

[0100] In this step, the subgraph may be drawn according to the subgraph algorithm.

[0101] S414, using the line out of the subgraph as the root node to find the longest path.

[0102] In this embodiment, the longest path can be found by taking the outgoing line of the subgraph as the root node, so that the compactness of the graph can be improved as much as possible.

[0103] S415, drawing the current node at the current drawing position according to the direction.

[0104] S416, next node.

[0105] S417: Whether there is a branch node.

[0106] S418: Determine the arrangement of the child nodes.

[0107] Among them, the child node can also be called a second primitive node.

[0108] S419. If the upper width is larger, it will be drawn at the lower part; if the lower width is larger, it will be drawn at the upper part.

[0109] S420, if the left is higher, it is drawn on the right, and if the right is higher, it is drawn on the left.

[0110] In this embodiment, the upper width is drawn at the bottom, the lower width is drawn at the top, the left height is drawn at the right, and the right height is drawn at the left, which can improve the compactness of the layout. In addition, when the main branch is drawn in a parallel direction, the sub-branch can be drawn in a vertical direction, or when the main branch is drawn in a vertical direction, the sub-branch can be drawn in a parallel direction.

[0111] S421, drawing a sub-circuit with the sub-node as the root node.

[0112] S422. Find the longest path of the child nodes with the child node as the root node.

[0113] S423, the loop ends and drawing stops.

[0114] See also Figure 5 , Figure 5 An S-shaped layout diagram drawn for an embodiment of the present invention. Figure 5 The S-shaped layout diagram shown is "S-shaped", and some nodes in the main branch are also connected to sub-branches.

[0115] In this embodiment, the automatic feeder mapping effectively solves the problems of large workload, low efficiency and easy errors in manual drawing, greatly improves the efficiency of distribution network engineering construction and improves the bottom security of the system. In addition, the sub-graph combination scheme adapts to the actual distribution network feeder needs, solves the problem that the existing scheme is too inefficient to handle the complex situation of distribution network feeders, expands the scope of application of mapping, and improves the practicality of automatic feeder mapping. And the width adjustment scheme improves the display effect of the mapping, making the graphics more intuitive and compact, and improving the user experience.

[0116] In addition, a combination of sub-diagram drawing methods is added to quickly adapt to the drawing forms of switchgear, ring network cabinets, distribution rooms, and user stations in the actual power grid feeder construction, solving the problem that the existing solutions cannot efficiently handle the complex situations of distribution network feeders, expanding the scope of application of drawing, and improving the practicality of automatic feeder drawing. In addition, a width optimization scheme is added to adjust the rationality of the drawing layout to prevent situations that affect the use of graphics, such as excessive width of the drawing ratio and excessive white space, so that the final drawing is a compact S-shaped layout. It also greatly reduces the drawing workload, improves efficiency, and easily avoids errors caused by negligence of the drawing staff during the drawing process.

[0117] See also Figure 6 , Figure 6 A schematic diagram of the structure of a device provided by an embodiment of the present invention. Figure 6 The apparatus shown may include: An acquisition module 610 is used to acquire distribution network CIM feeder model data and configuration information, and convert the distribution network CIM feeder model data into graph element node information and its connection information; A path finding module 620, configured to determine a root node among the primitive nodes based on the primitive node information, and to find a target path to form a graph starting from the root node, wherein the target path includes the root node and a plurality of first primitive nodes among the primitive nodes; A branch drawing module 630 is used to draw a graph based on the configuration information, the connection information and the target path, and if the target path is connected to a sub-branch of a second primitive node, turn to drawing the sub-branch connected to the current first primitive node; The dynamic drawing module 640 is used to input the drawing parameters of the current first primitive node and the drawing information of the drawn first primitive node combination into a preset calculation model, dynamically adjust the drawing parameters of the next first primitive node, and determine the position of the next first primitive node based on the adjusted drawing parameters; The sub-graph drawing module 650 is used to classify subsequent batches of graphics elements into a sub-graph based on the sub-graph selection algorithm to draw the sub-graph, and after the sub-graph drawing is completed, return to the target path from the sub-graph exit line to continue drawing until an S-shaped layout graph is obtained.

[0118] In a possible implementation, when the path finding module 620 starts from the root node to find the target path for forming a graph, it can be used to: Starting from the root node, multiple paths that can be formed by the primitive nodes are traversed by a depth-first search algorithm; and the path with the most primitive nodes is selected from the multiple paths as the target path.

[0119] In a possible implementation, when the branch drawing module 630 turns to drawing a sub-branch connected to the current first primitive node, it can be used to: Turn to draw a sub-branch connected to the first primitive node along a second direction, and the first direction is perpendicular to the second direction.

[0120] In a possible implementation, the dynamic drawing module 640 inputs the drawing parameters of the current first primitive node and the drawing information of the drawn first primitive node combination into a preset calculation model, and dynamically adjusts the drawing parameters of the next first primitive node, which can be used to: After drawing the current first primitive node, current drawing parameters are obtained, the current drawing parameters including the current drawing direction, the global trend direction, the width and height of the entire graph, the maximum coordinate value, and the drawing progress; drawing information of the drawn first primitive node combination is obtained, the drawing information including the local width and height, the extreme coordinate value, and the primitive attribute, the drawing information is obtained through pre-drawing; the current drawing parameters and the drawing information of the drawn first primitive node combination are input into a preset calculation model to obtain the next drawing parameters of the next first primitive node output by the preset calculation model, the next drawing parameters including the next drawing direction and the next drawing coordinates; and the next first primitive node is drawn according to the next drawing parameters.

[0121] In a possible implementation, the dynamic rendering module 640 is further used for: If it is determined based on the next drawing coordinate that the connection direction between the current first primitive node and the next first primitive node is different from the current drawing direction, the current first primitive node is recorded as a line turning point, so that after the primitive nodes are all drawn and laid out, a connecting line between the primitive nodes is drawn based on the connection information, wherein the direction of the connecting line at the line turning point changes.

[0122] In a possible implementation, the sub-graph drawing module 650 classifies subsequent batches of graphics primitives into a sub-graph based on a sub-graph selection algorithm to draw the sub-graph, and after the sub-graph drawing is completed, returns to the target path from the sub-graph exit line to continue drawing until an S-shaped layout graph is obtained, and is used to: When drawing the current first primitive node, based on the primitive attributes of the first primitive node and the current drawing progress, determine whether at least one of multiple preset conditions is met, and the multiple preset conditions correspond one-to-one to multiple sub-graph drawing methods; if at least one of the multiple preset conditions is met, sub-graph drawing is performed on the current first primitive node and at least one subsequent first primitive node through the sub-graph drawing method corresponding to one of the at least one preset condition, and after the sub-graph drawing is completed, a line is drawn from the sub-graph to continue drawing the target path; if any of the multiple preset conditions is not met, the next first primitive node is drawn.

[0123] In a possible implementation, the dynamic rendering module 640 is further used for: Determine whether the length ratio of the S-shaped layout diagram meets a preset ratio, wherein the length ratio includes a ratio between a length along a horizontal direction and a length along a vertical direction; if the length ratio of the S-shaped layout diagram does not meet the preset ratio, adjust the S-shaped layout diagram to obtain an adjusted S-shaped layout diagram; wherein the adjustment process includes the following steps: sequentially adjust the length of the S-shaped layout diagram along a target direction according to a first step length until a first length of the S-shaped layout diagram along a target direction is determined, wherein the first length is obtained by adjusting according to the first step length, and the difference between the length ratio of the S-shaped layout diagram under the first length and the preset ratio is not greater than the difference between the length ratio of the S-shaped layout diagram under other lengths and the preset ratio, wherein the other lengths are obtained by adjusting according to the first step length, and the target direction includes the horizontal direction or the vertical direction; on the basis of the first length, sequentially adjust the length of the S-shaped layout diagram along the target direction according to a second step length until the length ratio of the S-shaped layout diagram meets the preset ratio, and the second step length is smaller than the first step length.

[0124] The intelligent mapping device for low-voltage feeders in a distribution network based on an S-shaped layout provided in an embodiment of the present invention has the same technical features as the intelligent mapping method for low-voltage feeders in a distribution network based on an S-shaped layout provided in the above embodiment, so it can also solve the same technical problems and achieve the same technical effects. The device of this embodiment can refer to the description of the above method embodiment, and will not be repeated here.

[0125] This embodiment also provides an electronic device, including a processor and a memory, wherein the memory stores computer executable instructions that can be executed by the processor, and the processor executes the computer executable instructions to implement the above-mentioned intelligent mapping method for low-voltage feeders in a distribution network based on an S-shaped layout. The electronic device can be a server or a terminal device.

[0126] See also Figure 7 As shown, the electronic device includes a processor 100 and a memory 101, wherein the memory 101 stores computer executable instructions that can be executed by the processor 100, and the processor 100 executes the computer executable instructions to implement the above-mentioned intelligent mapping method for low-voltage feeder lines in the distribution network based on the S-type layout.

[0127] Further, Figure 7 The electronic device shown further includes a bus 102 and a communication interface 103 , and the processor 100 , the communication interface 103 and the memory 101 are connected via the bus 102 .

[0128] The memory 101 may include a high-speed random access memory (RAM), and may also include a non-volatile memory, such as at least one disk storage. The communication connection between the system network element and at least one other network element is realized through at least one communication interface 103 (which may be wired or wireless), and the Internet, wide area network, local area network, metropolitan area network, etc. may be used. The bus 102 may be an ISA bus, a PCI bus, or an EISA bus, etc. The bus can be divided into an address bus, a data bus, a control bus, etc. For ease of representation, Figure 7 Only one bidirectional arrow is used in the diagram, but this does not mean that there is only one bus or only one type of bus.

[0129] The processor 100 may be an integrated circuit chip with signal processing capabilities. In the implementation process, each step of the above method can be completed by the hardware integrated logic circuit or software instructions in the processor 100. The above processor 100 can be a general-purpose processor, including a central processing unit (CPU), a network processor (NP), etc.; it can also be a digital signal processor (DSP), an application-specific integrated circuit (ASIC), a field-programmable gate array (FPGA) or other programmable logic devices, discrete gates or transistor logic devices, discrete hardware components. The methods, steps and logic block diagrams disclosed in the embodiments of the present invention can be implemented or executed. The general-purpose processor can be a microprocessor or the processor can also be any conventional processor, etc. The steps of the method disclosed in conjunction with the embodiments of the present invention can be directly embodied as a hardware decoding processor for execution, or a combination of hardware and software modules in the decoding processor for execution. The software module may be located in a storage medium mature in the art, such as a random access memory, a flash memory, a read-only memory, a programmable read-only memory, or an electrically erasable programmable memory, a register, etc. The storage medium is located in the memory 101, and the processor 100 reads the information in the memory 101 and completes the steps of the method of the above embodiment in combination with its hardware.

[0130] The processor in the above-mentioned electronic device can implement the steps in the above-mentioned method for intelligent mapping of low-voltage feeder lines in the distribution network based on S-shaped layout by executing computer-executable instructions.

[0131] This embodiment also provides a computer-readable storage medium, which stores computer-executable instructions. When the computer-executable instructions are called and executed by a processor, the computer-executable instructions prompt the processor to implement the above-mentioned intelligent mapping method for low-voltage feeders in the distribution network based on the S-shaped layout.

[0132] The computer executable instructions stored in the above-mentioned computer-readable storage medium can implement the steps in the above-mentioned method for intelligent mapping of low-voltage feeders in a distribution network based on an S-shaped layout by executing the computer executable instructions.

[0133] This embodiment also provides a computer program product, including program code. The instructions included in the program code can be used to execute the method in the previous method embodiment. The specific implementation can be found in the method embodiment, which will not be described in detail here.

[0134] Those skilled in the art can clearly understand that, for the convenience and brevity of description, the specific working process of the system and device described above can refer to the corresponding process in the aforementioned method embodiment, and will not be repeated here.

[0135] In addition, in the description of the embodiments of the present invention, unless otherwise clearly specified and limited, the terms "installed", "connected", and "connected" should be understood in a broad sense, for example, it can be a fixed connection, a detachable connection, or an integral connection; it can be a mechanical connection or an electrical connection; it can be a direct connection or an indirect connection through an intermediate medium, and it can be the internal communication of two components. For those skilled in the art, the specific meanings of the above terms in the present invention can be understood according to specific circumstances.

[0136] If the function is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present invention, or the part that contributes to the prior art, or the part of the technical solution, can be embodied in the form of a software product. The computer software product is stored in a storage medium, including several instructions for a computer device (which can be a personal computer, server, or network device, etc.) to perform all or part of the steps of the methods of each embodiment of the present invention. The aforementioned storage medium includes: U disk, mobile hard disk, read-only memory (ROM, Read-Only Memory), random access memory (RAM, Random Access Memory), disk or optical disk, etc. Various media that can store program codes.

[0137] In the description of the present invention, it should be noted that the terms "center", "upper", "lower", "left", "right", "vertical", "horizontal", "inner", "outer", etc., indicating the orientation or positional relationship, are based on the orientation or positional relationship shown in the drawings, and are only for the convenience of describing the present invention and simplifying the description, rather than indicating or implying that the device or element referred to must have a specific orientation, be constructed and operated in a specific orientation, and therefore cannot be understood as limiting the present invention. In addition, the terms "first", "second", and "third" are used for descriptive purposes only, and cannot be understood as indicating or implying relative importance.

[0138] Finally, it should be noted that the above embodiments are only specific implementations of the present invention, which are used to illustrate the technical solutions of the present invention, rather than to limit them. The protection scope of the present invention is not limited thereto. Although the present invention is described in detail with reference to the above embodiments, those skilled in the art should understand that any person skilled in the art can still modify the technical solutions recorded in the above embodiments within the technical scope disclosed by the present invention, or can easily think of changes, or make equivalent replacements for some of the technical features therein; and these modifications, changes or replacements do not make the essence of the corresponding technical solutions deviate from the spirit and scope of the technical solutions of the embodiments of the present invention, and should be included in the protection scope of the present invention. Therefore, the protection scope of the present invention shall be based on the protection scope of the claims.

Claims

1. An intelligent mapping method for medium and low voltage feeders in a distribution network based on an S-shaped layout, characterized in that: include: Data acquisition step: acquiring distribution network CIM feeder model data and configuration information, and converting the distribution network CIM feeder model data into graph element node information and its connection information; Path finding step: based on the primitive node information, determining a root node in the primitive nodes, and starting from the root node to find a target path for forming a graph, the target path includes the root node and a plurality of first primitive nodes in the primitive nodes; Branch drawing step: drawing a graph based on the configuration information, the connection information and the target path, and if the target path is connected to a sub-branch of the second primitive node, turning to draw the sub-branch connected to the current first primitive node; Dynamic drawing step: inputting the drawing parameters of the current first primitive node and the drawing information of the drawn first primitive node combination into a preset calculation model, dynamically adjusting the drawing parameters of the next first primitive node, and determining the position of the next first primitive node based on the adjusted drawing parameters; Subgraph drawing step: based on the subgraph selection algorithm, the subsequent batches of graphics elements are classified into a certain subgraph to draw the subgraph, and after the subgraph is drawn, the line from the subgraph is returned to the target path to continue drawing until an S-shaped layout diagram is obtained.

2. The method according to claim 1, characterized in that: The step of searching for a target path to form a graph starting from the root node includes: Starting from the root node, traverse multiple paths that can be formed by the primitive nodes through a depth-first search algorithm; The path with the most primitive nodes is selected from the multiple paths as the target path.

3. The method according to claim 1, characterized in that: The first primitive node in the target path is drawn along a first direction, and the turning to draw a sub-branch connected to the current first primitive node includes: Turn to draw a sub-branch connected to the first primitive node along a second direction, and the first direction is perpendicular to the second direction.

4. The method according to claim 1, characterized in that: Inputting the drawing parameters of the current first primitive node and the drawing information of the drawn first primitive node combination into a preset calculation model, and dynamically adjusting the drawing parameters of the next first primitive node, including: After drawing the current first primitive node, obtaining current drawing parameters, wherein the current drawing parameters include current drawing direction, global trend direction, full image width and height, coordinate maximum value, and drawing progress; Obtaining drawing information of the drawn first primitive node combination, the drawing information including local width and height, coordinate extreme values ​​and primitive attributes, the drawing information being obtained through pre-drawing; Inputting the current drawing parameter and the drawing information of the drawn first primitive node combination into a preset calculation model to obtain the next drawing parameter of the next first primitive node output by the preset calculation model, wherein the next drawing parameter includes a next drawing direction and a next drawing coordinate; Draw the next first primitive node according to the next drawing parameter.

5. The method according to claim 4, characterized in that The method further comprises: If it is determined based on the next drawing coordinate that the connection direction between the current first primitive node and the next first primitive node is different from the current drawing direction, the current first primitive node is recorded as a line turning point, so that after the primitive nodes are all drawn and laid out, a connecting line between the primitive nodes is drawn based on the connection information, wherein the direction of the connecting line at the line turning point changes.

6. The method according to claim 1, characterized in that The subgraph selection algorithm classifies the subsequent batches of graphics elements into a subgraph to draw the subgraph, and after the subgraph is drawn, returns to the target path from the subgraph to continue drawing until an S-shaped layout diagram is obtained, including: When drawing the current first primitive node, judging whether at least one of a plurality of preset conditions is satisfied based on the primitive attributes of the first primitive node and the current drawing progress, wherein the plurality of preset conditions correspond one-to-one to a plurality of sub-graph drawing methods; If at least one of the plurality of preset conditions is satisfied, a sub-graph is drawn for the current first primitive node and at least one subsequent first primitive node by using the sub-graph drawing method corresponding to one of the at least one preset condition, and after the sub-graph drawing is completed, a line is drawn from the sub-graph to continue drawing the target path; If any of the plurality of preset conditions is not satisfied, then the next first primitive node is drawn.

7. The method according to claim 1, characterized in that After obtaining the S-shaped layout diagram, the method further includes: Determining whether a length ratio of the S-shaped layout diagram satisfies a preset ratio, wherein the length ratio includes a ratio between a length in a horizontal direction and a length in a vertical direction; If the length ratio of the S-shaped layout diagram does not meet the preset ratio, the S-shaped layout diagram is adjusted to obtain an adjusted S-shaped layout diagram; wherein the adjustment process includes the following steps: The length of the S-shaped layout diagram along the target direction is adjusted sequentially according to the first step length until a first length of the S-shaped layout diagram along the target direction is determined, wherein the first length is obtained by adjusting according to the first step length, and the difference between the length ratio of the S-shaped layout diagram under the first length and the preset ratio is not greater than the difference between the length ratio of the S-shaped layout diagram under other lengths and the preset ratio, and the other lengths are obtained by adjusting according to the first step length, and the target direction includes the horizontal direction or the vertical direction; On the basis of the first length, the length of the S-shaped layout diagram along the target direction is adjusted in sequence according to a second step length until the length ratio of the S-shaped layout diagram meets the preset ratio, and the second step length is smaller than the first step length.

8. An intelligent mapping device for medium and low voltage feeder lines in a distribution network based on an S-shaped layout, characterized in that: include: An acquisition module is used to acquire distribution network CIM feeder model data and configuration information, and convert the distribution network CIM feeder model data into graph element node information and its connection information; A path finding module, used for determining a root node among the primitive nodes based on the primitive node information, and finding a target path for forming a graph starting from the root node, wherein the target path includes the root node and a plurality of first primitive nodes among the primitive nodes; A branch drawing module, used for drawing a graph based on the configuration information, the connection information and the target path, and if the target path is connected to a sub-branch of a second primitive node, turning to draw a sub-branch connected to the current first primitive node; A dynamic drawing module, used to input the drawing parameters of the current first primitive node and the drawing information of the drawn first primitive node combination into a preset calculation model, dynamically adjust the drawing parameters of the next first primitive node, and determine the position of the next first primitive node based on the adjusted drawing parameters; The sub-graph drawing module is used to classify subsequent batches of graphics elements into a sub-graph based on the sub-graph selection algorithm to draw the sub-graph, and after the sub-graph drawing is completed, return to the target path from the sub-graph exit line to continue drawing until an S-shaped layout diagram is obtained.

9. An electronic device, characterized in that: The method comprises a processor and a memory, wherein the memory stores computer executable instructions that can be executed by the processor, and the processor executes the computer executable instructions to implement the method according to any one of claims 1 to 7.

10. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores computer-executable instructions, and when the computer-executable instructions are called and executed by a processor, the computer-executable instructions prompt the processor to implement the method according to any one of claims 1 to 7.

Images