CN115455623A - Wind power plant road route selection method, system, device and storage medium - Google Patents
Wind power plant road route selection method, system, device and storage medium Download PDFInfo
- Publication number
- CN115455623A CN115455623A CN202211135622.6A CN202211135622A CN115455623A CN 115455623 A CN115455623 A CN 115455623A CN 202211135622 A CN202211135622 A CN 202211135622A CN 115455623 A CN115455623 A CN 115455623A
- Authority
- CN
- China
- Prior art keywords
- road
- power plant
- wind power
- new
- path
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000003860 storage Methods 0.000 title claims abstract description 18
- 238000010187 selection method Methods 0.000 title claims description 9
- 238000004422 calculation algorithm Methods 0.000 claims abstract description 35
- 238000000034 method Methods 0.000 claims abstract description 30
- 239000000463 material Substances 0.000 claims description 13
- 238000010276 construction Methods 0.000 claims description 12
- 238000004590 computer program Methods 0.000 claims description 10
- 238000005457 optimization Methods 0.000 claims description 9
- 238000012545 processing Methods 0.000 claims description 9
- 238000009412 basement excavation Methods 0.000 claims description 8
- 238000004364 calculation method Methods 0.000 claims description 6
- 238000007781 pre-processing Methods 0.000 claims description 4
- 239000004575 stone Substances 0.000 claims 1
- 238000010586 diagram Methods 0.000 description 16
- 238000013461 design Methods 0.000 description 13
- 230000006870 function Effects 0.000 description 5
- 238000012423 maintenance Methods 0.000 description 3
- 238000012986 modification Methods 0.000 description 3
- 230000004048 modification Effects 0.000 description 3
- 230000000712 assembly Effects 0.000 description 1
- 238000000429 assembly Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000012938 design process Methods 0.000 description 1
- 230000010365 information processing Effects 0.000 description 1
- 230000007774 longterm Effects 0.000 description 1
- 238000007726 management method Methods 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 238000010248 power generation Methods 0.000 description 1
- 238000011160 research Methods 0.000 description 1
Images
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
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F30/00—Computer-aided design [CAD]
- G06F30/20—Design optimisation, verification or simulation
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
- G06Q10/047—Optimisation of routes or paths, e.g. travelling salesman problem
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
- G06Q50/06—Energy or water supply
Landscapes
- Engineering & Computer Science (AREA)
- Business, Economics & Management (AREA)
- Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Economics (AREA)
- Human Resources & Organizations (AREA)
- Geometry (AREA)
- Strategic Management (AREA)
- Tourism & Hospitality (AREA)
- Marketing (AREA)
- Computer Hardware Design (AREA)
- Evolutionary Computation (AREA)
- General Engineering & Computer Science (AREA)
- General Business, Economics & Management (AREA)
- Health & Medical Sciences (AREA)
- Mathematical Optimization (AREA)
- Game Theory and Decision Science (AREA)
- Development Economics (AREA)
- Entrepreneurship & Innovation (AREA)
- Pure & Applied Mathematics (AREA)
- Operations Research (AREA)
- Quality & Reliability (AREA)
- Mathematical Analysis (AREA)
- Computational Mathematics (AREA)
- Computer Networks & Wireless Communication (AREA)
- Public Health (AREA)
- Water Supply & Treatment (AREA)
- General Health & Medical Sciences (AREA)
- Primary Health Care (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention discloses a method, a system, a device and a storage medium for selecting a wind power plant road, belonging to the technical field of micro site selection of a wind power plant, wherein the method comprises the following steps: acquiring digital elevation data and generating a contour topographic map according to the digital elevation data; acquiring site boundaries, a sensitive area and wind generating set coordinates of the wind power plant from the contour topographic map, and removing areas outside the site boundaries and in the sensitive area in the contour topographic map to obtain a topographic map of the wind power plant; calculating the shortest path between any two wind generating sets in the topographic map of the wind power plant and the corresponding road cost by adopting an RRT (rapid return to the original) algorithm according to the coordinates of the wind generating sets, wherein the sum of all the road costs is the global road cost; with the minimum global road cost as a target, optimizing the shortest path by adopting an improved Prime algorithm to obtain the optimal connection circuit of the road in the wind power plant; the method combines the RRT algorithm and the improved Prime algorithm to calculate and optimize the wind power plant road with the complex terrain.
Description
Technical Field
The invention relates to a method, a system and a device for selecting a line of a wind power plant road and a storage medium, belonging to the technical field of micro site selection of wind power plants.
Background
The wind generating sets are distributed, the in-site maintenance road is generally long, and the important components of the wind power plant comprise the line layout of the wind power plant road design, the design of a roadbed and a road surface, long-term or temporary land acquisition and other plans, so that the reasonable road design plays a very key role in investment, management and operation and maintenance of the whole wind power plant.
The road planning of the wind power plant needs to be carried out by combining site landform and surrounding environment, the planning design is convenient and practical, and the occupation of forest cultivated land and large-area digging and filling are avoided as much as possible; optimizing a road design scheme, wherein the original road is utilized as much as possible according to the transportation requirements and the hoisting mechanical type of the wind generating set equipment, the path excavation amount is reduced, and the road grade and the standard are controlled according to the permanent and temporary combined measures; when in design, a specific implementation scheme is given according to the detailed conditions of the area, for example, the south often rains, and then relevant measures such as slope protection, retaining walls and the like need to be taken.
But at present, the research on the optimization of wind power plants with complex terrains, particularly roads on mountainous regions, is very limited at home and abroad, and certainly, the optimization has a plurality of uncertain factors without fixed standards; the design house and the wind power plant generally carry out road design work according to manual experience, line selection is different from person to person, the detailed design of a general 50MW wind field maintenance road needs 2-3 months, and the optimization of path design and road cost is difficult to achieve.
Disclosure of Invention
The invention aims to provide a method, a system, a device and a storage medium for selecting a road of a wind power plant, and solves the problem that the road cost and the path cannot be optimized in the prior art.
In order to realize the purpose, the invention is realized by adopting the following technical scheme:
in a first aspect, the invention provides a wind power plant road route selection method, which comprises the following steps:
acquiring digital elevation data, and generating a contour topographic map of the wind power plant according to the digital elevation data;
acquiring site boundaries, a sensitive area and wind generating set coordinates of the wind power plant from the contour topographic map, and removing areas outside the site boundaries and in the sensitive area in the contour topographic map to obtain a topographic map of the wind power plant;
calculating the shortest path between any two wind generating sets in the topographic map of the wind power plant and the road cost corresponding to the shortest path by adopting an RRT (rapid return to the original) algorithm according to the coordinates of the wind generating sets, wherein the sum of all the road costs is the global road cost;
and optimizing the shortest path by adopting an improved Prime algorithm with the minimum global road cost as a target to obtain the optimal connection circuit of the road in the wind power plant.
With reference to the first aspect, further, the digital elevation data is obtained by:
and extracting digital elevation data from the map data file in tiff format through a global mapper.
With reference to the first aspect, further, the digital elevation data includes horizontal data, vertical data, and elevation data.
With reference to the first aspect, further, the calculating a shortest path between any two wind turbine generators by using an RRT algorithm includes:
s1, setting a wind generating set as a starting point x start Setting another wind generating set as a terminal point x as a root node of the random tree goal ；
S2, randomly generating a random point x in the range of the topographic map of the wind power plant rand This random point x rand With a certain probability being chosen as the end point x goal ；
S3, calculating each node in the random tree at the moment and the generated random point x rand The distance between the random points x is found out rand Nearest node, denoted x nearest ；
S4, with x nearest Taking r as radius as circle center, r is preset step length, drawing a circle, taking out points on the circle as alternative points according to preset angle, calculating gradient from the alternative points to the circle center, and calculating x nearest Taking the alternative points meeting the requirements of the preset gradient and the turning radius as standby points according to the turning radius between the connecting line to the alternative points and the previous path, and selecting a distance end point x from the standby points goal The closest point is taken as the generated new point x new And add a new edge x nearest -x new Updating the random tree, and returning to the step S2 if all the alternative points do not meet the requirements of the preset gradient and the turning radius;
s5, at the new point x new Using rad as a radius and taking the radius as a circle center to search a neighboring node, wherein rad is a preset value, and calculating the distance from the neighboring node to a new point x new If the path length is reduced compared with the length of the previous path, calculating the turning radius between the newly generated path and the previous path, and if the newly generated path meets the requirements of a preset gradient and the turning radius, replacing the adjacent node with a new point x new Updating the random tree;
s6, rewiring operation is carried out to enable the final path length to be minimum, and if the father node of the neighbor node is changed to be a new point x new The length of the path can be reduced, the new path meets the preset gradient, and the turning radius between the new path and the previous path meets the preset requirement and is changed;
s7, if the new point x new To the end point x goal Is less than 1.5r, and the gradient meets the preset requirement, new point x new To the end point x goal The turning radius between the connecting line and the previous path meets the preset requirement, x is determined new And end point x goal Connecting and updating the random tree, entering the step S8, otherwise, returning to the step S2;
s8, from end point x goal And starting to search the father node of the node step by step until the root node of the random tree and returning to the final path.
With reference to the first aspect, further, the road cost includes a road structure layer material cost and a road earthwork construction amount cost;
the calculation formula of the road structure layer material cost is as follows:
M C ＝H*L*W*M P
wherein M is C The cost of the road structure layer material is low; h is the thickness of the structural layer; l is the road length; w is the road width; m P Unit cost for structural layer material;
the formula for calculating the construction cost of the road earthwork project is as follows:
E C ＝V C *C P (V C ≥V F )
E C ＝(V F -V C )*F P +V C *C P (V C ＜V F )
wherein E is C The construction cost of the earthwork project is reduced; v C The volume of excavation is taken; v F Is the filling amount; c P The unit cost of excavation is achieved; f P The cost is the unit cost of filling.
With reference to the first aspect, in a further improvement of the Prime algorithm, the method includes:
setting the weight as the global road cost after adding a certain node, and updating the weight after adding a node;
optimizing the shortest path by adopting an improved Prime algorithm, wherein the method comprises the following steps:
after two or more nodes are added, all the added nodes are regarded as a comprehensive node, all edges coming out of the comprehensive node are checked, the node which enables the overall road cost to be minimum after the nodes are added is selected and contained in the minimum tree, the weight of each edge is updated, the steps are repeated, the minimum spanning trees of all the wind generating sets are obtained, and therefore the optimal connection circuit of the roads in the wind power plant is obtained.
In a second aspect, the present invention further provides a wind farm road route selection system, including:
a data acquisition module: the system comprises a data acquisition module, a data processing module and a data processing module, wherein the data acquisition module is used for acquiring digital elevation data and generating a contour topographic map of the wind power plant according to the digital elevation data;
a topographic map preprocessing module: the method comprises the steps of acquiring site boundaries, sensitive areas and wind generating set coordinates of the wind power plant from a contour topographic map, and removing areas outside the site boundaries and in the sensitive areas in the contour topographic map to obtain a topographic map of the wind power plant;
a path calculation module: the method is used for calculating the shortest path and the road cost corresponding to the shortest path connected with any two wind generating sets in the topographic map of the wind power plant by adopting an RRT (rapid return to the original) algorithm according to the coordinates of the wind generating sets, wherein the sum of all the road costs is the global road cost;
a path optimization module: and optimizing the shortest path by adopting an improved Prime algorithm with the minimum global road cost as a target to obtain the optimal connection circuit of the road in the wind power plant.
In a third aspect, the invention further provides a wind power plant road route selection device, which comprises a processor and a storage medium;
the storage medium is used for storing instructions;
the processor is configured to operate in accordance with the instructions to perform the steps of the method according to any one of the first aspect.
In a fourth aspect, the invention also provides a computer-readable storage medium having stored thereon a computer program which, when executed by a processor, performs the steps of the method of any one of the first aspect.
Compared with the prior art, the invention has the following beneficial effects:
according to the method, the system, the device and the storage medium for selecting the wind power plant road, the RRT algorithm and the improved Prime algorithm are combined, the wind power plant road with the complex terrain is calculated and optimized, the workload in the design process of the road in the wind power plant can be reduced, manpower and material resources are saved, the road cost is reduced, the engineering investment is saved for an owner, the road scheme with the lowest overall road cost in the wind power plant with the complex terrain can be calculated in a short time through a computer, and an engineer performs later modification and detailed design on the basis, so that the method has a good engineering application value.
Drawings
FIG. 1 is one of flowcharts of a method for selecting a route of a wind farm road according to an embodiment of the present invention;
FIG. 2 is a second flowchart of a method for selecting a route for a wind farm road according to an embodiment of the present invention;
FIG. 3 shows a new RRT algorithm road point x between two wind turbine generators new Generating a schematic diagram;
FIG. 4 shows a new RRT algorithm road point x between two wind power generator sets according to an embodiment of the present invention new Reselecting a parent node schematic diagram;
FIG. 5 is a schematic diagram of an RRT algorithm road rewiring between two wind turbine assemblies according to an embodiment of the present invention;
FIG. 6 is a road information summary chart of any two wind generating sets in a wind farm provided by the embodiment of the invention;
FIG. 7 is a wind farm road optimal connection line information diagram;
FIG. 8 is a detailed information diagram of a wind farm road optimal connection scheme;
FIG. 9 is one of the comparison diagrams of the results of the conventional, improved Prime algorithm;
FIG. 10 is a second comparison of the results of the conventional, improved Prime algorithm.
Detailed Description
The present invention is further described with reference to the accompanying drawings, and the following examples are only for clearly illustrating the technical solutions of the present invention, and should not be taken as limiting the scope of the present invention.
Example 1
As shown in fig. 1, a wind farm road route selection method provided by the embodiment of the present invention includes the following steps:
s1, acquiring digital elevation data, and generating a contour topographic map of the wind power plant according to the digital elevation data.
The step S1 is a step of preprocessing map data, digital elevation data are extracted from a map data file in a tiff format through a global mapper or a self-written program, the digital elevation data comprise horizontal data, vertical data and elevation data, and a contour topographic map of the wind power plant is generated according to the extracted digital elevation data.
Step S1 corresponds to "step 1: generating contour topographic map ".
S2, acquiring site boundaries, a sensitive area and wind generating set coordinates of the wind power plant from the contour topographic map, and removing areas outside the site boundaries and in the sensitive area in the contour topographic map to obtain a topographic map of the wind power plant.
Step S2 corresponds to "step 2: and wind power plant information processing ".
And S3, calculating the shortest path between any two wind generating sets in the topographic map of the wind power plant and the road cost corresponding to the shortest path by adopting an RRT (remote distance transform) algorithm according to the coordinates of the wind generating sets, wherein the sum of all the road costs is the global road cost.
The process of calculating the shortest path between two wind generating sets in the wind power plant is as follows:
s3-1, setting a wind generating set as a starting point x start Setting another wind generating set as a terminal point x as a root node of the random tree goal 。
S3-2, randomly generating a random point x in the range of the topographic map of the wind power plant rand This random point x rand With a certain probability being chosen as the end point x goal 。
S3-3, calculating each node in the random tree at the moment and the generated random point x rand The distance between the random points x is found out rand Nearest node, denoted x nearest 。
S3-4, with x nearest Taking r as radius as circle center, r is preset step length, drawing a circle, taking out points on the circle as alternative points according to preset angle, calculating gradient from the alternative points to the circle center, and calculating x nearest Taking the alternative points meeting the requirements of the preset gradient and the turning radius as standby points according to the turning radius between the connecting line to the alternative points and the previous path, and selecting a distance end point x from the standby points goal The nearest point is used as the generationNew point x of new And add a new edge x nearest -x new Updating the random tree, if all the alternative points do not meet the requirements of the preset gradient and the turning radius, returning to the step S3-2, and generating a new point x new The process of (a) is shown in fig. 3.
S3-5, at the new point x new Using rad as a radius and taking the radius as a circle center to search a neighboring node, wherein rad is a preset value, and calculating the distance from the neighboring node to a new point x new If the path length is reduced compared with the length of the previous path, calculating the turning radius between the newly generated path and the previous path, and if the newly generated path meets the requirements of a preset gradient and the turning radius, replacing the adjacent node with a new point x new And updating the random tree.
The specific process of step S3-5 is shown in FIG. 4, where FIG. 4 (a) is the path generated by the previous step S3-4, FIG. 4 (b) is the optimized result, and in FIG. 4 (a), the new point x is shown new Is x nearest Path is x new -x nearest -x 1 -x 2 Passing through the new point x new Search for its neighbor node again as parent node, new point x new Becomes x 2 The path is x new -x 2 Obviously, the path length is shortened.
S3-6, rewiring operation is carried out to enable the final path length to be minimum, and if the father node of the adjacent node is changed into a new point x new The length of the path can be reduced, the new path meets the preset gradient, and the turning radius between the new path and the previous path meets the preset requirement and is changed.
The rewiring operation of step S3-6 is illustrated in FIG. 5, where FIG. 5 (a) is the path generated by the previous step S3-5, and FIG. 5 (b) is the result of the rewiring, x 2 Becomes x by rewiring new Original x 2 -x 1 -x nearest The path becomes x 2 -x new -x nearest The path has a shortened length.
S3-7, if new point x new To the end point x goal Is less than 1.5r, and the gradient meets the preset requirement,new point x new To the end point x goal The turning radius between the connecting line and the previous path meets the preset requirement, x is determined new And end point x goal And connecting and updating the random tree, and entering the step S3-8, otherwise, returning to the step S3-2.
S3-8, slave endpoint x goal And starting to search the father node of the node step by step until the root node of the random tree and returning to the final path.
After the shortest path is calculated, the road cost corresponding to the shortest path is calculated, and the corresponding wind power generation group number and the road number are recorded, as shown in fig. 6.
The road cost comprises the construction cost of road structure layer materials and the construction cost of road earthwork;
the calculation formula of the road structure layer material cost is as follows:
M C ＝H*L*W*M P
wherein, M C The cost of the road structure layer material is low; h is the thickness of the structural layer; l is the road length; w is the road width; m P Unit cost for structural layer material; the structural layer thickness is generally set by designers according to local experience according to the current road surface design specifications of the traffic department and combined with factory and mine road design under similar conditions.
The formula for calculating the construction cost of the road earthwork project is as follows:
E C ＝V C *C P (V C ≥V F )
E C ＝(V F -V C )*F P +V C *C P (V C ＜V F )
wherein E is C The construction cost of the earthwork project is reduced; v C The volume of excavation is taken; v F Is the filling amount; c P The unit cost of excavation is achieved; f P The cost is the unit cost of filling.
Step S3 corresponds to "step 3: and step 4, calculating the road information between the two stations: and calculating road information between any two stations in the whole field.
And S4, optimizing the shortest path by adopting an improved Prime algorithm with the minimum global road cost as a target to obtain the optimal connection circuit of the road in the wind power plant.
The path optimization in the wind power plant is based on the minimum global road cost as the target optimization, and the minimum global road cost is taken as the target function:
OPT＝min(M C +E C )
in this step, after a road connection (shortest path) between any two wind turbine generators is generated, a minimum tree is generated by using an improved Prime algorithm to realize global path optimization, a weight of an edge of the minimum tree of the conventional Prime algorithm is set to be a distance and is a fixed value, the obtained minimum tree is the shortest in global road length, the improved weight is set to be the global road cost after the node is added, and the weight is updated after each node is added.
After two or more nodes are added, all the added nodes are regarded as a comprehensive node, all edges coming out of the comprehensive node are checked, the node which enables the overall road cost to be minimum after the nodes are added is selected and contained in the minimum tree, the weight of each edge is updated, the steps are repeated, the minimum spanning trees of all the wind generating sets are obtained, and therefore the optimal connection circuit of the roads in the wind power plant is obtained.
Step S4 corresponds to "step 5: optimal route of road in the field ".
Fig. 7 is an information diagram of the optimal connection route of the wind farm road calculated according to the embodiment, and fig. 8 is a detailed information diagram of the optimal connection route of the wind farm road calculated according to the embodiment.
Example 2
The embodiment of the invention provides a wind power plant road route selection system, which comprises:
a data acquisition module: the device is used for acquiring digital elevation data and generating a contour topographic map of the wind power plant according to the digital elevation data;
a topographic map preprocessing module: the method comprises the steps of acquiring site boundaries, sensitive areas and wind generating set coordinates of the wind power plant from a contour topographic map, and removing areas outside the site boundaries and in the sensitive areas in the contour topographic map to obtain a topographic map of the wind power plant;
a path calculation module: the method is used for calculating the shortest path and the road cost corresponding to the shortest path connected with any two wind generating sets in the topographic map of the wind power plant by adopting an RRT (rapid return to the original) algorithm according to the coordinates of the wind generating sets, wherein the sum of all the road costs is the global road cost;
a path optimization module: and optimizing the shortest path by adopting an improved Prime algorithm with the minimum global road cost as a target to obtain the optimal connection line of the road in the wind power plant.
Example 3
The embodiment of the invention provides a wind power plant road route selection device, which comprises a processor and a storage medium, wherein the processor is used for processing a wind power plant road route;
the storage medium is used for storing instructions;
the processor is configured to operate in accordance with the instructions to perform the steps of the method of:
acquiring digital elevation data, and generating a contour topographic map of the wind power plant according to the digital elevation data;
acquiring site boundaries, a sensitive area and wind generating set coordinates of the wind power plant from the contour topographic map, and removing areas outside the site boundaries and in the sensitive area in the contour topographic map to obtain a topographic map of the wind power plant;
calculating the shortest path between any two wind generating sets in the topographic map of the wind power plant and the road cost corresponding to the shortest path by adopting an RRT (rapid return to the original) algorithm according to the coordinates of the wind generating sets, wherein the sum of all the road costs is the global road cost;
and optimizing the shortest path by adopting an improved Prime algorithm with the minimum global road cost as a target to obtain the optimal connection circuit of the road in the wind power plant.
Example 4
An embodiment of the present invention provides a computer-readable storage medium, on which a computer program is stored, which when executed by a processor implements the steps of the following method:
acquiring digital elevation data, and generating a contour topographic map of the wind power plant according to the digital elevation data;
acquiring site boundaries, a sensitive area and wind generating set coordinates of the wind power plant from the contour topographic map, and removing areas outside the site boundaries and in the sensitive area in the contour topographic map to obtain a topographic map of the wind power plant;
calculating the shortest path between any two wind generating sets in the topographic map of the wind power plant and the road cost corresponding to the shortest path by adopting an RRT (rapid return to the original) algorithm according to the coordinates of the wind generating sets, wherein the sum of all the road costs is the global road cost;
and optimizing the shortest path by adopting an improved Prime algorithm with the minimum global road cost as a target to obtain the optimal connection circuit of the road in the wind power plant.
As will be appreciated by one skilled in the art, embodiments of the present application may be provided as a method, system, or computer program product. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present application may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The present application is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the application. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
The above description is only a preferred embodiment of the present invention, and it should be noted that, for those skilled in the art, it is possible to make various improvements and modifications without departing from the technical principle of the present invention, and those improvements and modifications should be considered as the protection scope of the present invention.
Claims (9)
1. A wind power plant road route selection method is characterized by comprising the following steps:
acquiring digital elevation data, and generating a contour topographic map of the wind power plant according to the digital elevation data;
acquiring site boundaries, a sensitive area and wind generating set coordinates of the wind power plant from the contour topographic map, and removing areas outside the site boundaries and in the sensitive area in the contour topographic map to obtain a topographic map of the wind power plant;
calculating the shortest path between any two wind generating sets in the topographic map of the wind power plant and the road cost corresponding to the shortest path by adopting an RRT (rapid return to the original) algorithm according to the coordinates of the wind generating sets, wherein the sum of all the road costs is the global road cost;
and optimizing the shortest path by adopting an improved Prime algorithm with the minimum global road cost as a target to obtain the optimal connection circuit of the road in the wind power plant.
2. A wind farm road route selection method according to claim 1, characterized in that the digital elevation data is obtained by:
and extracting digital elevation data from the map data file in tiff format through a global mapper.
3. A wind farm route selection method according to claim 1, wherein the digital elevation data comprises horizontal data, vertical data and elevation data.
4. The method for selecting a wind farm route according to claim 1, wherein the calculating the shortest path between any two wind generating sets by using an RRT algorithm comprises:
s1, setting a wind generating set as a starting point x start Setting another wind generating set as a terminal point x as a root node of the random tree goal ；
S2, randomly generating a random point x in the range of the topographic map of the wind power plant rand This random point x rand With a certain probability being chosen as the end point x goal ；
S3, calculating each node in the random tree at the moment and the generated random point x rand The distance between the random points x is found out rand Nearest node, denoted x nearest ；
S4, with x nearest Taking r as radius as circle center, r is preset step length, drawing a circle, taking out points on the circle as alternative points according to preset angle, calculating gradient from the alternative points to the circle center, and calculating x nearest Taking the alternative points meeting the requirements of the preset gradient and the turning radius as standby points according to the turning radius between the connecting line to the alternative points and the previous path, and selecting a distance end point x from the standby points goal The closest point is taken as the generated new point x new And add a new edge x nearest -x new Updating the random tree, and returning to the step S2 if all the alternative points do not meet the requirements of the preset gradient and the turning radius;
s5, at the new point x new Using rad as radius circle as center of circle to search neighboring node, calculating neighboring node to new point x new If the path length is reduced compared with the length of the previous path, calculating the turning radius between the newly generated path and the previous path, and if the newly generated path meets the requirements of a preset gradient and the turning radius, replacing the adjacent node with a new point x new Updating the random tree by the father node of the node;
s6, rewiring operation is carried out to enable the final path length to be minimum, and if the father node of the neighbor node is changed to be a new point x new The length of the path can be reduced, the new path meets the preset gradient, and the turning radius between the new path and the previous path meets the preset requirement and is changed;
s7, if the new point x new To the end point x goal Is less than 1.5r, and the gradient meets the preset requirement, new point x new To the end point x goal The turning radius between the connecting line and the previous path meets the preset requirement, x is determined new And end point x goal Connecting and updating the random tree, entering the step S8, and otherwise, returning to the step S2;
s8, from end point x goal And starting to search the father node of the node step by step until the root node of the random tree and returning to the final path.
5. A wind farm road route selection method according to claim 1, characterized in that said road costs comprise road structure layer material construction cost and road earth and stone engineering quantity construction cost;
the calculation formula of the road structure layer material cost is as follows:
M C ＝H*L*W*M P
wherein, M C The cost of the road structure layer material is low; h is the thickness of the structure layer; l is the road length; w is the road width; m P Unit cost of construction layer material;
the formula for calculating the construction cost of the road earthwork project is as follows:
E C ＝V C *C P (V C ≥V F )
E C ＝(V F -V C )*F P +V C *C P (V C ＜V F )
wherein E is C The construction cost of the earthwork project is reduced; v C The volume of the excavation is the volume of the excavation; v F Is the filling amount; c P The unit cost of excavation is achieved; f P The cost is the unit cost of filling.
6. The wind farm road route selection method according to claim 1, wherein the improvement of the Prime algorithm comprises the following steps:
setting the weight as the global road cost after adding a certain node, and updating the weight after adding a node;
optimizing the shortest path by adopting an improved Prime algorithm, comprising the following steps:
after two or more nodes are added, all the added nodes are regarded as a comprehensive node, all edges coming out of the comprehensive node are checked, the node which enables the overall road cost to be minimum after the nodes are added is selected and contained in the minimum tree, the weight of each edge is updated, the steps are repeated, the minimum spanning trees of all the wind generating sets are obtained, and therefore the optimal connection circuit of the roads in the wind power plant is obtained.
7. A wind farm road route selection system is characterized by comprising:
a data acquisition module: the system comprises a data acquisition module, a data processing module and a data processing module, wherein the data acquisition module is used for acquiring digital elevation data and generating a contour topographic map of the wind power plant according to the digital elevation data;
a topographic map preprocessing module: the method comprises the steps of acquiring site boundaries, sensitive areas and wind generating set coordinates of the wind power plant from a contour topographic map, and removing areas outside the site boundaries and in the sensitive areas in the contour topographic map to obtain a topographic map of the wind power plant;
a path calculation module: the method is used for calculating the shortest path and the road cost corresponding to the shortest path connected with any two wind generating sets in the topographic map of the wind power plant by adopting an RRT (rapid return to the original) algorithm according to the coordinates of the wind generating sets, wherein the sum of all the road costs is the global road cost;
a path optimization module: and optimizing the shortest path by adopting an improved Prime algorithm with the minimum global road cost as a target to obtain the optimal connection line of the road in the wind power plant.
8. A wind power plant road route selection device is characterized by comprising a processor and a storage medium;
the storage medium is used for storing instructions;
the processor is configured to operate in accordance with the instructions to perform the steps of the method according to any one of claims 1 to 6.
9. Computer-readable storage medium, on which a computer program is stored which, when being executed by a processor, carries out the steps of the method according to any one of claims 1 to 6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211135622.6A CN115455623A (en) | 2022-09-19 | 2022-09-19 | Wind power plant road route selection method, system, device and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211135622.6A CN115455623A (en) | 2022-09-19 | 2022-09-19 | Wind power plant road route selection method, system, device and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN115455623A true CN115455623A (en) | 2022-12-09 |
Family
ID=84305458
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202211135622.6A Pending CN115455623A (en) | 2022-09-19 | 2022-09-19 | Wind power plant road route selection method, system, device and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115455623A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117010284A (en) * | 2023-10-07 | 2023-11-07 | 云南电投绿能科技有限公司 | Machine position arrangement method, device and equipment based on wind farm noise and storage medium |
-
2022
- 2022-09-19 CN CN202211135622.6A patent/CN115455623A/en active Pending
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117010284A (en) * | 2023-10-07 | 2023-11-07 | 云南电投绿能科技有限公司 | Machine position arrangement method, device and equipment based on wind farm noise and storage medium |
| CN117010284B (en) * | 2023-10-07 | 2024-01-05 | 云南电投绿能科技有限公司 | Machine position arrangement method, device and equipment based on wind farm noise and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107885960B (en) | Earthwork volume estimation system and method based on automatic line selection of construction roads in wind power plant | |
| CN108053060B (en) | Booster station site selection system and site selection method based on automatic road line selection in wind power plant | |
| CN106503381B (en) | BIM-GIS technology-based virtual construction site construction method for underground excavation station of subway | |
| CN107908899B (en) | Line selection system and line selection method for construction road of wind power plant | |
| CN112270030B (en) | Method, device, equipment and medium for optimal design of complex terrain wind power plant road | |
| CN102706323B (en) | Tower footing section extracting method based on airborne laser radar data | |
| CN101763455A (en) | Visual emergency system based on three-dimensional information integration | |
| CN109115297A (en) | A kind of measurement method of unmanned plane engineering amount of fill and amount of excavation | |
| CN108876204A (en) | A kind of method that urban distribution network planning multilevel splitting divides | |
| CN115455623A (en) | Wind power plant road route selection method, system, device and storage medium | |
| CN112288179B (en) | Optimized analysis method for planned village fruit production by using big data | |
| CN117910285B (en) | Creation method, device, equipment and storage medium of library basin design curved surface model | |
| CN104200044A (en) | GIS (geographic information system)-based three-dimensional power transmission line path selection method | |
| CN112948955A (en) | Mountain wind power plant road design method based on BIM | |
| CN108062438B (en) | Line selection system and line selection method for wind power plant operation road | |
| CN109853580B (en) | Open cut foundation pit construction management method based on photogrammetry | |
| Gruen | Next generation smart cities-the role of geomatics | |
| Park et al. | Case Study Research in Earthwork Site Digitization for Smart Construction | |
| CN104504476A (en) | Automatic complicated mountain railway line trend generating method | |
| CN113537142A (en) | Monitoring method, device and system for construction progress of capital construction project and storage medium | |
| CN110826127A (en) | Design optimization method for large industrial site | |
| CN114741759B (en) | Mountain area wind power plant road construction earth and stone side calculation method, device and storage medium | |
| Kochanek et al. | The Analysis of the Main Geospatial Factors Using Geoinformation Programs Required for the Planning, Design and Construction of a Photovoltaic Power Plant. | |
| Nie et al. | Mechanized construction technology of transmission line based on 3d visualization | |
| Revell et al. | Generalising and Symbolising Ordnance Survey® Base Scale Data to Create a Prototype 1: 50 000 Scale Vector Map |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |