Method and device for generating layout scheme of heliostat field in mountainous terrain

By optimizing the heliostat field layout using Delaunay triangulation and adaptive gravity search algorithms, the problems of terrain adaptability and shading effect in the layout of heliostat fields in mountainous terrain were solved, improving the light-gathering efficiency and energy harvesting efficiency, and reducing costs.

CN120145482BActive Publication Date: 2025-08-01NORTHWEST ENGINEERING CORPORATION LIMITED
View PDF 2 Cites 0 Cited by

Patent Information

Application Number
CN202510631029.8
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2025-05-16
Publication Date
2025-08-01
Estimated Expiration
2045-05-16

AI Technical Summary

Technical Problem

Existing technologies have problems such as insufficient terrain adaptability, imperfect control of shading effects, and insufficient optimization of system energy efficiency in the deployment of heliostat fields in mountainous terrain, making it difficult to achieve efficient solar energy collection and conversion in complex terrain.

Method used

An irregular triangular mesh model was constructed using the Delaunay triangulation method. Combined with cubic spline interpolation function and adaptive gravity search algorithm, multi-objective optimization was performed to determine the initial coordinates and height of the heliostat field and optimize the heliostat field layout scheme.

Benefits of technology

It improves the light-gathering and energy-harvesting efficiency of heliostat fields in complex mountainous environments, reduces construction and operation costs, reduces shading between heliostats, and achieves more efficient solar energy utilization.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN120145482B_ABST
    Figure CN120145482B_ABST
Patent Text Reader

Abstract

The present invention provides a method and device for generating a heliostat field layout scheme for mountainous terrain, relating to the technical field of solar thermal power generation engineering, including: using the Delaunay triangulation method to construct an irregular triangular mesh model of the initial heliostat field layout range; establishing a three-dimensional terrain surface model according to the irregular triangular mesh model; implementing a regularized grid layout on the three-dimensional terrain surface model; using a cubic spline interpolation function to perform interpolation analysis on each grid in the regularized grid layout to determine the initial coordinates and height of the heliostat field; using the projected area constraint condition and the adaptive gravitational search algorithm to perform multi-objective optimization on the initial coordinates and height to obtain the final heliostat field layout scheme. The present invention can effectively solve the technical defects such as insufficient terrain adaptability, imperfect control of the shading effect, and insufficient optimization of the system energy efficiency existing in the prior art solutions during the implementation process.
Need to check novelty before this filing date? Find Prior Art

Description

Background Art

[0002] In recent years, with the rapid development of renewable energy development and utilization technologies, Concentrated Solar Power (CSP) technology has been widely promoted and applied globally. In conventional technical solutions, the heliostat field is usually located in flat terrain areas with a slope of no more than 5% to achieve a regular layout of the mirror field. However, in practical engineering applications, there are a large number of mountainous terrain areas with slopes between 5% and 20%. The development and utilization of such terrain face significant technical challenges.

[0003] In existing technical solutions, there are mainly two types of methods for arranging heliostat fields in mountainous terrain: The first type of method directly applies flat terrain mirror field layout algorithms (such as the Campo algorithm, genetic algorithm, etc.) to the mountainous environment, and adjusts the horizontal inclination angle of the heliostat pedestal to maintain the installation angle of the mirror surface relative to the horizontal plane. Although this method inherits the mature technical framework of existing algorithms, it has the defect of insufficient terrain adaptability, specifically manifested as: (a) it cannot effectively compensate for the deviation of the mirror surface normal vector caused by terrain slope changes; (b) it causes an increase in the mirror surface occlusion effect; (c) the overall light field heat collection efficiency decreases. The second type of method adopts a terrain zoning processing strategy, dividing the mirror field area into several sub-areas for independent layout and local optimization. Although this scheme improves the local terrain adaptability, it has the following technical limitations: (i) mutual occlusion of mirror surfaces is likely to occur in the transition area between sub-areas; (ii) it is difficult to achieve the optimization of the global optical efficiency; (iii) the improvement effect of the system-level energy efficiency is limited.

[0004] Obviously, existing technical solutions all have technical defects such as insufficient terrain adaptability, imperfect control of the occlusion effect, and insufficient optimization of system energy efficiency during implementation, and there is an urgent need to develop a new method for arranging heliostat fields in mountainous terrain to solve these problems. Summary of the Invention

[0005] To overcome the problems existing in the related technologies, the present invention provides a method and device for generating a layout scheme of a heliostat field in mountainous terrain.

[0006] According to the first aspect of the embodiments of the present invention, there is provided a method for generating a layout scheme of a heliostat field in mountainous terrain, the method including:

[0007] Using the Delaunay triangulation method to construct an irregular triangular network model of the initial layout range of the heliostat field;

[0008] Establishing a three-dimensional terrain surface model according to the irregular triangular network model;

[0009] Implementing a regular grid layout on the three-dimensional terrain surface model;

[0010] Use a cubic spline interpolation function to perform interpolation analysis on each grid in the regularized grid layout, and determine the initial coordinates and height of the heliostat field;

[0011] Use the projected area constraint condition and the adaptive gravitational search algorithm to perform multi-objective optimization on the initial coordinates and height, and obtain the final heliostat field layout scheme.

[0012] In some exemplary embodiments of the present invention, based on the foregoing scheme, using a cubic spline interpolation function to perform interpolation analysis on each grid in the regularized grid layout, and determining the initial coordinates and height of the heliostat field includes:

[0013] Use a cubic spline interpolation function to calculate the interpolation value of each grid;

[0014] Based on the interpolation values of each grid, estimate the initial coordinates and height of the heliostat field corresponding to each grid within the boundary conditions.

[0015] In some exemplary embodiments of the present invention, based on the foregoing scheme, the boundary conditions include:

[0016] The value of the cubic spline interpolation function defined on the interval at is equal to the value of the cubic spline interpolation function defined on the interval at ;

[0017] The first derivative value of the cubic spline interpolation function defined on the interval at is equal to the first derivative value of the cubic spline interpolation function defined on the interval at ; and

[0018] The second derivative value of the cubic spline interpolation function defined on the interval at is equal to the second derivative value of the cubic spline interpolation function defined on the interval at , where represents the coordinate value of a vertex of the th grid, represents the coordinate value of the th grid, represents the coordinate value of the th grid.

