CN106250579A - The method and device that a kind of power circuit path intelligence generates - Google Patents
The method and device that a kind of power circuit path intelligence generates Download PDFInfo
- Publication number
- CN106250579A CN106250579A CN201610542538.4A CN201610542538A CN106250579A CN 106250579 A CN106250579 A CN 106250579A CN 201610542538 A CN201610542538 A CN 201610542538A CN 106250579 A CN106250579 A CN 106250579A
- Authority
- CN
- China
- Prior art keywords
- cell
- route selection
- submodule
- obstacle
- circuit
- 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
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F30/00—Computer-aided design [CAD]
- G06F30/10—Geometric CAD
- G06F30/18—Network design, e.g. design based on topological or interconnect aspects of utility systems, piping, heating ventilation air conditioning [HVAC] or cabling
Landscapes
- Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- Geometry (AREA)
- Theoretical Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Mathematical Analysis (AREA)
- Computational Mathematics (AREA)
- Mathematical Optimization (AREA)
- Pure & Applied Mathematics (AREA)
- Computer Hardware Design (AREA)
- Evolutionary Computation (AREA)
- General Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Navigation (AREA)
- Supply And Distribution Of Alternating Current (AREA)
Abstract
The present invention relates to the method that a kind of power circuit path intelligence generates, including step: set up rule, including setting atural object coding rule, setting up basis route selection rule and route selection special rules；Set up route selection region, determine target route selection region, limit working range；Carry out obstacle analysis, according to route selection region, obtain geographic information data in involved region, set up unit grids, whether it is obstacle grid according to unit grids involved by route selection rule judgment geography information, if it is the attribute of its route selection rule is attached on cell；According to the cell set in route selection region, circuit search algorithm generate circuit.Relative to prior art, the power circuit path intelligent generation method of the present invention considers the line alignment in Engineering Zone, and scientifically analytical plan index comprehensively, is equipped with crucial index contrast and analyzes, it is possible to be effectively improved efficiency and the accuracy rate of coordinates measurement.It addition, present invention also offers the device that a kind of power circuit path intelligence generates.
Description
Technical field
The invention belongs to power circuit planning field, especially relate to method that a kind of power circuit path intelligence generates and
Device.
Background technology
Along with the development of science and technology, electric power has become the energy that people's live and work is indispensable, the construction of power system
Also being the important component part of urban planning, the design to transmission line of electricity requires more and more higher.Design at transmission line of electricity
Cheng Zhong, the early stage in path selects, scheme comparison analyzes it is critical that.During the design of existing circuit early stage, often use base
Carry out route selection work in traditionally on paper topography, or importing image or topography mode carry out line on the design softwares such as CAD
Road selects and draws.Which kind of method above, it stresses terrain information analysis, for other factors, such as natural cause, people
Literary composition building dodges factor, built configuration factor etc., and to consider ability relatively low.Meanwhile, also need to take into account line length, corner
The many factors such as quantity, cost, simple dependence work point analysis, spent time, workload are huge, and route selection precision has
Limit.Path based on CAD diagram paper manual drawing generally requires local directed complete set in follow-up Preliminary design, construction drawing design, adjusts
Version trackability is relatively low；The mode that CAD software is drawn is more easily than amendment with manual route selection, preserves and issue, but limited
Implementation in its drawing coordinate system and the limited support to geodata, it is difficult to ensure that exploration or the essence of introducing geodata
Degree, is also not easy to merge and share.
It addition, along with gradually development and geodata resource the most perfect of GIS (GIS-Geographic Information System) technology, use
Generalized information system fits into the power circuit design of digitized and has become as feasible variant projects of location, it is possible to the fullest
The foot requirement such as ageing, precision and data sharing, but, still suffer from following shortcoming based on generalized information system manual drawing circuit:
(1). rule is by manually formulating, it is impossible to preserves and reuses, and yet suffers from the calculating of rule and apply easily
Situation about makeing mistakes, it is impossible to make system from moving constraint and check rule.
(2). being not easy to carry out data statistics, during manual drawing circuit, most parameters cannot quantify.
(3). well can not associate with economic indicator, and then by calculating expense, different schemes be contrasted.
Summary of the invention
The present invention is achieved by the following technical solutions: the method that a kind of power circuit path intelligence generates, including step
Rapid:
S1: set up rule, sets atural object coding, configuration route selection rule, arranges special rules；
S2: set up route selection region, specifies route selection working range；
S3: carry out obstacle analysis, is converted to cell set according to route selection rule by described route selection region, and according to route selection
The attribute of rule mark cell and state；
S4: according to the cell set in route selection region, circuit search algorithm generate circuit.
Relative to prior art, the power circuit path intelligent generation method of the present invention utilizes geographical information technology, in conjunction with
Computer analysis method, by important atural object analysis of Influential Factors systematization, it is provided that multipath scheme, route selection office the most on a large scale
Portion adjusts and can carry out by successive ignition with refinement, considers the line alignment in Engineering Zone, and scientifically analytical plan index comprehensively,
It is equipped with crucial index contrast and analyzes, it is possible to be effectively improved efficiency and the accuracy rate of coordinates measurement.
Further, described route selection rule, including global rule, cross over and dodge rule and/or special rules, described entirely
Office's rule includes that strain section span and crank degree limit, described leap with dodge rule for limit leap Breadth Maximum and
Maximum height, described special rules, including crossing a little and must cross line.
Further, according to the restriction scope of power engineering as route selection region, or draw polygon as route selection district
Territory.
Further, described step S3 farther includes step:
S31: formatted by route selection regional network, is converted to the set of multiple cell；
S32: traversal key element, takes the GEDI encoded radio of key element, inquires about corresponding route selection rule according to GEDI encoded radio；
S33: the district that the scope involved by key element shape and its evaded distance that calculating has route selection regular is positioned in grid
Territory, is labeled as the cell in this region obstacle, and is attached on cell by route selection rules properties.
Further, described step S4 farther includes step:
S41: judge whether to define special rules, if it does not, forward step S44 to；If it is, forward step S42 to；
S42: process the Points And lines that must cross；
S43: segmentation is called S44 and is circulated sectionalized line search；
S44: carry out circuit search according to circuit search algorithm.
Further, after step s4, including step: judge to generate whether circuit has result, if it is, carry out index
Contrast, minimum according to corner, length is the shortest and cost minimum of three index contrasts, draw the optimum knot of each index
Really；If it does not, end intelligent route selection.
Further, after step s4, including: carry out result refinement, automatically generate according to route selection result or manually adjust
Whole route selection region, setup parameter again, re-execute route selection process.
Further, described circuit searching algorithm comprises the following steps:
S4a: judge whether beginning and end line passes obstacle, if it does not, directly output line route；If it is, turn
To step S4b；
S4b: reset trellis state, has generated circuit if existing, and when resetting trellis state, skip flag is obstacle, rises temporarily
Stop and the cell that may span across state；
S4c: add starting point cell to open list, carries out following circular treatment；
Circulation step S4d is to step S4m:
S4d: take away and emplace the cell of Least-cost in table and, as current cell, forward step S4e to；
S4e: judge whether current cell is the cell that may span across, if it is, forward step S4g to；If it does not, forward to
Step S4f；
S4f: current cell is set to obstacle, and removes from open list, forward step S4d to；
S4g: move on to close list, if current cell is the obstacle unit that may span across from open list by current cell
Lattice, then be added to cross in cell set Sc, forward step S4h to；
S4h: judge whether to reach home or the open list at non-starting point cell place is sky, if it is, stop
Circulation, forwards step S4m to, if it does not, forward step S4i to；
S4i: from all directions to searching surrounding cells lattice, by the most non-obstacle not in cell join, and tool around
Have leap property obstacle and not in cell add, calculate actual cost and estimate cost, and the father of these grid is single
Unit's lattice point to, and forward step S4j to；
S4j: judge around current cell, whether eight cells are all the obstacle that not may span across, if it is, forward step to
Rapid S4k；If it does not, forward step S4l to；
S4k: current cell is set to obstacle, and removes from closing list, forward step S4d to；
S4l: path optimizing, it is judged that whether circuit cost can reduce further, if it is, replace current cell, and
Forward step S4d to；If it does not, pass directly to step S4d；
S4m: judge whether to find terminal, searches for unsuccessfully if it does not, return；If it is, forward step S4n to；
S4n: start forward from terminal, takes father's cell composition list of each cell, until starting point；
S4o: take all unit centers of a lattice in cell list, be linked in sequence into circuit, form this route selection line
Road；
S4p: obtain anchor support tower position information.
Further, described step S4l, further include steps of
In the open list of S4l1: cycle calculations, candidate unit lattice are to determining the distance cost of cell, obtain wherein cost
Minimum unit lattice as current cell, forward step S4l2 to；
S4l2: obtain candidate unit lattice about from current cell, calculate previous cell to candidate unit lattice away from
Whether determine that cell arrives the cost of candidate unit lattice again to current cell, if it is, forward step to less than upper one from cost
S4l3；If it is not, then forward step S4d to；
S4l3: current cell is replaced to this candidate unit lattice corresponding to minima cost, forwards step S4d to.
Further, after described step S4p, further include steps of
S4q: determine whether to generate a plurality of circuit, if it is, by complete for the cell of current line side in route selection region
Portion is set to interim constraint failure condition, returns to step S3b and generates other route.
It addition, the present invention also provides for the device that a kind of power circuit path intelligence generates, set up module, route selection including rule
Module, obstacle analysis module and circuit generation module are set up in region, wherein,
Rule sets up module, is used for setting terrestrial object information coding, configuration basis route selection rule, arranging route selection special rules；
Module is set up in route selection region, is used for determining target route selection region, limits working range；
Obstacle analysis module, for according to route selection region, obtains geographic information data in involved region, sets up unit net
Whether lattice, be obstacle grid according to unit grids involved by route selection rule judgment geography information, if it is carried out route selection
Rules properties is attached on cell；
Circuit generation module, for according to the cell set in route selection region, being generated circuit by circuit search algorithm.
Relative to prior art, the power circuit path intelligence generating means of the present invention utilizes geographical information technology, in conjunction with
Computer analysis method, by important atural object analysis of Influential Factors systematization, it is provided that multipath scheme, route selection office the most on a large scale
Portion adjusts and can carry out by successive ignition with refinement, considers the line alignment in Engineering Zone, and scientifically analytical plan index comprehensively,
It is equipped with crucial index contrast and analyzes, it is possible to be effectively improved efficiency and the accuracy rate of coordinates measurement.
Further, described obstacle analysis module farther include gridding submodule, route selection rule query submodule and
Obstacle marking submodule, wherein,
Gridding submodule, for being formatted by route selection regional network, is converted to the set of multiple cell；
Route selection rule query submodule, is used for traveling through key element, takes the GEDI encoded radio of key element, inquires about according to GEDI encoded radio
Corresponding route selection rule；
Obstacle marking submodule, for calculating the scope involved by the key element shape and its evaded distance having route selection rule
The region being positioned in grid, is labeled as the cell in this region obstacle, and is attached on cell by route selection rules properties.
Further, described circuit generation module farther include special rules judge submodule, special rules process son
Module, segment processing search submodule and circuit search submodule, wherein,
Special rules judges submodule, is used for judging whether to define special rules；
Special rules processes submodule, for processing the Points And lines that must cross.
Segment processing search submodule, for according to set up must cross a little with must cross line, carry out line sectionalizing, and call line
Submodule is searched on road, carries out sectioning search；
Circuit search submodule, for carrying out circuit search according to circuit search algorithm.
Further, generate judge module including a circuit, be used for judging to generate whether circuit has result, if it is, logical
Know that index contrasts module；If it does not, end intelligent route selection.
Further, including an index contrast module, be used for carrying out index contrast, minimum according to corner, length is the shortest and
Cost minimum of three index contrasts, and draws the optimal result of each index.
Further, including a result refinement module, it is used for carrying out result refinement, automatically generates or hands according to route selection result
Dynamic adjustment route selection region, again setup parameter, re-execute route selection process.
Further, described circuit search submodule specifically includes following submodule:
Direct-connected judgement submodule, is used for judging whether beginning and end line passes obstacle, if it does not, directly export line
Route；If it is, notice；
Network reset submodule, is used for resetting trellis state, has generated circuit if existing, and skips mark when resetting trellis state
It is designated as obstacle, interim terminal and may span across the cell of state；
Starting point adds submodule, for adding starting point cell to open list；
Current cell obtains submodule, emplaces in table the cell of Least-cost as current cell for taking away；
Cell attributive judgment submodule, for judging whether current cell is the cell that may span across, if it is, logical
MS closes list and adds submodule；If it does not, notify that the first current cell removes module；
First current cell removes module, for current cell is set to obstacle, and moves on to close from open list
List, notice loop ends judges submodule；
Close list and add submodule, for moving on to close list from open list by current cell, if active cell
Lattice are the obstacle cell that may span across, then be added to cross in cell set Sc；
Loop ends judges submodule, if reaching home or opening list is sky, then stops circulation, notifies endpoint
Submodule, if it does not, notice is from all directions to searching submodule；
From all directions to searching submodule, for from all directions to searching surrounding cells lattice, by the most non-obstacle not in cell
Join, and around have leap property obstacle and not in cell add, calculate actual cost and estimate cost, and
Father's cell of these grid is pointed to；
Candidate unit lattice judge submodule, are used for judging around current cell whether eight cells are all and not may span across
Obstacle, if it is, notify that the second current cell removes module；If it does not, announcement trunk optimizes submodule；
Second current cell removes module, for current cell is set to obstacle, and removes from closing list, logical
Know that current cell obtains submodule；
Line optimization submodule, for path optimizing, it is judged that whether circuit cost can reduce further, if it is, replace
Changing current cell, notice current cell obtains submodule；If it does not, directly notice current cell obtains submodule；
Endpoint submodule, is used for judging whether to find terminal, searches for unsuccessfully if it does not, return；If it is, notify father
Module is set up in cell list；
Module is set up in father's cell list, for starting forward from terminal, takes father's cell composition row of each cell
Table, until starting point；
Wire connecting block, for taking all unit centers of a lattice in cell list, is linked in sequence into circuit, shape
Become this route selection circuit；
Anchor support data obtaining module, is used for obtaining anchor support tower position information.
Further, described line optimization submodule, farther include following submodule:
Cost calculation sub-module, in the open list of cycle calculations, candidate unit lattice are to the distance generation determining cell
Valency, obtains the minimum unit lattice of wherein cost as current cell, notice minimum cost calculating sub module；
Minimum cost calculating sub module, for obtaining candidate unit lattice about from current cell, calculates upper one single
Less than upper one, whether unit's lattice determine that cell arrives the generation of candidate unit lattice again to current cell to candidate unit lattice distance cost
Valency, if it is, forward notice to replace submodule；If it does not, notice current cell obtains submodule；
Replace submodule, for current cell is replaced to this candidate unit lattice corresponding to minima cost, notice
Current cell obtains submodule.
In order to enable the apparent understanding present invention, illustrate to illustrate the detailed description of the invention of the present invention below with reference to accompanying drawing.
Accompanying drawing explanation
Fig. 1 is the step schematic diagram of a kind of power circuit path intelligent generation method of the present invention.
Fig. 2 is obstacle analysis step schematic diagram.
Fig. 3 is circuit intelligent search basic step schematic diagram.
Fig. 4 is circuit searching algorithm step schematic diagram.
Fig. 5 is circuit searching algorithm overall schematic on map.
Fig. 6 is the structural representation of the power circuit path intelligence generating means of the present invention.
Fig. 7 is the structural representation of obstacle analysis module.
Fig. 8 is the structural representation of circuit generation module.
Fig. 9 is the structural representation of circuit search submodule.
Detailed description of the invention
The overall technical architecture of the present invention mainly comprises following core process:
(1). set atural object coding.Different atural objects for being likely to occur in map set classification and coding standard, set up ground
Thing classification and coding storehouse.
(2). configuration route selection rule.The route selection rule of the overall situation is set up, as the acquiescence of all engineerings for all route selection engineerings
Route selection rule.In single engineering, default rule can be modified and re-apply.
(3). special rules is set.Special rules is divided into " must cross a little " and " must cross line " two kinds.Must cross and a little refer to select
Circuit has to pass through the point specified；The circuit that line refers to select must be crossed and must comprise the straightway or curved section specified.Points And lines
Can freely specify or draw.
(4). set route selection region.The shape in route selection region can be rectangle, it is also possible to be polygon.For selecting each time
Line, acquiescence uses the restriction scope of engineering as route selection region, it is also possible to draws polygon and is used as route selection region.
(5). disturbance of analysis.In conjunction with route selection region, according to route selection rule, tune being painted data parsing is network.
(6). generate circuit.According to obstacle grid, use optimization to seek footpath algorithm and generate initial plant, and be optimized.
(7). result refines.Automatically generate or manually adjust route selection region, again setup parameter according to route selection result, again
Perform route selection process.
(8). index contrasts.When generating a plurality of circuit, algorithm is minimum according to corner, length is the shortest and cost minimum of three refers to
Mark contrasts, and draws the optimal result of each index.
Referring to Fig. 1, it is the step schematic diagram of a kind of power circuit path intelligent generation method of the present invention, including step
Rapid:
S1: set up rule, sets atural object coding, configuration route selection rule, arranges special rules；
S2: set up route selection region, specifies route selection working range；
S3: carry out obstacle analysis, is converted to described route selection region cell set according to route selection rule, and identifies and single
The attribute of unit's lattice and state；
S4: according to the cell set in route selection region, circuit search algorithm generate circuit；
S5: judge to generate whether circuit has result, if it is, forward step S6 to；If it does not, end intelligent route selection；
S6: carry out index contrast, minimum according to corner, length is the shortest and cost minimum of three index contrasts,
Go out the optimal result of each index；
S7: carry out result refinement, automatically generates or manually adjusts route selection region, again setup parameter according to route selection result,
Re-execute route selection process；
S8: output generates circuit.
Hereinafter each step of the power circuit path intelligent generation method of the present invention is specifically introduced:
S1: set up rule, sets atural object coding, configuration route selection rule, arranges special rules；
(1) atural object coding (GEDI)
All atural objects are grouped by atural object coding standard by type, form the two layer encoding knot of " classification-type of ground objects "
Structure.The base attribute such as table 3-1 of atural object coding.
Table 3-1 atural object coded object base attribute table
(2) route selection rule
Route selection rule includes global rule and leap, dodges rule and special rules.
Route selection global rule arranges and includes that strain section span and crank degree limit.Strain section is between two strain rod towers
Part of path, need during designed lines its minimum range is configured, ensure that the minimum distance of its strain section is not less than a certain
Limit value；Crank degree be along line direction at angle tower before and after the angle of two sections, need to set a upper limit, it is to avoid circuit
Steering angle exceeds standard.
Crossing over and dodging rule refers to when designed lines, the strategy that circuit is taked through all kinds of atural objects.Cross over rule
Then comprise leap width and spanning height, be respectively used to limit the Breadth Maximum crossed over and maximum height.For setting this type of rule
Atural object then, circuit can be crossed over less than its maximum width at atural object, can cross over less than maximum height region at atural object.
In addition to the route selection rule being pre-configured with, before route selection, still can add special rules.Special rules includes two classes: must cross a little
With must cross line.Must cross the angle tower being a little usually expressed as circuit, circuit has to pass through this point；Must cross line be one section default
Route segment, circuit must comprise this route segment.Must cross a little and line must be crossed and all manually be specified by user.
S2: set up route selection region, specifies route selection working range.
When starting route selection, system default is using works scope as route selection region.Works scope sets can be from administrative region
It is set, including provincial, city-level, three grades of administrative divisions at county level.Engineering can also be carried out by the method that automatic rectangle is drawn
Regional choice.
In view of the complexity of engineering, and the continuing to optimize of route selection process, it is provided that route selection region is arranged.Selected region
Setting is possible not only to be rectangle, and could be arranged to the polygon that shape is changeable, and user is by drawing this region on map
Carry out self-defined route selection scope.Adjusting route selection region is to press close to project demands, it is provided that the constantly setting in refinement route selection region, one
Aspect is avoided that input a large amount of operation times, in deficient excellent region, on the other hand improve route selection quality.
S3: carry out obstacle analysis, is converted to cell set according to route selection rule by described route selection region, and according to route selection
The attribute of rule mark cell and state.
Obstacle analysis function is the data analysis preparation of route selection, with route selection region as border, according to the precision set
Build grid, the atural object in route selection region is converted to cell set by the setting of route selection rule, and identifies each unit lattice
Attribute and state.
Atural object in route selection region is defined as key element, and these atural objects possess corresponding route selection rule, if the route selection of key element
Rule is to dodge, then the cell corresponding to the scope involved by this key element and its evaded distance will be labeled as obstacle list
Unit, and include obstacle set in.As in figure 2 it is shown, concrete obstacle analysis step is:
S31: formatted by route selection regional network, is converted to the set of multiple cell；
S32: traversal key element, takes the GEDI encoded radio of key element, inquires about corresponding route selection rule according to GEDI encoded radio；
S33: the district that the scope involved by key element shape and its evaded distance that calculating has route selection regular is positioned in grid
Territory, is labeled as the cell in this region obstacle, and is attached on cell by route selection rules properties.
Packet purse rope lattice in obstacle analysis, cell, cell association atural object element information, cell state etc..
Grid scope keeps consistent with route selection regional extent, and the data structure of grid is as shown in table 3-2.
The data structure of table 3-2 grid
Cell is the minimum unit of composition grid, using row, column index as mark.Cell in route selection region can be whole
Body is divided into two classes, and a class is non-obstacle Unit Cell (can be through cell), and an other class is obstacle cell.Obstacle cell
The inside can be according to regular partition for dodging, may span across width, may span across three subclasses of height, the data structure of cell such as table 3-
Shown in 3.
The data structure of table 3-3 cell
S4: according to the cell set in route selection region, circuit search algorithm generate circuit.
Line selection algorithm uses different steps to generate line for two kinds of situations of " without special rules " and " having special rules "
Road, and in the case of " having special rules " (i.e. define to cross and a little maybe must cross line), restriction can be only generated a circuit, line
Road intelligent search basic step is as it is shown on figure 3, include step:
S41: judge whether to define special rules, if it does not, forward step S44 to；If it is, forward step S42 to；
S42: process the Points And lines that must cross；
S43: segmentation is called S44 and is circulated sectionalized line search；
S44: carry out circuit search according to circuit search algorithm.
The Points And lines concrete grammar that process must be crossed is as follows:
(1). parsing special rules:
A) sequence
When be provided with simultaneously must cross a rule and line rule must be crossed time, it is thus necessary to determine that circuit through must cross a little with must cross line
Sequentially, therefore must be ranked up crossing a little and line must be crossed before analysis rule.The foundation of sequence is must to cross a little to rise to route selection
The distance put and the starting point distance to route selection starting point that must cross line, according to arranging from small to large.
B) fixed cell lattice set is built
Fixed cell lattice represent the cell that circuit has to pass through.
I. for crossing a little, a place cell must be crossed and add fixed cell lattice to.
Ii. for line must be crossed, need by must cross line the cell of process all add fixed cell lattice to, and line must be crossed
Origin And Destination place cell labelling be marked, it is ensured that next step line sectionalizing is reasonable.
(2). carry out segmentation by fixed cell lattice, respectively each segmentation in addition to must crossing line is called " during without special rules
Line selection algorithm ", and each section of circuit ultimately generated is merged into a circuit with crossing line.
Hereinafter circuit searching algorithm is described in detail, used symbol and meaning such as following table 3-4.
Table 3-4 symbol synopsis
As shown in Figure 4, circuit searching algorithm comprises the following steps:
S4a: judge whether beginning and end line passes obstacle, if it does not, directly output line route；If it is, turn
To step S4b；
S4b: reset trellis state, has generated circuit if existing, and when resetting trellis state, skip flag is obstacle, rises temporarily
Stop and the cell that may span across state；
S4c: add starting point cell to open list, carries out following circular treatment；
Circulation step S4d is to step S4m:
S4d: take away and emplace the cell of Least-cost in table and, as current cell, forward step S4e to；
Cost described here refers to air line distance between points, does not consider barrier factors.Cost in open list
Minimum cell refers to that in open list, cell determines a little to upper one and this point is the shortest to the air line distance of terminal sum
Cell.
S4e: judge whether current cell is the cell that may span across, if it is, forward step S4g to；If it does not, forward to
Step S4f；
Here be Tong Guo the attribute judging current cell, a total of three kinds of situations: non-obstacle, the obstacle that may span across,
The obstacle that not may span across.Wherein, non-obstacle, the obstacle that may span across broadly fall into the cell that may span across, and the obstacle that not may span across
Belong to the cell that not may span across.
S4f: current cell is set to obstacle, and moves on to close list from open list, forward step S4d to；
S4g: move on to close list, if current cell is the obstacle unit that may span across from open list by current cell
Lattice, then be added to cross in cell set Sc, forward step S4h to；
It is non-obstacle and the obstacle that may span across for current cell, then it is moved on to close list from open list, right
It is the obstacle that may span across in current cell, also to add it to cross over cell set Sc.
S4h: judge whether to reach home or the open list at non-starting point cell place is sky, if it is, stop
Circulation, forwards step S4m to, if it does not, forward step S4i to；
S4i: from all directions to searching surrounding cells lattice, by the most non-obstacle not in cell join, and tool around
Have leap property obstacle and not in cell add, calculate actual cost and estimate cost, and the father of these grid is single
Unit's lattice point to, and forward step S4j to；
S4j: judge around current cell, whether eight cells are all the obstacle that not may span across, if it is, forward step to
Rapid S4k；If it does not, forward step S4l to；
S4k: current cell is set to obstacle, and removes from closing list, forward step S4d to；
S4l: path optimizing, it is judged that whether circuit cost can reduce further, if it is, replace current cell, and
Forward step S4d to；If it does not, pass directly to step S4d；
S4m: judge whether to find terminal, searches for unsuccessfully if it does not, return；If it is, forward step S4n to；
S4n: start forward from terminal, takes father's cell composition list of each cell, until starting point；
S4o: take all unit centers of a lattice in cell list, be linked in sequence into circuit, form this route selection line
Road；
S4p: obtain anchor support tower position information；
S4q: determine whether to generate a plurality of circuit, if it is, by complete for the cell of current line side in route selection region
Portion is set to interim constraint failure condition, returns to step S4b and generates other route.
Step S4l, further includes steps of
In the open list of S4l1: cycle calculations, candidate unit lattice are to determining the distance cost of cell, obtain wherein cost
Minimum unit lattice as current cell, forward step S4l2 to；
S4l2: obtain candidate unit lattice about from current cell, calculate previous cell to candidate unit lattice away from
Whether determine that cell arrives the cost of candidate unit lattice again to current cell, if it is, forward step to less than upper one from cost
S4l3；If it is not, then forward step S4d to；
S4l3: current cell is replaced to this candidate unit lattice corresponding to minima cost, forwards step S4d to.
As it is shown in figure 5, be circuit searching algorithm overall schematic on map, whole route selection region with grid representation,
Normal region is converted to normal cells lattice, and starting point, terminal, obstacle and may span across obstacle and be all conceptualized as the list of band specific properties
Unit's lattice, algorithm is searched from starting point, until finding terminal, if finally cannot search terminal, then returns to search and loses
Lose.Figure upward arrow indication region is search center point, and the numeral on arrow is search step.In figure, arrow has number designation,
Numeral is used to refer to the order of step.What arrow pointed to is the current cell of each step, if the numeral indicated on arrow is
Single (such as 1), represents and has been incorporated into open list LoCandidate unit lattice；If the numeral indicated is the such shape of 1-2
Formula, represents that this cell is become next step current cell by the candidate unit lattice of current cell, and i.e. next step can be with
This element lattice are starting point, the search work before repetition, until searching terminal or returning empty result.And search and may span across
Cell time, can the distance crossed over of real-time judge, if this leap distance exceedes route selection rule and is set up when may span across distance singly
Unit's lattice can be judged as passing through, and readjusts the direction of search.After so searching terminal, then follow arrow and mark from terminal
Know numeral (such as 22-23 form), go back to 22 from 23, find starting point, it is possible to conspire to create a circuit in accordance with rule.
Algorithm process cross over rule time, employ series of cells collection incompatible preservation search procedure passes can be across
More cell, when searching route continuously passes through and may span across cell, algorithm can verify whether the distance currently passed through exceeds
Cross over limiting distance (value of this distance is determined) by the rule being applied on cell, beyond representing current search when limiting
Path not may span across, and needs to return forward and again search.
S5: judge to generate whether circuit has result, if it is, forward step S6 to；If it does not, end intelligent route selection.
Step S5 judges to generate whether circuit has result, generation circuit is come to nothing when, can change further
Restrictive condition regenerates again, may comprise steps of:
S51: judge that whether circuit re-searches for number of times more than 3 times, if it does not, forward step S52 to；If it is, end intelligence
Can route selection；
S52: change restrictive condition, forward step S4 to；
S6: carry out index contrast, minimum according to corner, length is the shortest and cost minimum of three index contrasts,
Go out the optimal result of each index.
After generating a circuit, the cell of this circuit process is set to obstacle by algorithm, regenerates next circuit.
According to the character that cell in route selection grid is limited, make can to generate in aforementioned manners in a limited number of grid is all feasible
Circuit, and the index of each circuit can be calculated, then carry out result selection according to desired value.
Index contrast content includes that corner number, line length, cost expense etc. contrast, and stresses according to detailed programs
Point be analyzed, draw the comparative result of different schemes, to recommend in intelligent route selection preferably power circuit route scheme.
S7: carry out result refinement, automatically generates or manually adjusts route selection region, again setup parameter according to route selection result,
Re-execute route selection process.
After generating circuit, can refine based on result path: use result path to buffer, buffering is obtained
Polygon, as new route selection region, reduces or changes obstruction data source process range, improves obstacle grid and arranges precision, to line
Path, road is adjusted or refines；Existing circuit can also be used to carry out buffering or draw new buffer area, as next
The working region that individual route selection optimizes.
S8: output generates circuit；
After intelligent route selection, index contrast and result refinement, generate circuit, export result.
Relative to prior art, the power circuit path intelligent generation method of the present invention utilizes geographical information technology, in conjunction with
Computer analysis method, by important atural object analysis of Influential Factors systematization, it is provided that multipath scheme, route selection office the most on a large scale
Portion adjusts and can carry out by successive ignition with refinement, considers the line alignment in Engineering Zone, and scientifically analytical plan index comprehensively,
It is equipped with crucial index contrast and analyzes, it is possible to be effectively improved efficiency and the accuracy rate of coordinates measurement.
As shown in Figure 6, according to the power circuit path intelligent generation method of the present invention, present invention also offers a kind of electric power
Line route intelligence generating means, set up module 1 including rule, mould 2 is set up in route selection region, obstacle analysis module 3, circuit generate
Module 4, circuit generate judge module 5, index contrast module 6, result refinement module 7 and output module 8 wherein,
Rule sets up module 1, is used for setting terrestrial object information coding, configuration basis route selection rule, arranging route selection special rules；
Module 2 is set up in route selection region, is used for determining target route selection region, limits working range；
Obstacle analysis module 3, is used for carrying out obstacle analysis, according to route selection rule, described route selection region is converted to cell
Set, and attribute and the state of cell is identified according to route selection rule；
Circuit generation module 4, for according to the cell set in route selection region, being generated circuit by circuit search algorithm.
Circuit generates judge module 5, is used for judging to generate whether circuit has result, if it is, notice index contrast module
6；If it does not, end intelligent route selection.
Index contrast module 6, is used for carrying out index contrast, minimum according to corner, length is the shortest and cost minimum of three refers to
Mark contrasts, and draws the optimal result of each index；
Result refinement module 7, is used for carrying out result refinement, automatically generates or manually adjust route selection district according to route selection result
Territory, again setup parameter, re-execute route selection process；
Output module 8, is used for exporting generation circuit.
Obstacle analysis module 2 farther includes gridding submodule 21, route selection rule query submodule 22 and obstacle marking
Submodule 23, wherein, gridding submodule 21, for being formatted by route selection regional network, be converted to the set of multiple cell；
Route selection rule query submodule 22, is used for traveling through key element, takes the GEDI encoded radio of key element, looks into according to GEDI encoded radio
Ask corresponding route selection rule；
Obstacle marking submodule 23, for calculating the model involved by the key element shape and its evaded distance having route selection rule
Enclose the region being positioned in grid, the cell in this region is labeled as obstacle, and route selection rules properties is attached to cell
On.
As shown in Figure 8, circuit generation module 4 farther include special rules judge submodule 41, special rules process son
Module 42, sectionalized line search module 43 and circuit search submodule 44, wherein,
Special rules judges submodule 41, is used for judging whether to define special rules；
Special rules processes submodule 42, for processing the Points And lines that must cross.
Segment processing search submodule 43, for according to set up must cross a little with must cross line, carry out line sectionalizing, and call
Circuit searches submodule 44, carries out sectioning search；
Circuit search submodule 44, for carrying out circuit search according to circuit search algorithm.
As it is shown in figure 9, circuit search submodule 43 specifically includes following submodule:
Direct-connected judgement submodule 4a, is used for judging whether beginning and end line passes obstacle, if it does not, the directly company of output
Circuit line；If it is, notice；
Network reset submodule 4b, is used for resetting trellis state, has generated circuit if existing, and skips when resetting trellis state
It is labeled as obstacle, interim terminal and may span across the cell of state；
Starting point adds submodule 4c, for adding starting point cell to open list；
Current cell obtains submodule 4d, emplaces in table the cell of Least-cost as active cell for taking away
Lattice；Cell attributive judgment submodule 4e, for judging whether current cell is the cell that may span across, if it is, notice
Close list and add submodule 4g；If it does not, notify that the first current cell removes module 4f；
First current cell removes module 4f, for current cell is set to obstacle, and moves on to close from open list
Closing list, notice active cell obtains submodel 4d；
Close list and add submodule 4g, for moving on to close list from open list by current cell, if currently single
Unit's lattice are the obstacle cell that may span across, then be added to cross in cell set Sc, notify cycle criterion submodule 4h；
Loop ends judges submodule 4h, if reaching home or opening list is sky, then stops circulation, and notice terminal is sentenced
Disconnected submodule 4m, if it does not, notice is from all directions to searching submodule 4i；
From all directions to searching submodule 4i, for from all directions to searching surrounding cells lattice, by the most non-obstacle not in unit
Lattice join, and around have leap property obstacle and not in cell add, calculate actual cost and estimate cost,
And father's cell of these grid is pointed to；
Candidate unit lattice judge submodule 4j, and being used for judging around current cell whether eight cells are all can not be across
Obstacle more, if it is, notify that the second current cell removes module 4k；If it does not, announcement trunk optimizes submodule 4l；
Second current cell removes module 4k, for current cell is set to obstacle, and removes from closing list,
Notice current cell obtains submodule 4d；
Line optimization submodule 4l, for path optimizing, it is judged that whether circuit cost can reduce further, if it is,
Replacing current cell, notice current cell obtains submodule 4d；If it does not, current cell obtains submodule 4d；
Endpoint submodule 4m, is used for judging whether to find terminal, searches for unsuccessfully if it does not, return；If it is, notice
Module is set up in father's cell list；
Module 4n is set up in father's cell list, for starting forward from terminal, takes father's cell composition of each cell
List, until starting point；
Wire connecting block 4o, for taking all unit centers of a lattice in cell list, is linked in sequence into circuit,
Form this route selection circuit；
Anchor support data obtaining module 4p, is used for obtaining anchor support tower position information.
Multi-line judge module 4q: determine whether to generate a plurality of circuit, if it is, by current line one in route selection region
The cell of side is all set to interim constraint failure condition, and notice network reset submodule generates other route again.
Line optimization submodule 4l specifically includes following submodule:
Cost calculation sub-module 411, in the open list of cycle calculations, candidate unit lattice are to the distance determining cell
Cost, obtains the minimum unit lattice of wherein cost as current cell, notice minimum cost calculating sub module；
Minimum cost calculating sub module 4l2, for obtaining candidate unit lattice about from current cell, calculates upper one
Less than upper one, whether cell determines that cell arrives candidate unit lattice again to current cell to candidate unit lattice distance cost
Cost, if it is, forward notice to replace submodule；If it does not, notice current cell obtains submodule 4d；
Replace submodule 4l3, for current cell is replaced to this candidate unit lattice corresponding to minima cost, logical
Know that current cell obtains submodule 4d.
Relative to prior art, the power circuit path intelligence generating means of the present invention utilizes geographical information technology, in conjunction with
Computer analysis method, by important atural object analysis of Influential Factors systematization, it is provided that multipath scheme, route selection office the most on a large scale
Portion adjusts and can carry out by successive ignition with refinement, considers the line alignment in Engineering Zone, and scientifically analytical plan index comprehensively,
It is equipped with crucial index contrast and analyzes, it is possible to be effectively improved efficiency and the accuracy rate of coordinates measurement.
The invention is not limited in above-mentioned embodiment, if various changes or deformation to the present invention are without departing from the present invention
Spirit and scope, if these are changed and within the scope of deformation belongs to claim and the equivalent technologies of the present invention, then this
Bright being also intended to comprises these changes and deformation.
Claims (18)
1. the method that a power circuit path intelligence generates, it is characterised in that: include step:
S1: set up rule, sets atural object coding, configuration route selection rule, arranges special rules；
S2: set up route selection region, specifies route selection working range；
S3: carry out obstacle analysis, is converted to cell set according to route selection rule by described route selection region, and according to route selection rule
The attribute of mark cell and state；
S4: according to the cell set in route selection region, circuit search algorithm generate circuit.
The method that power circuit path the most according to claim 1 intelligence generates, it is characterised in that: described route selection rule,
Including global rule, crossing over and dodge rule and/or special rules, described global rule includes strain section span and crank degree
Limit, described leap with dodge rule for limiting Breadth Maximum and the maximum height of leap, described special rules, including must mistake
Put and line must be crossed.
The method that power circuit path the most according to claim 2 intelligence generates, it is characterised in that: according to power engineering
Restriction scope is as route selection region, or draws polygon as route selection region.
The method that power circuit path the most according to claim 3 intelligence generates, it is characterised in that: described step S3 enters one
Walk and include step:
S31: formatted by route selection regional network, is converted to the set of multiple cell；
S32: traversal key element, takes the GEDI encoded radio of key element, inquires about corresponding route selection rule according to GEDI encoded radio；
S33: the region that the scope involved by key element shape and its evaded distance that calculating has route selection regular is positioned in grid, will
Cell in this region is labeled as obstacle, and is attached on cell by route selection rules properties.
The method that power circuit path the most according to claim 4 intelligence generates, it is characterised in that: described step S4 enters one
Walk and include step:
S41: judge whether to define special rules, if it does not, forward step S44 to；If it is, forward step S42 to；
S42: process the Points And lines that must cross；
S43: segmentation is called S44 and is circulated sectionalized line search；
S44: carry out circuit search according to circuit search algorithm.
The method that power circuit path the most according to claim 5 intelligence generates, it is characterised in that: after step s4,
Including step: judge to generate whether circuit has result, if it is, carry out index contrast, minimum according to corner, length is the shortest and makes
Valency minimum of three index contrasts, and draws the optimal result of each index；If it does not, end intelligent route selection.
The method that power circuit path the most according to claim 5 intelligence generates, it is characterised in that: after step s4,
Including: carry out result refinement, automatically generate or manually adjust route selection region, again setup parameter according to route selection result, again hold
Row route selection process.
8. the method generated according to the power circuit path intelligence described in claim 1 to 7 any claim, its feature exists
In: described circuit searching algorithm comprises the following steps:
S4a: judge whether beginning and end line passes obstacle, if it does not, directly output line route；If it is, forward step to
Rapid S4b；
S4b: reset trellis state, has generated circuit if existing, and when resetting trellis state, skip flag is obstacle, interim terminal
With the cell that may span across state；
S4c: add starting point cell to open list, carries out following circular treatment；
Circulation step S4d is to step S4m:
S4d: take away and emplace the cell of Least-cost in table and, as current cell, forward step S4e to；
S4e: judge whether current cell is the cell that may span across, if it is, forward step S4g to；If it does not, forward step to
S4f；
S4f: current cell is set to obstacle, and removes from open list, forward step S4d to；
S4g: move on to close list from open list by current cell, if current cell is the obstacle cell that may span across,
Then it is added to cross in cell set Sc, forwards step S4h to；
S4h: judge whether to reach home or the open list at non-starting point cell place is sky, if it is, stop circulation,
Forward step S4m to, if it does not, forward step S4i to；
S4i: from all directions to searching surrounding cells lattice, by the most non-obstacle not in cell join, and around have across
More property obstacle and not in cell add, calculate actual cost and estimate cost, and by father's cell of these grid
Point to, forward step S4j to；
S4j: judge around current cell, whether eight cells are all the obstacle that not may span across, if it is, forward step to
S4k；If it does not, forward step S4l to；
S4k: current cell is set to obstacle, and removes from closing list, forward step S4d to；
S4l: path optimizing, it is judged that whether circuit cost can reduce further, if it is, replace current cell, and forwards to
Step S4d；
If it does not, pass directly to step S4d；
S4m: judge whether to find terminal, searches for unsuccessfully if it does not, return；If it is, forward step S4n to；
S4n: start forward from terminal, takes father's cell composition list of each cell, until starting point；
S4o: take all unit centers of a lattice in cell list, be linked in sequence into circuit, form this route selection circuit；
S4p: obtain anchor support tower position information.
The method that power circuit path the most according to claim 8 intelligence generates, it is characterised in that: described step S4l, enter
One step comprises the following steps:
In the open list of S4l1: cycle calculations, candidate unit lattice are to determining the distance cost of cell, obtain wherein that cost is
Junior unit lattice, as current cell, forward step S4l2 to；
S4l2: obtain candidate unit lattice about from current cell, calculates previous cell to candidate unit lattice distance generation
Less than upper one, whether valency determines that cell arrives the cost of candidate unit lattice again to current cell, if it is, forward step S4l3 to；
If it is not, then forward step S4d to；
S4l3: current cell is replaced to this candidate unit lattice corresponding to minima cost, forwards step S4d to.
The method that power circuit path the most according to claim 10 intelligence generates, it is characterised in that: described step S4p
Afterwards, further include steps of
S4q: determine whether to generate a plurality of circuit, if it is, all set the cell of current line side in route selection region
For interim constraint failure condition, return to step S3b and generate other route.
The device that 11. 1 kinds of power circuit path intelligence generates, it is characterised in that: include that rule sets up module, route selection region is built
Formwork erection block, obstacle analysis module and circuit generation module, wherein,
Rule sets up module, is used for setting terrestrial object information coding, configuration basis route selection rule, arranging route selection special rules；
Module is set up in route selection region, is used for determining target route selection region, limits working range；
Obstacle analysis module, for according to route selection region, obtains geographic information data in involved region, sets up unit grids,
Whether it is obstacle grid according to unit grids involved by route selection rule judgment geography information, is if it is carried out route selection rule
Attribute is attached on cell；
Circuit generation module, for according to the cell set in route selection region, being generated circuit by circuit search algorithm.
12. devices generated according to the power circuit path intelligence described in claim 11, it is characterised in that: described obstacle analysis mould
Block farther includes gridding submodule, route selection rule query submodule and obstacle marking submodule, wherein,
Gridding submodule, for being formatted by route selection regional network, is converted to the set of multiple cell；
Route selection rule query submodule, is used for traveling through key element, takes the GEDI encoded radio of key element, corresponding according to the inquiry of GEDI encoded radio
Route selection rule；
Obstacle marking submodule, is positioned at for calculating the scope involved by the key element shape and its evaded distance having route selection rule
Region in grid, is labeled as the cell in this region obstacle, and is attached on cell by route selection rules properties.
The device that 13. power circuit path according to claim 12 intelligence generate, it is characterised in that: described circuit generates
Module farther includes special rules and judges that submodule, special rules process submodule, segment processing search submodule and circuit
Search submodule, wherein,
Special rules judges submodule, is used for judging whether to define special rules；
Special rules processes submodule, for processing the Points And lines that must cross.
Segment processing search submodule, for according to set up must cross a little with must cross line, carry out line sectionalizing, and call circuit and search
Seek submodule, carry out sectioning search；
Circuit search submodule, for carrying out circuit search according to circuit search algorithm.
The device that 14. power circuit path according to claim 13 intelligence generate, it is characterised in that: include that a circuit is raw
Become judge module, be used for judging to generate whether circuit has result, if it is, notice index contrast module；If it does not, terminate intelligence
Route selection.
The device that 15. power circuit path according to claim 13 intelligence generate, it is characterised in that: include an index pair
Ratio module, is used for carrying out index contrast, minimum according to corner, length is the shortest and cost minimum of three index contrasts,
Go out the optimal result of each index.
The device that 16. power circuit path according to claim 13 intelligence generate, it is characterised in that: include that a result is thin
Change module, be used for carrying out result refinement, automatically generate or manually adjust route selection region, again setup parameter according to route selection result,
Re-execute route selection process.
17. devices generated according to the power circuit path intelligence described in claim 11 to 16 any claim, its feature
It is: described circuit search submodule specifically includes following submodule:
Direct-connected judgement submodule, is used for judging whether beginning and end line passes obstacle, if it does not, directly output line road
Line；If it is, notice；
Network reset submodule, is used for resetting trellis state, has generated circuit if existing, and when resetting trellis state, skip flag is
Obstacle, interim terminal and may span across the cell of state；
Starting point adds submodule, for adding starting point cell to open list；
Current cell obtains submodule, emplaces in table the cell of Least-cost as current cell for taking away；
Cell attributive judgment submodule, for judging whether current cell is the cell that may span across, if it is, notice is closed
Close list and add submodule；If it does not, notify that the first current cell removes module；
First current cell removes module, for current cell is set to obstacle, and removes from open list, and notice is worked as
Front unit lattice obtain submodule；
Close list and add submodule, for moving on to close list, if current cell is from open list by current cell
The obstacle cell that may span across, then be added to cross in cell set Sc；
Loop ends judges submodule, if reaching home or opening list is sky, then stops circulation, notifies endpoint submodule
Block, if it does not, notice is from all directions to searching submodule；
From all directions to searching submodule, for from all directions to searching surrounding cells lattice, by the most non-obstacle not in cell add
Arrive, and around have leap property obstacle and not in cell add, calculate actual cost and estimate cost, and by this
Father's cell of a little grid points to；
Candidate unit lattice judge submodule, for judging around current cell, whether eight cells are all the barrier that not may span across
Hinder, if it is, announcement trunk optimizes submodule；If it does not, notify that the second current cell removes module；
Second current cell removes module, for current cell is set to obstacle, and removes from closing list, and notice is worked as
Front unit lattice obtain submodule；
Line optimization submodule, for path optimizing, it is judged that whether circuit cost can reduce further, works as if it is, replace
Front unit lattice, notice current cell obtains submodule；If it does not, without modification, notice current cell obtains submodule；
Endpoint submodule, is used for judging whether to find terminal, searches for unsuccessfully if it does not, return；If it is, notify father's unit
Module is set up in lattice list；
Module is set up in father's cell list, for starting forward from terminal, takes father's cell composition list of each cell, directly
To starting point；
Wire connecting block, for taking all unit centers of a lattice in cell list, is linked in sequence into circuit, forms this
Secondary route selection circuit；
Anchor support data obtaining module, is used for obtaining anchor support tower position information.
The method that 18. power circuit path according to claim 17 intelligence generate, it is characterised in that: described line optimization
Submodule, farther includes following submodule:
Cost calculation sub-module, in the open list of cycle calculations, candidate unit lattice are to determining the distance cost of cell, obtain
Take the minimum unit lattice of wherein cost as current cell, notice minimum cost calculating sub module；
Minimum cost calculating sub module, for obtaining candidate unit lattice about from current cell, calculates previous cell
Whether determine that cell arrives the cost of candidate unit lattice again to current cell less than upper one to candidate unit lattice distance cost, as
Fruit is, forwards notice to and replaces submodule；
If it does not, notice current cell obtains submodule；
Replacing submodule, for current cell replaces to this candidate unit lattice corresponding to minima cost, notice is current
Cell obtains submodule.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610542538.4A CN106250579B (en) | 2016-07-08 | 2016-07-08 | Method and device for intelligently generating power line path |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610542538.4A CN106250579B (en) | 2016-07-08 | 2016-07-08 | Method and device for intelligently generating power line path |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106250579A true CN106250579A (en) | 2016-12-21 |
| CN106250579B CN106250579B (en) | 2019-12-20 |
Family
ID=57613987
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610542538.4A Active CN106250579B (en) | 2016-07-08 | 2016-07-08 | Method and device for intelligently generating power line path |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106250579B (en) |
Cited By (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107330563A (en) * | 2017-07-17 | 2017-11-07 | 华北电力大学 | A kind of offshore wind farm current collection combines Topology Optimization Method with transmission system |
| CN107517079A (en) * | 2017-08-04 | 2017-12-26 | 北京市天元网络技术股份有限公司 | Power communication light path alternate path analysis method and device |
| CN107808061A (en) * | 2017-11-20 | 2018-03-16 | 北京华大九天软件有限公司 | A kind of two-way across obstacle wiring method for supporting just to give oblique cabling |
| CN108021768A (en) * | 2017-12-22 | 2018-05-11 | 清华大学 | A kind of automatic paragraphing method that attribute and socket information are moved towards based on busbar |
| CN110046213A (en) * | 2018-11-20 | 2019-07-23 | 国网陕西省电力公司 | A kind of electric power selection method for taking path distortion correction and scissors crossing correction into account |
| CN110285819A (en) * | 2018-03-19 | 2019-09-27 | 北京京东尚科信息技术有限公司 | The method and apparatus for determining shortest path |
| 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 |
| CN110705751A (en) * | 2019-09-04 | 2020-01-17 | 国网冀北电力有限公司经济技术研究院 | Method for intelligently planning line path |
| CN111324998A (en) * | 2019-12-31 | 2020-06-23 | 浙江华云信息科技有限公司 | Connecting line routing layout method based on route search |
| CN111985715A (en) * | 2020-08-20 | 2020-11-24 | 国网山东省电力公司临沂供电公司 | Corridor path automatic navigation method and device based on multi-target lines |
| CN112686480A (en) * | 2021-03-17 | 2021-04-20 | 国网浙江省电力有限公司 | Cost estimation system and method based on standard cost system |
| CN113159436A (en) * | 2021-04-29 | 2021-07-23 | ***通信集团陕西有限公司 | Path recommendation method, device and equipment and readable storage medium |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103971184A (en) * | 2014-05-29 | 2014-08-06 | 国家电网公司 | Power transmission line path generation method based on spatial GIS (Geographic Information System) |
| CN103996089A (en) * | 2014-06-12 | 2014-08-20 | 国家电网公司 | Electric transmission line optimal path generation method based on GIS |
| CN104462685A (en) * | 2014-12-03 | 2015-03-25 | 江苏省电力公司淮安供电公司 | Transmission line design method based on GIS (grid) and Floyd algorithm |
| CN105243233A (en) * | 2015-11-04 | 2016-01-13 | 中南大学 | Line-station collaborative optimization method for railway in complicated mountain area |
-
2016
- 2016-07-08 CN CN201610542538.4A patent/CN106250579B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103971184A (en) * | 2014-05-29 | 2014-08-06 | 国家电网公司 | Power transmission line path generation method based on spatial GIS (Geographic Information System) |
| CN103996089A (en) * | 2014-06-12 | 2014-08-20 | 国家电网公司 | Electric transmission line optimal path generation method based on GIS |
| CN104462685A (en) * | 2014-12-03 | 2015-03-25 | 江苏省电力公司淮安供电公司 | Transmission line design method based on GIS (grid) and Floyd algorithm |
| CN105243233A (en) * | 2015-11-04 | 2016-01-13 | 中南大学 | Line-station collaborative optimization method for railway in complicated mountain area |
Non-Patent Citations (7)
| Title |
|---|
| C MONTEIRO等: "Compromise Seeking for Power Line Path Selection Based on Economic and Environmental Corridors", 《IEEE TRANSACTIONS ON POWER SYSTEMS》 * |
| C MONTEIRO等: "GIS Spatial Analysis Applied to Electric Line Routing Optimization", 《IEEE TRANSACTIONS ON POWER DELIVERY》 * |
| 付仲良等: "GIS技术支持下的电力智能选线", 《测绘地理信息》 * |
| 全姗姗: "考虑路径优化的输电网规划研究", 《中国优秀硕士学位论文全文数据库工程科技Ⅱ辑》 * |
| 刘亚涛: "输变电工程送电线路最优路径选择研究", 《中国优秀硕士学位论文全文数据库工程科技Ⅱ辑》 * |
| 李欣等: "基于GIS电力智能选线***的设计与实现", 《地理空间信息》 * |
| 陈平平: "基于电力GIS的最短路径优化算法的应用于分析", 《中国优秀硕士学位论文全文数据库工程科技Ⅱ辑》 * |
Cited By (21)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107330563A (en) * | 2017-07-17 | 2017-11-07 | 华北电力大学 | A kind of offshore wind farm current collection combines Topology Optimization Method with transmission system |
| CN107517079A (en) * | 2017-08-04 | 2017-12-26 | 北京市天元网络技术股份有限公司 | Power communication light path alternate path analysis method and device |
| CN107517079B (en) * | 2017-08-04 | 2019-07-23 | 北京市天元网络技术股份有限公司 | Power communication optical path alternate path analysis method and device |
| CN107808061A (en) * | 2017-11-20 | 2018-03-16 | 北京华大九天软件有限公司 | A kind of two-way across obstacle wiring method for supporting just to give oblique cabling |
| CN107808061B (en) * | 2017-11-20 | 2021-01-19 | 北京华大九天软件有限公司 | Bidirectional obstacle-crossing wiring method supporting orthogonal and oblique wiring |
| CN108021768A (en) * | 2017-12-22 | 2018-05-11 | 清华大学 | A kind of automatic paragraphing method that attribute and socket information are moved towards based on busbar |
| CN108021768B (en) * | 2017-12-22 | 2021-01-01 | 清华大学 | Intelligent segmentation method based on bus trend attribute and socket information |
| CN110285819A (en) * | 2018-03-19 | 2019-09-27 | 北京京东尚科信息技术有限公司 | The method and apparatus for determining shortest path |
| CN110285819B (en) * | 2018-03-19 | 2023-01-31 | 北京京东乾石科技有限公司 | Method and device for determining shortest path |
| CN110046213B (en) * | 2018-11-20 | 2023-04-18 | 国网陕西省电力公司 | Power line selection method considering path distortion correction and cross crossing correction |
| CN110046213A (en) * | 2018-11-20 | 2019-07-23 | 国网陕西省电力公司 | A kind of electric power selection method for taking path distortion correction and scissors crossing correction into account |
| CN110705751A (en) * | 2019-09-04 | 2020-01-17 | 国网冀北电力有限公司经济技术研究院 | Method for intelligently planning line path |
| CN110705751B (en) * | 2019-09-04 | 2023-04-07 | 国网冀北电力有限公司经济技术研究院 | Method for intelligently planning line path |
| CN110532508B (en) * | 2019-09-05 | 2020-09-18 | 东北大学 | Multi-objective optimization path selection method of power transmission line based on stepping ring grid |
| 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 |
| CN111324998A (en) * | 2019-12-31 | 2020-06-23 | 浙江华云信息科技有限公司 | Connecting line routing layout method based on route search |
| CN111324998B (en) * | 2019-12-31 | 2023-09-12 | 浙江华云信息科技有限公司 | Route search-based connecting wire routing layout method |
| CN111985715A (en) * | 2020-08-20 | 2020-11-24 | 国网山东省电力公司临沂供电公司 | Corridor path automatic navigation method and device based on multi-target lines |
| CN111985715B (en) * | 2020-08-20 | 2024-03-01 | 国网山东省电力公司临沂供电公司 | Automatic navigation method and equipment based on corridor path of multi-target line |
| CN112686480A (en) * | 2021-03-17 | 2021-04-20 | 国网浙江省电力有限公司 | Cost estimation system and method based on standard cost system |
| CN113159436A (en) * | 2021-04-29 | 2021-07-23 | ***通信集团陕西有限公司 | Path recommendation method, device and equipment and readable storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106250579B (en) | 2019-12-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106250579A (en) | The method and device that a kind of power circuit path intelligence generates | |
| CN103984997B (en) | Power transmission engineering addressing selection method based on GIS spatial informations | |
| CN103049799B (en) | A kind of Study on Power Grid Planning method based on multiple-objection optimization | |
| CN109635748B (en) | Method for extracting road characteristics in high-resolution image | |
| CN105466445B (en) | A kind of paths planning method based on ground fractal semantic | |
| CN109359350B (en) | Wind power plant road intelligent design method for optimizing fine construction cost | |
| CN103955565A (en) | GIS (Geographic Information System) platform-based urban water system construction planning method | |
| CN107038259A (en) | A kind of operational method and its system for constructing traffic network data | |
| CN104899329B (en) | A method of using minimum outer rectangle frame progress ancestor four to lookup | |
| CN107144288A (en) | The method and its device of a kind of path planning under orographic condition without road network | |
| CN107451716A (en) | A kind of flood control decision support method, electronic equipment, storage medium and system | |
| CN101900565A (en) | Path determining method and device | |
| CN104462685A (en) | Transmission line design method based on GIS (grid) and Floyd algorithm | |
| CN107872808A (en) | A kind of WLAN sites prediction analysis method and device | |
| CN105608276A (en) | Automatic powder transmission line path selection method and cellular automaton model | |
| CN112835997B (en) | GeoSOT grid-based grid inspection space grid coding method | |
| CN110046213A (en) | A kind of electric power selection method for taking path distortion correction and scissors crossing correction into account | |
| CN115759499A (en) | Path planning method, device, equipment and medium based on optimization algorithm | |
| CN109685274A (en) | The method of high-speed rail path planning design based on maklink figure Multi-node link | |
| CN101685465A (en) | Integrated three-dimensional data modeling method for comprehensive pipe network geographic information system | |
| CN102226915A (en) | Deep foundation pit engineering dynamic risk information management system | |
| CN104331847A (en) | Power supply zone partitioning method by use of Delaunay triangulation | |
| CN114418215A (en) | Smart city power transmission line planning method based on artificial intelligence | |
| CN109815611A (en) | A kind of Basin Boundary generation method based on Digital Valley | |
| CN114217609A (en) | Intelligent partitioning method for power grid line corridor zone meeting multiple constraint conditions |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |