CN111931993A - Power transmission network wiring diagram generation method and system - Google Patents
Power transmission network wiring diagram generation method and system Download PDFInfo
- Publication number
- CN111931993A CN111931993A CN202010690559.7A CN202010690559A CN111931993A CN 111931993 A CN111931993 A CN 111931993A CN 202010690559 A CN202010690559 A CN 202010690559A CN 111931993 A CN111931993 A CN 111931993A
- Authority
- CN
- China
- Prior art keywords
- planning
- station
- canvas
- newly added
- lines
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 64
- 238000010586 diagram Methods 0.000 title claims abstract description 57
- 230000005540 biological transmission Effects 0.000 title claims abstract description 39
- 238000013507 mapping Methods 0.000 claims abstract description 31
- 230000008569 process Effects 0.000 claims description 11
- 238000002922 simulated annealing Methods 0.000 claims description 9
- 238000003860 storage Methods 0.000 claims description 6
- 230000004044 response Effects 0.000 claims description 5
- 238000006243 chemical reaction Methods 0.000 claims description 3
- 230000003247 decreasing effect Effects 0.000 claims description 3
- 230000006870 function Effects 0.000 description 35
- 238000004590 computer program Methods 0.000 description 7
- 238000012545 processing Methods 0.000 description 4
- 238000001816 cooling Methods 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 238000004519 manufacturing process Methods 0.000 description 2
- 238000012805 post-processing Methods 0.000 description 2
- 238000010845 search algorithm Methods 0.000 description 2
- 230000002776 aggregation Effects 0.000 description 1
- 238000004220 aggregation Methods 0.000 description 1
- 238000013459 approach Methods 0.000 description 1
- 230000003796 beauty Effects 0.000 description 1
- 230000006399 behavior Effects 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000007423 decrease Effects 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 238000006073 displacement reaction Methods 0.000 description 1
- 238000007726 management method Methods 0.000 description 1
- 238000013178 mathematical model Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 238000011160 research Methods 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
- G06Q10/047—Optimisation of routes or paths, e.g. travelling salesman problem
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
- G06Q50/06—Energy or water supply
Landscapes
- Business, Economics & Management (AREA)
- Engineering & Computer Science (AREA)
- Human Resources & Organizations (AREA)
- Economics (AREA)
- Strategic Management (AREA)
- Physics & Mathematics (AREA)
- Health & Medical Sciences (AREA)
- Theoretical Computer Science (AREA)
- Marketing (AREA)
- General Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- Tourism & Hospitality (AREA)
- Game Theory and Decision Science (AREA)
- Quality & Reliability (AREA)
- Operations Research (AREA)
- Entrepreneurship & Innovation (AREA)
- Development Economics (AREA)
- Public Health (AREA)
- Water Supply & Treatment (AREA)
- General Health & Medical Sciences (AREA)
- Primary Health Care (AREA)
- Supply And Distribution Of Alternating Current (AREA)
Abstract
The invention discloses a power transmission network wiring diagram generation method which comprises an initial diagram forming method and an incremental diagram forming method. The invention realizes an automatic mapping method by using a computer, has higher mapping efficiency and strong practicability, and greatly reduces the labor cost.
Description
Technical Field
The invention relates to a method and a system for generating a power transmission network wiring diagram, and belongs to the field of power transmission line networks.
Background
The transmission network wiring diagram can reflect the topological situation between a plant station and a line, is a common reference for departments of scheduling, overhauling, planning and the like of a power grid, and has more applications in real-time scheduling and production management. In recent years, with the rapid development of national power grids, the number and the scale of plant lines are larger and larger, and the related technologies of computers are rapidly developed, so that the automatic generation of related power transmission network wiring diagrams by using computers is a hot problem in current research, but no corresponding power transmission network wiring diagram generation method exists at present.
Disclosure of Invention
The invention provides a method and a system for generating a power transmission network wiring diagram, which solve the problems disclosed in the background technology.
In order to solve the technical problems, the technical scheme adopted by the invention is as follows:
a power transmission network wiring diagram generation method comprises an initial diagram forming method and an incremental diagram forming method;
the initial mapping method comprises the following steps:
calculating the size of a canvas according to the number of stations to obtain the canvas;
obtaining the coordinates of the plant on the canvas by adopting a recursive quadripartion algorithm according to the longitude and latitude of the plant;
performing line planning according to coordinates of a factory station on the canvas, and calculating planning cost of each line and total planning cost of all lines;
re-planning the lines with the planning cost larger than the threshold value, re-calculating the planning cost of the lines and the total planning cost of all the lines, if the total planning cost is smaller than the total planning cost of the last time, repeating the step, and otherwise, obtaining a power transmission network wiring diagram;
the incremental mapping method comprises the following steps:
converting the latitude and longitude of the newly added station into coordinates on the existing canvas;
moving the coordinates of the newly added plant station by adopting a force guiding algorithm and a simulated annealing algorithm to obtain the final coordinates of the newly added plant station;
planning newly added lines according to the final coordinates of the newly added plant stations, and calculating the planning cost of each newly added line and the total planning cost of all newly added lines;
and re-planning the newly-added lines with the planning cost larger than the threshold value, re-calculating the planning cost of the newly-added lines and the total planning cost of all the newly-added lines, repeating the steps if the total planning cost is smaller than the total planning cost of the last time, and otherwise, obtaining a power transmission network wiring diagram.
The formula for calculating the size of the canvas is,
S＝height*width
wherein S is the canvas area;
The latitude and longitude of the newly added station is converted into the coordinate on the existing canvas, the formula is as follows,
n_x＝(x-min_x)*(width-2*step)/(max_x-min_x)
n_y＝(y-min_y)*(height-2*step)/(max_y-min_y)
the method comprises the steps of acquiring a coordinate of a newly added station, acquiring a coordinate of the newly added station, acquiring a grid step length of the newly added station, acquiring a height of the newly added station, acquiring a maximum longitude coordinate and a minimum longitude coordinate of the newly added station, and acquiring a maximum latitude coordinate and a minimum latitude coordinate of the newly added station.
And in response to the fact that the plurality of stations are only associated with the stations at the two ends of the corresponding line, the longitude and the latitude of the station are moved to the middle positions of the stations at the two ends, and then the coordinates of the stations on the canvas are calculated by adopting a recursive quadripartion algorithm.
The coordinates of the factory standing on the canvas are calculated by adopting a recursive quadripartion algorithm, and the specific process is that,
dividing the plant station into four parts according to the longitude and latitude of the plant station, and averagely dividing the canvas into four corresponding parts; repeating the step for each plant station and one corresponding canvas until the number of the plant stations corresponding to each canvas is 1;
and taking the grid point with the minimum cross cost in the canvas as the coordinate of the corresponding station.
The method adopts a force guide algorithm and a simulated annealing algorithm to move the coordinates of the newly added plant station to obtain the final coordinates of the newly added plant station, and comprises the following specific processes,
s1) calculating the repulsion force between the corresponding point of the newly added station on the canvas and other points, and calculating the attraction force between the corresponding point of the newly added station on the canvas and the point connected with the new station by the edge;
s2) calculating the resultant force y of the repulsion force and the attraction force corresponding to the newly added stationRepelling-yGuiding device(ii) a Wherein y isRepelling、yGuiding deviceRespectively repulsion force and attraction force;
s3) calculating the moving position (u.x + min (t, y) of the newly added station according to the current position (u.x, u.y) of the corresponding point of the newly added station, the current temperature t and the resultant forceRepelling-yGuiding device),u.y+min(t,yRepelling-yGuiding device))；
S4) in response to the current temperature not being the minimum value, decreasing the temperature according to a preset rule, proceeding to step S1; and responding to the situation that the current temperature is the minimum value, and setting the moving position of the newly added station as the final coordinate of the newly added station.
In the course of the route planning process,
a. sequentially planning the lines according to a preset priority;
b. separately planning a T-junction circuit and a common circuit, wherein for the T-junction circuit, a T node position is selected, and then the T-junction circuit is planned according to the common circuit;
c. and planning only one line of a plurality of lines with the same starting end and stopping end, synchronizing the planned line by the rest lines, and adding respective middle inflection points to perform line deviation.
According to the coordinates of a factory station on the canvas, planning the lines by adopting an A-star algorithm, and calculating the planning cost of each line and the total planning cost of all the lines;
the planning cost is formulated as follows,
f(x′)＝h(x′)+g(x′)
wherein f (x ') is the planning cost of the line x', h (x ') is the heuristic function of the line x', and g (x ') is the cost function of the line x';
g(x′)＝ti＝ti-1+min(ω1f1+ω2f2+ω3f3+ω4f4)
wherein, tiAt the minimum cost, t, from line start to end ii-1At the minimum cost, ω, from the line start to line node i-11、ω2、ω3、ω4Are respectively f1、f2、f3、f4Weight of (f)1、f2、f3、f4Are respectively provided withAs a line crossing function, a line corner function, a region impact function and a path length function.
A power transmission network wiring diagram generation system comprises an initial mapping system and an incremental mapping system;
the initial mapping system comprises:
the canvas size calculating module: calculating the size of a canvas according to the number of stations to obtain the canvas;
factory station canvas coordinate module: obtaining the coordinates of the plant on the canvas by adopting a recursive quadripartion algorithm according to the longitude and latitude of the plant;
a first planning cost module: performing line planning according to coordinates of a factory station on the canvas, and calculating planning cost of each line and total planning cost of all lines;
a first planning iteration module: re-planning the lines with the planning cost larger than the threshold value, re-calculating the planning cost of the lines and the total planning cost of all the lines, if the total planning cost is smaller than the total planning cost of the last time, repeating the step, and otherwise, obtaining a power transmission network wiring diagram;
the incremental mapping system comprises:
a latitude and longitude conversion module: converting the latitude and longitude of the newly added station into coordinates on the existing canvas;
a coordinate moving module: moving the coordinates of the newly added plant station by adopting a force guiding algorithm and a simulated annealing algorithm to obtain the final coordinates of the newly added plant station;
a second planning cost module: planning newly added lines according to the final coordinates of the newly added plant stations, and calculating the planning cost of each newly added line and the total planning cost of all newly added lines;
a second planning iteration module: and re-planning the newly-added lines with the planning cost larger than the threshold value, re-calculating the planning cost of the newly-added lines and the total planning cost of all the newly-added lines, repeating the steps if the total planning cost is smaller than the total planning cost of the last time, and otherwise, obtaining a power transmission network wiring diagram.
A computer readable storage medium storing one or more programs, the one or more programs comprising instructions, which when executed by a computing device, cause the computing device to perform a grid wiring diagram generation method.
The invention achieves the following beneficial effects: the invention realizes an automatic mapping method by using a computer, has higher mapping efficiency and strong practicability, and greatly reduces the labor cost.
Drawings
FIG. 1 is a flow chart of an initial mapping method;
FIG. 2 is a flow chart diagram of an incremental mapping method.
Detailed Description
The invention is further described below with reference to the accompanying drawings. The following examples are only for illustrating the technical solutions of the present invention more clearly, and the protection scope of the present invention is not limited thereby.
As shown in fig. 1, a power transmission network wiring diagram generation method includes an initial diagram generation method and an incremental diagram generation method.
The initial mapping method, namely the first mapping, originally has no map, and the specific steps comprise:
step 1, calculating the size of a canvas according to the number of stations to obtain the canvas.
Determining the size and layout density of the grid, and calculating the size of the canvas according to the maximum coordinate and the minimum coordinate of the plant and the number of lines of the plant, wherein the specific formula is as follows:
the formula for calculating the size of the canvas is,
S＝height*width
wherein S is the canvas area;
The latitude and longitude of the newly added station is converted into the coordinate on the existing canvas, the formula is as follows,
n_x＝(x-min_x)*(width-2*step)/(max_x-min_x)
n_y＝(y-min_y)*(height-2*step)/(max_y-min_y)
the method comprises the steps of acquiring a coordinate of a newly added station, acquiring a coordinate of the newly added station, acquiring a grid step length of the newly added station, acquiring a height of the newly added station, acquiring a maximum longitude coordinate and a minimum longitude coordinate of the newly added station, and acquiring a maximum latitude coordinate and a minimum latitude coordinate of the newly added station.
And 2, obtaining the coordinates of the plant on the canvas by adopting a recursive quadripartion algorithm according to the longitude and latitude of the plant.
The specific process is as follows:
21) dividing the plant station into four parts according to the longitude and latitude of the plant station, particularly dividing the plant station into four parts, namely, upper left, lower left, upper right and lower right parts according to the geographic position (the longitude and latitude), and equally dividing the canvas into four corresponding parts, namely, upper left, lower left, upper right and lower right parts (each plant station corresponds to each canvas one by one, namely, the upper left corresponds to the upper left, the lower left corresponds to the lower left, the upper right corresponds to the upper right, and the lower right corresponds to the lower right); the step is repeated for each factory station and one corresponding canvas until the number of factory stations corresponding to each canvas is 1, so that the canvas is fully utilized, the relative position can be guaranteed, and the phenomenon of excessive density can not occur.
22) And taking the grid point with the minimum cross cost in the canvas as the coordinate of the corresponding station.
In order to ensure that excessive corners or curved paths cannot appear in the following route planning, if a plurality of plant stations are only associated with plant stations at two ends of a corresponding route, the longitude and latitude of the plant stations are moved to the middle positions of the plant stations at the two ends, then the coordinates of the plant stations on the canvas are calculated by adopting a recursive four-division algorithm, and the compromise is that the canvas is attractive in wiring due to the fact that local relative position is lost.
And 3, planning the lines by adopting an A-star algorithm according to the coordinates of the plant on the canvas, and calculating the planning cost of each line and the total planning cost of all the lines.
The line planning after the position layout of the plant planning is finished directly determines the aesthetic degree of the graph. If the lines are directly connected, a great number of intersections are generated and the appearance is not attractive. When the number of lines increases, the number of intersections increases exponentially. Therefore, an efficient global circuit planning algorithm is needed to realize the beautiful layout of the circuit. Common line planning algorithms include Dijkstra algorithm, Bellman-ford algorithm, Floyd-Warshall algorithm, SPFA algorithm, Lee's maze algorithm and A-search algorithm. The algorithm a adopted here is a heuristic search algorithm, and is the most effective algorithm in solving the shortest path. The method has the advantages of flexible algorithm, high efficiency and the like.
The goal of route planning is the following:
A) the line intersection and the inflection point are as few as possible, and the inflection point is not on line as much as possible;
B) the circuit is horizontal and vertical as much as possible, and the outgoing line and the incoming line are 0 degree, 30 degrees, 45 degrees, 60 degrees and 90 degrees;
C) the overlapping lines among the lines are as few as possible except for the overlapping of outgoing lines and incoming lines;
D) all nodes must be on a mesh point.
In the design cost function model a-x algorithm, a set of route planning cost model needs to be constructed. In the a-algorithm, the heuristic function and the cost function determine the trend of the line. And the heuristic function is used for controlling the behavior of the A-algorithm and guiding the A-algorithm to approach the target node quickly. The cost function plays a major role in path planning in the a-algorithm, which determines how a path intermediate between two points should be planned.
The minimum cost t from the line start to end i is as followsi：
ti＝ti-1+min(ω1f1+ω2f2+ω3f3+ω4f4)
Wherein, ti-1At the minimum cost, ω, from the line start to line node i-11、ω2、ω3、ω4Are respectively f1、f2、f3、f4Weight of (f)1、f2、f3、f4Respectively a line crossing function, a line corner function, a region impact function and a path length function.
Line crossing function f1＝a1m+b1n+c1(b1＞a1) N is the number of lines of different voltage classes, m is the number of lines of the same voltage class, a1、b1Are all weighted by b1＞a1The condition of (2) is limited, so that in the line planning, the crossing of lines with the same voltage class is avoided as much as possible, and the condition that the lines with different voltage classes are not crossed is selected; c. C1Is a constant influencing factor, the main function of which is to adjust f1The weight magnitude of the function.
Line corner function
a2、b2、c2、d2、e2、g2Weights for different line shapes. If the line is an outgoing line, f20; in the latter cases, different weight values are used, and in different cases, different trends are selected. In addition, in the route planning, the situation that the road is flat and vertical and has few turns is more inclined for the sake of beauty. Therefore, in the following six cases, a2This is the best and a2The value of (d) is minimal; the other weight values need to be set to different values according to different route planning requirements.
Regional influence function f3＝a3·F(P,E)+b3·F(Q,E)+c3(a3＞b3)，
F (P, E) are respectively a line starting end P (x)p,yp) To line intermediate node E (x)e,ye) F (Q, E) is the line end stop Q (x)q,yq) To line intermediate node E (x)e,ye) A connection function of3、b3Are all weights, c3Is a constant impact factor;
path length function f4＝a4D, the function of the path length function is to record the path length of the line, which can reduce the number of unnecessary steps between lines. When the starting ends and the stopping ends of the two lines are consistent, the condition that the path length is small is preferentially selected; wherein, a4Is the weight coefficient of the path length function, and d is the length of the path.
The core of the a-algorithm is how to compute the cost function, which determines the position of each intermediate node from the start to the end.
The planning cost formula is as follows:
f(x′)＝h(x′)+g(x′)
where f (x ') is the planning cost of the line x', h (x ') is the heuristic function of the line x', generally taking manhattan distance, chebyshev distance, euclidean distance, or squared euclidean distance as the main function, if h (x ') is 0, the a × algorithm degenerates to Dijkstra algorithm, and g (x') is the cost function g (x ') of the line x', t ═ ti＝ti-1+min(ω1f1+ω2f2+ω3f3+ω4f4) The heuristic function is set to be the euclidean distance. And finally obtaining the route plan of the plant station based on the A-star algorithm and by combining the mathematical model.
In the course of the route planning process,
a. and sequentially planning the lines according to the preset priority.
b. Separately planning a T-junction circuit and a common circuit, wherein for the T-junction circuit, a T node position is selected, and then the T-junction circuit is planned according to the common circuit;
c. and planning only one line of a plurality of lines with the same starting end and stopping end, synchronizing the planned line by the rest lines, and adding respective middle inflection points to perform line deviation.
The specific route plan is described as follows:
1) single line path planning
Since the a-x algorithm does not consider the sorting condition of the following lines, the sorting of each line affects the path planning result of the following lines, and therefore the line planning sequence in different sequences also affects the result and efficiency of the line layout. Therefore, the sorting order of the lines is to be sorted, and the distance between two nodes in the canvas, the voltage level of the lines, the outgoing angle of the line nodes and the like can be considered in the sorting.
The lines which are sorted in advance are processed in sequence, and the lines with high voltage levels are preferentially wired. Setting a voltage threshold value, and if the voltage threshold value is higher than the voltage threshold value, leading out the wire in 8 directions such as the upper, lower, left and right directions and 45-degree angles in all directions; otherwise, the outlet direction is increased by 16 directions such as 30 degrees and 60 degrees. And (4) realizing the route planning from the starting end to the ending end by using an A-x algorithm to obtain the middle inflection point of the route.
2) T-wire planning
In lines with voltage class of 110kv and below, there are T-connections, which is a special case in power transmission lines, which is characterized by one end connected directly to a main line, rather than a direct station. Therefore, in the plant layout and the line planning, the ordinary line layout is performed first, the position of the T-junction is determined after the layout, and then the T-junction line planning is performed. Therefore, in the planning, the T-junction and the T-connection are separated first and then laid out.
The position of a T node is selected in a main line in a T-connection line according to a certain rule, and the position of the T node is selected to ensure that the T-connection line is attractive in planning. And after the position of the T node is updated, the T-connection circuit is subjected to line planning according to the planning rule of the common line.
3) Setting line offset to duplicate paths
In order to improve the power transmission stability and reliability of the power transmission line, a plurality of power transmission lines adopt double-loop and multi-loop power transmission, so that the condition that starting stations and stopping stations in the power transmission lines are consistent exists. For example, the starting point of the two transmission lines is the first station and the end point is the second station, such as the first line and the second line. In order to make the line planning undisturbed, in the case of double-loop and multi-loop lines as referred to above, the repeated lines are first filtered out, leaving only one line to be planned. And finally, adding the calculated middle inflection point of the line into the line of the same start-stop station.
Because of some defects of the a-algorithm in the route planning process, the layout of a single route is proper, and the overall layout is not good enough, so the function of route planning post-processing needs to be added: direct connection under the condition of not increasing intersection is considered for the condition that the distance between two points is short; two lines are re-laid aiming at the condition that one line affects the planning results of other lines; and moving the point to a proper position for direct connection aiming at the condition that only one station is associated.
And 4, re-planning the lines with the planning cost larger than the threshold value (also adopting an A-algorithm), re-calculating the planning cost of the lines and the total planning cost of all the lines, repeating the steps if the total planning cost is smaller than the total planning cost of the last time, and otherwise, obtaining a power transmission network wiring diagram.
The incremental mapping method comprises the following steps:
A1) and converting the latitude and longitude of the newly added station into the coordinates on the existing canvas.
A2) And moving the coordinates of the newly added plant station by adopting a force guiding algorithm and a simulated annealing algorithm to obtain the final coordinates of the newly added plant station.
The specific process is as follows:
s1) calculating the repulsion force between the corresponding point of the newly added station on the canvas and other points, and calculating the attraction force between the corresponding point of the newly added station on the canvas and the point connected with the new station by the edge;
s2) calculating the resultant force y of the repulsion force and the attraction force corresponding to the newly added stationRepelling-yGuiding device(ii) a Wherein y isRepelling、yGuiding deviceRespectively repulsion force and attraction force;
s3) calculating the moving position (u.x + min (t, y) of the newly added station according to the current position (u.x, u.y) of the corresponding point of the newly added station, the current temperature t and the resultant forceRepelling-yGuiding device),u.y+min(t,yRepelling-yGuiding device))；
S4) in response to the current temperature not being the minimum value, decreasing the temperature according to a preset rule (a rule based on the initial temperature and the cooling rate), proceeding to step S1; and responding to the situation that the current temperature is the minimum value, and setting the moving position of the newly added station as the final coordinate of the newly added station.
In the position deviation of the points for a certain number of times, the position is adjusted more and more slightly as the number of iterations increases, and the layout between the graphs becomes better and better. In the simulated annealing algorithm, the initial temperature and cooling rate are given to limit the maximum displacement of the spot. As the temperature decreases, the shift in position becomes more and more subtle, so that the pattern eventually attains a relatively stable state.
A3) And (4) planning the newly added lines according to the final coordinates of the newly added plant stations, and calculating the planning cost of each newly added line and the total planning cost of all the newly added lines (similar to the step 3).
A4) And (4) replanning the newly-added lines with the planning cost larger than the threshold value, recalculating the planning cost of the newly-added lines and the total planning cost of all the newly-added lines, repeating the step if the total planning cost is smaller than the total planning cost of the last time, and otherwise, obtaining a power transmission network wiring diagram (similar to the step 4).
The obtained power transmission network wiring diagram may be in a condition of point layout aggregation, so the power transmission network wiring diagram also needs to be scanned by adopting a window scanning algorithm (namely, the diagram is subjected to post-processing), and the main function of the power transmission network wiring diagram is to correct individual plant stations and lines aiming at the condition of unreasonable line planning (correct all unreasonable plant stations and lines aiming at the power transmission network wiring diagram obtained by the initial mapping method; correct all unreasonable new plant stations and lines aiming at the power transmission network wiring diagram obtained by the incremental mapping method); the method specifically comprises the following steps:
1) setting the size of a window, and setting thresholds of the number of stations and the number of lines in the area;
2) scanning whether the number of stations and the number of lines with each station as a center meet a threshold value or not;
3) if the factory station line reaches the moving standard, shifting the factory station with the most factory station lines in the area in the defined area; and if the threshold value is not reached, directly moving to the next station node.
The method realizes an automatic mapping method by using a computer, has higher mapping efficiency and strong practicability, and greatly reduces the labor cost.
A power transmission network wiring diagram generation system comprises an initial mapping system and an incremental mapping system;
the initial mapping system comprises:
the canvas size calculating module: calculating the size of a canvas according to the number of stations to obtain the canvas;
factory station canvas coordinate module: obtaining the coordinates of the plant on the canvas by adopting a recursive quadripartion algorithm according to the longitude and latitude of the plant;
a first planning cost module: performing line planning according to coordinates of a factory station on the canvas, and calculating planning cost of each line and total planning cost of all lines;
a first planning iteration module: re-planning the lines with the planning cost larger than the threshold value, re-calculating the planning cost of the lines and the total planning cost of all the lines, if the total planning cost is smaller than the total planning cost of the last time, repeating the step, and otherwise, obtaining a power transmission network wiring diagram;
the incremental mapping system comprises:
a latitude and longitude conversion module: converting the latitude and longitude of the newly added station into coordinates on the existing canvas;
a coordinate moving module: moving the coordinates of the newly added plant station by adopting a force guiding algorithm and a simulated annealing algorithm to obtain the final coordinates of the newly added plant station;
a second planning cost module: planning newly added lines according to the final coordinates of the newly added plant stations, and calculating the planning cost of each newly added line and the total planning cost of all newly added lines;
a second planning iteration module: and re-planning the newly-added lines with the planning cost larger than the threshold value, re-calculating the planning cost of the newly-added lines and the total planning cost of all the newly-added lines, repeating the steps if the total planning cost is smaller than the total planning cost of the last time, and otherwise, obtaining a power transmission network wiring diagram.
A computer readable storage medium storing one or more programs, the one or more programs comprising instructions, which when executed by a computing device, cause the computing device to perform a grid wiring diagram generation method.
A computing device comprising one or more processors, memory, and one or more programs stored in the memory and configured to be executed by the one or more processors, the one or more programs comprising instructions for performing a grid wiring diagram generation method.
As will be appreciated by one skilled in the art, embodiments of the present application may be provided as a method, system, or computer program product. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present application may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The present application is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the application. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
The present invention is not limited to the above embodiments, and any modifications, equivalent replacements, improvements, etc. made within the spirit and principle of the present invention are included in the scope of the claims of the present invention which are filed as the application.
Claims (10)
1. A power transmission network wiring diagram generation method is characterized in that: the method comprises an initial mapping method and an incremental mapping method;
the initial mapping method comprises the following steps:
calculating the size of a canvas according to the number of stations to obtain the canvas;
obtaining the coordinates of the plant on the canvas by adopting a recursive quadripartion algorithm according to the longitude and latitude of the plant;
performing line planning according to coordinates of a factory station on the canvas, and calculating planning cost of each line and total planning cost of all lines;
re-planning the lines with the planning cost larger than the threshold value, re-calculating the planning cost of the lines and the total planning cost of all the lines, if the total planning cost is smaller than the total planning cost of the last time, repeating the step, and otherwise, obtaining a power transmission network wiring diagram;
the incremental mapping method comprises the following steps:
converting the latitude and longitude of the newly added station into coordinates on the existing canvas;
moving the coordinates of the newly added plant station by adopting a force guiding algorithm and a simulated annealing algorithm to obtain the final coordinates of the newly added plant station;
planning newly added lines according to the final coordinates of the newly added plant stations, and calculating the planning cost of each newly added line and the total planning cost of all newly added lines;
and re-planning the newly-added lines with the planning cost larger than the threshold value, re-calculating the planning cost of the newly-added lines and the total planning cost of all the newly-added lines, repeating the steps if the total planning cost is smaller than the total planning cost of the last time, and otherwise, obtaining a power transmission network wiring diagram.
2. A method of generating a grid connection diagram according to claim 1, wherein: the formula for calculating the size of the canvas is,
S＝height*width
wherein S is the canvas area;
3. A method of generating a grid connection diagram according to claim 1, wherein: the latitude and longitude of the newly added station is converted into the coordinate on the existing canvas, the formula is as follows,
n_x＝(x-min_x)*(width-2*step)/(max_x-min_x)
n_y＝(y-min_y)*(height-2*step)/(max_y-min_y)
the method comprises the steps of acquiring a coordinate of a newly added station, acquiring a coordinate of the newly added station, acquiring a grid step length of the newly added station, acquiring a height of the newly added station, acquiring a maximum longitude coordinate and a minimum longitude coordinate of the newly added station, and acquiring a maximum latitude coordinate and a minimum latitude coordinate of the newly added station.
4. A method of generating a grid connection diagram according to claim 1, wherein: and in response to the fact that the plurality of stations are only associated with the stations at the two ends of the corresponding line, the longitude and the latitude of the station are moved to the middle positions of the stations at the two ends, and then the coordinates of the stations on the canvas are calculated by adopting a recursive quadripartion algorithm.
5. A method of generating a grid connection diagram according to claim 1 or 4, wherein: the coordinates of the factory standing on the canvas are calculated by adopting a recursive quadripartion algorithm, and the specific process is that,
dividing the plant station into four parts according to the longitude and latitude of the plant station, and averagely dividing the canvas into four corresponding parts; repeating the step for each plant station and one corresponding canvas until the number of the plant stations corresponding to each canvas is 1;
and taking the grid point with the minimum cross cost in the canvas as the coordinate of the corresponding station.
6. A method of generating a grid connection diagram according to claim 1, wherein: the method adopts a force guide algorithm and a simulated annealing algorithm to move the coordinates of the newly added plant station to obtain the final coordinates of the newly added plant station, and comprises the following specific processes,
s1) calculating the repulsion force between the corresponding point of the newly added station on the canvas and other points, and calculating the attraction force between the corresponding point of the newly added station on the canvas and the point connected with the new station by the edge;
s2) calculating the resultant force y of the repulsion force and the attraction force corresponding to the newly added stationRepelling-yGuiding device(ii) a Wherein y isRepelling、yGuiding deviceRespectively repulsion force and attraction force;
s3) calculating the moving position (u.x + min (t, y) of the newly added station according to the current position (u.x, u.y) of the corresponding point of the newly added station, the current temperature t and the resultant forceRepelling-yGuiding device),u.y+min(t,yRepelling-yGuiding device))；
S4) in response to the current temperature not being the minimum value, decreasing the temperature according to a preset rule, proceeding to step S1; and responding to the situation that the current temperature is the minimum value, and setting the moving position of the newly added station as the final coordinate of the newly added station.
7. A method of generating a grid connection diagram according to claim 1, wherein: in the course of the route planning process,
a. sequentially planning the lines according to a preset priority;
b. separately planning a T-junction circuit and a common circuit, wherein for the T-junction circuit, a T node position is selected, and then the T-junction circuit is planned according to the common circuit;
c. and planning only one line of a plurality of lines with the same starting end and stopping end, synchronizing the planned line by the rest lines, and adding respective middle inflection points to perform line deviation.
8. A method of generating a grid connection diagram according to claim 1, wherein: according to the coordinates of a factory station on the canvas, planning the lines by adopting an A-star algorithm, and calculating the planning cost of each line and the total planning cost of all the lines;
the planning cost is formulated as follows,
f(x′)＝h(x′)+g(x′)
wherein f (x ') is the planning cost of the line x', h (x ') is the heuristic function of the line x', and g (x ') is the cost function of the line x';
g(x′)＝ti＝ti-1+min(ω1f1+ω2f2+ω3f3+ω4f4)
wherein, tiAt the minimum cost, t, from line start to end ii-1At the minimum cost, ω, from the line start to line node i-11、ω2、ω3、ω4Are respectively f1、f2、f3、f4Weight of (f)1、f2、f3、f4Respectively a line crossing function, a line corner function, a region impact function and a path length function.
9. A power transmission network wiring diagram generation system is characterized in that: the method comprises an initial mapping system and an incremental mapping system;
the initial mapping system comprises:
the canvas size calculating module: calculating the size of a canvas according to the number of stations to obtain the canvas;
factory station canvas coordinate module: obtaining the coordinates of the plant on the canvas by adopting a recursive quadripartion algorithm according to the longitude and latitude of the plant;
a first planning cost module: performing line planning according to coordinates of a factory station on the canvas, and calculating planning cost of each line and total planning cost of all lines;
a first planning iteration module: re-planning the lines with the planning cost larger than the threshold value, re-calculating the planning cost of the lines and the total planning cost of all the lines, if the total planning cost is smaller than the total planning cost of the last time, repeating the step, and otherwise, obtaining a power transmission network wiring diagram;
the incremental mapping system comprises:
a latitude and longitude conversion module: converting the latitude and longitude of the newly added station into coordinates on the existing canvas;
a coordinate moving module: moving the coordinates of the newly added plant station by adopting a force guiding algorithm and a simulated annealing algorithm to obtain the final coordinates of the newly added plant station;
a second planning cost module: planning newly added lines according to the final coordinates of the newly added plant stations, and calculating the planning cost of each newly added line and the total planning cost of all newly added lines;
a second planning iteration module: and re-planning the newly-added lines with the planning cost larger than the threshold value, re-calculating the planning cost of the newly-added lines and the total planning cost of all the newly-added lines, repeating the steps if the total planning cost is smaller than the total planning cost of the last time, and otherwise, obtaining a power transmission network wiring diagram.
10. A computer readable storage medium storing one or more programs, characterized in that: the one or more programs include instructions that, when executed by a computing device, cause the computing device to perform any of the methods of claims 1-8.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010690559.7A CN111931993A (en) | 2020-07-17 | 2020-07-17 | Power transmission network wiring diagram generation method and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010690559.7A CN111931993A (en) | 2020-07-17 | 2020-07-17 | Power transmission network wiring diagram generation method and system |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN111931993A true CN111931993A (en) | 2020-11-13 |
Family
ID=73313258
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010690559.7A Pending CN111931993A (en) | 2020-07-17 | 2020-07-17 | Power transmission network wiring diagram generation method and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111931993A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112861293A (en) * | 2021-01-19 | 2021-05-28 | 国网浙江省电力有限公司 | Power transmission network wiring diagram generation method and device and electronic equipment |
| CN118395656A (en) * | 2024-06-26 | 2024-07-26 | 江苏秉信科技有限公司 | Novel automatic power distribution network diagram forming method |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107292003A (en) * | 2017-06-06 | 2017-10-24 | 南京南瑞继保电气有限公司 | A kind of automatic generating method of electric network station wiring diagram |
| CN108897913A (en) * | 2018-05-30 | 2018-11-27 | 南京南瑞继保电气有限公司 | A method of plant stand figure is automatically generated by SCD model file |
-
2020
- 2020-07-17 CN CN202010690559.7A patent/CN111931993A/en active Pending
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107292003A (en) * | 2017-06-06 | 2017-10-24 | 南京南瑞继保电气有限公司 | A kind of automatic generating method of electric network station wiring diagram |
| CN108897913A (en) * | 2018-05-30 | 2018-11-27 | 南京南瑞继保电气有限公司 | A method of plant stand figure is automatically generated by SCD model file |
Non-Patent Citations (1)
| Title |
|---|
| 沈自虎 等: "输电网接线图增量自动成图算法", 《计算机系统应用》 * |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112861293A (en) * | 2021-01-19 | 2021-05-28 | 国网浙江省电力有限公司 | Power transmission network wiring diagram generation method and device and electronic equipment |
| CN112861293B (en) * | 2021-01-19 | 2024-05-14 | 国网浙江省电力有限公司 | Power transmission network wiring diagram generation method and device and electronic equipment |
| CN118395656A (en) * | 2024-06-26 | 2024-07-26 | 江苏秉信科技有限公司 | Novel automatic power distribution network diagram forming method |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110795908B (en) | Bus sensing overall wiring method driven by deviation | |
| CN109540136A (en) | A kind of more unmanned boat collaboration paths planning methods | |
| CN104156459B (en) | A kind of method and system of the efficient pathfinding based on identical expense grid | |
| CN102346795B (en) | Automatic quick wiring method for electric and electronic virtual experiments | |
| CN108549378A (en) | A kind of mixed path method and system for planning based on grating map | |
| CN109443364A (en) | Paths planning method based on A* algorithm | |
| CN111931993A (en) | Power transmission network wiring diagram generation method and system | |
| CN107092978B (en) | Shortest path layered planning method for virtual earth | |
| CN109472870B (en) | Model matching method based on grid reconstruction and multi-influence-domain correction | |
| CN113961004A (en) | Pirate area ship route planning method and system, electronic equipment and storage medium | |
| CN109931943B (en) | Unmanned ship global path planning method and electronic equipment | |
| CN112985408A (en) | Path planning optimization method and system | |
| CN108665117A (en) | A kind of computational methods, device, terminal device and the storage medium of interior space shortest path | |
| CN104613976A (en) | Path determination method and device | |
| CN109460564B (en) | Power grid tidal current graph wiring method | |
| CN109828579A (en) | A kind of method for planning path for mobile robot that target delta is mobile | |
| CN111080786A (en) | BIM-based indoor map model construction method and device | |
| CN102506886A (en) | Method for realizing path planning in navigation equipment | |
| CN109214596A (en) | Seek the grid shortest path AFW algorithm with direction constraint and obstacle limitation | |
| CN104182913A (en) | Power grid mode picture forming and intelligent distributing method | |
| CN104123479A (en) | Quality control method for conversion of power grid special area raster data into vector data | |
| CN112417070B (en) | Road network topology construction method and device, electronic equipment and storage medium | |
| CN109086528B (en) | Method for automatically naming netty roads in civil3d according to ordering rule | |
| CN115169279A (en) | Bus wiring method based on GoldenBit and Hanan grid updating | |
| CN116009552A (en) | Path planning method, device, equipment and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20201113 |
|
| RJ01 | Rejection of invention patent application after publication |