[0019] In some exemplary embodiments of the present invention, based on the foregoing scheme, using the projected area constraint condition and the adaptive gravitational search algorithm to perform multi-objective optimization on the initial coordinates and height, and obtaining the final heliostat field layout scheme includes:

[0020] Select the solar parameters at typical moments as reference data, and calculate the projected area of each heliostat field based on the initial coordinates and height;

[0021] Taking the largest covered projected area, the least projection overlap, and unobstructed mechanical movement of the heliostats as the goals, use the adaptive gravitational search algorithm to perform multi-objective optimization on the initial coordinates and height to obtain the final heliostat field layout plan.

[0022] In some exemplary embodiments of the present invention, based on the foregoing solution, selecting the solar parameters at typical moments as reference data and calculating the projected area of each heliostat field based on the initial coordinates includes:

[0023] Calculate the vertical height where the center of the current heliostat field is located according to the initial coordinates and height;

[0024] Based on the vertical height where the center of the heliostat field is located, calculate the distance between the center of the current heliostat field and the receiver;

[0025] Based on the distance and the actual area of the current heliostat field, calculate the projected area of the current heliostat field.

[0026] In some exemplary embodiments of the present invention, based on the foregoing solution, taking the largest covered projected area, the least projection overlap, and unobstructed mechanical movement of the heliostats as the goals, using the adaptive gravitational search algorithm to perform multi-objective optimization on the initial coordinates and height to obtain the final heliostat field layout plan includes:

[0027] Set the number of heliostats in the initial mirror field, encode the initial mirror field, and generate a matrix with N rows and R columns, where N is the number of mirror field layout plans and R is the number of rows of heliostats;

[0028] Use a multi-objective fitness function including projected area coverage, projection overlap rate, and mechanical movement constraints to evaluate N mirror field layout plans;

[0029] Calculate the gravitational force according to the Euclidean distance between particles, calculate the acceleration by combining random parameters and an adaptive gravitational constant, and iteratively optimize the layout plan through the velocity-position update formula;

[0030] Continuously update the global optimal solution until the preset convergence accuracy is satisfied, and output the heliostat coordinate matrix corresponding to the highest fitness value.

[0031] In some exemplary embodiments of the present invention, based on the foregoing solution, the number of heliostats in the initial mirror field is greater than or equal to 1.1 times the number of heliostats in the expected heliostat field.

[0032] According to the second aspect of the embodiments of the present invention, there is provided a device for generating a layout plan of a heliostat field in a mountainous terrain, including:

[0033] The first model construction module is used to construct an irregular triangular network model of the initial heliostat field layout range by using the Delaunay triangulation method;

[0034] The second model construction module is used to establish a three-dimensional terrain surface model according to the irregular triangular network model;

[0035] The grid layout module is used to implement regular grid layout on the three-dimensional terrain surface model;

[0036] The interpolation analysis module is used to perform interpolation analysis on each grid in the regular grid layout by using a cubic spline interpolation function to determine the initial coordinates and height of the heliostat field;

[0037] The scheme generation module is used to perform multi-objective optimization on the initial coordinates and height by using the projected area constraint condition and the adaptive gravitational search algorithm to obtain the final heliostat field layout scheme.

[0038] According to the third aspect of the embodiments of the present invention, an electronic device is provided, including: a processor; and a memory, where computer-readable instructions are stored on the memory, and when the computer-readable instructions are executed by the processor, the method in the first aspect is implemented.

[0039] According to the fourth aspect of the embodiments of the present invention, a computer-readable storage medium is provided, on which a computer program is stored, and when the computer program is executed by a processor, the method in the first aspect is implemented.

[0040] The technical solutions provided by the embodiments of the present invention may include the following beneficial effects:

[0041] In the embodiments of the present invention, the irregular triangular network (Triangulated Irregular Network, TIN) model constructed by Delaunay triangulation can effectively capture the elevation mutation characteristics of mountain terrain (slope change ≥ 25°) and accurately fit the complex and changeable terrain of the mountain.

[0042] Implementing regular grid layout on the three-dimensional terrain surface model and using a cubic spline interpolation function to analyze and determine the initial coordinates and height can reduce the irregularity of the layout. Compared with random or empirical layout, it can make more efficient use of the mountain space, reduce the mutual occlusion between heliostats, and improve the overall daylighting efficiency.

[0043] Multi-objective optimization is carried out using the projected area constraint condition and the adaptive gravitational search algorithm. While considering terrain factors, it can comprehensively balance multiple key performance indicators such as the daylighting area and energy collection efficiency of heliostats, enabling the final layout plan of the heliostat field to achieve the best performance in a complex mountain environment, improving the collection and conversion efficiency of solar energy, and reducing construction and operation costs.

[0044] It should be understood that the above general description and the following detailed description are only exemplary and explanatory, and do not limit the present invention. BRIEF DESCRIPTION OF THE DRAWINGS

[0045] The accompanying drawings herein are incorporated into the specification and constitute a part of the present invention, showing embodiments consistent with the present invention, and are used together with the specification to explain the principles of the present invention.

[0046] Figure 1 A schematic diagram of the system architecture showing an exemplary application environment of a method and apparatus to which embodiments of the present invention can be applied;

[0047] Figure 2 A schematic flowchart of a method according to some embodiments of the present invention is schematically shown;

[0048] Figure 3 A schematic diagram of an apparatus according to some embodiments of the present invention is schematically shown;

[0049] Figure 4 A schematic diagram of the structure of a computer system of an electronic device according to some embodiments of the present invention is schematically shown;

[0050] Figure 5 A schematic diagram of a computer-readable storage medium according to some embodiments of the present invention is schematically shown. DETAILED DESCRIPTION OF THE EMBODIMENTS

[0051] Exemplary embodiments will be described in detail herein, and examples thereof are shown in the accompanying drawings. When the following description refers to the accompanying drawings, unless otherwise indicated, the same numbers in different drawings represent the same or similar elements. The embodiments described in the following exemplary embodiments do not represent all embodiments consistent with the present invention. On the contrary, they are merely examples of devices and methods consistent with some aspects of the present invention as detailed in the appended claims.

[0052] The terms used in the present invention are for the purpose of describing specific embodiments only and are not intended to limit the present invention. The singular forms "a", "the", and "said" used in the present invention and the appended claims are also intended to include the plural forms unless the context clearly indicates otherwise. It should also be understood that the term "and / or" as used herein refers to and includes any or all possible combinations of one or more of the associated listed items.

