CN103996089A - Electric transmission line optimal path generation method based on GIS - Google Patents
Electric transmission line optimal path generation method based on GIS Download PDFInfo
- Publication number
- CN103996089A CN103996089A CN201410261003.0A CN201410261003A CN103996089A CN 103996089 A CN103996089 A CN 103996089A CN 201410261003 A CN201410261003 A CN 201410261003A CN 103996089 A CN103996089 A CN 103996089A
- Authority
- CN
- China
- Prior art keywords
- path
- layer
- barrier
- transmission line
- definition
- 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.)
- Granted
Links
Classifications
-
- Y—GENERAL 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
- 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
Landscapes
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
- Navigation (AREA)
Abstract
Provided is an electric transmission line optimal path generation method based on a GIS. The method comprises the following steps of (1), determining a starting point and a terminal point of an electric transmission line path; (2), extracting an area coverage of the electric transmission line path; (3), processing a GIS map, wherein the GIS map is divided into an obstacle area layer, a geomorphology layer and a road line layer in the same coordinate system; (4), processing an obstacle area and constructing a visual graph according to a minimum area rectangular bounding box method; (5), obtaining an optimal path, wherein firstly feasible obstacle avoidance paths are preferred and obtained, then a cost matrix is constructed, finally an obstacle avoidance path of the shortest path is calculated through a Dijkstra algorithm, and consequently the optimal path of an electric transmission line is obtained; (6), counting the number of corners and crossing and spanning times. The electric transmission line optimal path generation method based on the GIS not only has the functions of avoiding obstacle areas and optimizing the generated path, but also has the functions of counting the length of the path and the number of the corners and the like.
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 be by designer first in indoor route selection, and after making an on-the-spot survey to scene, readjust path, form final path.But there is following defect in existing path optimization scheme:
1. traditional path design is carried out based on path, existing map He Yan road data, and this has just caused geography information to relatively lag behind, and needs a large amount of reconnaissance trips to assist, and not only accuracy rate is low, has also increased workload.
2. traditional path design completes on paper drawing, and workload is large, and revises comparatively complicated.
3. the factor that affects line route is various, comprises topography and geomorphology, land used type, scissors crossing, execution conditions etc., and traditional path design can not be considered 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 of avoiding barrier, optimizing generation pass, but also possesses the functions 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, it is characterized in that, and comprise the following steps:
(1) determine the Origin And Destination in transmission line of electricity path: the Origin And Destination Wei Liangge transformer station in transmission line of electricity path, provides substation location and transformer station's line direction by Substation Design personnel, and mark on GIS map;
(2) extract transmission line of electricity path regional extent: the air line distance of measuring Origin And Destination, with North and South direction on map and east-west direction, form right-angle triangle, obtain the distance of this right-angle triangle horizontal sides and vertical edge, and these two distances are added respectively to 2 backward upper round numbers, can obtain path regional extent;
(3) GIS map is processed: GIS map is at least divided into barrier zone figure layer, topography and geomorphology figure layer and three figure layer of road wiring diagram layer, and each figure layer is respectively containing a class GIS information, and All Layers is stack 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 that adopts minimum area Rectangular Bounding Volume to surround barrier zone is processed the barrier zone in barrier zone figure layer and represents barrier zone by Rectangular Bounding Volume;
(5) asking for of optimal path: first-selection is asked for feasible keeping away and hindered path, then constructions cost matrix, finally adopts dijkstra's algorithm to calculate keeping away of shortest path and hinders path, thereby obtain the optimal path of transmission line of electricity;
(6) statistics 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 respectively statistics.
In said method, the forming process of described barrier zone figure layer is:
1) determine the factor that is judged as barrier zone: described definite factor that is judged as barrier zone comprises the factors such as land used type, local plan, geology and ice formation;
2) by GIS information sifting barrier zone: if land used type 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 Dai Huo mining influence district, and the area that ice formation is heavy icing area is all considered as barrier zone;
3) form barrier zone figure layer: the barrier zone of above-mentioned screening is incorporated into a newly-built figure layer and forms barrier zone figure layer.
In said method, adopt the process of minimum area Rectangular Bounding Volume method processing barrier zone for first to adopt AABB method to obtain the boundary rectangle of barrier profile, the rectangle that minimax x coordinate and minimax y coordinate form; Then by the arbitrarily angled θ of rotation of coordinate, make the area that rotates rear encirclement barrier for minimum, the boundary rectangle of minimum area is the minimum area Rectangular Bounding Volume of barrier profile, and wherein, θ be take π/180 and is increased progressively as step-length, 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 figure 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 adjacent and intersect at an end points or non-intersect;
Definition 2: barrier zone figure 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,
i wherein, j=1,2 ..., K;
Definition 3:s, j ∈ R
1 2, become respectively starting point and impact point, point set V={s, g} ∪ V
0, V wherein
0represent all barrier fixed points, 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 figure layer R
1 2upper, definition G
1be the authorized graph consisting of V, the weights on limit are defined as the expansion Euclid distance between V collection two summits, are expressed as d (v
i, v
j), note by abridging as d
ij, v wherein
i, v
j∈ V;
Definition 5: establish G
1=(V, E), V={v
i| i=1,2 ..., n}, E is all and i ≠ j with the equal disjoint edge c of any barrier, G
1become Visual Graph;
2) judgement syntople
<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∈ 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 that form
iv
jwith V
aand V
a+1the line segment V forming
av
a+1whether intersect, according to crossing result, calculate d (v
i, v
j) value.Here V
a, V
a+1∈ O
l, l=1,2 ..., K, a=1,2 ..., n;
<3> judgement line segment V
iv
jwith V
av
a+1have or not intersection point, about the vector equation (3) of parameter lambda and μ:
(1-λ)V
i+λV
j＝(1-μ)V
a+μV
a+1 (3)
Whether there is λ, the solution of μ ∈ [0,1], if λ, μ ∈ [0,1] shows non-intersect, can be used 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] for comprising the Cost matrixes of three figure layer information;
Definition 7: will put v
i, v
jmove on at the topography and geomorphology figure layer R that represents landform region
2 2upper, definition G
2the authorized graph being formed by V, d ' (v
i, v
j) be revised weights;
Definition 8: will put v
i, v
jmove on at the road wiring diagram layer R that represents road circuit
3 2upper, definition c is for representing line segment V
iv
jwith road wiring diagram layer R
3 2upper line segment scissors crossing number of times;
2) revise path
Statistics is at various landform middle conductor V
iv
jthe distance l crossing over
n, revise weights d (v
i, v
j) be d ' (v
i, v
j)
In formula 4, f
nfor correction factor, n is landform numbering;
3) revise corner
T
ibe expressed as line segment V
iv
jwith V
i-1v
ibetween (k ≠ i, k ≠ j), whether there is corner, as d (v
i-1, v
i)+d (v
i, v
j)=d (v
k-1, v
j) t
i=0, otherwise t
i=1;
4) revise scissors crossing
V
iv
jline segment is at road wiring diagram layer R
3 2may produce scissors crossing with one or more road or circuit, use c
irepresent to occur the number of times of scissors crossing;
5) construct line segment V
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)
F wherein
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 respectively to s and g;
2) path starting point s is deposited in to S set, and be labeled as T summit, a shortest path of trying to achieve after the each computing of S set expression;
3) upgrade in S set and be communicated with the state recording of node with starting point s;
4) identification is communicated with s and the interim node of comprehensive weight minimum, is set to T node, until T node is terminal g, otherwise continue renewal S, is communicated with the state recording of node in gathering with starting point s;
5), according to the information in each node connected relation and state record table, from terminal g, start to record its preorder node, until be recorded to starting point s;
6), according to the result that records of previous step, can form starting point s to the optimal path of terminal g.
The invention has the beneficial effects as follows: the present invention is based on GIS cartographic information the area that is not suitable for erecting power transmission lines is considered as to barrier zone, and in the same coordinate system, form three figure layer of barrier figure layer, topography and geomorphology figure layer, road wiring diagram layer, with minimum area Rectangular Bounding Volume method, barrier zone is processed, and complete and keep away barrier route planning in conjunction with Visual Graph method, generate the optimal path of transmission line of electricity, it not only has the function of avoiding barrier, optimizing generation pass, but also possesses the functions such as path and corner number statistics.
Accompanying drawing explanation
Fig. 1 is method flow diagram of the present invention;
Fig. 2 is the regioselective schematic diagram in path of the present invention;
Fig. 3 is the schematic diagram of the Rectangular Bounding Volume of the anglec of rotation of the present invention while being θ;
Fig. 4 is the Visual Graph of barrier, region, path of the present invention figure layer;
Fig. 5 is two schematic diagram whether line segment is crossing that judge 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 below provides many different embodiment or example to be 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 be in different examples repeat reference numerals and/or letter.This repetition is in order to simplify and object clearly, itself do not indicate the relation between discussed various embodiment and/or setting.It should be noted that illustrated parts are not necessarily drawn in proportion in the accompanying drawings.The present invention has omitted the description of known assemblies and treatment technology and technique 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 Wei Liangge transformer station in transmission line of electricity path, provides substation location and transformer station's line direction by Substation Design personnel, and mark on GIS map;
(2) extract transmission line of electricity path regional extent: the air line distance of measuring Origin And Destination, with North and South direction on map and east-west direction, form right-angle triangle, obtain the distance of this right-angle triangle horizontal sides and vertical edge, and these two distances are added respectively to 2 backward upper round numbers, can obtain path regional extent;
(3) GIS map is processed: GIS map is at least divided into barrier zone figure layer, topography and geomorphology figure layer and three figure layer of road wiring diagram layer, and each figure layer is respectively containing a class GIS information, and All Layers is stack 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 that adopts minimum area Rectangular Bounding Volume to surround barrier zone is processed the barrier zone in barrier zone figure layer and represents 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, thereby obtain the optimal path of transmission line of electricity;
(8) statistics 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 respectively statistics.
The present invention is described in further detail to explanation below.
1, determine path starting point and terminal and the selection of path regional extent
(1) determine path Origin And Destination
The Origin And Destination Wei Liangge transformer station of line route.By Substation Design personnel, provide substation location (transformer station's center position) and transformer station's line direction, by computing machine, on GIS map, marked, and can accept Bi Jingdian position, path (manually input) according to requirement of engineering.
(2) path regional extent is selected
Measure the air line distance (km of unit, lower same) of Origin And Destination, with North and South direction on map and east-west direction, do right-angle triangle.Obtain the distance of time triangle horizontal sides and vertical edge.These two distances are added respectively to 2, and the number that rounds up, path regional extent can be obtained.As shown in Figure 2.The path domain coordinate obtaining is continued to use GIS map acquiescence coordinate.
2, the processing of GIS map
GIS map comprises this information such as all topography and geomorphologies in this region, land used type, scissors crossing, execution conditions, on each figure layer, comprises a category information.According to this patent applicable cases, GIS map is integrated into barrier figure layer, topography and geomorphology figure layer, these three figure layer of road wiring diagram layer.Three same initial points of figure layer, same coordinate, mutually stack.
(1) barrier figure layer (the first figure layer)
The area that is not suitable for erecting power transmission lines can be regarded as barrier and evade.Take following steps to form barrier figure layer.
(1.1) determine the factor (can revise according to the specific requirement of path design) that is judged as barrier zone
During routing, should consider the factors such as topography and geomorphology, geology, ice formation, traffic, construction, operation and local plan.According to the principle of routing, following area all can be regarded as barrier:
A) land used type: 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) press GIS information sifting disturbance in judgement district
" land used type " this layer of take is example.To each pixel in the GIS land used type map layer in the regional extent of path, (length corresponding in reality is rice/pixel, depending on GIS map resolution) in land used type judge, military installations, large industrial enterprise or residential block, be labeled as barrier by this point coordinate if.
After " land used type " figure layer passing marker is complete, the figure layers such as " local plan " " geology " " ice formation " are carried out to passing marker one by one.
If certain is a bit being labeled as barrier in the scanning of figure layer before, the scanning after can skipping in figure layer.
(1.3) form barrier figure layer
A newly-built figure layer, integrates the point that is labeled as " barrier " in ii step as barrier zone, and all the other points, as non-barrier, form barrier figure layer (the first figure layer).
(2) topography and geomorphology figure layer (the second figure layer)
Known according to the project of transmitting and converting electricity General Engineering Cost > > of < < State Grid Corporation of China of national grid issue, the cost erecting power transmission lines on different terrain landforms (level land, hills, the network of waterways and marsh, high mountain etc.) is different.This patent will reduce the cost while setting up path when planning optimal route path, will need to consider topography and geomorphology problem.Therefore extract topography and geomorphology figure layer as second figure layer.
(3) road wiring diagram layer (the 3rd figure layer)
The scissors crossing that the path that also will as far as possible avoid planning in transmission line of electricity path planning and, power circuit, communication line etc. produce.Therefore using GIS Roads in Maps with wiring diagram is laminated and as the 3rd figure layer.
3, the minimum rectangle bounding box of the barrier in the regional extent of path is asked for
(1) minimum area Rectangular Bounding Volume method is processed barrier zone.
Because the barrier zone in the figure layer of barrier is not how much regular polygons, 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, adopt minimum area Rectangular Bounding Volume to surround barrier zone.
As shown in Figure 3, adopt AABB method to obtain the boundary rectangle of barrier profile, the rectangle that minimax x coordinate and minimax y coordinate form; Then by the arbitrarily angled θ of rotation of coordinate (take π/180 increases progressively as step-length, and θ ∈ [0, pi/2]), make the area that rotates rear encirclement barrier for minimum.The coordinate of the barrier bounding box outline line any point of sealing under x-y coordinate system is (x, y), and after the arbitrarily angled θ of rotation, this coordinate under u-v coordinate system is made as (u, v).Coordinate transform is suc 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 is tried to achieve under new u-v coordinate, 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 summits under x-y coordinate axis.
(2) barrier figure layer is configured to Visual Graph
Each barrier zone is asked for to minimum area Rectangular Bounding Volume by step described in (1), then use O
ithe Rectangular Bounding Volume that represents barrier zone is called barrier on Visual Graph.Fig. 4 represents the Visual Graph of certain barrier, region, path figure layer, and s, g become respectively starting point and impact point, O
1and O
2represent two barriers, dotted line is the feasible path from starting point s to impact point g.
4, optimal path asks for
The Visual Graph that this patent is mainly constructed based on barrier figure layer, utilizes dijkstra's algorithm, consider path the weight of geography information, corner and scissors crossing situation of process, 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+1figure layer R
1 2fixed point on (barrier zone figure layer), if to any i, j (i ≠ j), i, j=1,2 ..., m, line segment v
iv
i+1with v
jv
j+1or adjacent and intersect at an end points or non-intersect.
Definition 2: figure 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,
i wherein, j=1,2 ..., K.
Definition 3:s, j ∈ R
1 2, become respectively starting point and impact point.Point set V={s, g} ∪ V
0, V wherein
0represent all barrier fixed points.In order to narrate conveniently, establish 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 (counterclockwise arrange); If O
1={ s}, O
k={ g}.
Definition 4: having the figure layer R of barrier zone
1 2upper, definition G
1it is the authorized graph being formed by V.The power on limit (cost) value is defined as the expansion Euclid distance between V collection two summits, is expressed as d (v
i, v
j) (brief note is d
ij), v wherein
i, v
j∈ V.
Definition 5: establish G
1=(V, E), V is all and i ≠ j with the equal disjoint edge c of any barrier as defined 3, E.G
1adjacent summit becomes Visual Graph, because can be seen mutually in way.
(1.2) judgement of syntople
When search path, need to solve two class syntoples, i.e. syntople between the critical relation between same barrier polygon vertex and different obstruct thing polygonal head.This two classes syntople can be limit (v by summit line in judgement V
i, v
j) and barrier polygon O
i, i=1,2 ..., the whether crossing method of K 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∈ 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 that form
iv
jwith V
aand V
a+1the line segment V forming
av
a+1whether intersect, according to crossing result, calculate d (v
i, v
j) value.Here V
a, V
a+1∈ O
l, l=1,2 ..., K, a=1,2 ..., n.
<2> judgement line segment V
iv
jwith V
av
a+1have or not intersection point, 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 λ, μ ∈ [0,1] shows non-intersect, can be used 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] for comprising the Cost matrixes of three figure layer information.
Definition 7 will be put v
i, v
jmove on at the figure layer R that represents landform region
2 2(topography and geomorphology figure layer) is upper, definition G
2the authorized graph being formed by V, d ' (v
i, v
j) be revised weights.
Definition 8 will be put v
i, v
jmove on at the figure layer R that represents road circuit
3 2(road wiring diagram layer) is upper, and definition c is for representing line segment V
iv
jwith figure 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 erecting power transmission lines on different terrain region is also different, in line with the principle that reduces cost, should to the influence degree of cost, to the unit length in path, revise with landform.
V
iv
jline segment is at figure layer R
2 2may in a kind of landform region, also may cross over two or more landform regions, according to the landform of process different, correction factor is also different.Typical scenario cost in the project of transmitting and converting electricity General Engineering Cost > > of < < State Grid Corporation of China being issued by national grid under each landform and obtain the correction factor (correction factor can from table 1 check in) of path planning under different terrain.
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 crossing 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, and reducing corner is also a principle of path optimizing, so embodied with corner correction factor in Cost matrix.T
ibe expressed as line segment V
iv
jwith V
i-1v
ibetween (k ≠ i, k ≠ j), whether there is corner.Determination methods is: as d (V
i-1, v
i)+d (v
i, v
j)=d (V
k-1, v
j) t
i=0, otherwise t
i=1.
(2.4) correction of scissors crossing
In path planning, the communication line generation scissors crossing that should avoid transmission line of electricity and other power circuits as far as possible and set up.Therefore the number of times of scissors crossing is also considered in the middle of the selection of optimal path.V
iv
jline segment is at figure layer R
3 2may produce scissors crossing with one or more road or circuit, use c
irepresent to occur the number of times of scissors crossing.
(2.5) structure of Cost matrix
Consider the length in path, and according to landform areal map layer R
2 2correction to path, and the factor of considering circuit corner and scissors crossing, can construct 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) f wherein
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, with S, gather to represent the shortest path of trying to achieve after each computing, during initialization, S set, only containing a starting point, is gathered to store with W and is added remaining vertex set after S set.Centered by starting point, search the adding in S set of shortest path in the next summit that it is connected, if the path that the summit of the connection of searching connects is than the short words of already present this path in S set, replace original path, to preserve in a word the shortest path from starting point to current point, until find terminal.
The core concept of dijkstra's algorithm is outwards expansion layer by layer centered by starting point, selects the path of a weights minimum and the weights on other summits are compared from the unmarked point being connected with starting point.This is recycle ratio process.In this problem, can use the weights that are weighted to of path, place landform, corner and scissors crossing situation.
As shown in Figure 6, the process of keeping away barrier path that adopts dijkstra's algorithm to calculate shortest path comprises the following steps:
1) Origin And Destination in path is labeled as respectively to s and g;
2) path starting point s is deposited in to S set, and be labeled as T summit, a shortest path of trying to achieve after the each computing of S set expression;
3) upgrade in S set and be communicated with the state recording of node with starting point s;
4) identification is communicated with s and the interim node of comprehensive weight minimum, is set to T node, until T node is terminal g, otherwise continue renewal S, is communicated with the state recording of node in gathering with starting point s;
5), according to the information in each node connected relation and state record table, from terminal g, start to record its preorder node, until be recorded to starting point s;
6), according to the result that records of previous step, can form starting point s to the optimal path of terminal g.
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 and can be obtained 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, can realize the Automated Design of transmission line of electricity path based on GIS,, after the Origin And Destination of definite path, can automatically complete path and generate, for designer's reference;
2, support manually to revise: can manually add and must also support designer's typing reconnaissance trip data through point, and according to this path manually or automatically be revised simultaneously;
3, support statistics along the line: after path generates, can be according to GIS geography information, complete path length, corner number, with the statistics of existing crossing elimination situation.
The above is the preferred embodiment of the present invention, for those skilled in the art, under the premise without departing from the principles of the invention, can also make some improvements and modifications, and these improvements and modifications are also regarded as protection scope of the present invention.
Claims (6)
1. the transmission line of electricity optimal path generation method based on GIS, is characterized in that, comprises the following steps:
(1) determine the Origin And Destination in transmission line of electricity path: the Origin And Destination Wei Liangge transformer station in transmission line of electricity path, provides substation location and transformer station's line direction by Substation Design personnel, and mark on GIS map;
(2) extract transmission line of electricity path regional extent: the air line distance of measuring Origin And Destination, with North and South direction on map and east-west direction, form right-angle triangle, obtain the distance of this right-angle triangle horizontal sides and vertical edge, and these two distances are added respectively to 2 backward upper round numbers, can obtain path regional extent;
(3) GIS map is processed: GIS map is at least divided into barrier zone figure layer, topography and geomorphology figure layer and three figure layer of road wiring diagram layer, and each figure layer is respectively containing a class GIS information, and All Layers is stack 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 that adopts minimum area Rectangular Bounding Volume to surround barrier zone is processed the barrier zone in barrier zone figure layer and represents barrier zone by Rectangular Bounding Volume;
(5) asking for of optimal path: first-selection is asked for feasible keeping away and hindered path, then constructions cost matrix, finally adopts dijkstra's algorithm to calculate keeping away of shortest path and hinders path, thereby obtain the optimal path of transmission line of electricity;
(6) statistics 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 respectively statistics.
2. the transmission line of electricity optimal path generation method based on GIS according to claim 1, is characterized in that, the forming process of described barrier zone figure layer is:
1) determine the factor that is judged as barrier zone: described definite factor that is judged as barrier zone comprises the factors such as land used type, local plan, geology and ice formation;
2) by GIS information sifting barrier zone: if land used type 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 Dai Huo mining influence district, and the area that ice formation is heavy icing area is all considered as barrier zone;
3) form barrier zone figure layer: the barrier zone of above-mentioned screening is incorporated into a newly-built figure layer and forms barrier zone figure layer.
3. the transmission line of electricity optimal path generation method based on GIS according to claim 1, it is characterized in that, adopt the process of minimum area Rectangular Bounding Volume method processing barrier zone for first to adopt AABB method to obtain the boundary rectangle of barrier profile, the rectangle that minimax x coordinate and minimax y coordinate form; Then by the arbitrarily angled θ of rotation of coordinate, make the area that rotates rear encirclement barrier for minimum, the boundary rectangle of minimum area is the minimum area Rectangular Bounding Volume of barrier profile, and wherein, θ be take π/180 and is increased progressively as step-length, and θ ∈ [0, pi/2].
4. 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 figure 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 adjacent and intersect at an end points or non-intersect;
Definition 2: barrier zone figure 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,
i wherein, j=1,2 ..., K;
Definition 3:s, j ∈ R
1 2, become respectively starting point and impact point, point set V={s, g} ∪ V
0, V wherein
0represent all barrier fixed points, 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 figure layer R
1 2upper, definition G
1be the authorized graph consisting of V, the weights on limit are defined as the expansion Euclid distance between V collection two summits, are expressed as d (v
i, v
j), note by abridging as d
ij, v wherein
i, v
j∈ V;
Definition 5: establish G
1=(V, E), V={v
i| i=1,2 ..., n}, E is all and i ≠ j with the equal disjoint edge c of any barrier, G
1become Visual Graph;
2) judgement syntople
<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∈ 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 that form
iv
jwith V
aand V
a+1the line segment V forming
av
a+1whether intersect, according to crossing result, calculate d (v
i, v
j) value.Here V
a, V
a+1∈ O
l, l=1,2 ..., K, a=1,2 ..., n;
<3> judgement line segment V
iv
jwith V
av
a+1have or not intersection point, about the vector equation (3) of parameter lambda and μ:
(1-λ)V
i+λV
j＝(1-μ)V
a+μV
a+1 (3)
Whether there is λ, the solution of μ ∈ [0,1], if λ, μ ∈ [0,1] shows non-intersect, can be used as path, if λ,
show to intersect, not can be used as path.
5. the transmission line of electricity optimal path generation method based on GIS according to claim 1, is characterized in that, the process of described constructions cost matrix is:
1) basic definition
Definition 6: definition cost[n] [n] for comprising the Cost matrixes of three figure layer information;
Definition 7: will put v
i, v
jmove on at the topography and geomorphology figure layer R that represents landform region
2 2upper, definition G
2the authorized graph being formed by V, d ' (v
i, v
j) be revised weights;
Definition 8: will put v
i, v
jmove on at the road wiring diagram layer R that represents road circuit
3 2upper, definition c is for representing line segment V
iv
jwith road wiring diagram layer R
3 2upper line segment scissors crossing number of times;
2) revise path
Statistics is at various landform middle conductor V
iv
jthe distance l crossing over
n, revise weights d (v
i, v
j) be d ' (v
i, v
j)
In formula 4, f
nfor correction factor, n is landform numbering;
3) revise corner
T
ibe expressed as line segment V
iv
jwith V
i-1v
ibetween (k ≠ i, k ≠ j), whether there is corner, as d (v
i-1, v
i)+d (v
i, v
j)=d (v
k-1, v
j) t
i=0, otherwise t
i=1;
4) revise scissors crossing
V
iv
jline segment is at road wiring diagram layer R
3 2may produce scissors crossing with one or more road or circuit, use c
irepresent to occur the number of times of scissors crossing;
5) construct line segment V
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)
F wherein
cfor scissors crossing correction factor, f
tfor corner correction factor.
6. 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 respectively to s and g;
2) path starting point s is deposited in to S set, and be labeled as T summit, a shortest path of trying to achieve after the each computing of S set expression;
3) upgrade in S set and be communicated with the state recording of node with starting point s;
4) identification is communicated with s and the interim node of comprehensive weight minimum, is set to T node, until T node is terminal g, otherwise continue renewal S, is communicated with the state recording of node in gathering with starting point s;
5), according to the information in each node connected relation and state record table, from terminal g, start to record its preorder node, until be recorded to starting point s;
6), according to the result that records of previous step, can form starting point s to the optimal path of terminal g.
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 true CN103996089A (en) | 2014-08-20 |
| CN103996089B CN103996089B (en) | 2016-04-06 |
Family
ID=51310249
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410261003.0A Active 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) |
Cited By (35)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104199910A (en) * | 2014-08-28 | 2014-12-10 | 公安部交通管理科学研究所 | Automatic trunk highway network traffic safety law enforcement service station laying method based on GIS |
| CN104462685A (en) * | 2014-12-03 | 2015-03-25 | 江苏省电力公司淮安供电公司 | Transmission line design method based on GIS (grid) and Floyd algorithm |
| CN104599069A (en) * | 2015-01-23 | 2015-05-06 | 云南电网有限责任公司 | Power transmission line route planning method based on environment factors and geographic features |
| CN105046017A (en) * | 2015-08-13 | 2015-11-11 | 深圳市置华机电设备有限公司 | Rapid node placement method and system for electromechanical seismic design |
| CN105067004A (en) * | 2015-09-14 | 2015-11-18 | 武大吉奥信息技术有限公司 | Terrain-based path search method |
| CN105321002A (en) * | 2015-11-28 | 2016-02-10 | 国网河南省电力公司郑州供电公司 | Cable line path positioning analysis method |
| CN106202744A (en) * | 2016-07-12 | 2016-12-07 | 中国能源建设集团广东省电力设计研究院有限公司 | Wind power collection system of offshore wind power plant avoidance method for optimizing route and system |
| CN106250579A (en) * | 2016-07-08 | 2016-12-21 | 广东科诺勘测工程有限公司 | The method and device that a kind of power circuit path intelligence generates |
| CN106289255A (en) * | 2016-07-22 | 2017-01-04 | 云南师范大学 | Based on around barrier path planning across the trajectory bearing calibration of naval vessel, land |
| CN106529803A (en) * | 2016-11-09 | 2017-03-22 | 国网辽宁省电力有限公司经济技术研究院 | General cost management method and system |
| CN106971144A (en) * | 2017-02-28 | 2017-07-21 | 北京航空航天大学 | A kind of method that application Visual Graph algorithms extract center line of road |
| CN107527112A (en) * | 2017-07-31 | 2017-12-29 | 全球能源互联网研究院有限公司 | The method and apparatus of shortest path between a kind of determination power equipment |
| CN108120444A (en) * | 2016-11-29 | 2018-06-05 | 高德信息技术有限公司 | A kind of electronic map data processing method and device |
| CN108536934A (en) * | 2018-03-26 | 2018-09-14 | 国网浙江省电力有限公司温州供电公司 | The underground electric infrastructure method judged with geology |
| 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 |
| CN109308386A (en) * | 2018-09-11 | 2019-02-05 | 深圳市彬讯科技有限公司 | The recognition methods of engineering drawing wall, device and electronic equipment |
| CN109426682A (en) * | 2017-08-25 | 2019-03-05 | 苏州织巢信息科技有限公司 | A kind of route intelligent selection method and device |
| CN110222605A (en) * | 2019-05-24 | 2019-09-10 | 深兰科技（上海）有限公司 | A kind of obstacle detection method and equipment |
| CN110532508A (en) * | 2019-09-05 | 2019-12-03 | 东北大学 | A kind of multiple-objection optimization routing resource of the transmission line of electricity based on stepping ring grid |
| JP2020008743A (en) * | 2018-07-09 | 2020-01-16 | 中国電力株式会社 | Regulated area management system |
| CN111283688A (en) * | 2020-03-23 | 2020-06-16 | 深圳科瑞技术股份有限公司 | Obstacle avoidance method of robot and robot equipment |
| CN111310984A (en) * | 2020-01-21 | 2020-06-19 | 成都智库二八六一信息技术有限公司 | Path planning method and system based on two-dimensional map grid division |
| CN111539658A (en) * | 2020-06-24 | 2020-08-14 | 中铁二院工程集团有限责任公司 | Automatic design system of railway engineering construction organization |
| CN111739084A (en) * | 2019-03-25 | 2020-10-02 | 上海幻电信息科技有限公司 | Picture processing method, atlas processing method, computer device, and storage medium |
| CN111783264A (en) * | 2020-06-22 | 2020-10-16 | 杭州阳斯信息技术有限公司 | Efficient layout method for power distribution network planning |
| CN112687110A (en) * | 2020-12-23 | 2021-04-20 | 江苏高立泊车科技有限公司 | Parking space level navigation method and system based on big data analysis |
| CN113158384A (en) * | 2021-03-03 | 2021-07-23 | 东北石油大学 | Oil and gas pipeline route planning method and system |
| CN113658295A (en) * | 2021-08-12 | 2021-11-16 | 南方电网数字电网研究院有限公司 | Geographic information-based power grid edge layout mapping method and device |
| CN114019952A (en) * | 2021-10-08 | 2022-02-08 | 巢湖学院 | Cooperative transmission path building method based on micro-conveying unit |
| US11441915B2 (en) | 2019-06-18 | 2022-09-13 | M. A. Mortenson Company | Circuits for electricity-generating units |
| CN115759338A (en) * | 2022-10-18 | 2023-03-07 | 厦门亿力吉奥信息科技有限公司 | Power line edge distribution method based on power grid GIS map and storage medium |
| CN116238834A (en) * | 2022-12-08 | 2023-06-09 | 湖北凯乐仕通达科技有限公司 | Method and device for planning working path of stereoscopic warehouse system and computer equipment |
| CN116362648A (en) * | 2023-03-01 | 2023-06-30 | 泰维能源集团股份有限公司 | Efficient liquefied natural gas transportation strategy making method |
| CN116485056A (en) * | 2023-04-13 | 2023-07-25 | 珠海华成电力设计院股份有限公司 | Scene construction system based on transmission line path planning |
Citations (4)
| 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 |
-
2014
- 2014-06-12 CN CN201410261003.0A patent/CN103996089B/en active Active
Patent Citations (4)
| 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 |
Cited By (65)
| 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 |
| CN104199910A (en) * | 2014-08-28 | 2014-12-10 | 公安部交通管理科学研究所 | Automatic trunk highway network traffic safety law enforcement service station laying method based on GIS |
| CN104462685A (en) * | 2014-12-03 | 2015-03-25 | 江苏省电力公司淮安供电公司 | Transmission line design method based on GIS (grid) and Floyd algorithm |
| CN104462685B (en) * | 2014-12-03 | 2017-10-31 | 江苏省电力公司淮安供电公司 | Transmission Line Design method based on grid GIS and Floyd algorithms |
| CN104599069A (en) * | 2015-01-23 | 2015-05-06 | 云南电网有限责任公司 | Power transmission line route planning method based on environment factors and geographic features |
| 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 |
| CN105046017A (en) * | 2015-08-13 | 2015-11-11 | 深圳市置华机电设备有限公司 | Rapid node placement method and system for electromechanical seismic design |
| CN105046017B (en) * | 2015-08-13 | 2018-06-19 | 深圳市置华机电设备有限公司 | A kind of quick points distributing method and system of electromechanics Aseismic Design |
| CN105067004A (en) * | 2015-09-14 | 2015-11-18 | 武大吉奥信息技术有限公司 | Terrain-based path search method |
| 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 |
| CN106250579A (en) * | 2016-07-08 | 2016-12-21 | 广东科诺勘测工程有限公司 | The method and device that a kind of power circuit path intelligence generates |
| CN106202744B (en) * | 2016-07-12 | 2019-09-13 | 中国能源建设集团广东省电力设计研究院有限公司 | Wind power collection system of offshore wind power plant avoidance method for optimizing route and system |
| CN106202744A (en) * | 2016-07-12 | 2016-12-07 | 中国能源建设集团广东省电力设计研究院有限公司 | Wind power collection system of offshore wind power plant avoidance method for optimizing route and system |
| WO2018010471A1 (en) * | 2016-07-12 | 2018-01-18 | 中国能源建设集团广东省电力设计研究院有限公司 | Method and system for optimizing obstacle avoidance path of offshore wind farm current collection system |
| CN106289255A (en) * | 2016-07-22 | 2017-01-04 | 云南师范大学 | Based on around barrier path planning across the trajectory bearing calibration of naval vessel, land |
| CN106529803A (en) * | 2016-11-09 | 2017-03-22 | 国网辽宁省电力有限公司经济技术研究院 | General cost management method and system |
| CN106529803B (en) * | 2016-11-09 | 2020-03-24 | 国网辽宁省电力有限公司经济技术研究院 | General cost management method and system |
| CN108120444A (en) * | 2016-11-29 | 2018-06-05 | 高德信息技术有限公司 | A kind of 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 |
| CN106971144A (en) * | 2017-02-28 | 2017-07-21 | 北京航空航天大学 | A kind of method that application Visual Graph algorithms extract center line of road |
| CN107527112B (en) * | 2017-07-31 | 2020-06-12 | 全球能源互联网研究院有限公司 | Method and equipment for determining shortest path between power equipment |
| CN107527112A (en) * | 2017-07-31 | 2017-12-29 | 全球能源互联网研究院有限公司 | The method and apparatus of shortest path between a kind of determination power equipment |
| CN109426682B (en) * | 2017-08-25 | 2023-05-09 | 上海市上规院城市规划设计有限公司 | Intelligent line selection method and device |
| CN109426682A (en) * | 2017-08-25 | 2019-03-05 | 苏州织巢信息科技有限公司 | A kind of route intelligent selection method and device |
| CN108536934A (en) * | 2018-03-26 | 2018-09-14 | 国网浙江省电力有限公司温州供电公司 | The underground electric infrastructure method judged with geology |
| CN108536934B (en) * | 2018-03-26 | 2023-05-26 | 国网浙江省电力有限公司温州供电公司 | Underground power pipeline planning method with geological judgment |
| CN108646135A (en) * | 2018-04-08 | 2018-10-12 | 中国电建集团河北省电力勘测设计研究院有限公司 | A kind of digitlization selection method of UHV transmission line |
| CN108694506B (en) * | 2018-05-14 | 2021-06-18 | 广东电网有限责任公司广州供电局 | Method and device for determining construction demand of power distribution network cable tunnel |
| CN108694506A (en) * | 2018-05-14 | 2018-10-23 | 广州供电局有限公司 | Power distribution network cable tunnel construction demand amount determines method and device |
| JP2020008743A (en) * | 2018-07-09 | 2020-01-16 | 中国電力株式会社 | Regulated area management system |
| JP7187851B2 (en) | 2018-07-09 | 2022-12-13 | 中国電力株式会社 | Regulated area management system |
| CN109308386A (en) * | 2018-09-11 | 2019-02-05 | 深圳市彬讯科技有限公司 | The recognition methods of engineering drawing wall, device and electronic equipment |
| CN109308386B (en) * | 2018-09-11 | 2023-04-21 | 深圳市彬讯科技有限公司 | Engineering drawing wall body identification method and device and electronic equipment |
| CN111739084B (en) * | 2019-03-25 | 2023-12-05 | 上海幻电信息科技有限公司 | Picture processing method, atlas processing method, computer device, and storage medium |
| CN111739084A (en) * | 2019-03-25 | 2020-10-02 | 上海幻电信息科技有限公司 | Picture processing method, atlas processing method, computer device, and storage medium |
| CN110222605A (en) * | 2019-05-24 | 2019-09-10 | 深兰科技（上海）有限公司 | A kind of obstacle detection method and equipment |
| CN110222605B (en) * | 2019-05-24 | 2021-11-19 | 深兰科技（上海）有限公司 | Obstacle detection method and equipment |
| US11441915B2 (en) | 2019-06-18 | 2022-09-13 | M. A. Mortenson Company | Circuits for electricity-generating units |
| CN110532508A (en) * | 2019-09-05 | 2019-12-03 | 东北大学 | A kind of multiple-objection optimization routing resource of the transmission line of electricity based on stepping ring grid |
| WO2021042423A1 (en) * | 2019-09-05 | 2021-03-11 | 东北大学 | Stepping ring grid-based multi-objective optimization path selection method for transmission line |
| CN110532508B (en) * | 2019-09-05 | 2020-09-18 | 东北大学 | Multi-objective optimization path selection method of power transmission line based on stepping ring grid |
| CN111310984A (en) * | 2020-01-21 | 2020-06-19 | 成都智库二八六一信息技术有限公司 | Path planning method and system based on two-dimensional map grid division |
| CN111310984B (en) * | 2020-01-21 | 2023-09-26 | 成都智库二八六一信息技术有限公司 | Path planning method and system based on two-dimensional map grid division |
| CN111283688B (en) * | 2020-03-23 | 2021-08-10 | 深圳市科瑞技术科技有限公司 | Obstacle avoidance method of robot and robot equipment |
| CN111283688A (en) * | 2020-03-23 | 2020-06-16 | 深圳科瑞技术股份有限公司 | Obstacle avoidance method of robot and robot equipment |
| CN111783264B (en) * | 2020-06-22 | 2024-04-30 | 杭州阳斯信息技术有限公司 | Efficient layout method for power distribution network planning |
| CN111783264A (en) * | 2020-06-22 | 2020-10-16 | 杭州阳斯信息技术有限公司 | Efficient layout method for power distribution network planning |
| CN111539658B (en) * | 2020-06-24 | 2022-09-02 | 中铁二院工程集团有限责任公司 | Automatic design system of railway engineering construction organization |
| CN111539658A (en) * | 2020-06-24 | 2020-08-14 | 中铁二院工程集团有限责任公司 | Automatic design system of railway engineering construction organization |
| CN112687110B (en) * | 2020-12-23 | 2023-02-28 | 江苏高立泊车科技有限公司 | Parking space level navigation method and system based on big data analysis |
| CN112687110A (en) * | 2020-12-23 | 2021-04-20 | 江苏高立泊车科技有限公司 | Parking space level navigation method and system based on big data analysis |
| CN113158384A (en) * | 2021-03-03 | 2021-07-23 | 东北石油大学 | Oil and gas pipeline route planning method and system |
| CN113658295A (en) * | 2021-08-12 | 2021-11-16 | 南方电网数字电网研究院有限公司 | Geographic information-based power grid edge layout mapping method and device |
| CN114019952B (en) * | 2021-10-08 | 2024-04-30 | 巢湖学院 | Cooperative transmission path construction method based on micro-conveying unit |
| CN114019952A (en) * | 2021-10-08 | 2022-02-08 | 巢湖学院 | Cooperative transmission path building method based on micro-conveying unit |
| CN115759338B (en) * | 2022-10-18 | 2024-04-16 | 厦门亿力吉奥信息科技有限公司 | Power line edge distribution method based on power grid GIS map and storage medium |
| CN115759338A (en) * | 2022-10-18 | 2023-03-07 | 厦门亿力吉奥信息科技有限公司 | Power line edge distribution method based on power grid GIS map and storage medium |
| CN116238834B (en) * | 2022-12-08 | 2024-01-02 | 湖北凯乐仕通达科技有限公司 | Method and device for planning working path of stereoscopic warehouse system and computer equipment |
| CN116238834A (en) * | 2022-12-08 | 2023-06-09 | 湖北凯乐仕通达科技有限公司 | Method and device for planning working path of stereoscopic warehouse system and computer equipment |
| CN116362648B (en) * | 2023-03-01 | 2023-11-07 | 泰维能源集团股份有限公司 | Efficient liquefied natural gas transportation strategy making method |
| CN116362648A (en) * | 2023-03-01 | 2023-06-30 | 泰维能源集团股份有限公司 | Efficient liquefied natural gas transportation strategy making method |
| CN116485056B (en) * | 2023-04-13 | 2023-10-20 | 珠海华成电力设计院股份有限公司 | Scene construction system based on transmission line path planning |
| CN116485056A (en) * | 2023-04-13 | 2023-07-25 | 珠海华成电力设计院股份有限公司 | Scene construction system based on transmission line path planning |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103996089B (en) | 2016-04-06 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103996089B (en) | Based on the transmission line of electricity optimal path generation method of GIS | |
| CN104567906B (en) | A kind of city road network vehicle path planning method and device based on the Big Dipper | |
| Postance et al. | Extending natural hazard impacts: an assessment of landslide disruptions on a national road transportation network | |
| CN104821013A (en) | Method and system for specific surface area extraction based on geodetic coordinate system digital elevation model | |
| CN103984997A (en) | Transmission project site and line selecting method based on GIS space information | |
| Antikainen | Comparison of different strategies for determining raster‐based least‐cost paths with a minimum amount of distortion | |
| CN103971184A (en) | Power transmission line path generation method based on spatial GIS (Geographic Information System) | |
| CN105067004A (en) | Terrain-based path search method | |
| CN104270785A (en) | Wireless network region problem positioning method based on geography grid aggregation | |
| US20210325907A1 (en) | Method and apparatus for generating an aerial navigation route based on a payload survivability estimate | |
| CN109146360A (en) | Grid method for building up and device and allocator and device | |
| CN104575085A (en) | Public bus arrival dynamic inducing method and device based on floating buses | |
| CN104123671B (en) | Meteorological reference station partition method | |
| Suleiman et al. | Optimal route location by least cost path (LCP) analysis using (GIS) a case study | |
| CN115830255A (en) | Simulation scene generation method and device, electronic equipment and storage medium | |
| CN111914039B (en) | Road network updating method and device | |
| JP6276228B2 (en) | Additional route selection device, additional route selection method, and program | |
| US11410560B2 (en) | Method and apparatus for representing an aerial route in a three-dimensional space | |
| Ganendra et al. | The role of airborne LiDAR survey technology in digital transformation | |
| Honma et al. | Traffic impacts of on-street parking cars on secondary north-south streets in downtown Yangon | |
| Jovanovic et al. | Analysis of free road data in Tanzania, Uganda and Kenya using free and open source software | |
| US20210006486A1 (en) | Route calculation method, route calculation device, and program | |
| Sarmento | Automatic routing of water supply pipelines | |
| JP5601588B2 (en) | Road information providing apparatus, road information providing program, and recording medium | |
| CN103226195B (en) | Monitoring coverage analysis method |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for 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 | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant |