Intelligent mapping method, device, equipment and medium for medium and low voltage feeders of distribution network based on S-type layout

Abstract

An embodiment of the present invention provides a method, device, equipment and medium for intelligent mapping of medium and low voltage feeders in a distribution network based on an S-shaped layout, which relates to the technical field of distribution networks. By using the feeder model data and configuration information of the distribution network to draw an S-shaped layout diagram, an S-shaped layout diagram corresponding to the feeder model data is obtained, so that automatic mapping can be achieved. Moreover, during the mapping process, drawing is performed according to the first graphic element nodes in the target path. When at least one second graphic element node is connected to one of the first graphic element nodes, the drawing is redirected to the sub-branch connected to the first graphic element node, and the drawing parameters are dynamically adjusted through a pre-designed calculation model. In addition, the subsequent batch of graphic elements is classified into a certain sub-graph by selecting a sub-graph algorithm to draw the sub-graph, and after the sub-graph is drawn, the drawing resumes from the outlet of the sub-graph back to the target path until the S-shaped layout diagram is obtained. In this way, the main branch and sub-branches can be drawn, thereby improving the accuracy of automatic mapping drawing.

Description

Technical Field

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

[0002] The number of distribution network graphics is large, the volume is large, and the parameters are frequently modified. The traditional manual drawing method is not only inefficient, error-prone, time-consuming and laborious, but also often fails to modify in time with the transformation of distribution lines, resulting in the situation that the mapped graphics are inconsistent with the actual situation, bringing operation risks to the distribution network dispatching.

[0003] The current mainstream mapping technology based on the topological data of the distribution network is mainly for simple single-line diagrams, and can present better effects only when the number of branches of the single-line diagram is small and the number of ring network diagrams on the feeder is small. If the number of branches is large and the number of ring network cabinets is large, the presented effect will be relatively poor, and it cannot be efficiently and intuitively displayed in the distribution network system. A large number of adjustments are still required when applying the mapped graphics to actual projects.

[0004] The patent application with the application number CN202310080901.5 obtains operation data from its own distribution network system and generates a cross fishbone layout self-healing index diagram with service parameters according to 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 medium and low voltage feeders in a distribution network based on an S-shaped layout are proposed. Summary of the Invention

[0006] In view of this, the purpose of the present invention is to provide an intelligent mapping method, device, equipment and medium for medium and low voltage feeders in a distribution network based on an S-shaped layout, so as to be able to automatically generate maps, and the automatic mapping layout effect is more compact and reasonable.

[0007] First aspect, an embodiment of the present invention provides an intelligent mapping method for medium and low voltage feeders in a distribution network based on an S-shaped layout, including: Data acquisition step: Acquire the distribution network CIM feeder model data and configuration information, and convert the distribution network CIM feeder model data into graphic element node information and its connection information; Path finding step: Based on the graphic element node information, determine the root node in the graphic element nodes, and start from the root node to find the target path for mapping. The target path includes the root node and multiple first graphic element nodes in the graphic element nodes; Branch drawing step: Perform mapping drawing based on the configuration information, the connection information, and the target path. If the target path is connected to a sub-branch of a second graphic element node, then turn to draw the sub-branch connected to the current first graphic element node; Dynamic drawing step: Input the drawing parameters of the current first graphic element node and the drawing information of the combined drawn first graphic element nodes into a pre-designed calculation model, dynamically adjust the drawing parameters of the next first graphic element node, and based on the adjusted drawing parameters, determine the position of the next first graphic element node; Sub-graph drawing step: Group subsequent batches of graphic elements into a certain sub-graph based on the selected sub-graph algorithm to draw the sub-graph, and after the sub-graph drawing is completed, return to the target path from the sub-graph outlet and continue drawing until an S-shaped layout diagram is obtained.

[0008] In a possible implementation manner, the step of starting from the root node to find the target path for mapping includes: starting from the root node, traversing multiple paths that can be formed by the graphic element nodes through a depth-first search algorithm; screening the path with the most graphic element nodes from the multiple paths as the target path.

[0009] In a possible implementation manner, the first graphic element nodes in the target path are drawn along a first direction. The step of turning to draw the sub-branch connected to the current first graphic element node includes: turning to draw the sub-branch connected to the first graphic element node along a second direction, where the first direction is perpendicular to the second direction.

[0010] In a possible implementation, the drawing parameters of the current first graphic primitive node and the drawing information of the combined drawn first graphic primitive nodes are input into a pre-designed calculation model to dynamically adjust the drawing parameters of the next first graphic primitive node, including: after the drawing of the current first graphic primitive node is completed, obtaining the current drawing parameters, where the current drawing parameters include the current drawing direction, the global trend direction, the full map width and height, the coordinate extreme values, and the drawing progress; obtaining the drawing information of the combined drawn first graphic primitive nodes, where the drawing information includes the local width and height, the coordinate extreme values, and the graphic primitive attributes, and the drawing information is obtained through pre-drawing; inputting the current drawing parameters and the drawing information of the combined drawn first graphic primitive nodes into the pre-designed calculation model to obtain the next drawing parameters of the next first graphic primitive node output by the pre-designed calculation model, where the next drawing parameters include the next drawing direction and the next drawing coordinates; and drawing the next first graphic primitive node according to the next drawing parameters.

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

[0012] In a possible implementation, during the process of drawing the final map, the subsequent batch of graphic primitives are classified into a certain sub-graph for sub-graph drawing based on the selected sub-graph algorithm, and after the sub-graph drawing is completed, the drawing returns to the target path from the sub-graph to continue drawing until an S-shaped layout map is obtained, including: when drawing the current first graphic primitive node, judging whether at least one of a plurality of preset conditions is satisfied based on the graphic primitive attributes of the first graphic primitive node and the current drawing progress, where 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, performing sub-graph drawing on the current first graphic primitive node and at least one subsequent first graphic 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, exiting the sub-graph to continue the drawing of the target path; if none of the plurality of preset conditions is satisfied, drawing the next first graphic primitive node.

[0013] In a possible implementation, after obtaining the S-shaped layout diagram corresponding to the feeder model data, the method further includes: determining whether the length ratio of the S-shaped layout diagram meets a preset ratio, where the length ratio includes the ratio between the length along the horizontal direction and the length along the vertical direction; if the length ratio of the S-shaped layout diagram does not meet the preset ratio, performing adjustment processing on the S-shaped layout diagram to obtain an adjusted S-shaped layout diagram; where the adjustment processing includes the following steps: sequentially adjusting the length of the S-shaped layout diagram along the target direction by a first step length until determining a first length of the S-shaped layout diagram along the target direction, where the first length is adjusted according to the first step length, and the difference between the length ratio of the S-shaped layout diagram at the first length and the preset ratio is not greater than the difference between the length ratio of the S-shaped layout diagram at other lengths and the preset ratio, and the other lengths are adjusted 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 adjusting the length of the S-shaped layout diagram along the target direction by a second step length until the length ratio of the S-shaped layout diagram meets the preset ratio, and the second step length is less than the first step length.

[0014] In a second aspect, an intelligent mapping device for medium and low voltage feeders in a distribution network based on an S-shaped layout provided by an embodiment of the present invention includes: an acquisition module, configured to acquire distribution network CIM feeder model data and configuration information, and convert the distribution network CIM feeder model data into graphic element node information and its connection information; a path finding module, configured to determine a root node in the graphic element nodes based on the graphic element node information, and start from the root node to find a target path for mapping, where the target path includes the root node and a plurality of first graphic element nodes in the graphic element nodes; a branch drawing module, configured to perform mapping drawing based on the configuration information, the connection information, and the target path. If a sub-branch connected to a second graphic element node is connected to the target path, then turn to draw a sub-branch connected to the current first graphic element node; a dynamic drawing module, configured to input the drawing parameters of the current first graphic element node and the drawing information of the combined drawn first graphic element nodes into a pre-designed calculation model, dynamically adjust the drawing parameters of the next first graphic element node, and determine the position of the next first graphic element node based on the adjusted drawing parameters; a sub-graph drawing module, configured to classify subsequent batches of graphic elements into a certain sub-graph based on a selected sub-graph algorithm to draw the sub-graph, and after the sub-graph drawing is completed, return from the sub-graph outlet to the target path 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, where 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 storing computer-executable instructions, which, when called and executed by a processor, cause the processor to implement the above method.

[0017] The embodiments of the present invention bring the following beneficial effects:

[0018] (1) By automatically generating diagrams for feeder lines, it effectively solves the problems of large workload, low efficiency, and error-proneness in manual drawing, and greatly improves the construction efficiency of distribution network projects and enhances the security of the system's underlying layer.

[0019] (2) The sub-diagram combination scheme adapts to the actual requirements of distribution network feeder lines, solves the problem that existing schemes are unable to efficiently handle complex situations of distribution network feeder lines, expands the application scope of diagram generation, and improves the practicality of automatic feeder line diagram generation.

[0020] (3) The width adjustment scheme improves the display effect of the generated diagrams, making the graphics more intuitive and compact, and enhancing the user experience.

[0021] Other features and advantages of the present invention will be described in the following specification, and some of them will become obvious from the specification or be understood by implementing the present invention. The objectives and other advantages of the present invention are achieved and obtained by the structures specifically pointed out in the specification, claims, and drawings.

[0022] To make the above objectives, features, and advantages of the present invention more obvious and understandable, the following specific preferred embodiments are given and described in detail in conjunction with the accompanying drawings. Description of the Drawings

[0023] Figure 1 A schematic diagram of a cross fishbone layout drawn for related technologies;

[0024] Figure 2 A schematic flow diagram of an intelligent diagram generation method for medium and low voltage feeder lines in a distribution network based on an S-shaped layout provided by an embodiment of the present invention;

[0025] Figure 3 A full-scale schematic diagram including a sub-diagram of a ring main unit cabinet provided by an embodiment of the present invention;

[0026] Figure 4 Another schematic flow diagram of an intelligent diagram generation method for medium and low voltage feeder lines in a distribution network based on an S-shaped layout provided by an embodiment of the present invention;

[0027] Figure 5 An S-shaped layout diagram drawn according to an embodiment of the present invention;

[0028] Figure 6Schematic structural diagram of a device provided by an embodiment of the present invention;

[0029] Figure 7 Schematic structural diagram of an electronic device provided by an embodiment of the present invention.

[0030] In order to more clearly illustrate the specific embodiments of the present invention or the technical solutions in the prior art, the following will briefly introduce the drawings required for use in the description of the specific embodiments or the prior art. Obviously, the drawings in the following description are some embodiments of the present invention. For those skilled in the art, without creative efforts, other drawings can also be obtained based on these drawings. Specific embodiments

[0031] To make the objectives, technical solutions, and advantages of the embodiments of the present invention clearer, the technical solutions of the present invention will be clearly and completely described below with reference to the drawings. Obviously, the described embodiments are some, but not all, of the embodiments of the present invention. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative efforts fall within the protection scope of the present invention.

[0032] In the related art, operation data can be obtained from its own power distribution network system and a cross-bone layout self-healing index map with service parameters can be generated based on the data for subsequent operation and maintenance. As Figure 1 shown, Figure 1 Schematic diagram of a cross-bone layout drawn in the related art.

[0033] However, the existing automatic mapping layout is not compact and reasonable enough, and cannot be efficiently and intuitively displayed in the power distribution network system. A large number of adjustments are still required when applying the mapping to actual projects.

[0034] In view of this, the embodiments of the present invention provide a method, device, equipment, and medium for intelligent mapping of medium and low voltage feeders in a power distribution network based on an S-shaped layout, which can automatically generate a map and improve the compactness and rationality of the mapping layout, so as to be efficiently and intuitively displayed.

[0035] Generally speaking, the embodiments of the present invention make the mapping layout compact and reasonable through width optimization and sub-graph combination, making the mapping more convenient to be applied to the low-voltage power distribution network system. Specifically, the present invention is an automatic mapping method for arranging and connecting graphic elements. The starting node is found from the model data, and the longest node path is found from the starting node as the main line and drawn step by step backward. When encountering multiple sub-nodes connected, the direction is changed and the sub-line is laid out with the sub-node as the starting node, and the overall mapping layout is optimized through the sub-graph combination scheme and the width adjustment scheme.

[0036] For ease of understanding, the embodiments of the present invention will first describe the intelligent mapping method for medium and low voltage feeders in a distribution network based on the S-shaped layout. As Figure 2 shown, Figure 2 FIG. 4 is a schematic flowchart of an intelligent mapping method for medium and low voltage feeders in a distribution network based on the S-shaped layout provided by an embodiment of the present invention. As Figure 2 shown, the method can be executed by an electronic device. As Figure 2 shown, the method may include:

[0037] S210. Obtain the distribution network CIM feeder model data and configuration information, and convert the distribution network CIM feeder model data into graphic element node information and its connection information.

[0038] Among them, the feeder model data may be 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, etc. Among them, the feeder identification: the name or number that uniquely identifies the feeder. Voltage level: the voltage level where the feeder is located, such as 110 kV, 220 kV, etc. The operating status includes current, voltage, power, or switch status, etc. Other information includes protection configuration, measurement data, etc. The relationship of the feeder may include connection relationships, such as start point, end point, and connected devices, etc. Through the connected devices, it can be known which devices the feeder is connected to, such as circuit breakers, disconnect switches, etc.

[0039] Among them, the configuration information may include mapping configuration information and measurement configuration information. Among them, the mapping configuration information is used to indicate the size of the presented content, such as indicating the size of the presented graphic element nodes. The measurement configuration information may indicate the measurement data of the presented graphic element nodes, and the measurement data may include parameters or power status (such as switch status, voltage, current, etc.).

[0040] Among them, the information of the graphic element nodes may include the unique identification of the graphic element nodes and the attributes of the graphic element nodes, etc. The attributes of the graphic element nodes may be voltage level, operating status, and other information. In this embodiment, the graphic element nodes may refer to the devices connected to the feeder.

[0041] S220. Based on the graphic element node information, determine the root node in the graphic element nodes, and start from the root node to find the target path for mapping. The target path includes the root node and multiple first graphic element nodes in the graphic element nodes.

[0042] Among them, the root node can be understood as the starting point. Specifically, it can be the starting point of the whole graph or a local starting point, which is not restricted here. Exemplarily, the outlet point of the transformer can be used as the root node. Then, starting from the root node, the target path for graph formation is searched. Among them, the target path can be understood as the main branch of the graph formation. During the process of graph formation and drawing, the nodes on this target path can be mainly drawn. When other conditions are met, sub-branches or sub-graphs are drawn, and then the drawing returns to the nodes on the target path until the graph formation and drawing are completed. Exemplarily, it can be determined whether the node is the outlet point of the transformer through the attributes and types of the graphic elements nodes.

[0043] S230. Perform graph formation and drawing based on the configuration information, the connection information, and the target path. If there is a sub-branch connected to the second graphic element node on the target path, then turn to draw the sub-branch connected to the current first graphic element node.

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

[0045] S240. Input the drawing parameters of the current first graphic element node and the drawing information of the combined drawn first graphic element nodes into a pre-designed calculation model, dynamically adjust the drawing parameters of the next first graphic element node, and based on the adjusted drawing parameters, determine the position of the next first graphic element node.

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

[0047] S250. Group the subsequent batches of graphic elements into a certain sub-graph based on the selected sub-graph algorithm to draw the sub-graph, and after the sub-graph drawing is completed, return to the target path from the outlet of the sub-graph and continue to draw until the S-shaped layout graph is obtained.

[0048] In this embodiment, by using the selected sub-graph algorithm to group the subsequent batches of graphic elements into a certain sub-graph to draw the sub-graph, and after the sub-graph drawing is completed, returning to the target path from the outlet of the sub-graph and continuing to draw, the normativeness of the obtained S-shaped layout graph can be improved. In this embodiment, grouping the subsequent batches of graphic elements into a certain sub-graph can be understood as grouping the subsequent batches of graphic elements into the same sub-graph.

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

[0050] In the embodiment of the present invention, through the data acquisition step: acquiring the distribution network CIM feeder model data and configuration information, and converting the distribution network CIM feeder model data into graphic element node information and its connection information; the path finding step: based on the graphic element node information, determining the root node in the graphic element nodes, and starting from the root node to find the target path of the completed drawing, the target path includes the root node and multiple first graphic element nodes in the graphic element nodes; the branch drawing step: performing the drawing of the completed drawing based on the configuration information, the connection information and the target path, if the target path is connected with a sub-branch of the second graphic element node, then turning to draw the sub-branch connected with the current first graphic element node; the dynamic drawing step: inputting the drawing parameters of the current first graphic element node and the drawing information of the combined drawn first graphic element nodes into a pre-designed calculation model, dynamically adjusting the drawing parameters of the next first graphic element node, and based on the adjusted drawing parameters, determining the position of the next first graphic element node; the sub-graphic drawing step: classifying the subsequent batches of graphic elements into a certain sub-graphic for drawing the sub-graphic based on the selected sub-graphic algorithm, and after the sub-graphic drawing is completed, returning from the sub-graphic outlet to the target path 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 the sub-branch.

[0051] In a possible implementation manner, the finding of the target path of the completed drawing starting from the root node includes:

[0052] Starting from the root node, traversing multiple paths that can be formed by the graphic element nodes through the depth-first search algorithm; screening the path with the most graphic element nodes from the multiple paths as the target path.

[0053] Depth-First Search (DFS) is an algorithm used to traverse or search a tree or graph. The DFS algorithm starts from a certain vertex of the graph and traverses along the depth direction of the tree until it reaches a leaf node, 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 recursion or an explicit stack. In this embodiment, the multiple paths that can be formed by the graphic element nodes can be understood as the multiple branches that can be formed by the graphic element nodes, and then the path with the most graphic element nodes is selected from the multiple paths as the target path, that is, the longest path is used as the target path. Equivalently, the shorter paths are used as sub-branches. In this way, the resulting graph can be made more compact.

[0054] In another possible implementation, it can also be to randomly select one of the paths as the main branch. In this way, the efficiency of graph formation can be improved.

[0055] In one possible implementation, the first graphic element node in the target path is drawn in a first direction, and turning to draw the sub-branch connected to the current first graphic element node includes:

[0056] Turning to draw the sub-branch connected to the first graphic element node in a second direction, where the first direction is perpendicular to the second direction.

[0057] Among them, the first direction is perpendicular to the second direction, specifically, the first direction is perpendicular to the second direction. For example, when drawing the main branch horizontally or vertically, turn to draw the sub-branch vertically or horizontally.

[0058] In this embodiment, the first graphic element node in the target path is drawn in the first direction; when at least one second graphic element node is connected to one of the first graphic element nodes, turn to draw the sub-branch connected to the first graphic element node in the second direction, where the first direction is perpendicular to the second direction. In this way, that is, draw the sub-branches in different directions, thereby improving the compactness of the resulting graph and facilitating determining whether a node is on the main branch or a sub-branch based on the arrangement direction of the nodes in the graph.