[0053] It should be understood that although the terms first, second, third, etc. may be used in the present invention to describe various information, such information should not be limited to these terms. These terms are only used to distinguish information of the same type from each other. For example, without departing from the scope of the present invention, the first information may also be referred to as the second information, and similarly, the second information may also be referred to as the first information. Depending on the context, the word "if" as used herein may be interpreted as "when" or "while" or "in response to determining".

[0054] Figure 1 The figure shows a schematic diagram of the system architecture of an exemplary application environment of a method and apparatus for generating a heliostat field layout scheme for a mountainous terrain to which embodiments of the present invention can be applied.

[0055] As Figure 1 shown, the system architecture 100 may include one or more of terminal devices such as a desktop computer 101, a portable computer 102, a smart phone 103, etc., a network 104, and a server 105. The network 104 is used to provide a medium for a communication link between the terminal device and the server 105. The network 104 may include various connection types, such as wired, wireless communication links, or fiber optic cables, etc. The terminal device may be various electronic devices with data processing functions, and a display screen is provided on the electronic device, and the display screen is used to display the generation result of the heliostat field layout scheme for the mountainous terrain to the user, including but not limited to the above-mentioned desktop computer, portable computer, smart phone, etc. It should be understood that Figure 1 the numbers of the terminal devices, the network, and the server in

[0056] are merely illustrative. According to the implementation requirements, there may be any number of terminal devices, networks, and servers. For example, the server 105 may be a sub-server cluster composed of multiple sub-servers, etc.

[0057] In addition, it should be understood that the method for generating the heliostat field layout scheme for mountainous terrain according to the embodiments of the present invention can be configured as a software module. In some implementation scenarios, the method for generating the heliostat field layout scheme for mountainous terrain of the present invention can be deployed independently to adapt to the heliostat field layouts for different mountainous terrains. In other implementation scenarios, the method for generating the heliostat field layout scheme for mountainous terrain of the present invention can be deployed within other software as a functional module of the software. For example, when deployed in the analysis software for mountainous terrain, the application manner of the method for generating the heliostat field layout scheme for mountainous terrain of the present invention is not particularly limited.

[0058] Next, the embodiments of the present invention will be described in detail.

[0059] The heliostat field is a core component of a Concentrated Solar Power (CSP) system, specifically referring to an array system composed of several planar mirrors with a two-axis rotation mechanism. Each mirror body reflects solar radiation to a collector at a fixed position (usually a central receiver tower) through real-time angle adjustment. Its core function is to achieve the spatial directional transmission and energy convergence of solar radiant energy.

[0060] As Figure 2 shown, Figure 2 is a flowchart of a method for generating a heliostat field layout scheme for mountainous terrain according to an exemplary embodiment of the present invention, including the following steps:

[0061] S210: Use the Delaunay triangulation method to construct an irregular triangular mesh model of the initial heliostat field layout range;

[0062] S220: Establish a three-dimensional terrain surface model based on the irregular triangular mesh model;

[0063] S230: Implement a regular grid layout on the three-dimensional terrain surface model;

[0064] S240: Use a cubic spline interpolation function to perform interpolation analysis on each grid in the regular grid layout to determine the initial coordinates and height of the heliostat field;

[0065] S250: Use the projection area constraint condition and the adaptive gravitational search algorithm to perform multi-objective optimization on the initial coordinates and height to obtain the final heliostat field layout scheme.

[0066] In S210, the Delaunay triangulation method is used to construct an irregular triangular mesh model of the initial heliostat field layout range.

[0067] The Delaunay Triangulation method is an algorithm that constructs a triangular network from a discrete point set. Its characteristic is that there are no other points inside the circumcircle of any triangle.

[0068] The determination of the initial heliostat field layout range can be considered comprehensively from multiple factors such as terrain factors, lighting conditions, surrounding environment, and construction costs.

[0069] Terrain factors generally need to consider the overall shape, slope, aspect, and terrain undulation of the mountain. For example, areas with overly steep slopes (generally considered that slopes exceeding a certain angle, such as 30°, are not conducive to the installation and maintenance of heliostats), geologically unstable areas such as landslides, and areas at the bottom of valleys where water is likely to accumulate and there is serious occlusion should be avoided. Areas with relatively gentle, open, and well-lit terrain, such as gentle slopes facing south, are preferred to ensure that the heliostats receive sufficient sunlight to the greatest extent.

[0070] Illumination condition factors generally analyze local solar radiation data, sunshine duration and other lighting information over the years to clarify the sun's movement trajectory and lighting intensity distribution. The layout range should cover areas with long annual sunshine hours and high solar radiation intensity as much as possible to improve the solar energy collection efficiency of the heliostats.

[0071] Surrounding environment factors consider the relationship between the heliostat field and surrounding infrastructure and obstacles. Areas far from large buildings, trees and other objects that may cause occlusion should be selected. At the same time, it should be convenient to connect to infrastructure such as power transmission lines and roads to reduce construction and operation costs. For example, being close to existing substations or power transmission lines can reduce the cost of laying power transmission lines; being close to traffic roads is convenient for equipment transportation and later maintenance.

[0072] Construction cost factors generally include land acquisition or lease costs, site leveling costs, etc. On the premise of meeting lighting and terrain requirements, areas with lower land costs and less site leveling work are preferred to control the overall investment cost of the project.

[0073] When constructing a Triangulated Irregular Network (TIN) model, discrete points within the heliostat field layout range (these points may be obtained based on topographic surveys, such as topographic feature points, control points, etc., and feature points can be mountaintops, valleys, saddles, etc.) are connected into triangles according to the rules of Delaunay triangulation, thus forming an irregular triangular network that can reflect the original characteristics of the site.

[0074] In the case of a complex and irregular mountain terrain scene, due to its undulating terrain and diverse slopes, it is difficult to accurately describe the terrain features using traditional regular grid division methods. The TIN model constructed by the Delaunay triangulation method can well adapt to the complexity of mountain terrain because it is based on the actual discrete points of the site for connection, can retain more terrain information, integrates details such as the undulations and terrain changes of the mountain into the triangular mesh, provides basic data support for subsequent steps such as establishing a three-dimensional terrain surface model, and reduces the problem of unreasonable heliostat layout caused by inaccurate terrain modeling.

[0075] In S220, a three-dimensional terrain surface model is established according to the irregular triangular mesh model.

[0076] In some embodiments, the contour lines of the irregular triangular mesh model can be extracted, and a three-dimensional terrain curve model can be established using the contour lines.

