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 PDF

Info

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
Application number
CN201410261003.0A
Other languages
Chinese (zh)
Other versions
CN103996089A (en
Inventor
李越
何春晖
郭宜果
李沐
王志鹏
贾善杰
朱毅
屠庆波
王庥祺
Original Assignee
国家电网公司
国网山东省电力公司经济技术研究院
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by 国家电网公司, 国网山东省电力公司经济技术研究院 filed Critical 国家电网公司
Priority to CN201410261003.0A priority Critical patent/CN103996089B/en
Publication of CN103996089A publication Critical patent/CN103996089A/en
Application granted granted Critical
Publication of CN103996089B publication Critical patent/CN103996089B/en

Links

Classifications

    • YGENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02DCLIMATE 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/00Energy efficient computing, e.g. low power processors, power management or thermal management

Abstract

A kind of transmission line of electricity optimal path generation method based on GIS, it comprises the following steps: (1) determines the Origin And Destination in transmission line of electricity path; (2) transmission line of electricity passage zone scope is extracted; (3) GIS map is processed: GIS map is divided in the same coordinate system barrier zone layer, topography and geomorphology layer and road circuit layer three layer; (4) adopt minimum area Rectangular Bounding Volume method process barrier zone and be configured to Visual Graph; (5) the asking for of optimal path: first-selection 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) corner number and scissors crossing number of times is added up.The present invention not only has the function avoided barrier, optimize generation pass, but also possesses the function such as path and corner number statistics.

Description

Based on the transmission line of electricity optimal path generation method of GIS

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 on-the-spot 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, land-use style, scissors crossing, execution conditions etc., traditional path design can not consider these factors as a whole.

Summary of the invention

For above-mentioned 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, right-angle triangle is formed with North and South direction on map and east-west direction, obtain the distance of this right-angle 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: first-selection 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 land-use style, local plan, geology and ice formation;

2) by GIS information sifting barrier zone: if land-use 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 above-mentioned screening is incorporated into a newly-built 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 step-length 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+1barrier zone layer R 1 2on fixed point, if to any i, j (i ≠ j), i, j=1,2 ..., m, line segment v iv i+1with v jv j+1or it is adjacent and intersect at an end points or non-intersect;

Definition 2: barrier zone layer R 1 2barrier set O is the set of simple polygon, each barrier corresponding each simple polygon number of vertex m ican 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 0represent that all barriers are fixed a point, V={v i| i=1,2 ..., n}, wherein v 1=s, v n=g, v 2~ v n-1corresponding all barrier fixed point V 0a sequence; If O 1={ s}, O k={ g};

Definition 4: at barrier zone layer R 1 2on, definition G 1be 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 1become 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:

d ( v i , v j ) = ( x i - x j ) 2 + ( y i - y j ) 2 j = { i + 1 , m k + 1 } 0 j = i &infin; else - - - ( 2 ) ;

<2> establishes V i∈ O k, V j∈ V-O k, k=1,2 ..., K, j=i, i+1 ..., n, calculates limit weights d (v i, v j) first to judge V iand V j2 line segment V formed iv jwith V aand V a+1the line segment V formed av a+1whether 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 iv jwith V av a+1with 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 non-intersect, 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 jmove on at the topography and geomorphology layer R representing shaped area 2 2on, definition G 2the authorized graph be made up of V, d ' (v i, v j) be revised weights;

Definition 8: will v be put i, v jmove on at the road circuit layer R representing road circuit 3 2on, definition c is for representing line segment V iv jwith road circuit layer R 3 2upper line segment scissors crossing number of times;

2) path is revised

Statistics is at various landform middle conductor V iv jthe distance l crossed over n, revise weights d (v i, v j) be d ' (v i, v j)

d &prime; ( v i , v j ) = &Sigma; n = 1 6 f n l n - - - ( 4 )

In formula 4, f nfor correction factor, n is landform numbering;

3) corner is revised

T ibe expressed as line segment V iv jwith V i-1v iwhether corner is there is, as d (v between (k ≠ i, k ≠ j) i-1, v i)+d (v i, v j)=d (v k-1, v j) then t i=0, otherwise t i=1;

4) scissors crossing is revised

V iv jline segment is at road circuit layer R 3 2scissors crossing may be produced with one or more road or circuit, use c irepresent the number of times that scissors crossing occurs;

5) line segment V is constructed iv jcost matrix

Line segment V iv jcost matrix cost [i] [j] as shown in formula (5):

cost[i][j]=d′(v i,v j)+f cc i+f tt i(5)

Wherein f cfor scissors crossing correction factor, f tfor 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, right-angle triangle is formed with North and South direction on map and east-west direction, obtain the distance of this right-angle 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 right-angle triangle with North and South direction on map and east-west 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, land-use 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) land-use 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 " land-use style " this layer.To each pixel in the GIS land-use style layer in the regional extent of path, (length corresponded in reality is rice/pixel, depending on GIS map resolution) in land-use style judge, if be military installations, large industrial enterprise or residential block, then this point coordinate is labeled as barrier.

After " land-use 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 newly-built layer, is together as barrier zone by the o'clock sharp being labeled as " barrier " in ii step, and all the other points, as non-barrier, 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 step-length 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 x-y coordinate system closed is (x, y), and after any rotation θ, this coordinate under u-v 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 u-v 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 x-y 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 irepresent 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 1and O 2represent 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+1layer R 1 2fixed point in (barrier zone layer), if to any i, j (i ≠ j), i, j=1,2 ..., m, line segment v iv i+1with v jv j+1or it is adjacent and intersect at an end points or non-intersect.

Definition 2: layer R 1 2barrier set O is the set of simple polygon.Each barrier corresponding each simple polygon number of vertex m ican 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 0represent 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 n-1corresponding all barrier fixed point V 0a sequence (arranged counterclockwise); If O 1={ s}, O k={ g}.

Definition 4: having the layer R of barrier zone 1 2on, definition G 1it 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 1adjacent 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:

d ( v i , v j ) = ( x i - x j ) 2 + ( y i - y j ) 2 j = { i + 1 , m k + 1 } 0 j = i &infin; else - - - ( 2 )

<2> establishes V i∈ O k, V j∈ V-O k, k=1,2 ..., K, j=i, i+1 ..., n, calculates limit weights d (v i, v j) first to judge V iand V j2 line segment V formed iv jwith V aand V a+1the line segment V formed av a+1whether 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 iv jwith V av a+1with 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 non-intersect, 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 jmove on at the layer R representing shaped area 2 2in (topography and geomorphology layer), definition G 2the authorized graph be made up of V, d ' (v i, v j) be revised weights.

Definition 8 will put v i, v jmove on at the layer R representing road circuit 3 2in (road circuit layer), definition c is for representing line segment V iv jwith layer R 3 2upper 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 iv jline segment is at layer R 2 2in 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

Topography and geomorphology Level land Hills Marsh, the network of waterways Mountain region High mountain Landform numbering n 1 2 3 4 6 Correction factor f n 1 1.06 1.40 1.21 1.43

Statistics is at various landform middle conductor V iv jthe distance l crossed over n, revise weights d (v i, v j) be d ' (v i, v j)

d &prime; ( v i , v j ) = &Sigma; n = 1 6 f n l n - - - ( 4 )

(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 ibe expressed as line segment V iv jwith V i-1v iwhether corner is there is between (k ≠ i, k ≠ j).Determination methods is: as d (V i-1, v i)+d (v i, v j)=d (V k-1, 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 iv jline segment is at layer R 3 2scissors crossing may be produced with one or more road or circuit, use c irepresent 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 2to the correction of path, and consider the factor of circuit corner and scissors crossing, line segment V can be constructed iv jcost matrix cost [i] [j], as shown in formula (5):

CoSt [i] [j]=d ' (v i, v j)+f cc i+ f tt i(5) wherein f cfor scissors crossing correction factor, f tfor 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

t = &Sigma; i &Element; S t i - - - ( 6 )

c = &Sigma; i &Element; S c i - - - ( 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)

1., based on the transmission line of electricity optimal path generation method of GIS, it 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, right-angle triangle is formed with North and South direction on map and east-west direction, obtain the distance of this right-angle 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; 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 step-length increases progressively, and θ ∈ [0, pi/2];
(5) the asking for of optimal path: first-selection 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.
2. the transmission line of electricity optimal path generation method based on GIS according to claim 1, it is characterized in that, 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 land-use style, local plan, geology and ice formation;
2) by GIS information sifting barrier zone: if land-use 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 above-mentioned screening is incorporated into a newly-built layer and forms barrier zone layer.
3. the transmission line of electricity optimal path generation method based on GIS according to claim 1, is characterized in that, 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+1barrier zone layer R 1 2on fixed point, if to any i, j (i ≠ j), i, j=1,2 ..., m, line segment v iv i+1with v jv j+1or it is adjacent and intersect at an end points or non-intersect;
Definition 2: barrier zone layer R 1 2barrier set O is the set of simple polygon, each barrier corresponding each simple polygon number of vertex m ican 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 0represent that all barriers are fixed a point, V={v i| i=1,2 ..., n}, wherein v 1=s, v n=g, v 2~ v n-1corresponding all barrier fixed point V 0a sequence; If O 1={ s}, O k={ g};
Definition 4: at barrier zone layer R 1 2on, definition G 1be 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 1become 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:
d ( v i , v j ) = ( x i - x j ) 2 + ( y i - y j ) 2 0 j = { i + 1 , m k + 1 } &infin; j = i e l s e - - - ( 2 ) ;
<2> establishes V i∈ O k, V j∈ V-O k, k=1,2 ..., K, j=i, i+1 ..., n, calculates limit weights d (v i, v j) first to judge V iand V j2 line segment V formed iv jwith V aand V a+1the line segment V formed av a+1whether intersect, calculate d (v according to crossing result i, v j) value, V here a, V a+1∈ O l, l=1,2 ..., K, a=1,2 ..., n;
<3> judges line segment V iv jwith V av a+1with 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 non-intersect, can as path, if λ, show to intersect, not can be used as path.
4. the transmission line of electricity optimal path generation method based on GIS according to claim 1, it is characterized in that, 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 jmove on at the topography and geomorphology layer R representing shaped area 2 2on, definition G 2the authorized graph be made up of V, d ' (v i, v j) be revised weights;
Definition 8: will v be put i, v jmove on at the road circuit layer R representing road circuit 3 2on, definition c is for representing line segment V iv jwith road circuit layer R 3 2upper line segment scissors crossing number of times;
2) path is revised
Statistics is at various landform middle conductor V iv jthe distance l crossed over n, revise weights d (v i, v j) be d ' (v i, v j)
d &prime; ( v i , v j ) = &Sigma; n = 1 6 f n l n - - - ( 4 )
In formula 4, f nfor correction factor, n is landform numbering;
3) corner is revised
T ibe expressed as line segment V iv jwith V i-1v iwhether corner is there is, as d (v between (k ≠ i, k ≠ j) i-1, v i)+d (v i, v j)=d (v k-1, v j) then t i=0, otherwise t i=1;
4) scissors crossing is revised
V iv jline segment is at road circuit layer R 3 2scissors crossing may be produced with one or more road or circuit, use c irepresent the number of times that scissors crossing occurs;
5) line segment V is constructed iv jcost matrix
Line segment V iv jcost matrix cost [i] [j] as shown in formula (5):
cost[i][j]=d′(v i,v j)+f cc i+f tt i(5)
Wherein f cfor scissors crossing correction factor, f tfor corner correction factor.
5. the transmission line of electricity optimal path generation method based on GIS according to claim 1, is characterized in that, 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.
CN201410261003.0A 2014-06-12 2014-06-12 Based on the transmission line of electricity optimal path generation method of GIS CN103996089B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201410261003.0A CN103996089B (en) 2014-06-12 2014-06-12 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) 2014-06-12 2014-06-12 Based on the transmission line of electricity optimal path generation method of GIS

Publications (2)

Publication Number Publication Date
CN103996089A CN103996089A (en) 2014-08-20
CN103996089B true CN103996089B (en) 2016-04-06

Family

ID=51310249

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201410261003.0A CN103996089B (en) 2014-06-12 2014-06-12 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)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104199910B (en) * 2014-08-28 2017-07-28 公安部交通管理科学研究所 The A-road net traffic safety law enforcement automatic distribution method in service station based on GIS
CN104462685B (en) * 2014-12-03 2017-10-31 江苏省电力公司淮安供电公司 Transmission Line Design method based on grid GIS and Floyd algorithms
CN104599069B (en) * 2015-01-23 2018-04-27 云南电网有限责任公司 A kind of transmission line of electricity paths planning method based on envirment factor and geographical feature
CN105046017B (en) * 2015-08-13 2018-06-19 深圳市置华机电设备有限公司 A kind of quick points distributing method and system of electromechanics Aseismic Design
CN105067004B (en) * 2015-09-14 2017-10-20 武大吉奥信息技术有限公司 A kind of method for searching path based on landform
CN105321002A (en) * 2015-11-28 2016-02-10 国网河南省电力公司郑州供电公司 Cable line path positioning analysis method
CN106250579B (en) * 2016-07-08 2019-12-20 广东科诺勘测工程有限公司 Method and device for intelligently generating power line path
CN106202744B (en) * 2016-07-12 2019-09-13 中国能源建设集团广东省电力设计研究院有限公司 Wind power collection system of offshore wind power plant avoidance method for optimizing route and system
CN106289255A (en) * 2016-07-22 2017-01-04 云南师范大学 Based on around barrier path planning across the trajectory bearing calibration of naval vessel, land
CN106529803B (en) * 2016-11-09 2020-03-24 国网辽宁省电力有限公司经济技术研究院 General cost management method and system
CN108120444B (en) * 2016-11-29 2020-05-08 高德信息技术有限公司 Electronic map data processing method and device
CN106971144B (en) * 2017-02-28 2020-06-16 北京航空航天大学 Method for extracting road center line by applying Visual Graph algorithm
CN107527112B (en) * 2017-07-31 2020-06-12 全球能源互联网研究院有限公司 Method and equipment for determining shortest path between power equipment
CN108646135A (en) * 2018-04-08 2018-10-12 中国电建集团河北省电力勘测设计研究院有限公司 A kind of digitlization selection method of UHV transmission line
CN108694506A (en) * 2018-05-14 2018-10-23 广州供电局有限公司 Power distribution network cable tunnel construction demand amount determines method and device
CN110532508B (en) * 2019-09-05 2020-09-18 东北大学 Multi-objective optimization path selection method of power transmission line based on stepping ring grid
CN111283688A (en) * 2020-03-23 2020-06-16 深圳科瑞技术股份有限公司 Obstacle avoidance method of robot and robot equipment

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103017757A (en) * 2012-12-06 2013-04-03 中联重科股份有限公司 Engineering machinery entering path planning method and path planning apparatus
CN103186710A (en) * 2011-12-31 2013-07-03 北京金山软件有限公司 Optimal route searching method and system
CN103390099A (en) * 2013-06-28 2013-11-13 孙茜茜 Service system and service method based on mobile operation system platform and Mobile GIS (Geographic Information System)
CN103711987A (en) * 2013-12-26 2014-04-09 中国人民解放军总后勤部油料研究所 Method for selecting and laying movable oil conveying pipeline based on Beidou satellite

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103186710A (en) * 2011-12-31 2013-07-03 北京金山软件有限公司 Optimal route searching method and system
CN103017757A (en) * 2012-12-06 2013-04-03 中联重科股份有限公司 Engineering machinery entering path planning method and path planning apparatus
CN103390099A (en) * 2013-06-28 2013-11-13 孙茜茜 Service system and service method based on mobile operation system platform and Mobile GIS (Geographic Information System)
CN103711987A (en) * 2013-12-26 2014-04-09 中国人民解放军总后勤部油料研究所 Method for selecting and laying movable oil conveying pipeline based on Beidou satellite

Also Published As

Publication number Publication date
CN103996089A (en) 2014-08-20

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 least-cost 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 off-road dump trucks in construction and mining sites using Google Earth and a modified least-cost path algorithm
JP2007524170A (en) Method and system for automated location-dependent 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 least-cost 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) Three-dimensional 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 three-dimensional 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