Wind turbine arrangement method and device

Abstract

The application relates to the technical field of offshore wind farm planning and micro-siting, and provides a wind turbine arrangement method and device, which comprises the following steps: acquiring an initial grid point array, and screening a preliminary screening point set located in the interior of an arrangeable region; for a to-be-adjusted point in the preliminary screening point set, which has a distance to the boundary of the arrangeable region less than a preset distance threshold, the to-be-adjusted point is adjusted in a direction away from the nearest boundary to obtain an adjusted point set; the adjusted point set is subjected to spacing review, and conflict points not satisfying a safety spacing requirement are eliminated to obtain a final machine site point set; and the final machine site point set is output. The application maximizes the space utilization while ensuring the compliance of the layout, effectively avoids the global spacing violation problem caused by local position adjustment, and ensures the engineering feasibility and compliance of the final machine site arrangement scheme under a complex boundary shape.

Description

Technical Field

[0001] This invention relates to the field of offshore wind farm planning and micro-site selection technology, specifically to a method and apparatus for arranging wind turbine units. Background Technology

[0002] In the early planning and feasibility study stages of offshore wind farms, turbine placement is a crucial factor affecting the project's power generation and economic viability. Currently, turbine placement mainly relies on manual operation by designers, who manually draw rows and columns in graphical software, place turbines one by one, and adjust their positions based on experience to avoid site boundaries. When faced with complex polygonal site boundaries, existing automated turbine placement algorithms are mostly optimized based on regular rectangular areas, often using simple discarding methods for turbines near the boundary. This approach results in low utilization of the deployable area, making it difficult to fully utilize the site edge space while strictly adhering to boundary avoidance requirements. Furthermore, after position adjustments, spacing conflicts between turbines can easily arise, making it difficult to guarantee overall compliance.

[0003] Therefore, there is an urgent need for a wind turbine layout method that can intelligently handle irregular boundaries and ensure global spacing compliance. Summary of the Invention

[0004] To address the problem in existing technologies that simply discard regular layout points within irregular boundaries, resulting in low space utilization and easy spacing conflicts, this application proposes a wind turbine layout method and device to achieve intelligent translation adjustment of points near the boundary and verification of global spacing to eliminate conflicts, thereby maximizing space utilization while ensuring layout compliance.

[0005] To achieve the above objectives, this application adopts the following technical solution: A wind turbine layout method includes: acquiring an initial grid of points and selecting a preliminary set of points located within the deployable area; for points in the preliminary set of points whose distance to the boundary of the deployable area is less than a preset distance threshold, translating them along the direction away from the nearest boundary to obtain an adjusted set of points; performing a spacing check on the adjusted set of points to eliminate conflict points that do not meet the safety spacing requirements, obtaining a final set of turbine locations; and outputting the final set of turbine locations.

[0006] The above solution first adjusts the points near the boundary by moving them inward to utilize the boundary space, and then performs a global spacing check on the adjusted point set to eliminate conflicts. This forms a closed-loop processing mechanism that "utilizes the boundary space first and then ensures global compliance," maximizing space utilization while ensuring layout compliance.

[0007] Optionally, for the points to be adjusted in the preliminary selection point set whose distance to the boundary of the deployable area is less than a preset distance threshold, the points are translated and adjusted along the direction away from the nearest boundary to obtain the adjusted point set, including: calculating the shortest distance from each point in the preliminary selection point set to each boundary of the deployable area; in response to the shortest distance being less than the preset distance threshold, determining the nearest boundary corresponding to the shortest distance; determining the direction vector away from the nearest boundary, and translating the corresponding points along the direction vector until the distance from the translated points to the boundary of the deployable area is greater than or equal to the preset distance threshold.

[0008] The above scheme ensures that points near the boundary can be accurately identified and safely adjusted to compliant positions by clearly defining the calculation of the shortest distance and the translation logic of the direction vector away from the nearest boundary.

[0009] Optionally, the step of performing a spacing check on the adjusted point set to eliminate conflict points that do not meet the safety spacing requirements and obtain the final machine point set includes: calculating the spacing between point pairs in the adjusted point set; in response to the existence of conflict point pairs with spacing less than the safety spacing, based on the expected power generation of each point in the conflict point pair, retaining the point with the larger expected power generation in the conflict point pair, and performing a position shifting or removal process on the other point in the conflict point pair.

[0010] The above scheme maximizes overall power generation efficiency while resolving spacing conflicts by introducing expected power generation as the criterion for conflict elimination.

[0011] Optionally, translating the corresponding point along the direction vector includes: setting an initial movement step size; moving the corresponding point along the direction vector by the initial movement step size to obtain a candidate position; determining whether the candidate position is located inside the deployable area and whether the distance from the candidate position to the boundary of the deployable area is greater than or equal to the preset distance threshold; if not satisfied, reducing the initial movement step size and repeating the movement and determination steps until the condition is met or a preset number of iterations is reached.

[0012] The above scheme improves the success rate and adaptability of translation adjustment under complex boundary conditions by dynamically adjusting the movement step size and performing iterative judgments.

[0013] Optionally, the expected power generation is determined based on wind speed estimation at the point location, including: obtaining wind speed estimation data at each point location in the adjusted point set; and calculating the expected power generation at each point location based on the wind speed estimation data and a predetermined wind turbine power characteristic curve.

[0014] The above scheme calculates the expected power generation using wind speed estimation data and wind turbine power characteristic curves, providing specific and quantifiable data support for trade-offs in the conflict resolution process.

[0015] Optionally, it also includes: obtaining the original boundary polygon and the boundary avoidance distance; shrinking each side of the original boundary polygon inward by the boundary avoidance distance to generate the deployable area.

[0016] The above scheme generates a deployable area by shrinking the original boundary polygon inward, thus ensuring from the source that the placement of all subsequent machine sites meets the physical boundary avoidance requirements.

[0017] In addition, this application also provides a wind turbine layout device, including: a screening module for acquiring an initial grid of points and screening out a preliminary set of points located within the deployable area; an adjustment module for translating and adjusting points in the preliminary set of points whose distance from the boundary of the deployable area is less than a preset distance threshold along the direction away from the nearest boundary to obtain an adjusted set of points; a verification module for verifying the spacing of the adjusted set of points, eliminating conflict points that do not meet the safety spacing requirements, and obtaining a final set of turbine locations; and an output module for outputting the final set of turbine locations.

[0018] The above solution achieves the implementation of the layout method at the hardware or software level through modular design, ensuring the effective execution of the core processing closed loop.

[0019] Optionally, a parameter setting module is also included to receive parameters such as safety clearance, heading angle, and boundary avoidance distance.

[0020] The above solution provides a flexible human-computer interaction interface through the parameter setting module, which facilitates the rapid configuration of layout parameters for different site conditions.

[0021] In addition, this application also provides an electronic device, including a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor executes the computer program to implement the above-described wind turbine arrangement method.

[0022] In addition, this application also provides a computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, implements the above-described wind turbine arrangement method.

[0023] Beneficial effects: This application employs a combined closed-loop design of inward translation adjustment of points near the boundary and global spacing verification to eliminate conflicts. For regular layout points within irregular boundaries, instead of simply discarding them, the shortest distance from the point to the boundary of the deployable area is calculated. If the distance is less than a preset distance threshold, the point is translated away from the nearest boundary. This mechanism maximizes the utilization of deployable space at the site edge while strictly adhering to avoidance distances, thus improving marine resource utilization efficiency. Simultaneously, a global spacing verification step is introduced after the translation adjustment. This step checks the pairwise spacing of the adjusted point set and eliminates conflicts by retaining high-value points based on expected power generation and moving or removing another point. This closed-loop process effectively avoids global spacing violations caused by local position adjustments, ensuring the engineering feasibility and compliance of the final turbine placement scheme under complex boundary shapes, and significantly improving design efficiency and scheme quality. Furthermore, this method standardizes and algorithmizes the turbine placement process, making scheme generation no longer dependent on the experience of individual experts, which is conducive to knowledge accumulation and team collaboration, and has good standardization and repeatability. Attached Figure Description

[0024] Figure 1 This is a flowchart of a wind turbine layout method according to an embodiment of this application; Figure 2 This is a flowchart of another wind turbine arrangement method according to an embodiment of this application; Figure 3 This is a schematic diagram of the geometric relationship between the original boundary polygon and the arrangeable region in an embodiment of this application; Figure 4 This is a schematic diagram of the generation of the initial regular mesh lattice in the rotating coordinate system according to an embodiment of this application; Figure 5 This is a schematic diagram illustrating the adjustment of grid point positions near the boundary in an embodiment of this application; Figure 6 This is a schematic diagram of a regularized aircraft station layout scheme within an irregular site boundary according to an embodiment of this application; Figure 7 This is a structural diagram of a wind turbine arrangement device according to an embodiment of this application. Detailed Implementation

[0025] To make the objectives, technical solutions, and advantages of this application clearer, the technical solutions in the embodiments of this application will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some, not all, of the embodiments of this application.

[0026] Unless otherwise defined, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this application pertains.

[0027] Example 1: like Figure 1 As shown, this embodiment provides a method for arranging wind turbine generators. This method is executed by a computer device and mainly includes the following steps: Step S110: Obtain the initial grid point matrix and filter out the preliminary set of points located within the deployable area.

[0028] The initial grid is a set of discrete points generated within the target wind farm site according to certain rules.

[0029] There are various ways to generate the initial grid. For example, it can be an orthogonal grid generated in a Cartesian coordinate system with equal row and column spacing, an inclined grid generated in a rotating coordinate system based on the prevailing wind direction, or even a grid based on a hexagonal honeycomb structure.

[0030] The deployable area refers to the effective area where wind turbine units are allowed to be deployed according to physical boundary avoidance requirements or safety regulations.

[0031] After obtaining the initial grid, the grid points that fall outside the deployable area are removed by judging the geometric positional relationship, and the points located inside the deployable area are retained to form a preliminary set of selected points.

[0032] This step enables initial filtering from a global rule-based matrix to a local compliant matrix.

[0033] Step S120: For the points to be adjusted in the initial screening point set whose distance from the boundary of the deployable area is less than a preset distance threshold, translate and adjust them in the direction away from the nearest boundary to obtain the adjusted point set.

[0034] The preset distance threshold is a critical value used to measure whether grid points are too close to the boundary. It can be set comprehensively based on factors such as the rotor diameter of the wind turbine, safety regulations, or the wake influence range. For example, it can be set to a specific multiple of the rotor diameter of the wind turbine.

[0035] In the initial screening set of points, some points, although located within the deployable area, may be less than the preset distance threshold from the boundary, posing a safety risk or insufficient space utilization. These points are marked as points to be adjusted.

[0036] In order to maximize the use of the available space at the edge of the site while strictly adhering to the avoidance distance, instead of simply discarding these points to be adjusted, the distance of each point to be adjusted to its nearest boundary is calculated, and the direction vector away from the nearest boundary is determined. The points to be adjusted are then translated and finely adjusted along the direction vector into the interior of the available area until the distance to the boundary meets the requirements, thus forming the adjusted point set.

[0037] Step S130: Perform a spacing check on the adjusted point set to eliminate conflicting points that do not meet the safety spacing requirements, and obtain the final machine point set.

[0038] Safety clearance refers to the minimum distance that wind turbine units must maintain to avoid severe wake interference and ensure operational safety.

[0039] During the translation adjustment in step S120, moving the point to be adjusted inward may shorten its distance to adjacent grid points. Therefore, it is necessary to check the pairwise spacing of all points in the adjusted point set. If any point pairs are found to have a spacing smaller than the safe spacing, these points are marked as conflict points.

[0040] Methods for eliminating conflicting points can include retaining the point with higher overall value while relocating the other point, or directly removing the other point from the point set. Through global spacing verification and conflict elimination, it is ensured that all retained points meet the minimum spacing requirement, forming the final machine point set.

[0041] Step S140: Output the final location set.

[0042] The output can be in the form of a data file, a coordinate list, or a graphical interface, which designers can use directly for subsequent micro-site selection assessments and engineering construction.

[0043] Furthermore, while outputting the final turbine site set, the system automatically calculates and outputs evaluation indicators for the current layout scheme, including: the theoretical number of wind turbines, i.e., the total number of final turbine site concentration points; the total installed capacity, i.e., the product of the theoretical number of wind turbines and the specified single-unit capacity; and the sea area efficiency index, calculated as: sea area per unit installed capacity = total site area / total installed capacity, where the total site area is calculated based on the area of ​​the original boundary polygon. These evaluation indicators provide designers with a quantitative basis for comparing different layout schemes, facilitating comprehensive optimization from the perspectives of power generation efficiency and sea area compliance.

[0044] This embodiment first adjusts the points to be adjusted near the boundary by shifting them inward to utilize the boundary space, and then performs a global spacing check on the adjusted point set to eliminate conflicts, forming a closed-loop processing mechanism of "utilizing boundary space first, then ensuring global compliance". This closed-loop mechanism effectively solves the problem in the prior art of simply discarding regular layout points within irregular boundaries, which leads to low space utilization and easy spacing conflicts, and maximizes space utilization while ensuring layout compliance.

[0045] Example 2: Based on Example 1, this example provides a detailed description of the specific algorithm for inward translation adjustment of points near the boundary. For the points to be adjusted in the initial selection point set whose distance to the boundary of the deployable area is less than a preset distance threshold, translation adjustment is performed along the direction away from the nearest boundary to obtain the adjusted point set. This includes: calculating the shortest distance from each point in the initial selection point set to each boundary of the deployable area; determining the nearest boundary corresponding to the shortest distance in response to the shortest distance being less than the preset distance threshold; determining the direction vector away from the nearest boundary, and translating the corresponding points along the direction vector until the distance from the translated point to the boundary of the deployable area is greater than or equal to the preset distance threshold.

[0046] The deployable area is typically an irregular polygon formed by connecting multiple line segments end to end. Calculating the shortest distance from a point to each boundary of the deployable area requires traversing every boundary segment of the polygon. For each segment, the perpendicular distance from the point to be adjusted to that segment is calculated. If the foot of the perpendicular falls inside the segment, this perpendicular distance is the shortest distance from the point to that segment; if the foot of the perpendicular falls on the extension of the segment, the straight-line distance from the point to be adjusted to the closer of the two endpoints of the segment is taken as the shortest distance. The minimum value obtained after traversing all boundary segments is taken as the shortest distance from that point to the boundary of the deployable area. When this shortest distance is less than a preset distance threshold, the boundary segment that generates this shortest distance is marked as the nearest boundary. Subsequently, the direction vector away from the nearest boundary is determined. If the foot of the perpendicular is inside the segment, the direction vector is the vector from the foot of the perpendicular to the point to be adjusted; if the shortest distance is generated by an endpoint, the direction vector is the vector from that endpoint to the point to be adjusted.

[0047] To ensure precise control of the movement step size, the direction vector is normalized to become a unit direction vector. Let the point to be adjusted be G, and let P_foot be the point (foot of the perpendicular or endpoint) on the nearest boundary segment to G. Then the direction vector V = G. P_foot, after normalization, yields the unit direction vector v = V / |V|. The point to be adjusted is translated along this direction vector with an initial step size step, and the new position after translation is G' = G + step × v.

[0048] This embodiment ensures that the point to be adjusted can move along the most direct path into the placeable area by accurately calculating the shortest distance and determining the direction vector away from the boundary, thus avoiding the problems of going out of bounds or low efficiency caused by blind adjustment.

[0049] Further, the corresponding point is translated along the direction vector, including: setting an initial movement step size; moving the corresponding point along the direction vector by the initial movement step size to obtain a candidate position; determining whether the candidate position is located inside the deployable area and whether the distance from the candidate position to the boundary of the deployable area is greater than or equal to a preset distance threshold; if not satisfied, the initial movement step size is reduced and the movement and judgment steps are repeated until the conditions are met or the preset number of iterations is reached.

[0050] Specifically, combined Figure 5 As shown, before adjustment, the point G to be adjusted is too close to the boundary, and its shortest distance d_min is less than the preset distance threshold. The system sets an initial movement step size, which can be set as the difference between the preset distance threshold and the current shortest distance, or as a specific proportion of the diameter of the wind turbine rotor. After moving the point to be adjusted along the direction vector by this initial movement step size, a new position is obtained as a candidate position. Since the shape of the boundary of the deployable area may be extremely irregular, the candidate position after movement may have two situations that do not meet the conditions: one is that the candidate position has moved too far, exceeding the inner range of the deployable area; the other is that although the candidate position is still inside the deployable area, its shortest distance to the boundary is still less than the preset distance threshold due to the change in the boundary orientation. Therefore, it is necessary to perform compliance judgment on the candidate position. If the judgment result is that the condition is not met, the movement step size is reduced by a preset proportion, such as halved, and the reduced step size is moved along the direction vector again based on the original position of the point to be adjusted to obtain a new candidate position and judge it again. This process is repeated. If the condition is still not met even when the step size is reduced to a minimum value, or the number of iterations reaches the preset iteration limit, the iteration is stopped. Setting a preset number of iterations avoids getting stuck in an infinite loop at dead zones such as extreme sharp-angle boundaries. This embodiment dynamically adjusts the movement step size and performs iterative judgments, enabling the translation adjustment process to adapt to complex and ever-changing boundary geometries. While ensuring that the boundary is not crossed and the avoidance distance is met, it effectively improves the space utilization near the boundary and the robustness of the algorithm.

[0051] Example 3: Based on Example 1, this example provides a detailed explanation of the specific rules and quantitative basis for spacing verification and conflict elimination. The adjusted point set undergoes spacing verification to eliminate conflict points that do not meet the safe spacing requirements, resulting in the final generator point set. This includes: calculating the spacing between point pairs in the adjusted point set; in response to the existence of conflict point pairs with spacing smaller than the safe spacing, based on the expected power generation of each point in the conflict point pair, retaining the point with the larger expected power generation, and relocating or removing the other point in the conflict point pair.

[0052] Specifically, after translational adjustments near the boundary, some points move inward into the deployable area, potentially shortening the distance between two adjacent points that originally met the safety spacing. The system iterates through the adjusted point set, calculating the Euclidean distance between all point pairs. If the distance between two points is found to be less than the safety spacing, these two points are marked as a conflict pair. To ensure the overall power generation efficiency of the wind farm while eliminating conflicts, the system introduces expected power generation as a quantitative criterion for conflict resolution. When a conflict occurs, the system calculates the expected power generation of each point in the conflict pair and compares their values. The point with a larger expected power generation means it can capture more wind energy at its current location and has higher economic value, thus it is retained. For the other point in the conflict pair, the system can perform position relocation processing, such as searching for a new compliant location outward along its grid line; if a location that meets the safety spacing and does not generate new conflicts cannot be found within a limited search range, the point is directly removed from the point set. This embodiment avoids the loss of high-value turbine locations due to blindly removing points by using a selection rule based on expected power generation, achieving dual optimization of space utilization and power generation efficiency.

[0053] Furthermore, the expected power generation is determined based on wind speed estimation at the point location, including: obtaining wind speed estimation data at each point location in the adjusted point set; and calculating the expected power generation at each point location based on the wind speed estimation data and the predetermined wind turbine power characteristic curve.

[0054] Specifically, wind speed estimation data can be obtained in various ways. For example, a macro-level wind energy resource assessment database can be accessed to interpolate the average wind speed at each location based on its geographical coordinates; alternatively, a computational fluid dynamics (CFD) model can be used, combined with site topography and roughness information, to simulate and calculate the wind speed distribution at each location under a specific wind direction. The predetermined wind turbine power characteristic curve is an inherent performance parameter of the wind turbine unit, reflecting its output power at different wind speeds. After obtaining the wind speed estimation data for a specific location, the system maps the wind speed value to the corresponding output power by looking up the wind turbine's power characteristic curve, and then calculates the expected power generation at that location by combining it with a time period (such as the annual equivalent full-load operating hours). This embodiment, by clearly defining the methods for obtaining wind speed estimation data and the mapping relationship of the power characteristic curve, provides specific and quantifiable data support for point selection during conflict resolution, ensuring the feasibility and economy of the layout scheme in actual engineering.

[0055] Example 4: Based on the above embodiments, this embodiment provides a detailed description of the method for generating a deployable region. The method further includes: obtaining the original boundary polygon and the boundary avoidance distance; and shrinking each side of the original boundary polygon inwards by the boundary avoidance distance to generate a deployable region.

[0056] Specifically, the original boundary polygon refers to a closed polygonal area defined by the physical boundary line of the wind farm site or the approved sea area, typically composed of a series of vertices with geographic coordinates connected sequentially. The boundary clearance distance refers to the safety buffer width set to meet safety regulations, environmental requirements, or to prevent wind turbine blades from exceeding the boundary. Combined with... Figure 3 As shown, after obtaining the original boundary polygon P and the boundary avoidance distance B, the system uses geometric calculations to translate each edge of the original boundary polygon P along its inward normal direction by the boundary avoidance distance B. For the translation lines of adjacent edges, new vertices are generated through intersection calculations. Connecting these new vertices sequentially generates a new polygon with a reduced area but similar shape, which serves as the placement region P_inner. This placement region P_inner serves as the boundary constraint benchmark for subsequent mesh point selection and translation adjustment, ensuring from the source that all subsequently generated mesh points meet the physical boundary avoidance requirements.

[0057] As another alternative implementation, the algorithm for shrinking the edges of the original boundary polygon inward by a boundary avoidance distance is not limited to simple line segment translation and intersection. For example, when dealing with polygons containing complex shapes with concavity and convexity, the Vatti clipping algorithm in computational geometry or the negative buffer algorithm in buffer analysis can be used to achieve high-precision inward shrinkage. As another example, when the original boundary contains curve segments, the curve can be discretized into short straight line segments before shrinkage, or the shrinkage calculation can be performed directly based on the equidistant line equation of the curve. It should be understood that as long as the purpose of shrinking the boundary inward by a preset distance to generate a safe internal region can be achieved, any specific geometric algorithm does not depart from the protection scope of this embodiment.

[0058] This embodiment pre-calculates the arrangeable area before generating and adjusting the grid points, transforming complex physical boundary avoidance constraints into explicit geometric boundary constraints. This mechanism allows subsequent preliminary screening steps to eliminate non-compliant points simply by performing a point-polygon containment relationship judgment. Simultaneously, it provides clear movement limits for the translational adjustment of points near the boundary, avoiding blind adjustments in an unconstrained state and effectively improving the execution efficiency and compliance of the arrangement algorithm.

[0059] Example 5: like Figure 2 As shown, this embodiment demonstrates the entire process of a compliant camera position solution from input to output for an irregular polygonal site.

[0060] Step S1, Input and Preprocessing.

[0061] Enter the following parameters either through the software interface or via a data file: The site boundary polygon P is represented by a sequence of vertex coordinates, for example, P = {P1(39560000, 2595000),P2(39562000, 2598000), P3(39558000, 2599000), P4(39556000, 2596000)}. The coordinates are in a Cartesian coordinate system (such as the UTM coordinate system).

[0062] Safety spacing D: Determined based on the impeller diameter. For example, for a fan with an impeller diameter of 313m, take D = 5 * 313 = 1565m.

[0063] The direction angle of the loom α is usually set to be perpendicular to the prevailing wind direction. If the prevailing wind direction is NE (45°), then α = 45° + 90° = 135°.

[0064] Boundary avoidance distance B: set according to sea use management regulations and safety requirements, for example, B = 500m.

[0065] Step S2: Calculate the deployable area.

[0066] Calculate the interior arrangeable polygon P_inner based on the input original boundary polygon P and boundary avoidance distance B.

[0067] Algorithm selection: The "negative buffer" algorithm in polygon buffer analysis, namely Vatti clipping algorithm, is adopted to translate each edge of polygon P by a distance B in the direction of the inward normal.

[0068] Specific calculations: Use computational geometry libraries (such as GEOS, CGAL) or implement your own algorithm. For each edge, calculate its inward normal vector, translate it to obtain a new edge, and then perform intersection and connection operations to form a new closed polygon P_inner.

[0069] Output: The sequence of vertex coordinates for P_inner. All wind turbine centers must be located inside P_inner.

[0070] Step S3: Generate a regular grid layout.

[0071] S31, Determine the range of the weaving machine.

[0072] Calculate the minimum bounding rectangle (MBR) of P_inner. Algorithm: Find the minimum and maximum X and Y coordinates of all vertices of P_inner, forming a rectangle Rect = [X_min, X_max, Y_min, Y_max].

[0073] S32, construct a rotating coordinate system.

[0074] The origin is the center point O(Cx, Cy) of the smallest bounding rectangle Rect.

[0075] Establish a rotating coordinate system: take the direction angle α as the new positive direction of the X' axis (i.e., the row direction) and the vertical direction as the positive direction of the Y' axis (i.e., the column direction).

[0076] Coordinate transformation formula: For any point (x, y) in the original coordinate system, its coordinates (x', y') in the rotated coordinate system are: x' =(x - Cx) * cos(α) + (y - Cy) * sin(α)y' = -(x - Cx) * sin(α) + (y- Cy) * cos(α) The angle α needs to be converted to radians.

[0077] S33, Mesh.

[0078] In the rotated coordinate system, the area within the smallest bounding rectangle Rect after rotation is used as the mesh generation region.

[0079] A uniform grid is generated on the X' axis (row direction) and Y' axis (column direction) with a safety spacing D as the step size.

[0080] Let M be the number of grid points in the X' direction and N be the number in the Y' direction. Then the initial grid point set G_initial = {G_ij | i=0,...,M-1; j=0,...,N-1}, where: G_ij(x', y') = (X'_min + i * D, Y'_min + j * D) Transform all G_ij back to the original geographic coordinate system using an inverse coordinate transformation (the formula is the opposite of the above) to obtain the initial grid point coordinates.

[0081] Step S4: Adaptive filtering and adjustment of grid points.

[0082] S41, initial screening.

[0083] Iterate through each point G_ij in G_initial.

[0084] Use the ray casting method or the rotation number method to determine whether a point is inside the polygon P_inner.

[0085] Points located outside P_inner are removed to obtain the initial filtered point set G_filtered.

[0086] S42, intelligent adjustment of points near the boundary.

[0087] For each point G in G_filtered, calculate its shortest distance d_min to each boundary line segment of P_inner. The calculation method is: calculate the perpendicular foot distance from the point to each line segment (if the perpendicular foot lies within the line segment) or the straight-line distance to the endpoint, and take the minimum value.

[0088] Set a safety factor k (for example, k=0.5). If d_min < k * D, it is determined that this point is too close to the boundary.

[0089] Adjustment method: Find the nearest boundary line segment L that results in d_min.

[0090] Calculate the direction vector from point G away from line segment L. If the perpendicular foot of G to line segment L is P_foot, the direction vector V = G - P_foot (normalized). If the perpendicular foot does not lie within the line segment, the direction vector is the opposite direction of the vector from G pointing to the nearest endpoint of the line segment.

[0091] Perform a small-amplitude translation along the direction vector V. Set an initial movement step size step (such as D / 20). Move the point to the new position G' = G + step * V.

[0092] Determine whether G' is still inside P_inner and satisfies d_min' >= k*D. If the conditions are not met, the step size can be reduced for iteration or attempts can be made along other directions until a position that meets the conditions is found.

[0093] Record the adjusted point G_adjusted.

[0094] Perform the above operations on all points that need to be adjusted to form the adjusted point set G_adjusted.

[0095] S43, Spacing verification and optimization.

[0096] Perform pairwise spacing check on the points in G_adjusted, and calculate the Euclidean distance.

[0097] If the distance Dist between any two points G_a and G_b is less than D, trigger conflict resolution.

[0098] Conflict resolution rules (example): Priority retention: Compare the expected power generation of the two points (which can be roughly estimated according to the wind speed at their positions), and retain the point with higher expected power generation.

[0099] Position fine-tuning: For points that need to be moved (such as points with low power generation), move them along the direction of their grid lines (row or column direction) to find a new position that is >= D from all other points and still within P_inner. The move search can use a small-step trial-and-error method.

[0100] If the issue cannot be resolved through fine-tuning, consider removing the point.

[0101] Ensure that all machine points ultimately meet the minimum spacing requirement, forming the final machine point set G_final.

[0102] Step S5: Solution output and evaluation.

[0103] Output the coordinates of all points in G_final.

[0104] Automatically calculate and output: Number of wind turbines N = count(G_final).

[0105] Total installed capacity (must be combined with the specified single-unit capacity).

[0106] Sea area utilization efficiency index: Sea area per unit installed capacity = (Total site area) / (Total installed capacity), where the total site area can be calculated based on the original polygon P.

[0107] Multiple options generation: By changing the direction angle α of the fabrication machine (e.g., from 0° to 165° in 15° intervals), repeating steps S3-S4, multiple alternative options are quickly generated, allowing designers to make comprehensive selections from the perspectives of wake layout and marine utilization efficiency.

[0108] Example 6: This embodiment provides a wind turbine layout device. For example... Figure 7 As shown, the device mainly includes a screening module, an adjustment module, a verification module, and an output module.

[0109] The filtering module is used to obtain the initial grid point matrix and filter out the preliminary set of points located within the deployable area.

[0110] Specifically, the filtering module serves as the data entry point for the entire device, and it can integrate a geometric calculation engine or call external computational geometry libraries. The filtering module receives initial grid data and polygon parameters of the deployable area from the upstream system or external storage medium. During operation, the filtering module iterates through each point in the initial grid by executing logic to determine the positional relationship between points and polygons, such as ray intersection or rotation algorithms. Points located outside the deployable area are removed, and the set of points remaining inside the deployable area is used as the initial filtered point set. The filtering module then passes the data structure of this initial filtered point set to the downstream adjustment module. It should be understood that the specific implementation of the filtering module is not limited to a standalone hardware processor; it can also be a software functional unit or microservice running on a general-purpose processor.

[0111] The adjustment module is used to translate and adjust the points to be adjusted in the direction away from the nearest boundary of the initially screened point set whose distance from the boundary of the deployable area is less than a preset distance threshold, so as to obtain the adjusted point set.

[0112] Specifically, the adjustment module is data-connected to the screening module and receives the preliminary screening point set output by the screening module. The adjustment module internally includes a distance calculation subunit and a vector translation subunit. The distance calculation subunit is responsible for calculating the shortest distance from each point in the preliminary screening point set to each boundary of the deployable area, and comparing the shortest distance with a preset distance threshold to identify the points to be adjusted. The vector translation subunit is responsible for determining the direction vector away from the nearest boundary and performing a translation operation along that direction vector. Through the coordinated operation of the above logic, the adjustment module outputs the adjusted point set to the verification module. In other embodiments, the adjustment module can also integrate step-size iteration control logic to handle translation adjustment requirements under complex boundary shapes, thereby improving the robustness of the device under extreme geometric conditions.

[0113] The verification module is used to verify the spacing of the adjusted point set, eliminate conflict points that do not meet the safety spacing requirements, and obtain the final machine point set.

[0114] Specifically, the verification module receives the adjusted point set output by the adjustment module and internally includes a spacing verification unit and a conflict resolution unit. The spacing verification unit traverses the adjusted point set, calculates the Euclidean distance between all point pairs, and determines whether there are any conflicting point pairs with a spacing smaller than the safety distance. Once a conflicting point pair is found, the conflict resolution unit is triggered. Based on preset conflict resolution rules, such as a comparison of expected power generation, it decides which point in the conflicting point pair to retain and performs position relocation or removal on the other point. The verification module uses a combination of global scanning and local processing to ensure that the final generated machine point set meets the minimum spacing requirement in the overall layout, thereby guaranteeing the engineering feasibility of the solution.

[0115] The output module is used to output the final location set.

[0116] Specifically, the output module connects to the verification module to obtain the final set of camera points after conflict resolution. The output module can convert this final set of camera points into a data file in a specific format, such as a CSV coordinate list or a CAD drawing file. It can also be displayed visually on a display device via a graphical user interface (GUI) for designers to use for subsequent evaluation and retrieval. The output module can exist as a data interface, a driver, or a graphics rendering engine.

[0117] Furthermore, the device also includes a parameter setting module for receiving parameters such as safety clearance, heading angle, and boundary avoidance distance.

[0118] The parameter setting module serves as a bridge for human-computer interaction or a configuration interface for external systems, providing the parameters required for the operation of the aforementioned functional modules. The parameter setting module can manifest as an input box, drop-down menu, or configuration file parser on a graphical user interface. Users or external systems input key parameters such as safety spacing, orientation angle, and boundary avoidance distance through the parameter setting module. Specifically, the safety spacing parameter is distributed to the verification module as a benchmark for spacing verification; the orientation angle parameter is distributed to the filtering module or its upstream mesh generation module to control the initial mesh point arrangement direction; and the boundary avoidance distance parameter is used to generate the deployable area.

[0119] This embodiment, by adding a parameter setting module, enables the layout device to flexibly adapt to the physical conditions of different wind farm sites and the safety specifications of different turbine models. It can quickly generate multiple comparison schemes without modifying the underlying code, significantly improving the device's versatility and practical value. Furthermore, the device also includes a boundary data input module for importing and processing site polygon data.

[0120] The boundary data input module supports graphical drawing or importing GIS files (such as Shapefile and KML formats) to define the original boundary polygons of the site. It performs format validation and coordinate system unification on the imported polygon data to ensure that subsequent calculation modules can correctly parse the boundary vertex coordinate sequence. The boundary data input module then passes the processed boundary polygon data to the filtering module or its upstream deployable area generation module as the original geometric input for the entire layout process.

[0121] Furthermore, the device also includes a visualization and interaction module for graphically displaying the original boundaries, deployable areas, grid points, and final camera positions, and supports manual fine-tuning by the user.

[0122] The visualization and interaction module graphically displays the original boundary polygon P, the indented deployable area P_inner, the initial grid, intermediate results of the filtering and adjustment process, and the final camera position set G_final on the display device. Simultaneously, the visualization and interaction module allows users to manually fine-tune the final camera position using mouse drag-and-drop. During the drag-and-drop process, the system verifies in real time whether the camera position remains within the deployable area and meets the safety distance requirements from other camera positions. If constraints are violated, a prompt is given or the system automatically reverts to the nearest compliant position. This module enables designers to manually intervene and optimize based on the automatically generated scheme, balancing algorithm efficiency with human experience. The examples provided are illustrative and not restrictive; the division between modules can be adjusted according to the specific hardware and software architecture, as long as the corresponding data processing and flow functions are achieved.

[0123] Example 6: This embodiment provides an electronic device, including a memory, a processor, and a computer program stored in the memory and executable on the processor. When the processor executes the computer program, it implements the wind turbine arrangement method described above.

[0124] Specifically, the electronic device can be a desktop computer, server cluster, cloud computing node, or portable workstation, or other hardware device with data processing capabilities. The memory can be used to store computer program instructions and intermediate data generated during the layout process, such as initial grid coordinates, polygon vertex sequences of the deployable area, preliminary selected point sets, and adjusted point sets. The memory can include high-speed random access memory, and can also include non-volatile memory, such as at least one disk storage device or flash memory device. The processor can be a central processing unit, a graphics processing unit, or a specific integrated circuit. By reading and executing the computer program stored in the memory, it can schedule internal logic units to sequentially complete the following steps: obtaining the initial grid and selecting the preliminary selected point set located within the deployable area; translating and adjusting the points to be adjusted in the preliminary selected point set whose distance to the boundary of the deployable area is less than a preset distance threshold along the direction away from the nearest boundary to obtain the adjusted point set; performing spacing verification on the adjusted point set to eliminate conflict points that do not meet the safety spacing requirements to obtain the final point set; and outputting the final point set. This embodiment combines a general-purpose hardware carrier with a specific computer program, enabling complex geometric calculations and logical judgments to be executed efficiently on physical hardware, thus realizing the engineering implementation and large-scale application of the layout method.

[0125] This embodiment also provides a computer-readable storage medium storing a computer program thereon, which, when executed by a processor, implements the above-described wind turbine arrangement method.

[0126] Specifically, a computer-readable storage medium can be any entity or device capable of carrying computer program code. For example, it can include, but is not limited to, electrical, magnetic, optical, electromagnetic, infrared, or semiconductor systems, devices, or any combination thereof. Specific examples may include portable computer disks, hard disks, random access memory, read-only memory, erasable programmable read-only memory, optical fibers, portable compact disk read-only memory, optical storage devices, magnetic storage devices, or any suitable combination thereof. When the computer program is read and executed by a processor, it can guide the processor to perform closed-loop processing of boundary point translation adjustment and global spacing verification to eliminate conflicts according to the set timing logic. This embodiment, through the form of a computer-readable storage medium, solidifies the layout algorithm into a distributable and deployable software product, facilitating rapid porting and installation on different computing platforms, effectively improving the dissemination efficiency and practical value of the technical solution. The device and medium embodiments described above are merely illustrative and not restrictive; those skilled in the art can flexibly configure them according to actual computing power requirements and deployment environments.

[0127] Example 7: The following example uses an irregularly shaped polygonal wind farm site in the nearshore area, combined with... Figure 4 and Figure 6 This demonstrates the complete process from generating a rotated mesh to finally outputting a compliant camera position solution.

[0128] Specifically, due to channel obstructions and geological restrictions, the offshore wind farm site presents an irregular polygonal shape. The system first acquires the vertex coordinate sequence of the original boundary polygon of the site and receives parameters such as safety distance, azimuth angle, and boundary avoidance distance input by the user through the parameter setting module. For example, the safety distance D is set to 1565 meters, the azimuth angle α to 135 degrees, and the boundary avoidance distance B to 500 meters. In another application scenario, taking an offshore site in Zhangzhou, Fujian as an example, using 18MW wind turbines (rotor diameter 260 meters), with a safety distance D of 1300 meters, a azimuth angle α of 135 degrees (corresponding to the prevailing wind direction ENE), and a boundary avoidance distance B of 500 meters, the system can also complete the calculation and generate a regularized layout scheme within seconds. Users can switch between different azimuth angle α values ​​to quickly compare the schemes. Based on the original boundary polygon and the boundary avoidance distance, the system shrinks each side of the original boundary polygon inwards by the boundary avoidance distance to generate a deployable area. This deployable area serves as the boundary constraint benchmark for subsequent grid point selection and translation adjustment, ensuring from the outset that the placement of all machine points meets the physical boundary avoidance requirements.

[0129] Subsequently, the system obtains the minimum bounding rectangle of the deployable area and establishes a rotated coordinate system aligned with the direction angle α, using the center O(Cx,Cy) of this rectangle as the origin. Specifically, for any point (x,y) in the original coordinate system, its coordinates (x',y') in the rotated coordinate system are calculated using the following coordinate transformation formula: x'=(x Cx)cosα+(y Cy)sinα,y'= (x Cx)sinα+(y Cy)cosα, where the angle α needs to be converted to radians for calculation.

[0130] In a rotating coordinate system, a uniform initial grid is generated in the row direction (x' axis) and column direction (y' axis) with a safety interval D as the step size. Let M be the number of grid points in the x' direction and N be the number in the y' direction. Then the coordinates of grid point G_ij are: G_ij(x',y')=(x'_min+i×D, y'_min+j×D), where i=0,1,…,M 1, j=0,1,…,N 1. x'_min and y'_min are the minimum values ​​of the minimum bounding rectangle in the x' and y' axes of the rotating coordinate system, respectively.

[0131] Transform all grid points back to the original geographic coordinate system using an inverse coordinate transformation to obtain the initial grid point matrix, such as... Figure 3 As shown, the system acquires an initial grid of points and filters out a preliminary set of points located within the deployable area. For points in the preliminary set of points whose distance to the boundary of the deployable area is less than a preset distance threshold, the system translates them along the direction away from the nearest boundary to obtain the adjusted point set. During the translation process, the system sets an initial movement step size and moves the corresponding points along the direction vector by the initial movement step size to obtain candidate positions. It then determines whether the candidate positions are located within the deployable area and whether the distance from the candidate positions to the boundary of the deployable area is greater than or equal to the preset distance threshold. If not, the initial movement step size is reduced and the movement and judgment steps are repeated until the conditions are met or the preset number of iterations is reached. This dynamic adjustment mechanism enables the translation adjustment process to adapt to complex and varied boundary geometries, effectively improving the space utilization near the boundary and the robustness of the algorithm while ensuring that the boundary is not crossed and the avoidance distance is met.

[0132] After completing the translation adjustment of points near the boundary, the system performs a spacing check on the adjusted point set, eliminates conflict points that do not meet the safety spacing requirements, and obtains the final machine point set.

[0133] The system calculates the spacing between point pairs in the adjusted point set. In response to conflicting point pairs with spacing less than the safe spacing, based on the expected power generation of each point in the conflicting point pair, the point with the higher expected power generation is retained, and the other point in the conflicting point pair is moved or removed. The expected power generation is determined based on wind speed estimation at the point location. The system acquires wind speed estimation data for each point location in the adjusted point set, and calculates the expected power generation at each location based on the wind speed estimation data and a predetermined wind turbine power characteristic curve. By using a selection rule based on expected power generation, the system avoids the loss of high-value turbine locations due to blindly removing points, achieving a dual optimization of space utilization and power generation efficiency.

