CN113032879B - Photovoltaic field leveling design method - Google Patents
Photovoltaic field leveling design method Download PDFInfo
- Publication number
- CN113032879B CN113032879B CN202110318570.5A CN202110318570A CN113032879B CN 113032879 B CN113032879 B CN 113032879B CN 202110318570 A CN202110318570 A CN 202110318570A CN 113032879 B CN113032879 B CN 113032879B
- Authority
- CN
- China
- Prior art keywords
- node
- nodes
- height
- dth
- height difference
- 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.)
- Active
Links
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/13—Architectural design, e.g. computer-aided architectural design [CAAD] related to design of buildings, bridges, landscapes, production plants or roads
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2119/00—Details relating to the type or aim of the analysis or the optimisation
- G06F2119/20—Design reuse, reusability analysis or reusability optimisation
Landscapes
- Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- Geometry (AREA)
- General Physics & Mathematics (AREA)
- Computer Hardware Design (AREA)
- Theoretical Computer Science (AREA)
- Civil Engineering (AREA)
- Structural Engineering (AREA)
- Computational Mathematics (AREA)
- Architecture (AREA)
- Mathematical Analysis (AREA)
- Mathematical Optimization (AREA)
- Pure & Applied Mathematics (AREA)
- Evolutionary Computation (AREA)
- General Engineering & Computer Science (AREA)
- Pit Excavations, Shoring, Fill Or Stabilisation Of Slopes (AREA)
Abstract
The invention provides a photovoltaic field leveling design method, which comprises the steps of block division and coding, node volume and area collection, adjacent node height difference adjustment and node height iterative adjustment.
Description
Technical Field
The invention relates to a photovoltaic field flattening design method which is mainly suitable for field flattening design of photovoltaic power stations in areas with large topographic relief, such as deserts.
Background
The photovoltaic modules are often arranged in the north-south direction, and the panels can rotate in the east-west direction to face the sun. In order to reduce mutual shielding of adjacent panels in the east-west direction, the east-west direction gradient of a photovoltaic field needs to be controlled within a certain range (generally not more than 2%); in desert area, photovoltaic panel adopts clean little robot to crawl along panel components north-south direction more and cleans, and the biggest slope of crawling of clean little robot has decided the biggest slope of place north-south direction (generally no more than 6%).
The large photovoltaic power station usually occupies dozens of square kilometers or even dozens of square kilometers, and in regions with large topographic relief such as deserts, the amount of earth and stone in the flat photovoltaic field can reach millions or even thousands of squares, so that the engineering quantity is huge. The traditional field-parallel design method needs to divide blocks into a photovoltaic field, and field-parallel design is carried out on each block by using field-parallel software, and then the coordination problem of boundaries among the blocks is considered. The traditional method is time-consuming and labor-consuming, the number of divided blocks is limited, at most, dozens of blocks are limited, the blocks are difficult to be well connected, the quality of a field-level scheme is difficult to judge, and only by doing more schemes for comparison, a relatively better scheme is selected finally. The traditional field leveling method has the disadvantages of large design workload, low efficiency and large excavation and filling amount of field square plans.
Disclosure of Invention
The purpose of the invention is: aiming at the problems in the background art, a photovoltaic field leveling design method is provided. The method takes a photovoltaic matrix (or a smaller range) as a block, a control gradient as a constraint condition and adjustment of the node height of the block as a basic step, and continuously iteratively adjusts the node height to enable the gradient of adjacent nodes to meet requirements, finally forms a field square plan and achieves the goal of minimum total earthwork excavation and filling amount.
The technical scheme adopted by the invention is as follows:
a photovoltaic field leveling design method is characterized by comprising the following steps:
a. block division and coding: according to the photovoltaic matrix arrangement, block division is carried out on the whole field, and all blocks and nodes are coded to form a topological structure;
b. node volume and area collection: collecting the areas and the volumes of all blocks onto nodes, and converting the block field leveling problem into a node height adjusting problem;
c. adjusting the height difference of adjacent nodes: and carrying out earth allocation and transportation on the adjacent nodes with the height difference larger than the allowable height difference on the premise of keeping the total earth volume unchanged, so that the height difference between the adjacent nodes is equal to the allowable height difference.
d. Node height iterative adjustment: and searching whether the height difference of the adjacent nodes is smaller than the allowable height difference or not from the node with the minimum height every time the height difference adjustment of the adjacent nodes occurs, thereby gradually finishing the iterative adjustment of the height of each node and finally forming a field leveling scheme.
The invention has the beneficial effects that:
a. the applicability is good: the method can be used for field parallel design of different photovoltaic field parallel processes, and only boundary conditions such as block division, gradient requirements and the like are different.
b. The design speed is fast: the design method is programmed through calculation programming, and the field square pattern design can be completed in a very short time.
c. The field leveling, excavating and filling work amount is less: the design method is substantial and realizes that the gradient of the field meets the requirement by clipping peaks and filling valleys nearby on the basis of keeping the original terrain to the maximum extent, thereby greatly reducing the flat digging and filling amount of the field and shortening the transportation distance.
Drawings
FIG. 1 is a flow chart of the steps of the present invention. The symbols in the figure are schematically as follows: slope-NS-limiting the Slope ratio of the field in the north and south directions, Slope-EW-site east-west slope limiting ratio, DI-NS-north-south adjacent node spacing, DI-EW-east-west adjacent node spacing, dtHiNeighboring node allowance, VeiVolume under original terrain of each block, Sei-area of horizontal projection of each block, SnjArea of each node collection, VnjVolume of each node set, Hnj-original height of each node, Seq-sequence of arrangement from node with minimum height to node with maximum height, dthi-height difference of adjacent nodes, p-number of nodes for calling in earthwork in the earthwork allocation and transportation, q-number of nodes for calling out earthwork in the earthwork allocation and transportation, k-compaction coefficient.
Fig. 2 is a block division diagram according to an embodiment of the invention.
Detailed Description
In order that those skilled in the art will better understand the technical solutions of the present invention, the following description of the preferred embodiments of the present invention is provided in conjunction with specific examples, but it should be understood that the drawings are for illustrative purposes only and should not be construed as limiting the patent; for the purpose of better illustrating the embodiments, certain features of the drawings may be omitted, enlarged or reduced, and do not represent the size of an actual product; it will be understood by those skilled in the art that certain well-known structures in the drawings and descriptions thereof may be omitted. The positional relationships depicted in the drawings are for illustrative purposes only and are not to be construed as limiting the present patent.
The embodiment provides a photovoltaic field leveling design method, which comprises the following steps:
s1, extracting site coordinate data
And extracting the original topographic coordinate data to form a topographic data document. To facilitate data processing, a local coordinate system may be employed.
S2, dividing rectangular blocks, and numbering the blocks and nodes
And dividing the photovoltaic field by adopting rectangular blocks with two sides respectively parallel to the east-west direction and the south-north direction, wherein the size of the blocks is determined according to the arrangement of the photovoltaic matrix and the size of the photovoltaic module. It should be noted that the larger the block division is, the larger the excavation and filling amount of the field leveling scheme is, and the field leveling construction is easier to control. It is recommended that the side length of the rectangular block is controlled within a range of 50m to 200 m. And numbering the divided blocks and the nodes of the blocks, and recording the coordinates of the nodes, the numbers of the blocks and the composition of the nodes of the blocks to form a topological structure.
As shown in fig. 2, the directions of north, south, bottom, left, west, right, and east are shown, wherein solid rectangles represent blocks, the numbers with circles are block numbers, and reference numbers 1, 2, and 3 … … 25 are nodes of the blocks, i.e., vertices of rectangles.
S3, calculating the allowable height difference of adjacent nodes
According to the maximum allowable south-north Slope ratio Slope -NSAnd Slope ratio Slope of east and west-EWCalculate neighbor allowable height Difference dtHi：dtHi＝DI-NS×Slope-NS(neighboring nodes distributed in the north-south direction), or dtHi＝DI-EW×Slope-EW(adjacent nodes distributed east-west).
S4, calculating the volume and the area of each block
Dividing a rectangular block into small grid arrays, wherein the side length of each small grid is about 10-20 m, the volume of each small grid is calculated by multiplying the area of each small grid by the height of a central point of each small grid, and the volume V of the blockeiIs the sum of all the small grid volumes; area of block SeiIs the sum of all the small grid areas.
S5, calculating the area and the volume of the collection of each node
Area S of each node collectionnj(hereinafter, simply referred to as the area of each node) is the area S of each block sharing the node ei1/4 of the sum; volume V of each node collectionnj(hereinafter, referred to as the volume of each node) is the volume V of each block sharing the node ei1/4 of the sum.
As shown in fig. 2, where the dashed rectangle is the area of the collection of nodes.
S6, calculating the original height of each node
Original height H of nodenjIs the ratio of volume to area, i.e.: hnj＝Vnj/Snj
S7, nodes are sorted according to height
And sorting the nodes with the smallest height to the nodes with the largest height to form a search sequence Seq ═ { n1, n2 … }, wherein n1 and n2 … represent node numbers, and the heights of the nodes are increased from small to large.
S8, sequentially searching the sequence Seq
Searching in turn for each node of the sequence Seq, e.g. the height difference dth of a node and its neighborsiGreater than the allowable height difference dtHiIf yes, stopping the search, and jumping to step S9; e.g. height difference dth of all nodes and neighboring nodesiAre not more than dtHiThen, it jumps to step S12.
S9, determining two nodes for earthwork allocation and transportation
Note that the node being searched for is p, and the height difference dth from the node p among the nodes adjacent to the node piGreater than the allowable height difference dtHiAnd the difference value dthi–dtHiThe node with the minimum value is q, the node q is determined as an earthwork dispatch point, and the node p is the earthworkAnd (5) adjusting a point.
S10. adjacent node earthwork allocation and transportation
Dispatching earth dtV from node q to node p, and enabling height difference dth 'of two nodes after dispatching'iEqual to the maximum allowable height difference dtHi。
In the process of adjusting and transporting the earth and stone of the nodes, the specific original height H in the volume of each nodenjThe height is a compacted square and is higher than the original height HnjThe low volume is the natural square and the compaction factor is k (k ═ compaction square/natural square). When the node q calls out the earthwork, firstly calling out a compaction square (if any), and then calling out a natural square (if any) after the height of the node is smaller than the original height; when the node p is called into the earthwork, the insufficient natural square is filled (if the node p is used), and after the height of the node is larger than the original height, the compaction square is filled (if the node p is used for surplus). During the earthwork transportation, attention needs to be paid to whether the properties of the earthwork are changed.
S11, updating the node height
The heights of the p and q nodes after the earth movement in S10 are respectively replaced by the heights before the two nodes, and the process goes to S7.
S12-connecting nodes.
And connecting all adjacent nodes according to the height of each node to form a final design field square scheme.
Claims (5)
1. A photovoltaic field leveling design method is characterized by comprising the following steps:
s1, extracting original topographic coordinate data;
s2, dividing the photovoltaic field by adopting rectangular blocks with two sides parallel to the east-west direction and the south-north direction respectively, numbering the divided blocks and nodes of the blocks, and recording node coordinates, block numbers and node composition of each block to form a topological structure;
s3, according to the maximum allowable south-north Slope ratio Slope-NSAnd east-west Slope ratio Slope-EWCalculate neighbor allowable height Difference dtHiWherein the allowable height difference dtH of the north-south adjacent nodei＝DI-NS×Slope-NS(ii) a Allowable height difference dtH of east-west adjacent nodesi＝DI-EW×Slope-EWWherein, Slope-NS-limiting the Slope ratio of the field in the north and south directions, Slope-EW-site east-west slope limiting ratio, DI-NS-north-south adjacent node spacing, DI-EW-east-west neighboring node spacing;
s4, calculating the volume and the area of each block by adopting a small grid addition method;
s5, calculating the area and the volume of the collection of each node, and calculating the area S of the collection of each node njFor each block area S sharing the nodeei1/4 for the sum; volume V of each node collectionnjFor each block volume V of the common nodeei1/4 for the sum;
s6, calculating the original height H of each nodenj：Hnj＝Vnj/Snj；
S7, sorting the nodes with the smallest height to the nodes with the largest height to form a retrieval sequence Seq (n 1, n2 …), wherein n1 and n2 … represent node numbers, and the heights of the nodes are increased from small to large;
s8, searching each node of the sequence Seq in sequence, such as the height difference dth of a certain node and the adjacent nodeiGreater than the allowable height difference dtHiIf yes, stopping the search, and jumping to step S9; e.g. height difference dth of all nodes and neighboring nodesiAre not more than dtHiThen, go to step S12;
s9, marking the searched node as p, and in each node adjacent to the node p, marking the height difference dth of the node piGreater than the allowable height difference dtHiAnd the difference value dthi–dtHiDetermining the node q as an earthwork transfer-out point and the node p as an earthwork transfer-in point, wherein the node q is the minimum value;
s10, transferring the earth dtV from the node q to the node p, and enabling the height difference dth 'of the two nodes p and q after transfer'iEqual to the maximum allowable height difference dtHi；
S11, respectively replacing the heights of the p and q nodes after the earthwork allocation and transportation in the S10 with the heights before the p and q nodes, and jumping to S7;
and S12, connecting all adjacent nodes according to the height of each node to form a final design field square scheme.
2. The photovoltaic field flattening design method of claim 1, wherein: and a local coordinate system is adopted for the field so as to facilitate data processing.
3. The photovoltaic field flattening design method of claim 1, wherein: the side length of the rectangular block is controlled within the range of 50 m-200 m.
4. The photovoltaic field flattening design method of claim 1, wherein: in the process of adjusting and transporting the earth and stone of the nodes, the specific original height H in the volume of each nodenjThe height is a compacted square and is higher than the original height HnjThe low volume is a natural square, and the compaction coefficient is k ═ compaction square/natural square; when the node q calls out earthwork, if the node q is a compaction square, the compaction square is called out firstly, and if the node q is not enough after the height of the node is smaller than the original height, the natural square is called out; when the nodes p are called into the earthwork, if insufficient natural earthwork exists, the insufficient natural earthwork is filled, and if the nodes p are excessive after the height of the nodes is larger than the original height, the nodes p are filled into the compaction square.
5. The photovoltaic field flattening design method of claim 1, wherein: and searching whether the height difference of the adjacent nodes is smaller than the allowable height difference or not from the node with the minimum height every time the height difference adjustment of the adjacent nodes occurs, thereby gradually finishing the iterative adjustment of the height of each node and finally forming a field leveling scheme.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110318570.5A CN113032879B (en) | 2021-03-25 | 2021-03-25 | Photovoltaic field leveling design method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110318570.5A CN113032879B (en) | 2021-03-25 | 2021-03-25 | Photovoltaic field leveling design method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113032879A CN113032879A (en) | 2021-06-25 |
| CN113032879B true CN113032879B (en) | 2022-06-28 |
Family
ID=76473642
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110318570.5A Active CN113032879B (en) | 2021-03-25 | 2021-03-25 | Photovoltaic field leveling design method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113032879B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113610310B (en) * | 2021-08-13 | 2024-02-13 | 宋代军 | Multi-factor determination urban and rural road network and land block vertical earthwork minimizing method thereof |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110135104A (en) * | 2019-05-28 | 2019-08-16 | 信息产业电子第十一设计研究院科技工程股份有限公司 | A kind of mountainous region photovoltaic arrangement algorithm based on topographic analysis, artificial calculating and software simulation |
| CN110212848A (en) * | 2019-06-26 | 2019-09-06 | 李�浩 | A method of photovoltaic power generation is carried out using the effective place of Along Railway |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20130167907A1 (en) * | 2012-01-04 | 2013-07-04 | Panagiotis G. Bitarchas | Photovoltaic Mounting Apparatus and Method of Installation |
| CN103473394B (en) * | 2013-08-20 | 2017-04-12 | 中冶集团武汉勘察研究院有限公司 | Earthwork balance optimization design method for multiple station section type field leveling layout |
| US20190036482A1 (en) * | 2017-07-28 | 2019-01-31 | Nec Laboratories America, Inc. | Adaptive power management of energy storage for pv output control |
-
2021
- 2021-03-25 CN CN202110318570.5A patent/CN113032879B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110135104A (en) * | 2019-05-28 | 2019-08-16 | 信息产业电子第十一设计研究院科技工程股份有限公司 | A kind of mountainous region photovoltaic arrangement algorithm based on topographic analysis, artificial calculating and software simulation |
| CN110212848A (en) * | 2019-06-26 | 2019-09-06 | 李�浩 | A method of photovoltaic power generation is carried out using the effective place of Along Railway |
Non-Patent Citations (1)
| Title |
|---|
| 沙漠地区太阳能电站场地平整计算方法研究;范娜;《低温建筑技术》;20200728;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113032879A (en) | 2021-06-25 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106898045B (en) | Large-area true three-dimensional geographic scene self-adaptive construction method based on SGOG tiles | |
| CN113032879B (en) | Photovoltaic field leveling design method | |
| CN101630366B (en) | Method for extracting dynamic inundated area of large numbers of block topographic data, device and system thereof | |
| CN112231870B (en) | Intelligent generation method for railway line in complex mountain area | |
| CN108053060B (en) | Booster station site selection system and site selection method based on automatic road line selection in wind power plant | |
| CN107480409B (en) | Topological hierarchical layout method for visual simulation model of power system | |
| CN112668129B (en) | Space load clustering-based intelligent grid dividing method for power distribution network | |
| CN109921420B (en) | Elastic power distribution network restoring force improving method and device and terminal equipment | |
| CN102565810A (en) | Method for extracting land utilization landmark boundary outline on remote sensing image | |
| CN113221356A (en) | Irregular roof photovoltaic panel arrangement system and optimization method for complex building | |
| CN110650482A (en) | Base station equipment planarization optimization layout method based on gridding small-area principle and genetic algorithm | |
| CN106714193A (en) | Settling deploying method for underwater sensor nodes based on ideal pattern model | |
| CN111783298A (en) | Intelligent photovoltaic design system and design method | |
| CN113221355A (en) | Arrangement method of irregular roof photovoltaic panels of complex building | |
| CN116663849A (en) | Photovoltaic field station site selection method | |
| CN107908899A (en) | A kind of wire selection system and selection method for Construction of Wind Power construction road | |
| CN113256011A (en) | Intelligent power transmission line selection method based on GIS multi-target dynamic planning technology | |
| CN110136257B (en) | Automatic three-dimensional modeling method for mountain photovoltaic power station | |
| CN112532296A (en) | Large-scale satellite network construction method based on elliptical satellite coverage | |
| CN112328722A (en) | Method and system for rapidly loading three-dimensional GIS (geographic information System) and model data of power transformer substation | |
| CN116702261A (en) | Photovoltaic building group optimal layout method and system | |
| CN115619900B (en) | Point cloud map topological structure extraction method based on distance map and probability road map | |
| CN115455623A (en) | Wind power plant road route selection method, system, device and storage medium | |
| CN109117517A (en) | A kind of base pit dewatering optimum design method based on genetic algorithm and groundwater model | |
| CN117454461A (en) | Site-level design method based on quadratic programming |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20220930 Address after: 518101 1901-1914 COFCO Ziyun building, zone 22, lingzhiyuan community, Xin'an street, Bao'an District, Shenzhen, Guangdong Province Patentee after: China power construction east China Survey and Design Institute (Shenzhen) Co.,Ltd. Patentee after: ZHEJIANG HUADONG ENGINEERING CONSTRUCTION MANAGEMENT Co.,Ltd. Patentee after: POWERCHINA HUADONG ENGINEERING Corp.,Ltd. Address before: 310000 Building 1, 201 Gaojiao Road, Yuhang District, Hangzhou City, Zhejiang Province Patentee before: ZHEJIANG HUADONG ENGINEERING CONSTRUCTION MANAGEMENT Co.,Ltd. Patentee before: POWERCHINA HUADONG ENGINEERING Corp.,Ltd. |