[0059] It should be noted that after the sub-branch is drawn, continuing to draw the target path with the first graphic element node can be to continue drawing the target path in the first direction.

[0060] In another possible implementation, it can also be not to change the drawing direction, that is, continue to draw the sub-branch in the first direction, and after the sub-branch is drawn, then draw the remaining part of the main branch in the second direction.

[0061] In a possible implementation, during the process of drawing a map, the drawing parameters of the current first graphic element node and the drawing information of the combined drawn first graphic element nodes are input into a pre-designed calculation model to dynamically adjust the drawing parameters of the next first graphic element node, including:

[0062] After completing the drawing of the current first graphic element node, obtain the current drawing parameters, where the current drawing parameters include the current drawing direction, the global trend direction, the full map width and height, the coordinate maximum and minimum values, and the drawing progress; obtain the drawing information of the combined drawn first graphic element nodes, where the drawing information includes the local width and height, the coordinate extreme values, and the graphic element attributes, and the drawing information is obtained through pre-drawing; input the current drawing parameters and the drawing information of the combined drawn first graphic element nodes into the pre-designed calculation model to obtain the next drawing parameters of the next first graphic element output by the pre-designed calculation model, where the next drawing parameters include the next drawing direction and the next drawing coordinates; draw the next first graphic element node according to the next drawing parameters.

[0063] Among them, the graphic element attributes can be: the graphic element to be drawn, the graphic element type (such as a circuit breaker), and the size of the graphic element, etc. The combined drawn first graphic element nodes can be a set of one or more already drawn first graphic element nodes.

[0064] In this embodiment, specifically, after drawing the current graphic element 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: It refers to the directionality when drawing the current graphic element node, such as from left to right, from top to bottom, etc. Global trend direction: This refers to the overall trend direction of the entire graph or layout, such as arranged from top to bottom as a whole, or flowing from left to right. Full map width and height: It refers to the width and height of the entire graphic interface. Coordinate maximum and minimum values: It refers to the maximum and minimum values of the coordinate ranges of all graphic element nodes during the current drawing process, which helps to determine the boundaries of the graph. Drawing progress: It represents the degree of completion of the current drawing process relative to the overall task.

[0065] Next, the system needs to obtain the "drawing information" of each first graphic element node that has been drawn (or pre-drawn) before. These information are crucial for subsequent drawing because they provide the specific characteristics of each graphic element node, including: Local width and height: The width and height of each graphic element node itself. Coordinate extreme values: The maximum and minimum values of the coordinate ranges of each graphic element node on the canvas. Graphic element attributes: Other characteristics of the graphic element node, such as color, transparency, border style, etc. These information are usually obtained through the pre-drawing process. Pre-drawing is a simulation or calculation of graphic elements before actual drawing to determine their positions and attributes.

[0066] After obtaining the current drawing parameters and the drawing information of each primitive node, the system inputs this data into a "pre-design calculation model". This model is constructed based on algorithms or machine learning techniques and is used to predict and calculate the drawing parameters of the next primitive node.

[0067] After the pre-design calculation model processes the input data, it outputs "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 position of the next primitive node on the canvas.

[0068] Finally, based on the next drawing parameters output by the pre-design calculation model, the system starts to draw the next first primitive node. This process is repeated until all primitive nodes are drawn to form the final graphical interface.

[0069] It should be noted that when training the pre-design calculation model, its input can be the drawing direction, trend direction, full map width and height, coordinate maximum and minimum values, drawing progress, local width and height, coordinate extreme values, and primitive attributes. The next preset drawing parameters are used as labels to calculate the loss with the output of the model, thereby completing the training. Optionally, it can also be a model with preset empirical values.

[0070] Generally speaking, this embodiment combines an intelligent width optimization scheme and dynamically adjusts the drawing parameters during drawing to achieve a better S-shaped layout. When arranging and drawing primitive nodes in step 3, the current arrangement and drawing parameters are recorded in real time, such as local direction, global direction, local width and height, global width and height, XY coordinate extreme values, drawing progress, subsequent primitive attributes, etc. as input data to calculate the optimal subsequent primitive node arrangement and drawing parameters, and the arrangement and drawing parameters are adjusted according to the obtained parameter results, such as arrangement and drawing direction, subsequent primitive drawing coordinates, line turning buried points, etc., to further arrange the subsequent primitive node arrangement and connection, so that the final global layout is a compact S-shaped layout.

[0071] In this embodiment, after completing the drawing of 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 maximum and minimum 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 the pre-design calculation model to obtain the next drawing parameters of the next first primitive node output by the pre-design 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 drawn figure.

[0072] In another possible implementation, it may be always drawn in one direction, which can reduce the time required for drawing and improve the drawing efficiency.

[0073] In one possible implementation, the method further includes:

[0074] 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 record the line turning buried point for the current first primitive node, so that after all the primitive nodes are drawn and the layout is completed, draw the connection lines between the primitive nodes based on the connection information, where the direction of the connection line at the line turning buried point changes.

[0075] 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 line or a new column (if the current drawing direction is in the row direction, it is judged whether a new line is required, and if the current drawing direction is in the column direction, it is judged whether a new column is required. The row direction can be understood as the long direction, and the column direction can be understood as the wide direction). If they are inconsistent, it means that there is a line turn here, so the current primitive node is marked as a line turning buried point. In addition to the basic drawing information, specific information about these turning buried points, such as the turning angle and direction change, also needs to be recorded additionally. This information will be used when drawing the connection lines later. In this way, after all the primitive nodes are drawn and the layout is completed, draw the connection lines between the primitive nodes based on the connection information, then the direction of the connection line at the line turning buried point changes, so that the accuracy of the connection can be improved.

[0076] In one possible implementation, during the process of drawing the final figure, the subsequent batch of primitive figures are grouped into a certain sub - figure based on the selected sub - figure algorithm to draw the sub - figure, and after the sub - figure is drawn, it exits the sub - figure and returns to the target path to continue drawing until an S - type layout figure is obtained, including:

[0077] When drawing the current first graphic primitive node, based on the graphic primitive attributes of the first graphic primitive node and the current drawing progress, determine whether at least one of a plurality of preset conditions is satisfied, and the plurality of preset conditions correspond one-to-one to a plurality of sub-graphic drawing methods; if at least one of the plurality of preset conditions is satisfied, perform sub-graphic drawing on the current first graphic primitive node and at least one subsequent first graphic primitive node by using the sub-graphic drawing method corresponding to one of the at least one preset condition, and after the sub-graphic drawing is completed, exit from the sub-graphic to continue drawing the target path; if none of the plurality of preset conditions is satisfied, draw the next first graphic primitive node.

[0078] Optionally, the plurality of sub-graphic drawing methods may include but are not limited to the sub-graphic method for switchgear / ring main unit cabinet, the sub-graphic method for distribution substation / user station, the sub-graphic method for transformer substation area, etc. The subsequent first graphic primitive nodes may be the nodes to be drawn after the current first graphic primitive node.

[0079] It should be noted that if at least two of the plurality of preset conditions are satisfied, the method with the highest priority among the sub-graphic drawing methods corresponding to the at least two preset conditions may be selected based on the priority of the sub-graphic drawing methods for sub-graphic drawing.

[0080] Please refer to Figure 3 , Figure 3 which is a full-scale schematic diagram including a ring main unit cabinet sub-graphic provided by an embodiment of the present invention. As Figure 3 shown in the schematic diagram, it includes a substation, an outgoing line identifier, a circuit breaker, a substation area, a switch, a user access point, and a ring main unit cabinet sub-graphic, etc.

[0081] Optionally, it is possible to determine whether to classify subsequent batches of graphic primitives into a certain sub-graphic according to the graphic primitive attribute characteristics (the graphic primitive attributes of the current graphic primitive and subsequent graphic primitives) and the drawing progress characteristics. Specifically, the attributes of each graphic primitive can be analyzed, such as type, voltage level, affiliated equipment, etc. According to the attribute characteristics, the graphic primitives are classified into corresponding categories, such as switchgear, transformer, line, etc. Then, track the drawing progress to understand the currently drawn graphic primitives and the graphic primitives to be drawn. According to the drawing progress, determine whether a new sub-graphic needs to be created or continue to draw in the current sub-graphic. Then, select a suitable sub-graphic method according to the graphic primitive category and drawing requirements.

[0082] Specifically, when starting up, the sub - graph module is loaded, and a set of sub - graph drawing methods is loaded from it. Then, the pre - element attribute features and drawing progress features before the element position are drawn and enter the sub - graph judgment. In the sub - graph module that meets the sub - graph judgment conditions, the sub - graph formation method with the highest priority is selected according to the module priority. Then, in the sub - graph module, the elements are drawn downward according to the connection relationship and its own layout method until the elements of the sub - graph are drawn completely. Then, the subsequent elements are drawn. The incoming and outgoing lines between the ordinary elements and the sub - graph are connected. Ordinary elements can be understood as elements that are not drawn according to the sub - graph drawing method.

[0083] Exemplarily, the preset conditions corresponding to the sub - graph method of the power distribution room may be: the element type of the current element is a busbar, and the subsequent element is of the same container. The preset conditions corresponding to the sub - graph method of the switchgear / ring - main unit cabinet may be: the element type of the current element is a ring - main unit cabinet / switching and locking device, and the subsequent element is of the same container.

[0084] In this embodiment, when drawing the current first element node, based on the element attribute of the first element node and the current drawing progress, it is determined whether at least one of a plurality of preset conditions is met, and the plurality of preset conditions correspond one - to - one with a plurality of sub - graph drawing methods; if at least one of the plurality of preset conditions is met, the sub - graph drawing method corresponding to one of the at least one preset condition is used to perform sub - graph drawing on the current first element node and at least one subsequent first element node, and after the sub - graph drawing is completed, the sub - graph outgoing line is used to continue the drawing of the target path; if none of the plurality of preset conditions is met, the next first element node is drawn. In this way, a plurality of first element nodes according to the sub - graph drawing method can be drawn according to the sub - graph method, which can improve the accuracy of the formation drawing.

[0085] In a possible implementation manner, after obtaining the S - type layout diagram, the method further includes:

[0086] Determine whether the length ratio of the S - type layout diagram meets a preset ratio, where the length ratio includes the ratio between the length along the horizontal direction and the length along the vertical direction; if the length ratio of the S - type layout diagram does not meet the preset ratio, perform adjustment processing on the S - type layout diagram to obtain an adjusted S - type layout diagram; where the adjustment processing includes the following steps:

[0087] Adjust the length of the S-shaped layout diagram along the target direction step by step according to the first step length until the first length of the S-shaped layout diagram along the target direction is determined, where the first length is adjusted according to the first step length, and the difference between the length ratio of the S-shaped layout diagram at the first length and the preset ratio is not greater than the difference between the length ratio of the S-shaped layout diagram at other lengths and the preset ratio, and the other lengths are adjusted 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 step by step 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 less than the first step length.

[0088] Exemplarily, the horizontal length can be understood as the length, and the vertical length can be understood as the width. Then, the ratio between the length along the horizontal direction and the length along the vertical direction can be understood as the length-width ratio. Whether the length ratio meets 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, set to 0.1 or 0, and no limit is made here.

[0089] Exemplarily, assume that the preset ratio is 3:2, the length is 4000, and the width is 2000. Then, at this time, adjust the width according to the first step length of 100. When the width is 2500, it is found that the length-width ratio at this time is closest to the preset ratio. Then, adjust the width according to the second step length of 10 until the length ratio of the S-shaped layout diagram meets the preset ratio. In addition, it can also be to adjust the length, for example, decrease the length according to the first step length.

[0090] It should be understood that adjusting according to the first step length can be increasing or decreasing the length along the target direction according to the first step length.

[0091] In this embodiment, the graph can be finely adjusted by the divide-and-conquer method. Specifically, adjust the position of the graph element according to the step length of 100 for the width and calculate the length-width ratio. Find two widths in the hundreds-level pixels that make the length-width ratio of the graph closest to the preset value (such as 3:2). Adjust the graph element according to the step length of 10 for the width at the optimal width point of the hundreds-level pixels and calculate the length-width ratio to find the optimal width of the tens-level pixels, and obtain the final drawn graph.

[0092] For the sake of easy understanding, the following embodiment provides another embodiment for exemplary illustration. As Figure 4 shown, Figure 4 is a schematic flowchart of another intelligent graphing method for medium- and low-voltage feeders in a distribution network based on the S-shaped layout provided by the embodiment of the present invention. As Figure 4 shown, the method may include:

[0093] S401. Start drawing.

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

[0095] S402. Find the outgoing switch of the substation as the root node.

[0096] This step can refer to the relevant description in S230.

[0097] S403. Find the longest path of the root node as the main branch.

[0098] This step can refer to the relevant description in S230.

[0099] S404. All nodes on the longest path.

[0100] This step can refer to the relevant description in S230. The nodes in this embodiment can be called the first graphic primitive nodes.

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

[0102] This step can refer to the relevant description in S230.

[0103] S406. The current node.

[0104] S407. Whether there are still nodes.

[0105] If there are no nodes, end the current recording. If there are still nodes, determine whether to adjust the width.

[0106] S408. End the current loop.

[0107] S409. Whether to adjust the width.

[0108] Among them, the width adjustment in this step can be an adjustment of whether to line break, and it 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, then adjust the width, that is, continue drawing by line breaking or changing columns.

[0109] S410. Adjust the drawing parameters.

[0110] The adjustment of the drawing parameters in this step can be to adjust the width, that is, continue drawing by line breaking or changing columns.

[0111] S411. Determine whether there is a sub-graph algorithm that meets the conditions.

[0112] Among them, the sub-graph algorithm can also be called the sub-graph drawing method. The preset conditions and specific sub-graph algorithms can refer to the description of the above embodiments.

[0113] S412. Sub - graph selection algorithm.

[0114] Among them, the method of how to select the sub - graph algorithm can refer to the description in the above embodiments.

[0115] S413. Draw the sub - graph.

[0116] In this step, the sub - graph can be drawn according to the sub - graph algorithm.

[0117] S414. Take the outgoing line of the sub - graph as the root node and find the longest path.

[0118] In this embodiment, taking the outgoing line of the sub - graph as the root node to find the longest path can improve the compactness of the formed graph as much as possible.

[0119] S415. Draw the current node at the current drawing position according to the direction.

[0120] S416. Next node.

[0121] S417. Whether there are branch nodes.

[0122] S418. Judge the arrangement mode of sub - nodes.

[0123] Among them, the sub - nodes can also be called the second graphic elements nodes.

[0124] S419. If it is wider at the top, draw it at the bottom; if it is wider at the bottom, draw it at the top.

[0125] S420. If it is higher on the left, draw it on the right; if it is higher on the right, draw it on the left.

[0126] In this embodiment, if it is wider at the top, draw it at the bottom; if it is wider at the bottom, draw it at the top; if it is higher on the left, draw it on the right; if it is higher on the right, draw it on the left, which can improve the compactness of the layout. In addition, it can also be to turn to the vertical direction to draw the sub - branch when drawing the main branch in the parallel direction, or turn to the parallel direction to draw the sub - branch when drawing the main branch in the vertical direction.

[0127] S421. Draw the sub - line with the sub - node as the root node.

[0128] S422. Take the sub - node as the root node and find the longest path of the sub - node.

[0129] S423. The loop ends and stops drawing.

[0130] Please refer to Figure 5 , Figure 5 which is an S - type layout diagram drawn in the embodiment of the present invention. As Figure 5 shown, the S - type layout diagram is in an "S" shape, and some nodes in the main branch are also connected with sub - branches.

[0131] In this embodiment, the automatic mapping of feeders effectively solves the problems of large workload, low efficiency, and error-proneness in manual drawing, greatly improving the construction efficiency of distribution network projects and enhancing the underlying security of the system. Moreover, the sub-graph combination scheme adapts to the actual requirements of distribution network feeders, solves the problem that existing schemes cannot efficiently handle the complex situations of distribution network feeders, expands the application scope of mapping, and improves the practicability of automatic feeder mapping. In addition, the width adjustment scheme improves the mapping display effect, making the graphics more intuitive and compact, and enhancing the user experience.

[0132] In addition, adding the sub-graph drawing method combination scheme can quickly adapt to the drawing forms of switchgear stations, ring main units, distribution rooms, and user stations in actual power grid feeder construction, solve the problem that existing schemes cannot efficiently handle the complex situations of distribution network feeders, expand the application scope of mapping, and improve the practicability of automatic feeder mapping. And the width optimization scheme is added to adjust the rationality of the mapping layout, prevent situations that affect the use of graphics such as too wide mapping ratio and too much blank space, and make the final mapping in a compact S-shaped layout. Moreover, it greatly reduces the drawing workload, improves efficiency, and easily avoids errors caused by the negligence of drawing personnel during the drawing process.

[0133] Please refer to Figure 6 , Figure 6 which is a schematic structural diagram of a device provided by an embodiment of the present invention. As Figure 6 shown, the device may include:

[0134] An acquisition module 610, configured to acquire distribution network CIM feeder model data and configuration information, and convert the distribution network CIM feeder model data into graphic element node information and its connection information;

[0135] A path finding module 620, configured to determine a root node in the graphic element nodes based on the graphic element node information, and start from the root node to find a target path for mapping, where the target path includes the root node and a plurality of first graphic element nodes in the graphic element nodes;

[0136] A branch drawing module 630, configured to perform mapping drawing based on the configuration information, the connection information, and the target path. When a sub-branch of a second graphic element node is connected to the target path, it turns to draw the sub-branch connected to the current first graphic element node;

[0137] A dynamic drawing module 640, configured to input the drawing parameters of the current first graphic element node and the drawing information of the combined drawn first graphic element nodes into a pre-designed calculation model, dynamically adjust the drawing parameters of the next first graphic element node, and determine the position of the next first graphic element node based on the adjusted drawing parameters;

[0138] The sub - graph drawing module 650 is used to classify the subsequent batch of graphic elements into a certain sub - graph based on the selected sub - graph 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 - type layout graph is obtained.

[0139] In a possible implementation manner, when the path - finding module 620 starts from the root node to find the target path of the formed graph, it can be used for:

[0140] Starting from the root node, traverse multiple paths that can be formed by the graphic element nodes through the depth - first search algorithm; screen the path with the most graphic element nodes from the multiple paths as the target path.

[0141] In a possible implementation manner, when the branch - drawing module 630 turns to draw a sub - branch connected to the current first graphic element node, it can be used for:

[0142] Turn to draw the sub - branch connected to the first graphic element node along the second direction, where the first direction is perpendicular to the second direction.

[0143] In a possible implementation manner, when the dynamic - drawing module 640 inputs the drawing parameters of the current first graphic element node and the drawing information of the combined drawn first graphic element nodes into a pre - designed calculation model to dynamically adjust the drawing parameters of the next first graphic element node, it can be used for:

[0144] After the drawing of the current first graphic element node is completed, obtain the current drawing parameters, where the current drawing parameters include the current drawing direction, the global trend direction, the full - map width and height, the coordinate extreme values, and the drawing progress; obtain the drawing information of the combined drawn first graphic element nodes, where the drawing information includes the local width and height, the coordinate extreme values, and the graphic element attributes, and the drawing information is obtained through pre - drawing; input the current drawing parameters and the drawing information of the combined drawn first graphic element nodes into the pre - designed calculation model to obtain the next drawing parameters of the next first graphic element node output by the pre - designed calculation model, where the next drawing parameters include the next drawing direction and the next drawing coordinate; draw the next first graphic element node according to the next drawing parameters.

[0145] In a possible implementation manner, the dynamic - drawing module 640 is also used for:

[0146] If it is determined based on the next drawing coordinate that the connection direction between the current first graphic element node and the next first graphic element node is different from the current drawing direction, record the line - turning buried point of the current first graphic element node, so that after all the graphic element nodes are drawn and the layout is completed, draw the connection lines between the graphic element nodes based on the connection information, where the direction of the connection line at the line - turning buried point changes.

[0147] In a possible implementation, the sub-graph drawing module 650 classifies the subsequent batch of graph elements into a certain sub-graph based on the selected sub-graph algorithm to draw the sub-graph, and after the sub-graph drawing is completed, returns to the target path from the sub-graph outlet to continue drawing until an S-shaped layout graph is obtained, and is used for:

[0148] When drawing the current first graph element node, based on the graph element attributes of the first graph element node and the current drawing progress, determine whether at least one of a plurality of preset conditions is satisfied, and 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, perform sub-graph drawing on the current first graph element node and at least one subsequent first graph element 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, continue drawing the target path from the sub-graph outlet; if none of the plurality of preset conditions is satisfied, draw the next first graph element node.

[0149] In a possible implementation, the dynamic drawing module 640 is further used for:

[0150] Judge whether the length ratio of the S-shaped layout graph meets a preset ratio, where the length ratio includes the ratio between the length along the horizontal direction and the length along the vertical direction; if the length ratio of the S-shaped layout graph does not meet the preset ratio, perform adjustment processing on the S-shaped layout graph to obtain an adjusted S-shaped layout graph; wherein, the adjustment processing includes the following steps: sequentially adjust the length of the S-shaped layout graph along the target direction according to the first step length until the first length of the S-shaped layout graph along the target direction is determined, where 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 graph at the first length and the preset ratio is not greater than the difference between the length ratio of the S-shaped layout graph at 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, sequentially adjust the length of the S-shaped layout graph along the target direction according to the second step length until the length ratio of the S-shaped layout graph meets the preset ratio, and the second step length is less than the first step length.

[0151] The intelligent mapping device for medium and low voltage feeders of the distribution network based on the S-shaped layout provided by the embodiments of the present invention has the same technical features as the intelligent mapping method for medium and low voltage feeders of the distribution network based on the S-shaped layout provided by the above embodiments, 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 method embodiment above and will not be elaborated here.

[0152] This embodiment also provides an electronic device, including a processor and a memory. 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 medium-voltage and low-voltage feeders in a power distribution network based on the S-shaped layout. This electronic device can be a server or a terminal device.

[0153] As shown in Figure 7 , the electronic device includes a processor 100 and a memory 101. 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 medium-voltage and low-voltage feeders in a power distribution network based on the S-shaped layout.

[0154] Furthermore, Figure 7 the electronic device shown in also includes a bus 102 and a communication interface 103. The processor 100, the communication interface 103, and the memory 101 are connected through the bus 102.

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

[0156] The processor 100 may be an integrated circuit chip with the ability to process signals. In the implementation process, each step of the above method can be completed by the integrated logic circuit of the hardware in the processor 100 or the instructions in the form of software. The above-mentioned processor 100 may be a general-purpose processor, including a central processing unit (CPU for short), a network processor (NP for short), etc.; it may also be a digital signal processor (DSP for short), an application specific integrated circuit (ASIC for short), a field-programmable gate array (FPGA for short), or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components. It can implement or execute the various methods, steps, and logic block diagrams disclosed in the embodiments of the present invention. The general-purpose processor may be a microprocessor or the processor may also be any conventional processor, etc. The steps of the method disclosed in combination with the embodiments of the present invention can be directly embodied as being executed and completed by the hardware decoding processor, or be executed and completed by the combination of the hardware and software modules in the decoding processor. The software module may be located in a mature storage medium 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. This storage medium is located in the memory 101, and the processor 100 reads the information in the memory 101 and combines its hardware to complete the steps of the method in the foregoing embodiments.

[0157] The processor in the above electronic device can implement the steps in the above method for intelligent mapping of medium- and low-voltage feeders in a distribution network based on the S-shaped layout by executing computer-executable instructions.

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

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

[0160] 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 foregoing method embodiments. For specific implementation, reference can be made to the method embodiments, which will not be elaborated here.

[0161] Those skilled in the art can clearly understand that for the convenience and brevity of description, the specific working processes of the systems and devices described above can refer to the corresponding processes in the foregoing method embodiments and will not be elaborated herein.

[0162] In addition, in the description of the embodiments of the present invention, unless otherwise clearly specified and limited, the terms "installed", "connected", and "coupled" 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 directly connected or indirectly connected through an intermediate medium, and it can be the communication inside two elements. For those skilled in the art, the specific meanings of the above terms in the present invention can be understood according to specific situations.

[0163] 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, in essence, or the part that contributes to the prior art, or a part of this technical solution, can be embodied in the form of a software product. This computer software product is stored in a storage medium and includes several instructions for causing a computer device (which can be a personal computer, a server, or a network device, etc.) to execute all or part of the steps of the methods in the various embodiments of the present invention. The foregoing storage medium includes: various media such as USB flash drives, mobile hard disks, read-only memories (ROMs), random access memories (RAMs), magnetic disks, or optical discs that can store program codes.

[0164] In the description of the present invention, it should be noted that the orientation or positional relationship indicated by the terms "center", "upper", "lower", "left", "right", "vertical", "horizontal", "inner", "outer", etc. is based on the orientation or positional relationship shown in the drawings, and is 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 should not be construed as a limitation of the present invention. In addition, the terms "first", "second", and "third" are only used for descriptive purposes and cannot be understood as indicating or implying relative importance.

[0165] Finally, it should be noted that the above embodiments are only specific implementation manners of the present invention, used to illustrate the technical solutions of the present invention, rather than limiting it. The protection scope of the present invention is not limited thereto. Although the present invention has been described in detail with reference to the foregoing embodiments, those skilled in the art should understand that any person skilled in the art within the technical scope disclosed by the present invention can still modify the technical solutions recorded in the foregoing embodiments, or can easily think of changes, or perform equivalent replacements on some of the technical features; 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 all be covered within the protection scope of the present invention. Therefore, the protection scope of the present invention shall be subject to 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, Including: Data acquisition step: acquiring the distribution network CIM feeder model data and configuration information, and converting the distribution network CIM feeder model data into graphic element node information and its connection information; Path finding step: based on the graphic element node information, determining the root node in the graphic element nodes, and starting from the root node to find the target path for graph formation, the target path including the root node and a plurality of first graphic element nodes in the graphic element nodes; Branch drawing step: performing graph formation drawing based on the configuration information, the connection information and the target path, and if the target path is connected with a sub-branch of a second graphic element node, then turning to draw the sub-branch connected to the current first graphic element node; Dynamic drawing step: after drawing the current first graphic element node, acquiring the current drawing parameters, the current drawing parameters including the current drawing direction, the global trend direction, the full map width and height, the coordinate extreme values and the drawing progress; acquiring the drawing information of the combined first graphic element nodes that have been drawn, the drawing information including the local width and height, the coordinate extreme values and the graphic element attributes, the drawing information being obtained through pre-drawing; inputting the current drawing parameters and the drawing information of the combined first graphic element nodes that have been drawn into a pre-designed calculation model to obtain the next drawing parameters of the next first graphic element node output by the pre-designed calculation model, the next drawing parameters including the next drawing direction and the next drawing coordinate; drawing the next first graphic element node according to the next drawing parameters; Sub-graph drawing step: classifying the subsequent batches of graphic elements into a certain sub-graph based on the selected sub-graph algorithm to draw the sub-graph, and after the sub-graph drawing is completed, returning from the sub-graph outlet to the target path to continue drawing until an S-shaped layout graph is obtained.

2. The method according to claim 1, wherein The finding the target path for graph formation starting from the root node includes: Starting from the root node, traversing a plurality of paths that can be formed by the graphic element nodes through the depth-first search algorithm; Selecting the path with the most graphic element nodes from the plurality of paths as the target path.

3. The method according to claim 1, wherein The first graphic element nodes in the target path are drawn along a first direction, and the turning to draw the sub-branch connected to the current first graphic element node includes: Turning to draw the sub-branch connected to the first graphic element node along a second direction, the first direction being perpendicular to the second direction.

4. The method according to claim 1, wherein The method further includes: If it is determined based on the next drawing coordinate that the connection direction between the current first graphic element node and the next first graphic element node is different from the current drawing direction, then recording the line turning buried point of the current first graphic element node, so that after all the graphic element nodes are drawn and the layout is completed, the connection lines between the graphic element nodes are drawn based on the connection information, wherein the direction of the connection line at the line turning buried point is changed.

5. The method according to claim 1, wherein The classifying the subsequent batches of graphic elements into a certain sub-graph based on the selected sub-graph algorithm to draw the sub-graph, and after the sub-graph drawing is completed, returning from the sub-graph outlet to the target path to continue drawing until an S-shaped layout graph is obtained includes: 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 a plurality of preset conditions is satisfied, and 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, perform sub-graph drawing on 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, exit from the sub-graph to continue drawing the target path; If none of the plurality of preset conditions is satisfied, draw the next first primitive node.

6. The method according to claim 1, wherein After obtaining the S-shaped layout diagram, the method further includes: Determine whether the length ratio of the S-shaped layout diagram satisfies a preset ratio, where the length ratio includes the ratio between the length along the horizontal direction and the length along the vertical direction; If the length ratio of the S-shaped layout diagram does not satisfy the preset ratio, perform adjustment processing on the S-shaped layout diagram to obtain an adjusted S-shaped layout diagram; where the adjustment processing includes the following steps: Adjust the length of the S-shaped layout diagram along the target direction in sequence according to a first step length until the first length of the S-shaped layout diagram along the target direction is determined, where 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 at the first length and the preset ratio is not greater than the difference between the length ratio of the S-shaped layout diagram at 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, adjust the length of the S-shaped layout diagram along the target direction in sequence according to a second step length until the length ratio of the S-shaped layout diagram satisfies the preset ratio, and the second step length is less than the first step length.

7. An intelligent mapping device for medium and low voltage feeders in a distribution network based on an S-shaped layout, characterized in that, Includes: An acquisition module, configured to acquire distribution network CIM feeder model data and configuration information, and convert the distribution network CIM feeder model data into primitive node information and its connection information; A path finding module, configured to determine a root node in the primitive nodes based on the primitive node information, and start from the root node to find a target path for forming a graph, where the target path includes the root node and a plurality of first primitive nodes in the primitive nodes; A branch drawing module, configured to perform graph drawing based on the configuration information, the connection information, and the target path. If a sub-branch connected to a second primitive node is connected to the target path, then turn to draw the sub-branch connected to the current first primitive node; A dynamic drawing module, configured to obtain current drawing parameters after completing the drawing of the current first primitive node, where the current drawing parameters include the current drawing direction, the global trend direction, the full map width and height, the coordinate extreme values, and the drawing progress; obtain the drawing information of the drawn first primitive node combination, where the drawing information includes the local width and height, the coordinate extreme values, and the primitive attributes, and the drawing information is obtained through pre-drawing; input the current drawing parameters and the drawing information of the drawn first primitive node combination into a pre-designed calculation model to obtain the next drawing parameters of the next first primitive node output by the pre-designed calculation model, where the next drawing parameters include the next drawing direction and the next drawing coordinates; draw the next first primitive node according to the next drawing parameters. A sub-graph drawing module, configured to classify subsequent batches of primitives into a certain sub-graph based on a selected sub-graph algorithm to draw the sub-graph, and after the sub-graph drawing is completed, return to the target path from the sub-graph outlet and continue drawing until an S-shaped layout graph is obtained.

8. An electronic device, characterized in that, It includes a processor and a memory, where 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-6.

9. 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 the processor, the computer-executable instructions cause the processor to implement the method according to any one of claims 1-6.

Images