[0134] Finally, the system outputs the final set of machine point locations, such as Figure 5 As shown, all turbine locations are arranged in a regular grid and strictly within the deployable area, with safe spacing requirements met between adjacent locations. The figure also displays key indicators of the scheme, including evaluation parameters such as the number of wind turbines, total installed capacity, and marine utilization efficiency, as well as north-pointing navigation markers and turbine location numbers, facilitating designers' intuitive understanding of the overall layout and key data of the scheme.

[0135] To verify the effectiveness of the proposed method, a complex, irregular polygonal site of approximately 50 square kilometers was selected for testing, with a manual turbine placement scheme developed by a senior design engineer serving as the benchmark. Compared to the traditional manual placement method, in the aforementioned irregular near-shore site, manual placement takes approximately two working days and struggles to accurately guarantee boundary avoidance and global spacing compliance. The manual scheme also suffers from some points being too close to the boundary, requiring adjustments. However, using the proposed placement method, automatically generating a compliant scheme takes less than 30 seconds. By changing the placement direction angle α from 0 to 165 degrees at 15-degree intervals and repeatedly executing the mesh generation and selection adjustment steps, generating 12 comparative schemes with different angles takes less than 5 minutes in total. Furthermore, due to the intelligent adjustment of points near the boundary, one more wind turbine can be placed under the same boundary and constraints compared to the manual scheme, improving site utilization by approximately 6%. Furthermore, by rapidly changing the direction angle α and comparing multiple schemes, a layout direction with lower wake loss (approximately 0.5%) than the manually selected initial scheme was found, further demonstrating the advantages of the rotating coordinate system multi-scheme generation mechanism in optimizing wake layout. This embodiment fully demonstrates the engineering value and efficiency improvement of this application under complex boundary conditions, realizing a closed-loop processing of "first utilizing boundary space, then ensuring global compliance," significantly improving design efficiency and scheme quality.

[0136] The above description is merely a specific embodiment of this application, but the scope of protection of this application is not limited thereto. Any person skilled in the art can easily conceive of variations or substitutions within the technical scope disclosed in this application, such as changes to the grid point generation rules, replacement of the boundary inward shrinkage algorithm, or adjustments to the hardware and software implementation of each functional module of the device. As long as these do not deviate from the core processing loop of this application—"first utilizing boundary space, then ensuring global compliance"—they should all be covered within the scope of protection of this application. Therefore, the scope of protection of this application should be determined by the scope of the claims.

Claims

1. A method for arranging wind turbine units, characterized in that, include: Obtain the initial grid of points and filter out the preliminary set of points located within the deployable area; For the points to be adjusted in the initial screening set whose distance from the boundary of the deployable area is less than a preset distance threshold, they are translated and adjusted along the direction away from the nearest boundary to obtain the adjusted point set; The adjusted point set is then subjected to a spacing check to eliminate conflicting points that do not meet the safety spacing requirements, resulting in the final machine point set. Output the final set of machine points.

2. The method according to claim 1, characterized in that, For the points to be adjusted in the initial screening point set whose distance from the boundary of the deployable area is less than a preset distance threshold, the points are translated and adjusted along the direction away from the nearest boundary to obtain the adjusted point set, including: Calculate the shortest distance from each point in the initial screening point set to each boundary of the deployable area; In response to the shortest distance being less than the preset distance threshold, the nearest boundary corresponding to the shortest distance is determined; Determine the direction vector away from the nearest boundary, and translate the corresponding point along the direction vector until the distance from the translated point to the boundary of the deployable area is greater than or equal to the preset distance threshold.

3. The method according to claim 1, characterized in that, The step of performing a spacing check on the adjusted point set to eliminate conflict points that do not meet the safety spacing requirements, and obtaining the final machine point set, includes: Calculate the spacing between the pairs of points in the adjusted point set; In response to the existence of a conflict point pair with a spacing smaller than the safe spacing, based on the expected power generation of each point in the conflict point pair, the point with the larger expected power generation in the conflict point pair is retained, and the other point in the conflict point pair is moved or removed.

4. The method according to claim 2, characterized in that, The translation of the corresponding point along the direction vector includes: Set the initial movement step size; The corresponding point is moved along the direction vector by the initial movement step to obtain the candidate position; Determine whether the candidate position is located inside the deployable area and whether the distance from the candidate position to the boundary of the deployable area is greater than or equal to the preset distance threshold; If the condition is not met, the initial movement step size is reduced and the movement and judgment steps are repeated until the condition is met or the preset number of iterations is reached.

5. The method according to claim 3, characterized in that, The expected power generation is determined based on wind speed estimation at the point location, including: Obtain wind speed estimation data at each point in the adjusted point set; Based on the wind speed estimation data and the predetermined wind turbine power characteristic curve, the expected power generation at each location is calculated.

6. The method according to claim 1, characterized in that, Also includes: Obtain the original boundary polygon and boundary avoidance distance; The edges of the original boundary polygon are shrunk inward by the boundary avoidance distance to generate the arrangeable area.

7. A wind turbine arrangement device, characterized in that, include: The filtering module is used to obtain the initial grid of points and filter out the preliminary set of points located within the deployable area. The adjustment module is used to translate and adjust the points to be adjusted in the direction away from the nearest boundary for the points in the initial screening point set whose distance from the boundary of the deployable area is less than a preset distance threshold, so as to obtain the adjusted point set. The verification module is used to verify the spacing of the adjusted point set, eliminate conflict points that do not meet the safety spacing requirements, and obtain the final machine point set; The output module is used to output the final location set.

8. The apparatus according to claim 7, characterized in that, It also includes a parameter setting module for receiving parameters such as safety clearance, direction angle, and boundary avoidance distance.

9. An electronic device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, characterized in that, When the processor executes the computer program, it implements the method of any one of claims 1 to 6.

10. A computer-readable storage medium having a computer program stored thereon, characterized in that, When the computer program is executed by a processor, it implements the method of any one of claims 1 to 6.

Images