Line topology generation method for reutilization of power tower resources

Abstract

The invention relates to the technical field of electric power towers, in particular to a line topology generation method for reutilization of electric power tower resources. According to the technical scheme, the line topology generation method for power tower resource reuse comprises the following steps that S1, information of each tower is extracted from a power grid line diagram Grid, the information of each tower is expressed as a triple (longitude, latitude and unique number or unique name of the tower), and the information of each tower is extracted from a grid line diagram Grid; forming a triple array L by the triple of all tower information; s2, finding out the minimum latitude in all the triads from the triad array L and defining the minimum latitude as latitude A, and finding out the minimum longitude of all the triads and defining the minimum longitude as longitude A; according to the invention, planning can be carried out between two towers of different lines, so that the existing power towers can be reused, non-power cables are built on the basis of the existing towers, the resource utilization rate of the existing towers is improved, and the building efficiency of the non-power cables is improved.

Description

Technical Field

[0001] The present invention relates to the technical field of power pole towers, and in particular to a line topology generation method for reusing power pole tower resources. Background Art

[0002] The power supply network has a large number of poles and towers. In addition to suspending and supporting power cables, these towers can also be used to suspend and support cables such as communication cables. This avoids the need to repeatedly build towers specifically for suspending and supporting other types of cables, such as communication cables. However, due to different usage requirements, other cables such as communication cables will not be laid out exactly in accordance with the route of power cables. For example, if two power lines are close together, and the distance between two towers belonging to the two power lines is less than the construction standard requirements for suspending optical cables and other cables, optical cables and other cables can be laid across the lines between the two towers. Typically, power grid companies have basic data such as the topology and line maps of power lines. When wiring needs to be done between towers on different lines, due to the limitations of the line topology and line maps, conventional line planning algorithms cannot plan between two towers that are not on the same line.

[0003] A power grid topology is an undirected graph with power towers and power cables as nodes and edges. It represents the connections between actual power cables and facilities such as towers. However, when towers are reused to support non-power cables, the existing power grid topology only allows for planning along power lines. Adjacent towers on different lines cannot be planned as the same non-power cable route, resulting in long, circuitous routes and inefficient use of towers.

[0004] Patent publication number CN117372616A discloses a method for constructing a tower twin model topology, comprising: obtaining the coordinates of each tower in the target area power grid; determining the offset of the relative coordinates of the connection porcelain bottle on each tower based on the tower's three-dimensional model; determining the offset angle of each tower based on the coordinates of each tower and the previous tower; determining the coordinates of the connection porcelain bottle on each tower based on the offset angle and the offset; and constructing a tower twin model topology based on the coordinates of each tower and the coordinates of the connection porcelain bottle on each tower. By implementing the present invention, the tower twin model topology can be quickly constructed based on the coordinates of each tower, the position of the connection porcelain bottle on each tower, and the line direction determined by the offset angle, avoiding the high cost and difficulty of modeling using traditional computer modeling or point cloud scanning methods. However, the present invention does not address the issue of reusing towers to install non-power cables, and therefore still has drawbacks in terms of the reuse of power towers. Summary of the Invention

[0005] The present invention proposes a line topology generation method for the reuse of power tower resources, which solves the problem in the prior art that when towers are reused to suspend and support non-power cables, according to the existing power grid topology, planning can only be achieved along the power lines. Adjacent towers of different lines cannot be planned as the same non-power cable route, which leads to long routing and ineffective use of towers.

[0006] In order to solve the above technical problems, the technical solution adopted by the present invention is:

[0007] A line topology generation method for reusing power tower resources comprises the following steps:

[0008] Step S1, extracting information of each tower from the power grid line map Grid, wherein the information of each tower is represented as a triplet (longitude, latitude, tower unique number or unique name), and the triplet of all tower information forms a triplet array L;

[0009] Step S2: Find the minimum latitude among all triplets from the triple array L and define it as latitude A, find the minimum longitude among all triplets and define it as longitude A, define the location (latitude A, longitude A) as the origin (0, 0) of a relative coordinate system, convert the longitude and latitude of all triplets in the triple array L into relative coordinates (X, Y) relative to the point (0, 0), and all triplets are converted into (X, Y, N), where X is the horizontal relative coordinate, Y is the vertical relative coordinate, and N is the unique number or unique name of the tower. All converted triplets form a new triple array LD;

[0010] Step S3: sort all triples in the triple array LD from small to large according to X in their array element triples (X, Y, N), and store the sorting result as a copy sequence array LDN;

[0011] Step S4: Create an undirected graph adjacency list Map, wherein the Map includes a node array D, and assign all the contents of the array LDN to the node array D;

[0012] Step S5: Calculate the distances between towers with adjacent horizontal and vertical relative coordinates to obtain towers with distances that meet the requirements, connect the towers that meet the requirements and can be used for cable laying in the map, complete the construction of the map, and output the map.

[0013] Furthermore, in step S3, all triples in the triple array LD are sorted from small to large according to Y in their array element triples (X, Y, N), and the sorting result is stored as a copy sequence array LDA.

[0014] Furthermore, in step S4, the node array D contains two fields, the first field is the node field, the content of which is a node triple (X, Y, N), called a node, and the second field is the pointer field, the content of which is a pointer P pointing to a node.

[0015] Furthermore, the Map is initialized, the length of the node array D is set to the length of the copy sequence LDN, all triples (X, Y, N) in the copy sequence LDN are assigned to the node triples (X, Y, N) of the node array D, that is, D[] = LDN[], and a terminator is filled in each pointer field P.

[0016] Furthermore, the maximum pole tower spacing described in the stringing is MaxL. A temporary array TLDN is created, a temporary integer variable int i is created, i=0, and the following calculation process is performed:

[0017] Step 1: If i is greater than or equal to the number of triplet elements in the array LDN, return to the Map and end the calculation; if i is less than the number of triplet elements in the array LDN, proceed to step 2;

[0018] Step 2: Create a temporary integer variable int j, set j = i + 1;

[0019] Step 3: Take LDN[j]. If the absolute value of the difference between the horizontal coordinates X of LDN[i] and LDN[j] is less than or equal to MaxL, then load the triplet LDN[j] into the temporary array TLDN.

[0020] Furthermore, it also includes:

[0021] Step 4: If the absolute value of the difference between the horizontal coordinates X of LDN[i] and LDN[j] is greater than MaxL, all triplet elements in the temporary array TLDN are sorted according to the size of Y.

[0022] Furthermore, after the order of Y in step 4 is sorted, the following sub-process is further included:

[0023] Sub-process step 1: Create a temporary integer variable int k, set k = 0, create a temporary integer variable int l, set l = k + 1;

[0024] Sub-process step 2: If k is less than the number of triples in the array TLDN, proceed to sub-process step 3;

[0025] Sub-process step 3: Take TLDN[l]. If the absolute value of the difference between the vertical coordinates Y of TLDN[k] and TLDN[l] is greater than MaxL, remove the triple LDN[j] and all subsequent elements from the temporary array TLDN. Otherwise, increment l to l=l+1, and jump to sub-process step 2.

[0026] Sub-process step 4: k is incremented, that is, k=k+1, and jump to sub-process step 2.

[0027] Furthermore, in step 2 of the sub-process, if k is greater than or equal to the number of triplet elements in the array TLDN, then jump to the following steps:

[0028] Step 5: Create a temporary integer variable int m and set m=0;

[0029] Step 6. Calculate the distance D between the tower stored in TLDN[m] and the tower stored in LDN[i]. Use the Pythagorean theorem to calculate D, which is equal to the square root of the sum of the square of the difference between the horizontal relative coordinates of the two towers and the square of the difference between the vertical relative coordinates of the two towers. When the element satisfies D less than or equal to MaxL, create an object d of type D, store TLDN[m] in the node field of d, fill the index field of the element of the node storing the element LDN[i] in the node array of the Map with the address of d, and fill the index field of d with the termination symbol "^".

[0030] Step 7: Increment m, that is, m=m+1.

[0031] Furthermore, it also includes:

[0032] Step 8: If m is greater than or equal to the number of elements in the array TLDN, jump to step 1.

[0033] Furthermore, it also includes:

[0034] Step 9: increment i, i=i+1, and jump to step 1.

[0035] The positive effects of the present invention are:

[0036] By reconstructing the topology, planning can be carried out between two pole towers on different lines, so that existing power pole towers can be reused and non-power cables can be built on the basis of existing pole towers, thereby improving the resource utilization of existing pole towers, improving the efficiency of non-power cable construction, and reducing construction costs.

[0037] The present invention is a method for generating a topology that is redrawn according to the distance between power towers. It can generate a topology in which the distance between towers is less than the constructible distance, that is, the distance between towers is equal to connectivity. On this topology, requirements such as planning line paths across power lines can be realized, and the tower resources of power grid companies can be reused.

[0038] First, the algorithm is extremely time-efficient. Its time complexity is approximately O(n*logN). Considering a provincial power grid with 4 million towers, the computer would need to perform approximately 40 million operations. Currently, a typical server can perform 1 million operations per second, completing the topology in about 40 seconds.

[0039] Second, the algorithm is highly space-efficient, with a space overhead equal to approximately four times the number of towers. If each tower node requires 4 bytes of memory for data storage, the total memory consumption for 4 million towers is approximately 64MB.

[0040] Third, this algorithm supports the algorithm of planning lines directly based on the location of towers, which is no longer restricted by the power grid topology and realizes the possibility of business expansion of power grid companies. BRIEF DESCRIPTION OF THE DRAWINGS

[0041] Figure 1 This is a schematic diagram of the adjacency table Map in the present invention;

[0042] Figure 2 This is a schematic diagram of the Map structure constructed in the present invention. DETAILED DESCRIPTION

[0043] The following will be combined with the embodiments of the present invention to clearly and completely describe the technical solutions in the embodiments of the present invention. Obviously, the embodiments described are only 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 ordinary technicians in this field without making any creative efforts are within the scope of protection of the present invention.

[0044] Example

[0045] The grid diagram Grid stored in the grid-related information system. The Grid can be any data structure storing the grid topology. For the convenience of description, it can be assumed that the data type of the Grid is a graph.

[0046] A line topology generation method for reusing power tower resources comprises the following steps:

[0047] Step S1, extracting information of each tower from the power grid line map Grid, wherein the information of each tower is represented as a triplet (longitude, latitude, tower unique number or unique name), and the triplet of all tower information forms a triplet array L;

[0048] Extract the information of all towers in the grid one by one. Each tower's information is represented as a triple: (Lng, Lat, N), which is a triple of (longitude, latitude, and tower's unique number or name). The triples of all tower information form a triple array L, which represents the unique identifiers and locations of all towers in the input power grid diagram.

[0049] Step S2: Find the minimum latitude among all triplets in the triple array L and define it as latitude A, find the minimum longitude among all triplets and define it as longitude A, define the location (latitude A, longitude A) as the origin (0, 0) of a relative coordinate system, convert the longitude and latitude of all triplets in the triple array L to relative coordinates (X, Y) relative to the point (0, 0), and all triplets are converted to (X, Y, N), where X is the horizontal relative coordinate, Y is the vertical relative coordinate, and N is the unique number or unique name of the tower. All converted triplets form a new triple array LD;

[0050] Use any efficient search algorithm to find the minimum latitude among all triples in L, defined as latitude A. Use any efficient search algorithm to find the minimum longitude among all triples in L, defined as longitude A.

[0051] Using an arbitrary coordinate system conversion formula, convert the longitude and latitude of all triplets in L into relative coordinates (X, Y) relative to point (0, 0). The units of X and Y are kilometers (km). After conversion, all triplets are converted to (X, Y, N), that is, (horizontal relative coordinate, vertical relative coordinate, tower unique number or unique name); all triplets containing distance information are stored in an array LD;

[0052] The purpose of converting longitude and latitude coordinates to a plane coordinate system is to reduce the time complexity of subsequent operations. Distance calculations based on longitude and latitude differences often involve numerous sine and cosine calculations, which incurs significant computational overhead. Converting to a plane relative coordinate system reduces this time complexity.

[0053] Step S3: sort all triples in the triple array LD from small to large according to X in their array element triples (X, Y, N), and store the sorting result as a copy sequence array LDN;

[0054] In step S3, all triples in the triple array LD are sorted from small to large according to Y in their array element triples (X, Y, N), and the sorting result is stored as a copy sequence array LDA.

[0055] The algorithm sorts the triplet array LD from smallest to largest by the value of X in its element triples (X, Y, N) and stores the sorted result as a duplicate sequence LDN. Alternatively, LD can be sorted by the value of Y and the resulting sequence as a duplicate sequence LDA. Either method is acceptable. Here, LDN is used for the description; however, the principle is the same if LDA is used.

[0056] Step S4: Create an undirected graph adjacency list Map, which contains a node array D. All the contents in the array LDN are assigned to the node array D.

[0057] A map is an adjacency list stored in any file format. In this embodiment, for the convenience of description, it can be assumed that the type of the map is a linked-table.

[0058] In step S4, the node array D contains two fields, the first field is the node field, the content of which is a node triple (X, Y, N), called a node, and the second field is the pointer field, the content of which is a pointer P pointing to a node.

[0059] Define and create an undirected graph adjacency list Map. Map contains a node array D. Each array element in this array has two fields. The first field is the node field, which contains a node triple (X, Y, N), called a node. The second field is the pointer field, which contains a pointer P to a node. That is, D[] = {(node ​​1, P1), (node ​​2, P2))...}.

[0060] Initialize the Map, set the length of the node array D to the length of the copy sequence LDN, assign all triples (X, Y, N) in the copy sequence LDN to the node triples (X, Y, N) of the node array D, that is, D[] = LDN[], and fill in a terminator in each pointer field P.

[0061] When Map is initialized in this step, the length of the node array D is set to the length of the array LND, and all the contents of LDN are assigned to the node array D, that is, D[] = LDN[]; and a terminator is filled in each pointer field P, such as Figure 1 shown.

[0062] Step S5: Calculate the distance between towers with adjacent horizontal and vertical relative coordinates to obtain towers with distances that meet the requirements. Connect the towers that meet the requirements and can be used for cable laying in the map to complete the construction of the map and output the map.

[0063] The maximum spacing between towers for wiring is MaxL. For wiring to work between towers, the distance between two towers must be less than or equal to MaxL. The unit is kilometers, expressed as a floating-point number. Create a temporary array TLDN and a temporary integer variable int i, set i = 0, and perform the following calculation:

[0064] Step 1: If i is greater than or equal to the number of triples in the array LDN, return to Map and end the calculation. If i is less than the number of triples in the array LDN, proceed to step 2.

[0065] Step 2: Create a temporary integer variable int j, set j = i + 1;

[0066] Step 3. Take LDN[j]. If the absolute value of the difference between the horizontal coordinates X of LDN[i] and LDN[j] is less than or equal to MaxL, then load the triplet LDN[j] into the temporary array TLDN.

[0067] Also includes:

[0068] Step 4: If the absolute value of the difference between the horizontal coordinates X of LDN[i] and LDN[j] is greater than MaxL, then all triplet elements in the temporary array TLDN are sorted according to the size of Y.

[0069] After sorting by the size of Y in step 4, the following sub-processes are also included:

[0070] Sub-process step 1: Create a temporary integer variable int k, set k = 0, create a temporary integer variable int l, set l = k + 1;

[0071] Sub-process step 2: If k is less than the number of triples in the array TLDN, proceed to sub-process step 3;

[0072] Sub-procedure step 3: Take TLDN[l]. If the absolute value of the difference between the vertical coordinates Y of TLDN[k] and TLDN[l] is greater than MaxL, remove the triple LDN[j] and all subsequent elements from the temporary array TLDN. Otherwise, increment l to l=l+1, and jump to sub-procedure step 2.

[0073] Sub-process step 4: k is incremented, that is, k=k+1, and jump to sub-process step 2.

[0074] In step 2 of the sub-process, if k is greater than or equal to the number of triples in the array TLDN, jump to the following steps:

[0075] Step 5: Create a temporary integer variable int m and set m=0;

[0076] Step 6. Calculate the distance D between the tower stored in TLDN[m] and the tower stored in LDN[i]. Use the Pythagorean theorem to calculate D, which is equal to the square root of the sum of the square of the difference between the horizontal relative coordinates of the two towers and the square of the difference between the vertical relative coordinates of the two towers. Use the Pythagorean theorem to calculate the actual distance between the towers.

[0077] The actual tower distance is compared with the maximum distance MaxL. When the element satisfies D less than or equal to MaxL, the tower distance meets the requirement;

[0078] Create an object d of type D, store TLDN[m] in the node field of d, fill the index field of the element of the node storing element LDN[i] in the node array of Map with the address of d, and fill the index field of d with the termination symbol "^";

[0079] Step 7: Increment m, that is, m=m+1.

[0080] Step 8. If m is greater than or equal to the number of elements in the array TLDN, jump to step 1.

[0081] Step 9: increment i, i=i+1, and jump to step 1.

[0082] This cycle is repeated to calculate and compare the triplet information of each tower, and then a complete topological relationship of the tower that can be built can be obtained.

[0083] After all the above steps, the construction of Map is completed. Map is our newly constructed topology that can be used to lay non-power cables. The data structure is as follows Figure 2 shown.

[0084] To perform line planning algorithm on this topology, we can use A * Any type of efficient algorithm can be used to plan routes according to the distance between towers.

[0085] The power grid has millions of nodes. The method described in this paper for constructing new topological relationships between towers first identifies adjacent towers and then calculates the number of towers available for line connection between them, avoiding the need to calculate proximity relationships between all towers. This optimizes time complexity. Power grid towers are sparsely distributed across the entire map. Using tiles or grids to store tower information would waste significant storage space. This algorithm uses an adjacency list to store tower information, optimizing the algorithm's space complexity.

[0086] The above-mentioned embodiments are described in a relatively detailed and specific manner, expressing preferred embodiments of the present invention. They are only used to illustrate the technical ideas and features of the present invention. Their purpose is to enable those skilled in the art to understand the contents of the present invention and implement them accordingly. However, they are not limited to the present invention alone, and the patent scope of the present invention cannot be limited solely by these embodiments. That is, any equivalent changes or modifications made to the spirit disclosed by the present invention, for researchers or technicians in this field, without departing from the structure of the present invention, local improvements within the system and changes and conversions between subsystems, etc., are still within the patent scope of the present invention.

Claims

1. A line topology generation method for reusing power tower resources, characterized in that: include: Step S1, extracting tower information from the power grid diagram Grid, where the information of each tower is represented as a triplet (longitude, latitude, tower unique number or unique name), and all tower information forms a triplet array L; Step S2: convert all triple arrays into coordinates to form a new triple array LD; Step S3: sort all triples in the triple array LD from small to large according to X in their array element triples (X, Y, N), and store the sorting result as a copy sequence array LDN; Step S4: Create an undirected graph adjacency list Map, wherein the Map includes a node array D, and assign all the contents of the array LDN to the node array D; Step S5: Calculate the distance between towers with adjacent horizontal and vertical relative coordinates to obtain towers with distances that meet the requirements. Connect the towers that meet the requirements and can be wired in the map to complete the map construction and output the map.

2. A line topology generation method for reusing power tower resources according to claim 1, characterized in that: In step S2, the process of converting all triple arrays into coordinates is as follows: finding the minimum latitude of all triples from the triple array L and defining it as latitude A, finding the minimum longitude of all triples and defining it as longitude A, defining the location (latitude A, longitude A) as the origin (0, 0) of a relative coordinate system, converting the longitude and latitude of all triples in the triple array L into relative coordinates (X, Y) relative to the point (0, 0), all triples are converted into (X, Y, N), X is the horizontal relative coordinate, Y is the vertical relative coordinate, N is the unique number or unique name of the tower, and all converted triple arrays form a new triple array LD; In step S3, all triples in the triple array LD are sorted from small to large according to Y in their array element triples (X, Y, N), and the sorting result is stored as a copy sequence array LDA.

3. The line topology generation method for reusing power tower resources according to claim 1, characterized in that: In step S4, the node array D contains two fields, the first field is the node field, the content of which is a node triple (X, Y, N), called a node, and the second field is the pointer field, the content of which is a pointer P pointing to a node.

4. A line topology generation method for power tower resource reuse according to claim 3, characterized in that: Initialize the Map, set the length of the node array D to the length of the copy sequence LDN, assign all triples (X, Y, N) in the copy sequence LDN to the node triples (X, Y, N) of the node array D, that is, D[] = LDN[], and fill in a terminator in each pointer field P.

5. A line topology generation method for power tower resource reuse according to claim 4, characterized in that: The maximum tower spacing described in the line stringing is MaxL. Create a temporary array TLDN and a temporary integer variable int i, set i = 0, and perform the following calculation process: Step 1: If i is greater than or equal to the number of triplet elements in the array LDN, return to the Map and end the calculation; if i is less than the number of triplet elements in the array LDN, proceed to step 2; Step 2: Create a temporary integer variable int j, set j = i + 1; Step 3: Take LDN[j]. If the absolute value of the difference between the horizontal coordinates X of LDN[i] and LDN[j] is less than or equal to MaxL, then load the triplet LDN[j] into the temporary array TLDN.

6. A line topology generation method for power tower resource reuse according to claim 5, characterized in that: Also includes: Step 4: If the absolute value of the difference between the horizontal coordinates X of LDN[i] and LDN[j] is greater than MaxL, all triplet elements in the temporary array TLDN are sorted according to the size of Y.

7. A line topology generation method for power tower resource reuse according to claim 6, characterized in that: After the order of Y in step 4 is sorted, the following sub-process is also included: Sub-process step 1: Create a temporary integer variable int k, set k = 0, create a temporary integer variable intl, set l = k + 1; Sub-process step 2: If k is less than the number of triples in the array TLDN, proceed to sub-process step 3; Sub-process step 3: Take TLDN[l]. If the absolute value of the difference between the vertical coordinates Y of TLDN[k] and TLDN[l] is greater than MaxL, remove the triple LDN[j] and all subsequent elements from the temporary array TLDN. Otherwise, increment l to l=l+1, and jump to sub-process step 2. Sub-process step 4: k is incremented, that is, k=k+1, and jump to sub-process step 2.

8. The line topology generation method for reusing power tower resources according to claim 7, characterized in that: In step 2 of the sub-process, if k is greater than or equal to the number of triplet elements in the array TLDN, jump to the following steps: Step 5: Create a temporary integer variable int m and set m=0; Step 6. Calculate the distance D between the tower stored in TLDN[m] and the tower stored in LDN[i]. Use the Pythagorean theorem to calculate D, which is equal to the square root of the sum of the square of the difference between the horizontal relative coordinates of the two towers and the square of the difference between the vertical relative coordinates of the two towers. When the element satisfies D less than or equal to MaxL, create an object d of type D, store TLDN[m] in the node field of d, fill the index field of the element of the node storing the element LDN[i] in the node array of the Map with the address of d, and fill the index field of d with the termination symbol "^". Step 7: Increment m, that is, m=m+1.

9. A line topology generation method for power tower resource reuse according to claim 8, characterized in that: Also includes: Step 8: If m is greater than or equal to the number of elements in the array TLDN, jump to step 1.

10. A line topology generation method for power tower resource reuse according to claim 9, characterized in that: Also includes: Step 9: increment i, i=i+1, and jump to step 1.

Images