CN103996089B  Based on the transmission line of electricity optimal path generation method of GIS  Google Patents
Based on the transmission line of electricity optimal path generation method of GIS Download PDFInfo
 Publication number
 CN103996089B CN103996089B CN201410261003.0A CN201410261003A CN103996089B CN 103996089 B CN103996089 B CN 103996089B CN 201410261003 A CN201410261003 A CN 201410261003A CN 103996089 B CN103996089 B CN 103996089B
 Authority
 CN
 China
 Prior art keywords
 path
 barrier
 layer
 definition
 transmission line
 Prior art date
Links
 230000005540 biological transmission Effects 0.000 title claims abstract description 40
 239000010410 layers Substances 0.000 claims abstract description 96
 238000000034 methods Methods 0.000 claims abstract description 30
 239000011159 matrix materials Substances 0.000 claims abstract description 17
 230000000007 visual effect Effects 0.000 claims abstract description 13
 230000015572 biosynthetic process Effects 0.000 claims description 7
 238000005755 formation reactions Methods 0.000 claims description 7
 239000003570 air Substances 0.000 claims description 4
 280000867207 Lambda companies 0.000 claims description 3
 239000004020 conductors Substances 0.000 claims description 3
 230000000875 corresponding Effects 0.000 claims description 3
 238000007418 data mining Methods 0.000 claims description 3
 238000005065 mining Methods 0.000 claims description 3
 230000001052 transient Effects 0.000 claims description 3
 238000010586 diagrams Methods 0.000 description 6
 230000004048 modification Effects 0.000 description 3
 238000006011 modification reactions Methods 0.000 description 3
 280000174388 State Grid Corporation of China companies 0.000 description 2
 238000004891 communication Methods 0.000 description 2
 238000005516 engineering processes Methods 0.000 description 2
 239000003550 marker Substances 0.000 description 2
 238000005457 optimization Methods 0.000 description 2
 240000007594 Oryza sativa Species 0.000 description 1
 235000007164 Oryza sativa Nutrition 0.000 description 1
 230000000712 assembly Effects 0.000 description 1
 238000010276 construction Methods 0.000 description 1
 230000000694 effects Effects 0.000 description 1
 238000003379 elimination reactions Methods 0.000 description 1
 235000009566 rice Nutrition 0.000 description 1
Classifications

 Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSSSECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSSREFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
 Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
 Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
 Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management
Abstract
Description
Technical field
The present invention relates to power system transmission line design field, specifically a kind of transmission line of electricity optimal path generation method based on GIS.
Background technology
At present, in Transmission Line Design, path optimization is by designer first in indoor route selection, and after making an onthespot survey to scene, readjusts path, forms final path.But there is following defect in existing path optimization scheme:
1. traditional path design is carried out based on existing map with along path, road data, and this just causes geography information and relatively lags behind, and needs a large amount of reconnaissance trips to assist, and not only accuracy rate is low, also add workload.
2. traditional path design completes on paper drawing, and workload is large, and amendment is comparatively complicated.
3. the factor affecting line route is various, and comprise topography and geomorphology, landuse style, scissors crossing, execution conditions etc., traditional path design can not consider these factors as a whole.
Summary of the invention
For abovementioned the deficiencies in the prior art, the invention provides a kind of transmission line of electricity optimal path generation method based on GIS, it not only has the function avoided barrier, optimize generation pass, but also possesses the function such as path and corner number statistics.
The present invention solves the technical scheme that its technical matters takes: a kind of transmission line of electricity optimal path generation method based on GIS, is characterized in that, comprise the following steps:
(1) determine the Origin And Destination in transmission line of electricity path: the Origin And Destination in transmission line of electricity path is Liang Ge transformer station, provide substation location and transformer station's line direction by Substation Design personnel, and mark in GIS map;
(2) transmission line of electricity passage zone scope is extracted: the air line distance measuring Origin And Destination, rightangle triangle is formed with North and South direction on map and eastwest direction, obtain the distance of this rightangle triangle horizontal sides and vertical edge, and these two distances are added 2 backward upper round numbers respectively, passage zone scope can be obtained;
(3) process GIS map: GIS map is at least divided into barrier zone layer, topography and geomorphology layer and road circuit layer three layer, each layer is respectively containing a class GIS information, and All Layers superposes mutually in the same coordinate system;
(4) adopt minimum area Rectangular Bounding Volume method process barrier zone and be configured to Visual Graph: the method adopting minimum area Rectangular Bounding Volume to surround barrier zone is carried out the barrier zone in process barrier zone layer and represented barrier zone by Rectangular Bounding Volume;
(5) the asking for of optimal path: firstselection is asked for and feasible kept away barrier path, then constructions cost matrix, what finally adopt dijkstra's algorithm to calculate shortest path keeps away barrier path, thus obtains the optimal path of transmission line of electricity;
(6) add up corner number and scissors crossing number of times: by transmission line of electricity optimal path corner number and scissors crossing number of times sum up statistics respectively.
In said method, the forming process of described barrier zone layer is:
1) factor being judged as barrier zone is determined: describedly determine to be judged as that the factor of barrier zone comprises the factors such as landuse style, local plan, geology and ice formation;
2) by GIS information sifting barrier zone: if landuse style is military installations, large industrial enterprise or residential block, or local plan is wilderness area or scenic spot, or geology is geologic hazard band, unfavorable geology band or mining influence district, and ice formation is that the area of heavy icing area is all considered as barrier zone;
3) barrier zone layer is formed: the barrier zone of abovementioned screening is incorporated into a newlybuilt layer and forms barrier zone layer.
In said method, the process adopting minimum area Rectangular Bounding Volume method process barrier zone is the boundary rectangle first adopting AABB method to obtain barrier profile, i.e. the rectangle that forms of minimax x coordinate and minimax y coordinate; Then by arbitrarily angled for rotation of coordinate θ, make the area rotating rear encirclement barrier be minimum, the boundary rectangle of minimum area is the minimum area Rectangular Bounding Volume of barrier profile, wherein, θ with π/180 for steplength increases progressively, and θ ∈ [0, pi/2].
In said method, described in ask for feasible process of keeping away barrier path and be:
1) basic definition
Definition 1: establish v _{i}=(x _{i}, y _{i}) (i=1,2 ..., m), v _{1}=v _{m+1}barrier zone layer R _{1} ^{2}on fixed point, if to any i, j (i ≠ j), i, j=1,2 ..., m, line segment v _{i}v _{i+1}with v _{j}v _{j+1}or it is adjacent and intersect at an end points or nonintersect;
Definition 2: barrier zone layer R _{1} ^{2}barrier set O is the set of simple polygon, each barrier corresponding each simple polygon number of vertex m _{i}can be different, and during i ≠ j, wherein i, j=1,2 ..., K;
Definition 3:s, j ∈ R _{1} ^{2}, become starting point and impact point respectively, point set V={s, g} ∪ V _{0}, wherein V _{0}represent that all barriers are fixed a point, V={v _{i} i=1,2 ..., n}, wherein v _{1}=s, v _{n}=g, v _{2}~ v _{n1}corresponding all barrier fixed point V _{0}a sequence; If O _{1}={ s}, O _{k}={ g};
Definition 4: at barrier zone layer R _{1} ^{2}on, definition G _{1}be the authorized graph be made up of V, the weights on limit are defined as the expansion Euclid distance between V collection two summit, are expressed as d (v _{i}, v _{j}), referred to as d _{ij}, wherein v _{i}, v _{j}∈ V;
Definition 5: establish G _{1}=(V, E), V={v _{i} i=1,2 ..., n}, E are the entirety of the equal disjoint edge c with any barrier and i ≠ j, G _{1}become Visual Graph;
2) syntople is judged
<1> establishes v _{j}∈ V and v _{i}, v _{j}∈ O _{k}, k=1,2 ..., K, calculates (v _{i}, v _{j}) (j=i, i+1 ..., m _{k}, m _{k}+ 1) weights d (v _{i}, v _{j}) can calculate by formula (2), that is:
<2> establishes V _{i}∈ O _{k}, V _{j}∈ VO _{k}, k=1,2 ..., K, j=i, i+1 ..., n, calculates limit weights d (v _{i}, v _{j}) first to judge V _{i}and V _{j}2 line segment V formed _{i}v _{j}with V _{a}and V _{a+1}the line segment V formed _{a}v _{a+1}whether intersect, calculate d (v according to crossing result _{i}, v _{j}) value.Here V _{a}, V _{a+1}∈ O _{l}, l=1,2 ..., K, a=1,2 ..., n;
<3> judges line segment V _{i}v _{j}with V _{a}v _{a+1}with or without intersection point, namely about the vector equation (3) of parameter lambda and μ:
(1λ)V _{i}+λV _{j}＝(1μ)V _{a}+μV _{a+1}(3)
Whether have λ, the solution of μ ∈ [0,1], if λ, μ be ∈, [0,1] shows nonintersect, can as path, if λ, show to intersect, not can be used as path.
In said method, the process of described constructions cost matrix is:
1) basic definition
Definition 6: definition cost [n] [n] is for comprising the Cost matrix of three map data mining platform;
Definition 7: will v be put _{i}, v _{j}move on at the topography and geomorphology layer R representing shaped area _{2} ^{2}on, definition G _{2}the authorized graph be made up of V, d ' (v _{i}, v _{j}) be revised weights;
Definition 8: will v be put _{i}, v _{j}move on at the road circuit layer R representing road circuit _{3} ^{2}on, definition c is for representing line segment V _{i}v _{j}with road circuit layer R _{3} ^{2}upper line segment scissors crossing number of times;
2) path is revised
Statistics is at various landform middle conductor V _{i}v _{j}the distance l crossed over _{n}, revise weights d (v _{i}, v _{j}) be d ' (v _{i}, v _{j})
In formula 4, f _{n}for correction factor, n is landform numbering;
3) corner is revised
T _{i}be expressed as line segment V _{i}v _{j}with V _{i1}v _{i}whether corner is there is, as d (v between (k ≠ i, k ≠ j) _{i1}, v _{i})+d (v _{i}, v _{j})=d (v _{k1}, v _{j}) then t _{i}=0, otherwise t _{i}=1;
4) scissors crossing is revised
V _{i}v _{j}line segment is at road circuit layer R _{3} ^{2}scissors crossing may be produced with one or more road or circuit, use c _{i}represent the number of times that scissors crossing occurs;
5) line segment V is constructed _{i}v _{j}cost matrix
Line segment V _{i}v _{j}cost matrix cost [i] [j] as shown in formula (5):
cost[i][j]＝d′(v _{i},v _{j})+f _{c}c _{i}+f _{t}t _{i}(5)
Wherein f _{c}for scissors crossing correction factor, f _{t}for corner correction factor.
In said method, the process of keeping away barrier path that described employing dijkstra's algorithm calculates shortest path is:
1) Origin And Destination in path is labeled as s and g respectively;
2) path starting point s is gathered stored in S, and be labeled as T summit, a shortest path of trying to achieve after each computing of S set expression;
3) state recording being communicated with node in S set with starting point s is upgraded;
4) identify and to be communicated with s and the minimum transient node of comprehensive weight, be set to T node, till T node is terminal g, otherwise continue the state recording being communicated with node during renewal S gathers with starting point s;
5) according to the information in each node connected relation and state record table, from terminal g, its preorder node is recorded, until be recorded to starting point s;
6) according to the record result of previous step, the optimal path of starting point s to terminal g can be formed.
The invention has the beneficial effects as follows: the present invention is based on GIS map information and the area being not suitable for erecting power transmission lines is considered as barrier zone, and in the same coordinate system, form barrier layer, topography and geomorphology layer, road circuit layer three layer, with minimum area Rectangular Bounding Volume method, barrier zone is processed, and complete in conjunction with Visual Graph method and keep away barrier route planning, generate the optimal path of transmission line of electricity, it not only has the function avoided barrier, optimize generation pass, but also possesses the function such as path and corner number statistics.
Accompanying drawing explanation
Fig. 1 is method flow diagram of the present invention;
Fig. 2 is the schematic diagram that passage zone of the present invention is selected;
The schematic diagram of the Rectangular Bounding Volume that Fig. 3 is the anglec of rotation of the present invention when being θ;
Fig. 4 is the Visual Graph of barrier, passage zone of the present invention layer;
Fig. 5 is the schematic diagram whether two line segments intersect that judges of the present invention;
Fig. 6 is that the present invention adopts dijkstra's algorithm to calculate the method flow diagram of shortest path.
Embodiment
For clearly demonstrating the technical characterstic of this programme, below by embodiment, and in conjunction with its accompanying drawing, the present invention will be described in detail.Disclosing hereafter provides many different embodiments or example is used for realizing different structure of the present invention.Of the present invention open in order to simplify, hereinafter the parts of specific examples and setting are described.In addition, the present invention can in different example repeat reference numerals and/or letter.This repetition is to simplify and clearly object, itself does not indicate the relation between discussed various embodiment and/or setting.It should be noted that parts illustrated in the accompanying drawings are not necessarily drawn in proportion.Present invention omits the description of known assemblies and treatment technology and process to avoid unnecessarily limiting the present invention.
As shown in Figure 1, a kind of transmission line of electricity optimal path generation method based on GIS of the present invention, it comprises the following steps:
(1) determine the Origin And Destination in transmission line of electricity path: the Origin And Destination in transmission line of electricity path is Liang Ge transformer station, provide substation location and transformer station's line direction by Substation Design personnel, and mark in GIS map;
(2) transmission line of electricity passage zone scope is extracted: the air line distance measuring Origin And Destination, rightangle triangle is formed with North and South direction on map and eastwest direction, obtain the distance of this rightangle triangle horizontal sides and vertical edge, and these two distances are added 2 backward upper round numbers respectively, passage zone scope can be obtained;
(3) process GIS map: GIS map is at least divided into barrier zone layer, topography and geomorphology layer and road circuit layer three layer, each layer is respectively containing a class GIS information, and All Layers superposes mutually in the same coordinate system;
(4) adopt minimum area Rectangular Bounding Volume method process barrier zone and be configured to Visual Graph: the method adopting minimum area Rectangular Bounding Volume to surround barrier zone is carried out the barrier zone in process barrier zone layer and represented barrier zone by Rectangular Bounding Volume;
(5) ask for feasible keeping away and hinder path;
(6) constructions cost matrix;
(7) adopt dijkstra's algorithm to calculate keeping away of shortest path and hinder path, thus obtain the optimal path of transmission line of electricity;
(8) add up corner number and scissors crossing number of times: by transmission line of electricity optimal path corner number and scissors crossing number of times sum up statistics respectively.
Explanation is described in further detail to the present invention below.
1, determine that path starting point and terminal and passage zone scope are selected
(1) path Origin And Destination is determined
The Origin And Destination of line route is Liang Ge transformer station.There is provided substation location (transformer station's center position) and transformer station's line direction by Substation Design personnel, marked in GIS map by computing machine, and Bi Jingdian position, path (manually inputting) can be accepted according to requirement of engineering.
(2) passage zone scope is selected
Measure the air line distance (unit km, lower same) of Origin And Destination, do rightangle triangle with North and South direction on map and eastwest direction.Obtain the distance of time triangle horizontal sides and vertical edge.These two distances are added 2 respectively, and the number that rounds up, passage zone scope can be obtained.As shown in Figure 2.The path domain coordinate obtained continues to use GIS map default coordinate.
2, the process of GIS map
GIS map comprises this information such as all topography and geomorphologies, landuse style, scissors crossing, execution conditions in this region, each layer comprises a category information.According to this patent applicable cases, GIS map is integrated into barrier layer, topography and geomorphology layer, these three layer of road circuit layer.Three same initial points of layer, same to coordinate, superposes mutually.
(1) barrier layer (the first layer)
The area being not suitable for erecting power transmission lines can be regarded as barrier and evade.Following steps are taked to form barrier layer.
(1.1) factor (can revise according to the specific requirement of path design) being judged as barrier zone is determined
The factors such as topography and geomorphology, geology, ice formation, traffic, construction, operation and local plan should be considered during routing.According to the principle of routing, following area all can be regarded as barrier:
A) landuse style: military installations, large industrial enterprise, residential block;
B) local plan: wilderness area, scenic spot etc.;
C) geology: geologic hazard band, unfavorable geology band, mining influence district;
D) ice formation: heavy icing area.
(1.2) by GIS information sifting disturbance in judgement district
For " landuse style " this layer.To each pixel in the GIS landuse style layer in the regional extent of path, (length corresponded in reality is rice/pixel, depending on GIS map resolution) in landuse style judge, if be military installations, large industrial enterprise or residential block, then this point coordinate is labeled as barrier.
After " landuse style " layer passing marker is complete, one by one passing marker is carried out to layer such as " local plan " " geology " " ice formation ".
If certain is a bit labeled as barrier, then the scanning after can skipping in layer in layer scanning before.
(1.3) barrier layer is formed
A newlybuilt layer, is together as barrier zone by the o'clock sharp being labeled as " barrier " in ii step, and all the other points, as nonbarrier, form barrier layer (the first layer).
(2) topography and geomorphology layer (the second layer)
Known according to " State Grid Corporation of China's project of transmitting and converting electricity General Engineering Cost " that national grid is issued, the cost that different terrain landforms (level land, hills, the network of waterways and marsh, high mountain etc.) erect power transmission lines is different.This patent will reduce cost during erection path when planning optimal route path, will need to consider topography and geomorphology problem.Therefore topography and geomorphology layer is extracted as second layer.
(3) road circuit layer (the 3rd layer)
Also to avoid the path of planning and, the scissors crossing that produces such as power circuit, communication line in transmission line of electricity path planning as far as possible.Therefore using road in GIS map and wiring diagram laminated and as the 3rd layer.
The minimum rectangle bounding box of the barrier 3, within the scope of passage zone is asked for
(1) minimum area Rectangular Bounding Volume method process barrier zone.
Due to the geometry polygon that the barrier zone in the layer of barrier is not rule, in order to find the facility of optimal path below, need to surround barrier zone with the regular geometric polygon of minimum area.In this patent, minimum area Rectangular Bounding Volume is adopted to surround barrier zone.
As shown in Figure 3, AABB method is adopted to obtain the boundary rectangle of barrier profile, i.e. the rectangle that forms of minimax x coordinate and minimax y coordinate; Then by arbitrarily angled for rotation of coordinate θ (with π/180 for steplength increases progressively, and θ ∈ [0, pi/2]), the area rotating rear encirclement barrier is made to be minimum.The barrier coordinate of bounding box outline line any point under xy coordinate system closed is (x, y), and after any rotation θ, this coordinate under uv coordinate system is set to (u, v).Coordinate transform is such as formula (1):
u＝xcosθ+ysinθ
v＝ycosθxsinθ(1)
S＝(u _{max}u _{min})(v _{max}v _{min})
Obtain the boundary rectangle area S that AABB method under new uv coordinate is tried to achieve, the boundary rectangle of these external middle minimum areas is the minimum area Rectangular Bounding Volume of barrier profile.Store this coordinate of Rectangular Bounding Volume four summit under xy coordinate axis.
(2) barrier layer is configured to Visual Graph
Each barrier zone is asked for minimum area Rectangular Bounding Volume by step described in (1), then uses O _{i}represent the Rectangular Bounding Volume of barrier zone, Visual Graph is called barrier.Fig. 4 represents the Visual Graph of certain barrier, passage zone layer, and s, g become starting point and impact point respectively, O _{1}and O _{2}represent two barriers, dotted line is the feasible path from starting point s to impact point g.
4, the asking for of optimal path
This patent mainly based on the Visual Graph that barrier layer constructs, utilizes dijkstra's algorithm, consider path the weight of the geography information of process, corner and scissors crossing situation, cook up the optimal path from starting point to impact point.
(1) feasible keeping away hinders asking for of path
(1.1) basic definition
Definition 1: establish v _{i}=(x _{i}, y _{i}) (i=1,2 ..., m), v _{1}=v _{m+1}layer R _{1} ^{2}fixed point in (barrier zone layer), if to any i, j (i ≠ j), i, j=1,2 ..., m, line segment v _{i}v _{i+1}with v _{j}v _{j+1}or it is adjacent and intersect at an end points or nonintersect.
Definition 2: layer R _{1} ^{2}barrier set O is the set of simple polygon.Each barrier corresponding each simple polygon number of vertex m _{i}can be different, and during i ≠ j, wherein i, j=1,2 ..., K.
Definition 3:s, j ∈ R _{1} ^{2}, become starting point and impact point respectively.Point set V={s, g} ∪ V _{0}, wherein V _{0}represent that all barriers are fixed a point.Convenient in order to describe, if V={v _{i} i=1,2 ..., n}, wherein v _{1}=s, v _{n}=g, and v _{2}~ v _{n1}corresponding all barrier fixed point V _{0}a sequence (arranged counterclockwise); If O _{1}={ s}, O _{k}={ g}.
Definition 4: having the layer R of barrier zone _{1} ^{2}on, definition G _{1}it is the authorized graph be made up of V.Power (cost) value on limit is defined as the expansion Euclid distance between V collection two summit, is expressed as d (v _{i}, v _{j}) (referred to as d _{ij}), wherein v _{i}, v _{j}∈ V.
Definition 5: establish G _{1}=(V, E), the V entirety that 3, E is the equal disjoint edge c with any barrier as defined and i ≠ j.G _{1}adjacent summit becomes Visual Graph, because can be seen mutually in way.
(1.2) judgement of syntople
When search path, need solution two class syntople, the critical relation namely between same barrier polygon vertex and the syntople between different obstruct thing polygonal head.This two classes syntople can by judging summit line and limit (v in V _{i}, v _{j}) and barrier polygon O _{i}, i=1,2 ..., the method whether K intersects solves.
<1> establishes v _{j}∈ V and v _{i}, v _{j}∈ O _{k}, k=1,2 ..., K, calculates (v _{i}, v _{j}) (j=i, i+1 ..., m _{k}, m _{k}+ 1) weights d (v _{i}, v _{j}) can calculate by formula (2), that is:
<2> establishes V _{i}∈ O _{k}, V _{j}∈ VO _{k}, k=1,2 ..., K, j=i, i+1 ..., n, calculates limit weights d (v _{i}, v _{j}) first to judge V _{i}and V _{j}2 line segment V formed _{i}v _{j}with V _{a}and V _{a+1}the line segment V formed _{a}v _{a+1}whether intersect, calculate d (v according to crossing result _{i}, v _{j}) value.Here V _{a}, V _{a+1}∈ O _{l}, l=1,2 ..., K, a=1,2 ..., n.
<2> judges line segment V _{i}v _{j}with V _{a}v _{a+1}with or without intersection point, namely about the vector equation (3) of parameter lambda and μ, as shown in Figure 5:
(1λ)V _{i}+λV _{j}＝(1μ)V _{a}+μV _{a+1}(3)
Whether there is λ, the solution of μ ∈ [0,1].If λ, μ be ∈, [0,1] shows nonintersect, can as path, if λ, show to intersect, not can be used as path.
(2) structure of Cost matrix
(2.1) basic definition
Definition 6 definition cost [n] [n] is for comprising the Cost matrix of three map data mining platform.
Definition 7 will put v _{i}, v _{j}move on at the layer R representing shaped area _{2} ^{2}in (topography and geomorphology layer), definition G _{2}the authorized graph be made up of V, d ' (v _{i}, v _{j}) be revised weights.
Definition 8 will put v _{i}, v _{j}move on at the layer R representing road circuit _{3} ^{2}in (road circuit layer), definition c is for representing line segment V _{i}v _{j}with layer R _{3} ^{2}upper line segment (representing road and circuit) scissors crossing number of times.
(2.2) correction of path
As mentioned before, the cost that different terrain region erects power transmission lines is also different, in line with the principle reducing cost, should revise with landform to the unit length of the influence degree of cost to path.
V _{i}v _{j}line segment is at layer R _{2} ^{2}in a kind of shaped area, also may may span two or more shaped area, according to the landform of process different, correction factor is also different.Typical scenario cost in " the State Grid Corporation of China's project of transmitting and converting electricity General Engineering Cost " issued by national grid under each landform and obtain the correction factor of path planning under different terrain (correction factor can check in from table 1).
The correction factor of table 1 path planning under different terrain
Statistics is at various landform middle conductor V _{i}v _{j}the distance l crossed over _{n}, revise weights d (v _{i}, v _{j}) be d ' (v _{i}, v _{j})
(2.3) correction of corner
In path planning, circuit corner can increase cost, reduces the principle that corner is also path optimizing, so embodied with corner correction factor in Cost matrix.T _{i}be expressed as line segment V _{i}v _{j}with V _{i1}v _{i}whether corner is there is between (k ≠ i, k ≠ j).Determination methods is: as d (V _{i1}, v _{i})+d (v _{i}, v _{j})=d (V _{k1}, v _{j}) then t _{i}=0, otherwise t _{i}=1.
(2.4) correction of scissors crossing
In path planning, transmission line of electricity and other power circuits and the communication line that set up should be avoided to produce scissors crossing as far as possible.Therefore in the middle of the selection number of times of scissors crossing also being considered optimal path.V _{i}v _{j}line segment is at layer R _{3} ^{2}scissors crossing may be produced with one or more road or circuit, use c _{i}represent the number of times that scissors crossing occurs.
(2.5) structure of Cost matrix
Consider the length in path, and according to landform areal map layer R _{2} ^{2}to the correction of path, and consider the factor of circuit corner and scissors crossing, line segment V can be constructed _{i}v _{j}cost matrix cost [i] [j], as shown in formula (5):
CoSt [i] [j]=d ' (v _{i}, v _{j})+f _{c}c _{i}+ f _{t}t _{i}(5) wherein f _{c}for scissors crossing correction factor, f _{t}for corner correction factor.(scissors crossing correction factor and corner correction factor all can provide according to actual conditions.)
(4) dijkstra's algorithm calculates and keeps away barrier path
For Weighted Directed Graph G, a shortest path of trying to achieve after representing each computing with S set, during initialization, S gathers only containing a starting point, stores add the rear remaining vertex set of S set with W set.That centered by starting point, searches the shortest path in the next summit that it connects adds in S set, if the words that the path that the summit of the connection of searching connects is shorter than this path already present in S set, then replace original path, the shortest path from starting point to current point to be preserved in a word, until find terminal.
The core concept of dijkstra's algorithm outwards expands layer by layer centered by starting point, and the path selecting weights minimum from the unmarked point be connected with starting point also compares the weights on other summits.This be a recycle ratio compared with process.What this problem can use path, place landform, corner and scissors crossing situation is weighted to weights.
As shown in Figure 6, the process of keeping away barrier path adopting dijkstra's algorithm to calculate shortest path comprises the following steps:
1) Origin And Destination in path is labeled as s and g respectively;
2) path starting point s is gathered stored in S, and be labeled as T summit, a shortest path of trying to achieve after each computing of S set expression;
3) state recording being communicated with node in S set with starting point s is upgraded;
4) identify and to be communicated with s and the minimum transient node of comprehensive weight, be set to T node, till T node is terminal g, otherwise continue the state recording being communicated with node during renewal S gathers with starting point s;
5) according to the information in each node connected relation and state record table, from terminal g, its preorder node is recorded, until be recorded to starting point s;
6) according to the record result of previous step, the optimal path of starting point s to terminal g can be formed.
5, corner and scissors crossing number of times statistics
After determining optimal path, path the point of process exist in S set.The corner number in path and scissors crossing number of times are summed up can obtain according to formula 6 and formula 7
Wherein, t represents the corner number in path, and c represents the scissors crossing number of times in path.
The present invention has following characteristics:
1, path Automated Design: adopt the technical program, the Automated Design of transmission line of electricity path based on GIS can be realized, namely after determining path Origin And Destination, automatically can complete coordinates measurement, for designer's reference;
2, support manually to revise: can manually add must through point, also support designer's typing reconnaissance trip data simultaneously, and or auto modification artificial to path according to this;
3, support to add up along the line: after coordinates measurement, can according to GIS geography information, complete path length, corner number, statistics with existing crossing elimination situation.
The above is the preferred embodiment of the present invention, and for those skilled in the art, under the premise without departing from the principles of the invention, can also make some improvements and modifications, these improvements and modifications are also regarded as protection scope of the present invention.
Claims (5)
Priority Applications (1)
Application Number  Priority Date  Filing Date  Title 

