Dynamic programming algorithm-based grid theme graph layout method

Abstract

The invention discloses a dynamic programming algorithm-based grid theme graph layout method. The dynamic programming algorithm-based grid theme graph layout method is characterized by comprising the following steps: (1) building a single-line graph-based ring network topological relation model according to spatial data of a power system; (2) building a connected graph formed by N vertexes and an N*N adjacent matrix according to the built topological relation model and the number N of sub-graph files; (3) building a function model, and calculating an optimal value according to a dynamic programming algorithm until the sub-graph files are completely traversed; (4) distributing the sub-graph files; and (5) rendering the sub-graph files into a graph. A layout method which is best for a power grid is extended and expanded on the basis of the dynamic programming algorithm; the graph can be quickly and perfectly formed; and the problem of the rendering efficiency of a grid system under a large amount of data is solved.

Description

technical field [0001] The invention relates to a layout method of a thematic map of a power grid based on a dynamic programming algorithm. Background technique [0002] The thematic map of the power grid can also be called the electrical wiring diagram. It is a visual expression of the topological state of the power grid. It is an indispensable tool to assist the inspection personnel and dispatchers of the power grid. The workload of graphics drawing is heavy, and there is also the problem of inconsistency in the number of graphics. [0003] At present, there are various algorithms for the layout of power grid topology wiring diagrams in the industry, and the algorithms used are basically the following three algorithms: [0004] First, the tree diagram layout algorithm: a space-filling layout algorithm for hierarchical data. [0005] The disadvantage is that when dealing with complex hierarchical data, the squareness performance of the ordered tree diagram is poor, and it...

AI Technical Summary

Problems solved by technology

[0005] The disadvantage is: when dealing with complex hierarchical data, the squareness of the ordered tree diagram is poor, it is difficult to meet the data display requirements of each layer, and manual participation is required

[0007] The disadvantage is that the algorithm has limited ability to explore new spaces, and it is easy to converge to a local optimal solution

[0009] The disadvantage is: a lot of grid data is partially looped and cannot be processed

Images