[0077] For example, for each triangle in the TIN model, according to the coordinates and elevation values of its three vertices, a plane equation can be defined to represent the plane where the triangle is located. In three-dimensional space, the plane equation can generally be expressed in the form of By solving the coefficients of the equation through the triangle vertex coordinates , , , . Combining the plane equations of all triangles can construct a three-dimensional terrain surface model of the entire mirror field area. Each triangle, as a component part of the surface, jointly constitutes a continuous surface approximating the actual terrain.

[0078] The contour lines of the irregular triangular mesh model can be extracted using contour line tracing algorithms, data interpolation and fitting methods, etc.

[0079] When extracting the contour lines of the irregular triangular mesh model using the contour line tracing algorithm, a starting triangle can be randomly selected from the TIN model. According to the given contour line elevation value, judge the intersection situation of the three sides of the triangle with the contour line. If the elevations of the two endpoints of a side are on both sides of the contour line elevation, then this side intersects with the contour line, and the coordinates of the intersection point are calculated by linear interpolation. Then continue to trace along the triangle adjacent to this triangle and likely to intersect with the contour line, repeating the above process until a complete contour line is formed or the tracing termination condition is reached. By continuously repeating this process, contour lines at different elevations can be extracted, thus obtaining the contour map of the mirror field.

[0080] When using data interpolation and fitting methods to extract contour lines from an irregular triangular mesh model, the elevation of any point inside a triangle can also be calculated through interpolation. Based on the dense elevation point data obtained from these interpolations, a fitting algorithm, such as spline curve fitting, etc., is used to connect the points with the same elevation to form smooth contour lines. This method can improve the accuracy and smoothness of the contour lines to a certain extent and better reflect the detailed features of the mirror site terrain.

[0081] In S230, a regular grid layout is implemented on the three-dimensional terrain surface model.

[0082] A regular grid refers to a grid structure that is evenly arranged in a two-dimensional or three-dimensional space at fixed row spacings, column spacings (or layer spacings), such as a rectangular grid (cornfield type) or a hexagonal grid.

[0083] In some embodiments, to implement a regular grid layout on the three-dimensional terrain surface model, tools such as GIS software (ArcGIS), 3D modeling tools (Blender), or mathematical methods (differential geometric parameterization) can be used to map the three-dimensional terrain surface model to a two-dimensional parameter space (such as UV unwrapping) to facilitate the generation of regular grids. Then, regular grids are generated in the parameter space using methods such as surface subdivision (Subdivision) and projection interpolation (such as radial basis functions), and the grids are projected back onto the three-dimensional terrain surface model through inverse mapping.

[0084] In other embodiments, to implement a regular grid layout on the three-dimensional terrain surface model, the grid parameters can be determined first according to the three-dimensional terrain surface model; then, based on the grid parameters, regularly arranged grid nodes are generated in three-dimensional space; and then the grid nodes are connected.

[0085] Here, the grid parameters include grid resolution, grid range, and grid type. The grid resolution can be determined according to the accuracy requirements of the three-dimensional terrain surface model and actual application needs. For example, when performing a detailed mirror field analysis, a smaller grid spacing (such as 1 m × 1 m) may be required to accurately capture terrain changes; while when performing a macroscopic terrain display, a larger grid spacing (such as 10 m × 10 m) can be selected. The grid range is used to clarify the coverage range of the regular grid on the three-dimensional terrain surface model, and usually should cover the entire area to be analyzed. The starting and ending positions of the grid can be determined according to the boundary coordinates of the model. Common regular grid types include square grids and rectangular grids, etc. Generally, a suitable grid type is selected according to the actual situation and the convenience of subsequent processing. The square grid has the same resolution in all directions, and the calculation and analysis are relatively simple.

[0086] According to the grid parameters, grid nodes are generated in a regular arrangement in three-dimensional space. Here, taking a square grid as an example, on the horizontal plane, starting from the starting point, at the set grid spacing, nodes are successively generated in the directions of the axis and axis to form a two-dimensional grid node array.

[0087] Finally, adjacent grid nodes are connected in a certain order to form a regular grid.

[0088] The regularized grid has a unified structure and a fixed spacing, making the organization and storage of data simpler and more regular. When performing data processing, the computer can quickly access and process the data of each grid point according to a fixed pattern, greatly improving the efficiency of data processing, reducing the calculation time and resource consumption. And due to the regularity of the grid, some efficient data compression algorithms can be used to compress and store the grid data. For example, for elevation data, only the relative elevation change values of each grid point need to be stored, rather than the absolute coordinates and elevations of each point, thus saving a large amount of storage space and facilitating data transmission and management.

[0089] In addition, by reasonably setting the grid spacing and choosing the interpolation method, the error propagation in the analysis process can be effectively controlled to ensure the accuracy and reliability of the analysis results. For example, in a complex terrain mirror field area, the analysis accuracy can be improved and the error can be reduced by reducing the grid spacing.

[0090] In S240, a cubic spline interpolation function is used to perform interpolation analysis on each grid in the regularized grid layout to determine the initial coordinates and height of the heliostat field.

[0091] In some embodiments, for each heliostat in the heliostat field, its initial coordinates are determined according to its position in the regularized grid. Assuming that a heliostat is located within a certain grid, its coordinates can be determined by the node coordinates of the grid and the relative position of the heliostat within the grid. For example, if the heliostat is located at the center of the grid, its coordinates can be taken as the average of the coordinates of the four vertices of the grid.

[0092] Then, the constructed cubic spline interpolation function is used to calculate the elevation value at the heliostat position, that is, the height of the heliostat. Substituting the coordinates of the heliostat into the corresponding cubic spline interpolation function, the obtained value is the height of this point.

[0093] In some other embodiments, using a cubic spline interpolation function to perform interpolation analysis on each grid in the regularized grid layout to determine the initial coordinates and height of the heliostat field includes:

[0094] Using a cubic spline interpolation function to calculate the interpolation value of each grid;

[0095] Estimate the initial coordinates and height of the heliostat field corresponding to each grid within the boundary conditions based on the interpolation values of each grid.

[0096] This process can be specifically expressed as:

[0097]

[0098] is a series of functions , ,..., The set, where each function corresponds to the interpolation value of each grid in the regular grid layout of the TIN model. is the independent variable, representing the interval coordinates of the interpolation. For each small interval , a cubic spline interpolation function is defined. It is required that this function is three - times differentiable, that is . Here, means that this function has a continuous third - order derivative on the interval .

[0099] The boundary conditions include:

[0100]

[0101] Among them, represents at , represents the cubic spline interpolation function defined on the interval , represents the coordinate value of a vertex of the th grid, represents at , represents the cubic spline interpolation function defined on the interval , and respectively represent 's first - order derivative and second - order derivative, and respectively represent 's first - order derivative and second - order derivative.

[0102] That is to say:

[0103] The value of the cubic spline interpolation function defined on the interval at is equal to the value of the cubic spline interpolation function defined on the interval at ;

[0104] The cubic spline interpolation function defined on the interval has the same first derivative value at as the cubic spline interpolation function defined on the interval at ; and

[0105] The cubic spline interpolation function defined on the interval has the same second derivative value at as the cubic spline interpolation function defined on the interval at , where represents the coordinate value of a vertex of the th grid, represents the coordinate value of the th grid, represents the coordinate value of the th grid.

[0106] In S250, the initial coordinates and height are multi-objectively optimized using the projected area constraint condition and the Adaptive Gravitational Search Algorithm (AGSA) to obtain the final layout plan of the heliostat field.

[0107] The projected area constraint condition refers to setting certain restrictions on the projected area of the heliostat field in a specific direction (such as the horizontal direction or a direction related to the sun's rays). This constraint condition may be based on various practical requirements, such as land use restrictions and avoiding excessive occlusion between heliostats. By restricting the projected area, the layout of the heliostats can be reasonably planned to ensure the efficient operation of the mirror field within a limited space while reducing unnecessary land occupation. As an important constraint condition, it can exclude those layout plans that do not meet the projected area requirements during the optimization process, narrow the range of feasible solutions, and guide the algorithm to search for the optimal solution in the direction that meets the actual site and usage requirements.

[0108] The Adaptive Gravitational Search Algorithm (AGSA), like the basic Gravitational Search Algorithm, has its core idea originating from Newton's law of universal gravitation and laws of motion. In the algorithm, each solution in the search space is simulated as a particle with mass, and there is a gravitational force between the particles. The particle with a larger mass has a greater gravitational force on other particles and will attract other particles to approach it, thereby guiding the search process towards a better solution.

[0109] Advantages of AGSA in the optimization of the heliostat field:

[0110] In the optimization of heliostat field layout, the combination of the coordinates and heights of heliostats forms a complex search space. The adaptive characteristics of AGSA enable it to better handle such complex situations. It can automatically adjust the search strategy at different search stages, being able to quickly search in a large range for areas where optimal solutions may exist and also conduct detailed searches locally to find more accurate combinations of heliostat coordinates and heights. Compared with traditional fixed-parameter algorithms, it can more effectively explore better layout schemes.

[0111] By adaptively adjusting parameters, AGSA can more quickly identify "high-quality regions" in the search space and guide particles to gather in these regions, thus accelerating the convergence speed of the algorithm. In the optimization of heliostat field layout, this means that a better solution that meets the requirements of multi-objective optimization can be found in a shorter time, saving computational resources and time costs and improving design efficiency.

[0112] Since it can dynamically adjust the search strategy according to the search situation, AGSA is not easily trapped in local optimal solutions. That is to say, in the layout of heliostat fields, there may be multiple locally better layout schemes, but only one or a few of them are globally optimal. AGSA can adaptively adjust the movement and search range of particles, having a greater chance of jumping out of the local optimal trap and finding the true global optimal or near-global optimal heliostat field layout scheme, thereby improving the overall performance and benefits of the mirror field.

[0113] When working in coordination with the projection area constraint condition, AGSA will continuously check whether the heliostat field layout scheme represented by the particles meets the projection area requirements during the search process. For schemes that do not meet the constraints, an adaptive adjustment mechanism will be used to guide the particles to move in the direction that meets the constraints, ensuring that the final obtained scheme meets the actual requirements in terms of projection area.

[0114] In the framework of multi-objective optimization, AGSA will adaptively adjust the search direction and intensity of particles according to the importance of each objective and the current optimization situation to balance the relationship between different objectives. For example, when there is a conflict between the two objectives of light energy collection efficiency and cost, AGSA will find a balance point that can optimize both as much as possible during the search process according to the preset weights or dynamically changing priorities, and finally obtain a heliostat field layout scheme with the optimal comprehensive performance, meeting the various requirements for heliostat fields in actual engineering.

[0115] In some embodiments, this process may include:

[0116] Selecting solar parameters at typical moments as reference data and calculating the projection area of each heliostat field based on the initial coordinates and heights;

[0117] Taking the maximum covered area by the projected area, the least projection overlap, and unobstructed mechanical movement of the heliostats as the goals, the adaptive gravitational search algorithm is used to perform multi-objective optimization on the initial coordinates and height to obtain the final layout plan of the heliostat field.

[0118] The selection of typical moments usually needs to consider the representativeness of parameters such as the solar altitude angle and azimuth angle and their importance to the operation of the heliostat field. For example, at noon on the winter solstice and summer solstice, the solar altitude angles reach the minimum and relatively large values of the year respectively, which are crucial for evaluating the performance of the heliostat field under extreme seasonal conditions; at sunrise and sunset on the vernal equinox and autumnal equinox, the solar azimuth angle changes greatly, which can be used to analyze the situation of the heliostat field under different lighting directions. In addition, the moment with the strongest local solar radiation intensity may also be selected as a typical moment.

[0119] Solar parameters mainly include the solar altitude angle , the solar azimuth angle , etc. These parameters can be calculated through astronomical formulas or obtained from professional meteorological databases and solar energy resource assessment software. For example, the solar altitude angle and azimuth angle can be calculated according to the date, time, geographical location (longitude, latitude ) and other by astronomical algorithms:

[0120]

[0121]

[0122] Among them, is the solar declination, is the hour angle.

[0123] Calculating the projected area of each heliostat field based on the initial coordinates and height includes:

[0124] According to the initial coordinates and height, calculate the vertical height where the center of the current heliostat field is located ;

[0125]

[0126] Based on the vertical height where the center of the heliostat field is located , calculate the distance from the center of the current heliostat field to the receiver ;

[0127]

[0128] Based on the distance , the actual area of the current heliostat field , calculate the projected area of the current heliostat field .

[0129]

[0130]

[0131] Among them, is the vertical height where the heliostat center is located, is the circumferential radial spacing, is the slope angle, is the distance from the heliostat center to the ground, is the distance from the heliostat center to the receiver, is the height where the receiver is located, is the projected area of the heliostat, is the actual area of the heliostat.

[0132] The main function of the heliostat field is to collect solar energy. A larger coverage of the projected area means that more light can be reflected and focused onto the receiver, thereby improving the efficiency of solar energy collection. This goal is directly related to the energy output of the mirror field. During the optimization process, it is necessary to try to arrange the heliostats so that a larger effective illumination area can be formed at the receiver.

[0133] Projection overlap will cause the light reflected by some heliostats to be blocked by other heliostats, resulting in a waste of light energy. Reducing projection overlap can improve the utilization efficiency of the heliostats, enabling the light reflected by each heliostat to effectively reach the receiver and avoiding unnecessary energy losses.

[0134] The heliostats need to perform mechanical movements during the process of tracking the sun. If the spacing between the heliostats is too small or the arrangement is unreasonable, it may cause collisions or obstructions during the movement process. Ensuring unobstructed mechanical movement of the heliostats is a basic condition for ensuring the normal operation of the mirror field. When optimizing the layout plan, it is necessary to consider the movement range and spatial requirements of the heliostats.

[0135] Therefore, aiming at the maximum coverage of the projected area, the least projection overlap, and unobstructed mechanical movement of the heliostats, using the adaptive gravitational search algorithm, multi-objective optimization is performed on the initial coordinates and heights, and the final heliostat field layout plan obtained includes:

[0136] Set the number of heliostats in the initial mirror field, encode the initial mirror field, and generate a matrix with N rows and R columns, where N is the number of mirror field layout plans and R is the number of rows of heliostats;

[0137] Adopt a multi-objective fitness function including the coverage degree of the projected area, the projection overlap rate, and mechanical movement constraints to evaluate N mirror field layout plans;

[0138] Calculate the gravitational force according to the Euclidean distance between particles, calculate the acceleration by combining random parameters and an adaptive gravitational constant, and iteratively optimize the layout scheme through the velocity-position update formula;

[0139] Continuously update the global optimal solution until the preset convergence accuracy is met, and output the heliostat coordinate matrix corresponding to the highest fitness value.

[0140] When setting the number of heliostats in the initial mirror field, the present invention sets the number of heliostats in the initial mirror field to be greater than or equal to 1.1 times the expected number of heliostats in the mirror field, so as to reserve sufficient layout space for the final layout scheme. Set the adjacent row spacing to be 1 to 2 times the minimum increment to increase population diversity.

[0141] When evaluating N mirror field layout schemes, mark the highest and lowest fitness values to determine the current optimal layout scheme. The fitness function of the present invention is:

[0142]

[0143]

[0144] Among them, represents at time the relative fitness of the th particle, at time the fitness value of the th particle (corresponding to a heliostat field layout scheme), which reflects the quality of this layout scheme for multi-objective optimization problems (such as the largest projected area coverage and the least projection overlap, etc.); represents the worst value among the fitness values of all particles in the particle swarm at time at time which is used as the reference lower limit for calculating the relative fitness; represents at time the calculated value related to the mass of the th particle; at time the relative fitness of the[[ID=5M]] th particle, respectively represent the th particle and the th particle,

[0145] Here, it is also necessary to perform a boundary check on the population to ensure that all particles are within the search space, avoid overlap between heliostats, and maintain the integrity of the population. Calculate the inertial mass of each particle and adaptively adjust the gravitational constant .

[0146]

[0147] denotes the gravitational constant at time denotes the initial gravitational constant, denotes the exponential function with base is a coefficient that controls the rate of change of the gravitational constant and is a constant; denotes time denotes the time period.

[0148] Calculate the gravitational force based on the Euclidean distance between particles, calculate the acceleration by combining the random parameter and the adaptive gravitational constant, and iteratively optimize the layout scheme through the velocity-position update formula, including:

[0149]

[0150] denotes the gravitational force exerted by particle on particle at time and respectively denote time the th particle and the mass-related calculated values of the denotes the Euclidean distance between particle and particle at time is a very small positive number used to ensure that the denominator is not zero and avoid calculation errors; are respectively the position vectors of particle and particle at time

[0151] The acceleration calculation formula is:

[0152]

[0153] denotes the acceleration of particle at time Represents a random number between 0 and 1. Introducing randomness can increase the diversity of the algorithm search and avoid falling into local optima.

[0154] Velocity - position update formula:

[0155]

[0156]

[0157] Represents The velocity of the -th particle at time Represents The velocity of the -th particle at time Represents The acceleration of the -th particle at time Represents The position of the -th particle at time Represents The position of the -th particle at time Represents The velocity of the -th particle at time

[0158] Based on the initial mirror field of the three - dimensional mirror field terrain model, the present invention combines the AGSA algorithm to make the projection coverage area of the heliostats as large as possible in the field area while satisfying the boundary conditions for the normal operation of the mirror field, with as little projection overlap area as possible, and ensuring unobstructed mechanical movement of the heliostats. Through parameter adjustment, a better arrangement effect can be obtained within a determined area, and finally an optimal mirror field layout scheme can be achieved.

[0159] [[ID=z3]]According to the second aspect of the embodiments of the present invention, there is also provided a generating device for the heliostat field layout scheme of mountainous terrain. Referring to Figure 3 as shown, the generating device for the heliostat field layout scheme of mountainous terrain includes:

[0160] A first model construction module 310, configured to construct an irregular triangular mesh model of the initial heliostat field layout range by using the Delaunay triangulation method;

[0161] A second model construction module 320, configured to establish a three - dimensional terrain surface model according to the irregular triangular mesh model;

[0162] A grid layout module 330, configured to implement regular grid layout on the three - dimensional terrain surface model;

[0163] The interpolation analysis module 340 is configured to perform interpolation analysis on each grid in the regularized grid layout by using a cubic spline interpolation function to determine the initial coordinates and height of the heliostat field.

[0164] The scheme generation module 350 is configured to perform multi-objective optimization on the initial coordinates and height by using the projected area constraint condition and the adaptive gravitational search algorithm to obtain the final heliostat field layout scheme.

[0165] It should be noted that although several modules and sub-modules of the apparatus for generating the heliostat field layout scheme for mountainous terrain are mentioned in the above detailed description, this division is not mandatory. In fact, according to the embodiments of the present invention, the features and functions of two or more of the above-described modules or sub-modules can be embodied in one module or unit. Conversely, the features and functions of one module or sub-module described above can be further divided and embodied by a plurality of modules or sub-modules.

[0166] In addition, in an exemplary embodiment of the present invention, there is also provided an electronic device capable of implementing the method for generating the heliostat field layout scheme for mountainous terrain.

[0167] Those skilled in the art can understand that various aspects of the present invention can be implemented as a system, a method or a program product. Therefore, various aspects of the present invention can be specifically implemented in the following forms, namely: a complete hardware embodiment, a complete software embodiment (including firmware, microcode, etc.), or an embodiment combining hardware and software aspects, which can be collectively referred to as "circuit", "module" or "system" here.

[0168] Next, reference is made to Figure 4 to describe the electronic device 400 according to this embodiment of the present invention. Figure 4 The illustrated electronic device 400 is only an example and should not impose any limitation on the functions and usage scope of the embodiments of the present invention.

[0169] As Figure 4 shown, the electronic device 400 is presented in the form of a general-purpose computing device. The components of the electronic device 400 may include, but are not limited to: at least one of the above-mentioned processing units 410, at least one of the above-mentioned storage units 420, a bus 430 connecting different system components (including the storage unit 420 and the processing unit 410), and a display unit 440.

[0170] Among them, the storage unit stores program codes, and the program codes can be executed by the processing unit 410, so that the processing unit 410 executes the steps according to various exemplary embodiments of the present invention described in the above "Exemplary Method" section of the present invention. For example, the processing unit 410 can execute as Figure 2S210 shown in : Using the Delaunay triangulation method, construct an irregular triangular mesh model of the initial heliostat field layout range; S220: Establish a three-dimensional terrain surface model based on the irregular triangular mesh model; S230: Implement a regular grid layout on the three-dimensional terrain surface model; S240: Use a cubic spline interpolation function to perform interpolation analysis on each grid in the regular grid layout to determine the initial coordinates and height of the heliostat field; S250: Use the projection area constraint condition and the adaptive gravitational search algorithm to perform multi-objective optimization on the initial coordinates and height to obtain the final heliostat field layout plan.

[0171] The storage unit 420 may include a readable medium in the form of a volatile storage unit, such as a random access storage unit (RAM) 421 and / or a cache storage unit 422, and may further include a read-only storage unit (ROM) 423.

[0172] The storage unit 420 may also include a program / utilities 424 having a set (at least one) of program modules 425. Such program modules 425 include, but are not limited to: an operating system, one or more application programs, other program modules, and program data. Each or some combination of these examples may include an implementation of a network environment.

[0173] The bus 430 may represent one or more of several types of bus structures, including a memory bus or memory controller, a peripheral bus, an accelerated graphics port, a processing unit, or a local bus using any of a variety of bus structures.

[0174] The electronic device 400 may also communicate with one or more external devices 470 (such as a keyboard, a pointing device, a Bluetooth device, etc.), may also communicate with one or more devices that enable a user to interact with the electronic device 400, and / or may communicate with any device that enables the electronic device 400 to communicate with one or more other computing devices (such as a router, a modem, etc.). Such communication may be through an input / output (I / O) interface 450. And, the electronic device 400 may also communicate with one or more networks (such as a local area network (LAN), a wide area network (WAN), and / or a public network, such as the Internet) through a network adapter 460. As shown in the figure, the network adapter 460 communicates with other modules of the electronic device 400 through the bus 430. It should be understood that, although not shown in the figure, other hardware and / or software modules may be used in conjunction with the electronic device 400, including but not limited to: microcode, device drivers, redundant processing units, external disk drive arrays, RAID systems, tape drives, and data backup storage systems, etc.

[0175] Through the description of the above embodiments, those skilled in the art can easily understand that the exemplary embodiments described herein can be implemented by software or by a combination of software and necessary hardware. Therefore, the technical solutions according to the embodiments of the present invention can be embodied in the form of a software product, which can be stored in a non-volatile storage medium (such as a CD-ROM, a USB flash drive, a portable hard disk, etc.) or on a network, and includes several instructions to enable a computing device (such as a personal computer, a server, a terminal device, or a network device, etc.) to execute the method according to the embodiments of the present invention.

[0176] In an exemplary embodiment of the present invention, there is also provided a computer-readable storage medium having a program product capable of implementing the above method of the present invention stored thereon. In some possible embodiments, various aspects of the present invention can also be implemented in the form of a program product, which includes program code. When the program product runs on a terminal device, the program code is used to cause the terminal device to execute the steps according to various exemplary embodiments of the present invention described in the above "Exemplary Method" section of the present invention.

[0177] Referring to Figure 5 As shown, a program product 500 for implementing the method for generating the heliostat field layout scheme for the above mountain terrain according to the embodiments of the present invention is described. It can be a portable compact disc read-only memory (CD-ROM) and includes program code, and can run on a terminal device, such as a personal computer. However, the program product of the present invention is not limited thereto. In the present invention, the readable storage medium can be any tangible medium that contains or stores a program, and the program can be used by or in combination with an instruction execution system, apparatus, or device.

[0178] The program product can adopt any combination of one or more readable storage media. The readable storage medium can be, for example, but not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the above. More specific examples (non-exhaustive list) of the readable storage medium include: an electrical connection having one or more wires, a portable disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the above.

[0179] The program code for performing the operations of the present invention can be written in any combination of one or more programming languages, including object-oriented programming languages such as Java, C++, etc., and also including conventional procedural programming languages such as the "C" language or similar programming languages. The program code can be executed entirely on the user's computing device, partially on the user's device, executed as a stand-alone software package, partially on the user's computing device and partially on a remote computing device, or entirely on a remote computing device or server. In the case of a remote computing device, the remote computing device can be connected to the user's computing device through any type of network, including a local area network (LAN) or a wide area network (WAN), or, alternatively, can be connected to an external computing device (e.g., by using an Internet service provider to connect through the Internet).

[0180] In addition, the above-mentioned drawings are only schematic illustrations of the processes included in the method according to the exemplary embodiments of the present invention, rather than for limiting purposes. It is easy to understand that the processes shown in the above-mentioned drawings do not indicate or limit the chronological order of these processes. Additionally, it is also easy to understand that these processes can be executed, for example, synchronously or asynchronously in multiple modules.

[0181] Through the description of the above embodiments, those skilled in the art can easily understand that the exemplary embodiments described herein can be implemented by software or by a combination of software and necessary hardware. Therefore, the technical solutions according to the embodiments of the present invention can be embodied in the form of a software product, which can be stored in a non-volatile storage medium (which can be a CD-ROM, a USB flash drive, a mobile hard disk, etc.) or on a network, including several instructions to enable a computing device (which can be a personal computer, a server, a touch terminal, or a network device, etc.) to execute the method according to the embodiments of the present invention.

[0182] After considering the specification and practicing the invention disclosed herein, those skilled in the art will readily conceive of other embodiments of the present invention. The present invention is intended to cover any variations, uses, or adaptations of the present invention that follow the general principles of the present invention and include known common knowledge or conventional technical means in the technical field not disclosed by the present invention. The specification and embodiments are only regarded as exemplary, and the true scope and spirit of the present invention are pointed out by the claims.

[0183] It should be understood that the present invention is not limited to the exact structures described above and shown in the drawings, and various modifications and changes can be made without departing from its scope. The scope of the present invention is only limited by the appended claims.

Claims

1. A method for generating a layout scheme of a heliostat field in a mountainous terrain, characterized in that, Including: Using the Delaunay triangulation method to construct an irregular triangular net model of the initial heliostat field layout range; Establishing a three-dimensional terrain surface model based on the irregular triangular net model; Implementing a regular grid layout on the three-dimensional terrain surface model; Using a cubic spline interpolation function to perform interpolation analysis on each grid in the regular grid layout to determine the initial coordinates and height of the heliostat field; Using the projected area constraint condition and the adaptive gravitational search algorithm to perform multi-objective optimization on the initial coordinates and height to obtain the final heliostat field layout scheme; Using the projected area constraint condition and the adaptive gravitational search algorithm to perform multi-objective optimization on the initial coordinates and height to obtain the final heliostat field layout scheme includes: Selecting the solar parameters at a typical moment as reference data, and calculating the projected area of each heliostat field based on the initial coordinates and height; Taking the maximum projected area coverage, the least projected overlap, and unobstructed mechanical movement of the heliostats as the goals, and using the adaptive gravitational search algorithm to perform multi-objective optimization on the initial coordinates and height to obtain the final heliostat field layout scheme; Taking the maximum projected area coverage, the least projected overlap, and unobstructed mechanical movement of the heliostats as the goals, and using the adaptive gravitational search algorithm to perform multi-objective optimization on the initial coordinates and height to obtain the final heliostat field layout scheme includes: Setting the number of heliostats in the initial mirror field, encoding the initial mirror field, and generating a matrix with N rows and R columns, where N is the number of mirror field layout schemes and R is the number of rows of heliostats; Using a multi-objective fitness function including projected area coverage, projected overlap rate, and mechanical movement constraints to evaluate N mirror field layout schemes; Calculating the gravitational force according to the Euclidean distance between particles, calculating the acceleration by combining random parameters and the adaptive gravitational constant, and iteratively optimizing the layout scheme through the velocity-position update formula; Continuously updating the global optimal solution until the preset convergence accuracy is satisfied, and outputting the heliostat coordinate matrix corresponding to the highest fitness value.

2. The method for generating the heliostat field layout scheme for mountainous terrain according to claim 1, wherein Using a cubic spline interpolation function to perform interpolation analysis on each grid in the regular grid layout to determine the initial coordinates and height of the heliostat field includes: Using a cubic spline interpolation function to calculate the interpolation value of each grid; Based on the interpolation values of each grid, estimating the initial coordinates and height of the heliostat field corresponding to each grid within the boundary conditions.

3. The method for generating the heliostat field layout scheme for mountainous terrain according to claim 2, characterized in that, The boundary conditions include: The value of the cubic spline interpolation function defined on the interval at is equal to the value of the cubic spline interpolation function defined on the interval at ; The first derivative value of the cubic spline interpolation function defined on the interval at is equal to the first derivative value of the cubic spline interpolation function defined on the interval at ; and The second derivative value of the cubic spline interpolation function defined on the interval at is equal to the second derivative value of the cubic spline interpolation function defined on the interval at , where represents the coordinate value of a vertex of the th grid, represents the coordinate value of the th grid, represents the coordinate value of the th grid.

4. The method for generating the heliostat field layout scheme for mountainous terrain according to claim 1, wherein Selecting the solar parameters at a typical moment as reference data, and calculating the projected area of each heliostat field based on the initial coordinates includes: According to the initial coordinates and height, calculating the vertical height where the center of the current heliostat field is located; Based on the vertical height where the center of the heliostat field is located, calculating the distance from the center of the current heliostat field to the receiver; Based on the distance and the actual area of the current heliostat field, calculating the projected area of the current heliostat field.

5. The method for generating a heliostat field layout scheme for mountainous terrain according to claim 1, wherein The number of heliostats in the initial mirror field is greater than or equal to 1.1 times the number of heliostats in the expected heliostat field.

6. A generating device for a heliostat field layout scheme for mountainous terrain, characterized in that, Including: A first model construction module for using the Delaunay triangulation method to construct an irregular triangular net model of the initial heliostat field layout range; The second model construction module is used to establish a three-dimensional terrain surface model according to the irregular triangular mesh model; The grid layout module is used to implement regular grid layout on the three-dimensional terrain surface model; The interpolation analysis module is used to perform interpolation analysis on each grid in the regular grid layout by using a cubic spline interpolation function to determine the initial coordinates and height of the heliostat field; The scheme generation module is used to perform multi-objective optimization on the initial coordinates and height by using the projected area constraint condition and the adaptive gravitational search algorithm to obtain the final heliostat field layout scheme.

7. An electronic device, characterized in that, It includes: A processor; And A memory, on which computer-readable instructions are stored, and when the computer-readable instructions are executed by the processor, the method for generating the heliostat field layout scheme for mountainous terrain according to any one of claims 1 to 5 is implemented.

8. A computer-readable storage medium, characterized in that, A computer program is stored thereon, and when the computer program is executed by the processor, the method for generating the heliostat field layout scheme for mountainous terrain according to any one of claims 1 to 5 is implemented.

Citation Information

Patent Citations

  • Mirror field arrangement method and mirror field adapting to severe terrains

    CN110136027A

  • CAD and BIM coordinate automatic conversion method and system based on coordinate mapping

    CN119478285A