CN201410261003.0A CN103996089B (en)  20140612  20140612  Based on the transmission line of electricity optimal path generation method of GIS 
Applications Claiming Priority (1)
Application Number  Priority Date  Filing Date  Title 

CN201410261003.0A CN103996089B (en)  20140612  20140612  Based on the transmission line of electricity optimal path generation method of GIS 
Publications (2)
Publication Number  Publication Date 

CN103996089A CN103996089A (en)  20140820 
CN103996089B true CN103996089B (en)  20160406 
Family
ID=51310249
Family Applications (1)
Application Number  Title  Priority Date  Filing Date 

CN201410261003.0A CN103996089B (en)  20140612  20140612  Based on the transmission line of electricity optimal path generation method of GIS 
Country Status (1)
Country  Link 

CN (1)  CN103996089B (en) 
Families Citing this family (17)
Publication number  Priority date  Publication date  Assignee  Title 

CN104199910B (en) *  20140828  20170728  公安部交通管理科学研究所  The Aroad net traffic safety law enforcement automatic distribution method in service station based on GIS 
CN104462685B (en) *  20141203  20171031  江苏省电力公司淮安供电公司  Transmission Line Design method based on grid GIS and Floyd algorithms 
CN104599069B (en) *  20150123  20180427  云南电网有限责任公司  A kind of transmission line of electricity paths planning method based on envirment factor and geographical feature 
CN105046017B (en) *  20150813  20180619  深圳市置华机电设备有限公司  A kind of quick points distributing method and system of electromechanics Aseismic Design 
CN105067004B (en) *  20150914  20171020  武大吉奥信息技术有限公司  A kind of method for searching path based on landform 
CN105321002A (en) *  20151128  20160210  国网河南省电力公司郑州供电公司  Cable line path positioning analysis method 
CN106250579B (en) *  20160708  20191220  广东科诺勘测工程有限公司  Method and device for intelligently generating power line path 
CN106202744B (en) *  20160712  20190913  中国能源建设集团广东省电力设计研究院有限公司  Wind power collection system of offshore wind power plant avoidance method for optimizing route and system 
CN106289255A (en) *  20160722  20170104  云南师范大学  Based on around barrier path planning across the trajectory bearing calibration of naval vessel, land 
CN106529803B (en) *  20161109  20200324  国网辽宁省电力有限公司经济技术研究院  General cost management method and system 
CN108120444B (en) *  20161129  20200508  高德信息技术有限公司  Electronic map data processing method and device 
CN106971144B (en) *  20170228  20200616  北京航空航天大学  Method for extracting road center line by applying Visual Graph algorithm 
CN107527112B (en) *  20170731  20200612  全球能源互联网研究院有限公司  Method and equipment for determining shortest path between power equipment 
CN108646135A (en) *  20180408  20181012  中国电建集团河北省电力勘测设计研究院有限公司  A kind of digitlization selection method of UHV transmission line 
CN108694506A (en) *  20180514  20181023  广州供电局有限公司  Power distribution network cable tunnel construction demand amount determines method and device 
CN110532508B (en) *  20190905  20200918  东北大学  Multiobjective optimization path selection method of power transmission line based on stepping ring grid 
CN111283688A (en) *  20200323  20200616  深圳科瑞技术股份有限公司  Obstacle avoidance method of robot and robot equipment 
Citations (4)
Publication number  Priority date  Publication date  Assignee  Title 

CN103017757A (en) *  20121206  20130403  中联重科股份有限公司  Engineering machinery entering path planning method and path planning apparatus 
CN103186710A (en) *  20111231  20130703  北京金山软件有限公司  Optimal route searching method and system 
CN103390099A (en) *  20130628  20131113  孙茜茜  Service system and service method based on mobile operation system platform and Mobile GIS (Geographic Information System) 
CN103711987A (en) *  20131226  20140409  中国人民解放军总后勤部油料研究所  Method for selecting and laying movable oil conveying pipeline based on Beidou satellite 

2014
 20140612 CN CN201410261003.0A patent/CN103996089B/en active IP Right Grant
Patent Citations (4)
Publication number  Priority date  Publication date  Assignee  Title 

CN103186710A (en) *  20111231  20130703  北京金山软件有限公司  Optimal route searching method and system 
CN103017757A (en) *  20121206  20130403  中联重科股份有限公司  Engineering machinery entering path planning method and path planning apparatus 
CN103390099A (en) *  20130628  20131113  孙茜茜  Service system and service method based on mobile operation system platform and Mobile GIS (Geographic Information System) 
CN103711987A (en) *  20131226  20140409  中国人民解放军总后勤部油料研究所  Method for selecting and laying movable oil conveying pipeline based on Beidou satellite 
Also Published As
Publication number  Publication date 

CN103996089A (en)  20140820 
Similar Documents
Publication  Publication Date  Title 

US20160238396A1 (en)  Incremental map generation, refinement and extension with gps traces  
Lee et al.  A 3D data model and topological analyses for emergency response in urban areas  
EP2556338B1 (en)  Probe data processing  
Cova et al.  Modelling community evacuation vulnerability using GIS  
Pillai et al.  Offshore wind farm electrical cable layout optimization  
US6714664B2 (en)  Road area extracting apparatus for extracting a road area from a block map, deformed map automatic generation system for generating a deformed map from road area data obtained by the road area extracting apparatus, map information providing system, geographical information providing system and geographical information describing method  
KR101104551B1 (en)  System for power facility navigation  
Bagli et al.  Routeing of power lines through leastcost path analysis and multicriteria evaluation to minimise environmental impacts  
US8681153B2 (en)  Map display method used to enhance the display of a building by showing several levels of this building  
Choi et al.  Optimal haulage routing of offroad dump trucks in construction and mining sites using Google Earth and a modified leastcost path algorithm  
JP2007524170A (en)  Method and system for automated locationdependent recognition of flood risk  
CN103942941A (en)  Mobile monitoring fusion platform based on geographic information system (GIS)  
CN105783810A (en)  Earthwork quantity measuring method based on UAV photographic technology  
CN103984997B (en)  Power transmission engineering addressing selection method based on GIS spatial informations  
US10606962B2 (en)  Horizontal optimization of transport alignments  
Effat et al.  Designing and evaluation of three alternatives highway routes using the Analytical Hierarchy Process and the leastcost path analysis, application in Sinai Peninsula, Egypt  
WO2018010471A1 (en)  Method and system for optimizing obstacle avoidance path of offshore wind farm current collection system  
CN102662179A (en)  Threedimensional optimizing route selection method based on airborne laser radar  
Omer et al.  Spatial patterns of retail activity and street network structure in new and traditional Israeli cities  
CN105184492B (en)  Power grid based on threedimensional digital earth resists typhoon disaster simulation analysis early warning system  
Moser et al.  Beyond visualisation–3D GIS analyses for virtual city models  
Saha et al.  GIS‐based route planning in landslide‐prone areas  
KR20060074601A (en)  Navigation service method and terminal of enabling the method  
CN104567906B (en)  A kind of city road network vehicle path planning method and device based on the Big Dipper  
Fiorini et al.  AIS data visualization for maritime spatial planning (MSP) 
Legal Events
Date  Code  Title  Description 

PB01  Publication  
C06  Publication  
SE01  Entry into force of request for substantive examination  
C10  Entry into substantive examination  
CB03  Change of inventor or designer information 
Inventor after: Li Yue Inventor after: He Chunhui Inventor after: Guo Yiguo Inventor after: Li Mu Inventor after: Wang Zhipeng Inventor after: Jia Shanjie Inventor after: Zhu Yi Inventor after: Tu Qingbo Inventor after: Wang Xiuqi Inventor before: Miao Peiqing Inventor before: Tian Xin Inventor before: Huang Wei Inventor before: Yu Gengxi Inventor before: Wang Yu Inventor before: Liu Haitao Inventor before: Li Yue Inventor before: Hou Yuanhong Inventor before: He Chunhui Inventor before: Tu Qingbo Inventor before: Guo Yiguo Inventor before: Li Mu Inventor before: Wang Zhipeng 

COR  Change of bibliographic data  
GR01  Patent grant  
C14  Grant of patent or utility model 