Method, device and electronic equipment for determining a path of a water conveyance tunnel

Abstract

This invention discloses a method, apparatus, and electronic device for determining the path of a water conveyance tunnel. The method includes: determining a straight path based on multiple grids of the water conveyance tunnel determined by a digital surface elevation model and multi-source constraint information; obtaining multiple blocking segments based on the surface elevation attributes of each grid in the straight path; expanding any blocking segment to obtain a search window, and extracting multiple locally connected regions within the search window; generating a regional path based on the multiple locally connected regions; determining the internal paths of the multiple locally connected regions based on the regional path and the internal paths of the multiple locally connected regions; obtaining the intermediate path of the blocking segment through the regional path and the internal paths of the multiple locally connected regions; and generating the target path of the water conveyance tunnel based on the intermediate paths of the multiple blocking segments. This achieves a transformation from global pixel-level search to local regional-level search for the path of ultra-long-distance water conveyance tunnels in complex mountainous areas, improving path search efficiency.

Description

Technical Field

[0001] This invention relates to the field of water conservancy engineering technology, and in particular to a method, apparatus, and electronic equipment for determining the path of a water conveyance tunnel. Background Technology

[0002] Currently, route optimization for water conveyance tunnels, traffic tunnels, pipeline projects, and other linear infrastructure mainly relies on Geographic Information Systems (GIS), Digital Elevation Models (DEMs), and route search and optimization algorithms. Existing methods typically construct evaluation systems based on factors such as topographic elevation, slope, geological conditions, environmentally sensitive areas, and project cost, and employ methods such as the Least-Cost Path (LCP), Dijkstra's algorithm, genetic algorithms, and particle swarm optimization algorithms for route search and scheme comparison. In recent years, with the development of GIS, BIM, and 3D geoscience information technologies, multi-source spatial data fusion, multi-objective decision analysis, and intelligent optimization algorithms have been gradually applied to the field of route planning. This has enabled comprehensive evaluation of topographic constraints, geological risks, ecological protection, and engineering economics, and has been widely used in the planning of highways, railways, power transmission lines, pipeline projects, and underground tunnels.

[0003] However, most of the aforementioned methods rely on pixel-level searches using global DEM grids. As the water conveyance distance and mountainous area increase, the search space expands dramatically, leading to problems such as high computational complexity and insufficient ability to identify continuous obstacle mountains in the optimal selection of routes for ultra-long-distance water conveyance tunnels with multiple mountain ranges. Therefore, a new method for determining the route of water conveyance tunnels is urgently needed. Summary of the Invention

[0004] This invention provides a method, apparatus, and electronic device for determining the path of a water conveyance tunnel. By employing a technical approach of blocking identification, local search, regional search, and path reconstruction, it enables rapid optimization of the path for ultra-long-distance water conveyance tunnels in complex mountainous areas, thereby improving the accuracy of path determination.

[0005] According to a first aspect of the present invention, a method for determining the path of a water conveyance tunnel is provided, the method comprising: Based on the digital surface elevation model and multi-source constraint information corresponding to the water conveyance tunnel, multiple grids corresponding to the water conveyance tunnel are determined; wherein, any one of the multiple grids includes surface elevation attributes and constraint attributes; Based on the starting grid and the ending grid among the plurality of grids, determine the straight path corresponding to the starting grid and the ending grid; Based on the surface elevation attributes of each grid in the straight path, continuous high-depth blocking segments in the straight path are identified, resulting in multiple blocking segments; For any one of the multiple blocking segments, the blocking segment is expanded to obtain a search window corresponding to the blocking segment, and multiple local connected regions of the search window are extracted; Based on the plurality of locally connected regions, generate a regional path; and based on the plurality of locally connected regions, determine the internal path of the plurality of locally connected regions; The detour path corresponding to the blocked segment is obtained through the regional path and the internal path of the multiple locally connected regions. The multiple blocked segments in the straight path are replaced by the detour paths corresponding to the multiple blocked segments to generate the target path of the water conveyance tunnel.

[0006] According to another aspect of the present invention, a device for determining the path of a water conveyance tunnel is provided, the device comprising: The rasterization module is used to determine multiple grids corresponding to the water conveyance tunnel based on the digital surface elevation model and multi-source constraint information corresponding to the water conveyance tunnel; wherein, any one of the multiple grids includes surface elevation attributes and constraint attributes; A straight path determination module is used to determine a straight path between the starting grid and the ending grid based on the starting grid and the ending grid among the plurality of grids; The identification module is used to identify continuous high-depth blocking segments in the straight path based on the surface elevation attributes of each grid in the straight path, thereby obtaining multiple blocking segments; The connected region determination module is used to expand any one of the multiple blocking segments to obtain a search window corresponding to the blocking segment, and extract multiple local connected regions of the search window; An internal path determination module is used to generate a regional path based on the plurality of locally connected regions; and to determine the internal path of the plurality of locally connected regions based on the plurality of locally connected regions. The target path determination module is used to obtain the detour path corresponding to the blocked segment through the regional path and the internal path of the multiple locally connected regions, and to replace the multiple blocked segments in the straight path with the detour paths corresponding to the multiple blocked segments to generate the target path of the water conveyance tunnel.

[0007] According to another aspect of the present invention, an electronic device is provided, the electronic device comprising: At least one processor; and A memory communicatively connected to the at least one processor; wherein, The memory stores a computer program that can be executed by the at least one processor, which enables the at least one processor to perform the method for determining the path of a water conveyance tunnel as described in any embodiment of the present invention.

[0008] According to another aspect of the present invention, a computer-readable storage medium is provided, the computer-readable storage medium storing computer instructions for causing a processor to execute and implement the method for determining the path of a water conveyance tunnel as described in any embodiment of the present invention.

[0009] According to another aspect of the present invention, a computer program product is also provided, including a computer program that, when executed by a processor, implements the steps of the method for determining the path of a water conveyance tunnel as described in any embodiment of the present invention.

[0010] The technical solution of this invention involves determining multiple grids corresponding to the water conveyance tunnel based on the digital surface elevation model and multi-source constraint information; determining a straight path between the starting and ending grids based on the starting and ending grids; identifying continuous high-depth blocking segments in the straight path based on the surface elevation attributes of each grid, thus obtaining multiple blocking segments; expanding any one of the blocking segments to obtain a search window corresponding to the blocking segment, and extracting multiple locally connected regions from the search window; generating a regional path based on the multiple locally connected regions; determining the internal paths of the multiple locally connected regions based on the multiple locally connected regions; obtaining the detour path corresponding to the blocking segment through the regional path and the internal paths of the multiple locally connected regions; and replacing the multiple blocking segments in the straight path using the detour paths corresponding to the multiple blocking segments to generate the target path of the water conveyance tunnel. Therefore, this embodiment of the application, through a technical approach combining continuous high-depth obstacle identification, regional topology search, and hierarchical path reconstruction, achieves the transformation of path searching for ultra-long-distance water conveyance tunnels in complex mountainous areas from global pixel-level search to local regional-level search, significantly improving path search efficiency while ensuring engineering feasibility. Due to the adoption of a regional-level topology search strategy, this embodiment of the application can still quickly identify feasible paths and effectively avoid construction-restricted areas even under conditions of large global DEM data volume, numerous continuous high-depth obstacles, and multiple constraints such as geological disaster zones and ecological protection zones, thereby significantly reducing the number of search nodes and lowering computational complexity.

[0011] It should be understood that the description in this section is not intended to identify key or essential features of the embodiments of the present invention, nor is it intended to limit the scope of the invention. Other features of the invention will become readily apparent from the following description. Attached Figure Description

[0012] To more clearly illustrate the technical solutions in the embodiments of the present invention, the accompanying drawings used in the description of the embodiments will be briefly introduced below. Obviously, the accompanying drawings described below are only some embodiments of the present invention. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0013] Figure 1 This is a schematic diagram illustrating the process of determining the path of a water conveyance tunnel according to an embodiment of the present invention; Figure 2 This is a flowchart of a method for determining multiple blocking segments according to an embodiment of the present invention; Figure 3 This is a flowchart illustrating the search window for determining the blocking segment according to an embodiment of the present invention; Figure 4 This is a schematic diagram of the process for obtaining a search window according to an embodiment of the present invention; Figure 5 This is a flowchart illustrating the extraction of multiple locally connected regions of a search window according to an embodiment of the present invention. Figure 6 This is a flowchart illustrating the generation of a region path according to an embodiment of the present invention; Figure 7 This is a flowchart illustrating a method for determining the path of a water conveyance tunnel according to an embodiment of the present invention. Figure 8 This is a schematic diagram of a device for determining the path of a water conveyance tunnel according to an embodiment of the present invention; Figure 9 This is a schematic diagram of the structure of the electronic device provided in the embodiments of the present invention. Detailed Implementation

[0014] To enable those skilled in the art to better understand the present invention, the technical solutions of the present invention will be clearly and completely described below with reference to the accompanying drawings of the embodiments of the present invention. Obviously, the described embodiments are only some embodiments of the present invention, and not all embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative effort should fall within the scope of protection of the present invention.

[0015] It should be noted that the terms "first," "second," etc., in the specification, claims, and accompanying drawings of this invention are used to distinguish similar objects and are not necessarily used to describe a specific order or sequence. It should be understood that such data can be interchanged where appropriate so that the embodiments of the invention described herein can be implemented in orders other than those illustrated or described herein. Furthermore, the terms "comprising" and "having," and any variations thereof, are intended to cover non-exclusive inclusion; for example, a process, method, system, product, or apparatus that comprises a series of steps or units is not necessarily limited to those steps or units explicitly listed, but may include other steps or units not explicitly listed or inherent to such processes, methods, products, or apparatus.

[0016] In existing technologies, most methods rely on pixel-level searches using global DEM grids. However, as the water conveyance distance and mountainous area increase, the search space expands dramatically, leading to problems such as high computational complexity and insufficient ability to identify continuous obstacle mountains in the optimal selection of routes for ultra-long-distance water conveyance tunnels with multiple mountain ranges. Therefore, a new method for determining the route of water conveyance tunnels is proposed.

[0017] Therefore, this application discloses a method for determining the path of a water conveyance tunnel. The method involves determining multiple grids corresponding to the water conveyance tunnel based on the digital elevation model and multi-source constraint information; determining a straight path between the starting and ending grids based on the starting and ending grids; identifying continuous high-depth blocking segments in the straight path based on the surface elevation attributes of each grid, resulting in multiple blocking segments; expanding any one of the blocking segments to obtain a search window corresponding to the blocking segment, and extracting multiple locally connected regions from the search window; generating a regional path based on the multiple locally connected regions; determining the internal paths of the multiple locally connected regions based on the multiple locally connected regions; obtaining the detour path corresponding to the blocking segment through the regional path and the internal paths of the multiple locally connected regions; and replacing the multiple blocking segments in the straight path using the detour paths corresponding to the multiple blocking segments to generate the target path of the water conveyance tunnel. Therefore, this embodiment of the application, through a technical approach combining continuous high-depth obstacle identification, regional topology search, and hierarchical path reconstruction, achieves the transformation of path searching for ultra-long-distance water conveyance tunnels in complex mountainous areas from global pixel-level search to local regional-level search, significantly improving path search efficiency while ensuring engineering feasibility. Due to the adoption of a regional-level topology search strategy, this embodiment of the application can still quickly identify feasible paths and effectively avoid construction-restricted areas even under conditions of large global DEM data volume, numerous continuous high-depth obstacles, and multiple constraints such as geological disaster zones and ecological protection zones, thereby significantly reducing the number of search nodes and lowering computational complexity.

[0018] The method for determining the path of the water conveyance tunnel in the embodiments of this application will be described in detail below. Figure 1 This is a flowchart illustrating a method for determining the path of a water conveyance tunnel according to an embodiment of the present invention. Figure 1 As can be seen from this, it may specifically include the following steps: S110: Based on the digital surface elevation model and multi-source constraint information corresponding to the water conveyance tunnel, determine multiple grids corresponding to the water conveyance tunnel; wherein, any one of the multiple grids includes surface elevation attributes and constraint attributes; The multi-source constraint information in this application embodiment includes geological constraint data, ecological constraint data, and engineering constraint data.

[0019] Furthermore, in this embodiment, the digital surface elevation model and multi-source constraint information corresponding to the water conveyance tunnel are projected and rasterized to obtain the raster corresponding to the water conveyance tunnel. The obtained raster can be expressed by formula (1): ...(1); in, The grid corresponding to the water conveyance tunnel. For the grid cell corresponding to the i-th row and j-th column, is the total number of rows in the raster, and N is the total number of columns in the raster.

[0020] In this application embodiment, the surface elevation attribute of any raster is obtained through a surface elevation mapping function, and the surface elevation attribute of any raster can be obtained through formula (2): ...(2); in, This represents the surface elevation attribute corresponding to the raster in the i-th row and j-th column. This is a surface elevation mapping function.

[0021] In this application embodiment, the passability of a grid can be determined by constraint attributes. In one possible implementation, the passability of a grid is determined in the following way: For any given grid cell, obtain its constraint attributes. If the grid cell's constraint attributes satisfy all constraint data, then the grid cell is determined to be passable; if the grid cell's constraint attributes have unsatisfied constraint data, then the grid cell is determined to be impassable. Specifically, the passability of a grid cell can be determined using formula (3): ... (3); in, =1 indicates that the grid cell corresponding to the i-th row and j-th column is passable. 0 indicates that the grid cell corresponding to the i-th row and j-th column is impassable. This indicates that the constraint properties of the raster corresponding to the i-th row and j-th column satisfy various constraint data. This indicates that the constraint attribute of the raster corresponding to the i-th row and j-th column contains constraint data that is not satisfied.

[0022] S120: Based on the starting grid and the ending grid among the plurality of grids, determine the straight path corresponding to the starting grid and the ending grid; wherein, the straight path can be obtained by formula (4): ... (4); in, It is a straight path. As the starting grid, For the endpoint grid, For pre-set path parameters, .

[0023] S130: Based on the surface elevation attributes of each grid in the straight path, identify the continuous high-depth blocking segments in the straight path to obtain multiple blocking segments; The method for determining multiple blocking segments in S130 of the embodiments of this application will be described below. Figure 2 To determine a flowchart for multiple blocking segments, the specific steps may include: S210: For any grid cell in the straight path, determine the corresponding ground elevation based on the grid cell's position coordinates; In this embodiment of the application, the ground elevation corresponding to the grid can be determined by the formula (2) mentioned above. This embodiment of the application will not be repeated here.

[0024] S220: Based on the surface elevation corresponding to the grid, determine whether the grid is in a high burial depth state; In one possible implementation, S220 can be specifically implemented as follows: subtracting the ground elevation corresponding to the grid from the design elevation corresponding to the straight path at the grid to obtain the target distance; if the target distance is greater than a preset burial depth threshold, the grid is determined to be in a high burial depth state; if the target distance is not greater than the preset burial depth threshold, the grid is determined not to be in a high burial depth state. The target distance represents the vertical distance from the ground surface to the straight path. The target distance can be determined using formula (5): ... (5); in, The target distance; This represents the surface elevation corresponding to grid S. This represents the design elevation of the straight path at grid S.

[0025] The design elevation of the straight path at grid S can be determined using formula (6): ... (6); in, The design elevation of the preset starting grid; The longitudinal slope of the tunnel is designed locally, and a positive value is taken when descending along the direction of water flow; m is the cumulative mileage from the grid start point to grid S.

[0026] Whether the grid is in a high burial depth state can be determined by formula (7): ... (7); in, The state of grid m, This is a preset burial depth threshold. This indicates that the grid is in a high burial depth state. This indicates that the grid is not in a high-depth state.

[0027] In this embodiment, the target threshold is obtained by adding the ground elevation corresponding to the endpoint grid to a preset burial depth threshold.

[0028] It should be noted that the burial depth threshold is not limited in this embodiment of the application. The burial depth threshold in this embodiment of the application can be set according to the specific actual situation.

[0029] S230: Based on multiple consecutive grids of high burial depth states, the length of the high burial depth section is obtained; In one possible implementation, S230 can be specifically implemented as follows: multiplying the number of multiple consecutive high-depth grids by the width of any one grid to obtain the length of the high-depth section. The length of the high-depth section can be obtained using formula (8): ... (8); in, The length of the deep burial section. The number of grid cells in multiple consecutive high-depth burial states. The width of any grid cell.

[0030] The width of the grid in this embodiment is preset, and this embodiment does not limit it.

[0031] S240: Determine the high-depth burial section whose length exceeds the preset length threshold as the blocking section.

[0032] The blocking segment in this application embodiment includes the starting position, the ending position, and the length of the corresponding high burial depth section.

[0033] It should be noted that the length threshold in this embodiment can be set according to the specific actual situation, and this embodiment does not limit the specific value of the length threshold.

[0034] S140: For any one of the plurality of blocking segments, the blocking segment is expanded to obtain a search window corresponding to the blocking segment, and multiple local connected regions of the search window are extracted; The method for determining the search window for the blocking segment in the embodiments of this application will be described below. Figure 3 A flowchart illustrating the process of determining the search window for the blocking segment may include the following steps: S310: For any blocking segment, based on the starting point index, ending point index, and preset number of extended grids of the blocking segment on the straight path, obtain the target starting point index and the target ending point index; Wherein, the starting point index is the index of the starting point grid, and the ending point index is the index of the ending point grid.

[0035] In one possible implementation, S310 can be specifically implemented as follows: Subtracting the starting point index from the extended grid number yields the target starting point index; wherein, the target starting point index can be obtained through formula (9): ... (9); in, Target starting point index, As the starting index, To expand the number of raster cells.

[0036] The target endpoint index is obtained by adding the endpoint index to the number of extended grid cells. The target endpoint index can be obtained using formula (10): ... (10); in, Index for the target destination, For the endpoint index.

[0037] It should be noted that the number of extended grids in this application embodiment can be set according to the specific actual situation, and this application embodiment does not limit the number of extended grids.

[0038] S320: Obtain the target starting point based on the target starting point index, and obtain the target ending point based on the target ending point index; In one possible implementation, the target starting point index is input into a pre-set spatial coordinate mapping function to obtain the target starting point; and the target ending point index is input into a pre-set spatial coordinate mapping function to obtain the target ending point. The target starting point and target ending point can be obtained using formula (11): ... (11); in, Starting from the target, The target destination.

[0039] S330: Based on the target starting point and the target ending point, obtain the normal vector corresponding to the direction vector between the target starting point and the target ending point; In one possible implementation, a direction vector between the target starting point and the target ending point is obtained based on the target starting point and the target ending point; the normal vector is then obtained based on the direction vector. The direction vector can be obtained using formula (12): ... (12); in, It is the direction vector.

[0040] Furthermore, the normal vector can be obtained through formula (13): ... (13); in, It is the normal vector. Direction vector The horizontal position coordinates, Direction vector The vertical position coordinates in the diagram.

[0041] S340: The search window is obtained based on the target starting point, the target ending point, the normal vector, and the initial expansion width.

[0042] The following is a detailed explanation of how the search window is obtained in S340. Figure 4 To obtain a flowchart of the search window, the specific steps may include: S410: Add the position coordinates of the target starting point to the extended coordinates to obtain the coordinates of the first vertex, wherein the extended coordinates are obtained by multiplying the normal vector by the preset extended width; wherein the coordinates of the first vertex can be obtained by formula (14): ... (14); in, Let the coordinates of the first vertex be... The coordinates of the starting point of the target. This is the initial expanded width.

[0043] S420: Subtract the extended coordinates from the position coordinates of the target starting point to obtain the coordinates of the second vertex; wherein, the coordinates of the second vertex can be determined by formula (15): ... (15); in, The coordinates of the second vertex are given.

[0044] S430: Subtract the extended coordinates from the position coordinates of the target endpoint to obtain the coordinates of the third vertex; wherein, the coordinates of the third vertex can be obtained through formula (16): ... (16); in, The coordinates are those of the third vertex.

[0045] S440: Add the position coordinates of the target endpoint to the extended coordinates to obtain the coordinates of the fourth vertex; wherein, the coordinates of the fourth vertex can be obtained through formula (17): ... (17); in, The coordinates of the fourth vertex are given.

[0046] S450: The search window is obtained based on the coordinates of the first vertex, the second vertex, the third vertex, and the fourth vertex.

[0047] In this embodiment, the coordinates of the first vertex, the second vertex, the third vertex, and the fourth vertex are used as the vertex coordinates of the search window. By connecting the coordinates of each vertex, the search window is obtained.

[0048] In one possible implementation, after obtaining the search window, if the search window cannot extract any locally connected regions and the initial expansion width is not greater than a preset threshold, then the initial expansion width is added to a preset value to obtain an updated expansion width, and the updated expansion width is determined as the initial expansion width. Then, S340 is executed again until the search window extracts the multiple locally connected regions.

[0049] In one possible implementation, the process ends if the initial expansion width is greater than a preset threshold.

[0050] It should be noted that the preset values ​​in the embodiments of this application can be set according to the specific actual situation, and the embodiments of this application do not limit the specified values.

[0051] The following describes the method for extracting multiple locally connected regions of the search window in the embodiments of this application. Figure 5 A flowchart illustrating the process of extracting multiple locally connected regions from a search window may include the following steps: S510: For any search window, determine the grid cells in the search window whose constraint attribute is a specified value as passable grid cells; The specified value in this embodiment is 1, but this embodiment does not limit the specified value and can be set according to the specific actual situation.

[0052] S520: For any passable grid, other passable grids adjacent to the passable grid are determined as grids that have a connectivity relationship with the passable grid; In this application embodiment, "adjacent" refers to being adjacent within an eight-neighborhood.

[0053] S530: Based on each passable grid and the grids that are connected to each passable grid, obtain all the multiple locally connected regions.

[0054] Multiple grids with connectivity relationships are aggregated to obtain multiple locally connected regions.

[0055] In the embodiments of this application, any locally connected region includes all adjacent passable grid cells.

[0056] S150: Generate a region path based on the plurality of locally connected regions; and determine the internal path of the plurality of locally connected regions based on the plurality of locally connected regions. Figure 6 A flowchart for generating a region path may include the following steps: S610: For any two locally connected regions, determine the boundary distance between the two locally connected regions based on the boundary points in the two locally connected regions; In one possible implementation, the boundary distance between two locally connected regions is determined by: traversing the two boundary points in each of the two locally connected regions, and determining the distance between the two boundary points based on their position coordinates; after the traversal is complete, the distance with the smallest value is determined as the boundary distance.

[0057] S620: If the boundary distance is not greater than a preset length threshold, then the two locally connected regions are taken as region nodes, and the straight line corresponding to the boundary distance is taken as an edge, to obtain a region topology graph. It should be noted that the length threshold in this embodiment can be set according to the specific actual situation, and this embodiment does not limit the length threshold.

[0058] S630: Obtain the regional topology network based on multiple regional topology maps; In this embodiment, a regional topology network is composed of multiple regional topology maps.

[0059] S640: Based on the first locally connected region where the target starting point is located and the second locally connected region where the target ending point is located, determine the regional path between the first locally connected region and the second locally connected region in the regional topology network.

[0060] In this embodiment of the application, in the regional topology network, the first locally connected region where the target starting point is located and the second locally connected region where the target ending point is located are taken as the starting and ending nodes, and the shortest path between the starting and ending nodes is determined as the regional path.

[0061] In one possible implementation, the internal paths of multiple locally connected regions are determined by: for any locally connected region, obtaining the internal path of the locally connected region based on two boundary points within the locally connected region.

[0062] Furthermore, the two boundary points of the locally connected region are input into the straight path generation function to obtain the internal path of the locally connected region. The internal path of the connected region can be obtained through formula (18): ... (18); in, Let i be the internal path of the connected region i. Let i be a boundary point of the connected region i. Let i be another boundary point of the connected region i. This is a function for generating straight paths.

[0063] S160: Obtain the detour path corresponding to the blocked segment through the regional path and the internal path of the multiple locally connected regions, and replace the multiple blocked segments in the straight path with the detour path corresponding to the multiple blocked segments to generate the target path of the water conveyance tunnel.

[0064] For example, let the internal path of a locally connected region be... The regional path between adjacent regions is The intermediate path around which the blocking segment is located is represented as: .

[0065] In one possible implementation, the intermediate paths corresponding to multiple blocking segments are spliced ​​together to obtain the target path of the water conveyance tunnel.

[0066] The method for determining the path of the water conveyance tunnel in the embodiments of this application will be described below. Figure 7 A flowchart illustrating the method for determining the path of a water conveyance tunnel, which may include the following steps: S700: Based on the digital surface elevation model and multi-source constraint information corresponding to the water conveyance tunnel, determine multiple grids corresponding to the water conveyance tunnel; wherein, any one of the multiple grids includes surface elevation attributes and constraint attributes; S710: Determine a straight path corresponding to the start grid and the end grid among the plurality of grids; S720: For any grid cell in the straight path, determine the corresponding ground elevation based on the grid cell's position coordinates; S730: If the surface elevation is greater than the target threshold, the state of the grid is determined to be a high burial depth state, wherein the target threshold is determined based on the surface elevation corresponding to the endpoint grid and a preset burial depth threshold; S740: The length of the high-depth section is obtained based on a grid of multiple consecutive high-depth states; S750: Depth sections with a length greater than a preset length threshold are identified as blocking sections; S760: For any blocking segment, based on the starting point index, ending point index, and preset number of extended grids of the blocking segment on the straight path, obtain the target starting point index and the target ending point index; S770: Obtain the target starting point based on the target starting point index, and obtain the target ending point based on the target ending point index; S780: Based on the target starting point and the target ending point, obtain the normal vector corresponding to the direction vector between the target starting point and the target ending point; S790: Based on the target starting point, the target ending point, and the normal vector, the search window is obtained; S791: For any search window, determine the grid cells in the search window whose constraint attribute is a specified value as passable grid cells; S792: For any passable grid, other passable grids adjacent to the passable grid are determined as grids that have a connectivity relationship with the passable grid; S793: Based on each passable grid and the grids that are connected to each passable grid, obtain all the multiple locally connected regions; S794: Generate a region path based on the plurality of locally connected regions; and determine the internal path of the plurality of locally connected regions based on the plurality of locally connected regions; S795: Obtain the intermediate path corresponding to the blocking segment through the regional path and the internal path of the multiple locally connected regions, and generate the target path of the water conveyance tunnel based on the intermediate path corresponding to the multiple blocking segments.

[0067] Based on the same inventive concept, this application also provides a device for determining the path of a water conveyance tunnel. Figure 8 This is a schematic diagram of the device for determining the path of the water conveyance tunnel. Figure 8 As shown, the device 800 includes: The rasterization module 810 is used to determine multiple grids corresponding to the water conveyance tunnel based on the digital surface elevation model and multi-source constraint information corresponding to the water conveyance tunnel; wherein, any one of the multiple grids includes surface elevation attributes and constraint attributes; The straight path determination module 820 is used to determine a straight path corresponding to the start grid and the end grid based on the start grid and the end grid among the plurality of grids; The identification module 830 is used to identify continuous high-depth blocking segments in the straight path based on the surface elevation attributes of each grid in the straight path, thereby obtaining multiple blocking segments; The connected region determination module 840 is used to expand any one of the multiple blocking segments to obtain a search window corresponding to the blocking segment, and extract multiple local connected regions of the search window. The internal path determination module 850 is used to generate a region path based on the plurality of locally connected regions; and to determine the internal path of the plurality of locally connected regions based on the plurality of locally connected regions. The target path determination module 860 is used to obtain the intermediate path corresponding to the blocking segment through the regional path and the internal path of the multiple locally connected regions, and generate the target path of the water conveyance tunnel based on the intermediate path corresponding to the multiple blocking segments.

[0068] In one possible embodiment, the identification module 830 is specifically used for: For any grid cell in the straight path, determine the corresponding ground elevation based on the grid cell's position coordinates; Based on the surface elevation of the grid, it is determined whether the grid is in a high burial depth state, wherein the target threshold is determined according to the surface elevation corresponding to the endpoint grid and a preset burial depth threshold. The length of the high-depth section is obtained based on a grid of multiple consecutive high-depth burial states. High-depth burial sections with a length greater than the preset length threshold are identified as blocking sections.

[0069] In one possible embodiment, the connected region determination module 840 is specifically used for: For any blocking segment, based on the starting point index, ending point index, and a preset number of extended grids of the blocking segment on the straight path, the target starting point index and the target ending point index are obtained, wherein the starting point index is the index of the starting point grid and the ending point index is the index of the ending point grid. The target starting point is obtained based on the target starting point index, and the target ending point is obtained based on the target ending point index; Based on the target starting point and the target ending point, obtain the normal vector corresponding to the direction vector between the target starting point and the target ending point; The search window is obtained based on the target starting point, the target ending point, and the normal vector.

[0070] In one possible embodiment, the connected region determination module 840 is further configured to: Subtracting the starting point index from the number of extended grid cells yields the target starting point index; The target endpoint index is obtained by adding the endpoint index to the extended grid number.

[0071] In one possible implementation, the connected region determination module 840 is further configured to: The coordinates of the first vertex are obtained by adding the position coordinates of the target starting point to the extended coordinates, wherein the extended coordinates are obtained by multiplying the normal vector by the preset extended width; Subtracting the extended coordinates from the position coordinates of the target starting point yields the coordinates of the second vertex. Subtracting the extended coordinates from the position coordinates of the target endpoint yields the coordinates of the third vertex. Add the position coordinates of the target endpoint to the extended coordinates to obtain the coordinates of the fourth vertex; The search window is obtained based on the coordinates of the first vertex, the second vertex, the third vertex, and the fourth vertex.

[0072] In one possible implementation, the connected region determination module 840 is further configured to: For any given search window, the grid cells with constraint attributes set to a specified value are identified as passable grid cells. For any passable grid, other passable grids adjacent to the passable grid are determined as grids that have a connectivity relationship with the passable grid; Based on each passable grid and the grids that are connected to each passable grid, a plurality of locally connected regions are obtained.

[0073] In one possible implementation, the internal path determination module 850 is specifically used for: For any two locally connected regions, determine the boundary distance between the two locally connected regions based on the boundary points in the two locally connected regions; If the boundary distance is not greater than a preset length threshold, then the two locally connected regions are taken as region nodes, and the straight line corresponding to the boundary distance is taken as an edge, thus obtaining a region topology graph. Based on multiple regional topology maps, a regional topology network is obtained; Based on the first locally connected region where the target starting point is located and the second locally connected region where the target ending point is located, a regional path is determined between the first locally connected region and the second locally connected region in the regional topology network.

[0074] In one possible implementation, the internal path determination module 850 is further configured to: For any locally connected region, the internal path of the locally connected region is obtained based on the two boundary points in the locally connected region; The process of obtaining the target path of the water conveyance tunnel through the regional path and the internal paths of the multiple locally connected regions includes: The target path is obtained by sequentially concatenating the regional path and the internal paths of the multiple locally connected regions in a preset order.

[0075] The device for determining the path of a water conveyance tunnel provided in this embodiment of the invention can execute the method for determining the path of a water conveyance tunnel provided in any embodiment of the invention, and has the corresponding functional modules and beneficial effects of the method.

[0076] The collection, storage, use, processing, transmission, provision, and disclosure of user personal information involved in the technical solution disclosed herein comply with the provisions of relevant laws and regulations and do not violate public order and good morals.

[0077] Figure 9 A schematic diagram of an electronic device 10, which can be used to implement embodiments of the present invention, is shown. The electronic device is intended to represent various forms of digital computers, such as laptop computers, desktop computers, workstations, personal digital assistants, servers, blade servers, mainframe computers, and other suitable computers. The electronic device can also represent various forms of mobile devices, such as personal digital processors, cellular phones, smartphones, wearable devices (e.g., helmets, glasses, watches, etc.), and other similar computing devices. The components shown herein, their connections and relationships, and their functions are merely illustrative and are not intended to limit the implementation of the invention described and / or claimed herein.

[0078] like Figure 9 As shown, the electronic device 10 includes at least one processor 11 and a memory, such as a read-only memory (ROM) 12 or a random access memory (RAM) 13, communicatively connected to the at least one processor 11. The memory stores computer programs executable by the at least one processor. The processor 11 can perform various appropriate actions and processes based on the computer program stored in the ROM 12 or loaded from storage unit 18 into the RAM 13. The RAM 13 can also store various programs and data required for the operation of the electronic device 10. The processor 11, ROM 12, and RAM 13 are interconnected via a bus 14. An input / output (I / O) interface 15 is also connected to the bus 14.

[0079] Multiple components in electronic device 10 are connected to I / O interface 15, including: input unit 16, such as keyboard, mouse, etc.; output unit 17, such as various types of displays, speakers, etc.; storage unit 18, such as disk, optical disk, etc.; and communication unit 19, such as network card, modem, wireless transceiver, etc. Communication unit 19 allows electronic device 10 to exchange information / data with other devices through computer networks such as the Internet and / or various telecommunications networks.

[0080] Processor 11 can be a variety of general-purpose and / or special-purpose processing components with processing and computing capabilities. Some examples of processor 11 include, but are not limited to, a central processing unit (CPU), a graphics processing unit (GPU), various special-purpose artificial intelligence (AI) computing chips, various processors running machine learning model algorithms, a digital signal processor (DSP), and any suitable processor, controller, microcontroller, etc. Processor 11 performs the various methods and processes described above, such as the method for determining the path of a water conveyance tunnel.

[0081] In some embodiments, the method for determining the path of a water conveyance tunnel can be implemented as a computer program tangibly contained in a computer-readable storage medium, such as a storage unit. In some embodiments, part or all of the computer program can be loaded and / or installed on an electronic device via ROM and / or a communication unit. When the computer program is loaded into RAM and executed by a processor, one or more steps of the method for determining the path of a water conveyance tunnel described above can be performed. Alternatively, in other embodiments, the processor can be configured to perform the method for determining the path of a water conveyance tunnel by any other suitable means (e.g., by means of firmware).

[0082] Various embodiments of the systems and techniques described above herein can be implemented in digital electronic circuit systems, integrated circuit systems, field-programmable gate arrays (FPGAs), application-specific integrated circuits (ASICs), application-specific standard products (ASSPs), systems-on-a-chip (SoCs), payload-programmable logic devices (CPLDs), computer hardware, firmware, software, and / or combinations thereof. These various embodiments may include implementations in one or more computer programs that can be executed and / or interpreted on a programmable system including at least one programmable processor, which may be a dedicated or general-purpose programmable processor, capable of receiving data and instructions from a storage system, at least one input device, and at least one output device, and transmitting data and instructions to the storage system, the at least one input device, and the at least one output device.

[0083] Computer programs used to implement the methods of the present invention may be written in any combination of one or more programming languages. These computer programs may be provided to a processor of a general-purpose computer, a special-purpose computer, or other programmable data processing device, such that when executed by the processor, the computer programs cause the functions / operations specified in the flowcharts and / or block diagrams to be performed. The computer programs may be executed entirely on a machine, partially on a machine, or as a standalone software package, partially on a machine and partially on a remote machine, or entirely on a remote machine or server.

[0084] In the context of this invention, a computer-readable storage medium can be a tangible medium that may contain or store a computer program for use by or in conjunction with an instruction execution system, apparatus, or device. A computer-readable storage medium may include, but is not limited to, electronic, magnetic, optical, electromagnetic, infrared, or semiconductor systems, apparatus, or devices, or any suitable combination thereof. Alternatively, a computer-readable storage medium may be a machine-readable signal medium. More specific examples of machine-readable storage media include electrical connections based on one or more wires, portable computer disks, hard disks, random access memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM or flash memory), optical fibers, portable compact disk read-only memory (CD-ROM), optical storage devices, magnetic storage devices, or any suitable combination thereof.

[0085] To provide interaction with a user, the systems and techniques described herein can be implemented on an electronic device having: a display device (e.g., a CRT (cathode ray tube) or LCD (liquid crystal display) monitor) for displaying information to the user; and a keyboard and pointing device (e.g., a mouse or trackball) through which the user provides input to the electronic device. Other types of devices can also be used to provide interaction with the user; for example, feedback provided to the user can be any form of sensory feedback (e.g., visual feedback, auditory feedback, or tactile feedback); and input from the user can be received in any form (including sound input, voice input, or tactile input).

[0086] The systems and technologies described herein can be implemented in computing systems that include backend components (e.g., as data servers), or middleware components (e.g., application servers), or frontend components (e.g., user computers with graphical user interfaces or web browsers through which users can interact with implementations of the systems and technologies described herein), or any combination of such backend, middleware, or frontend components. The components of the system can be interconnected via digital data communication of any form or medium (e.g., communication networks). Examples of communication networks include local area networks (LANs), wide area networks (WANs), blockchain networks, and the Internet.

[0087] A computing system can include clients and servers. Clients and servers are generally located far apart and typically interact through communication networks. The client-server relationship is created by computer programs running on the respective computers and having a client-server relationship with each other. The server can be a cloud server, also known as a cloud computing server or cloud host, which is a hosting product within the cloud computing service system to address the shortcomings of traditional physical hosts and VPS services, such as high management difficulty and weak business scalability.

[0088] It should be understood that the various forms of processes shown above can be used, with steps reordered, added, or deleted. For example, the steps described in this invention can be executed in parallel, sequentially, or in different orders, as long as the desired result of the technical solution of this invention can be achieved, and this is not limited herein.

[0089] The specific embodiments described above do not constitute a limitation on the scope of protection of this invention. Those skilled in the art should understand that various modifications, combinations, sub-combinations, and substitutions can be made according to design requirements and other factors. Any modifications, equivalent substitutions, and improvements made within the spirit and principles of this invention should be included within the scope of protection of this invention.

Claims

1. A method for determining the path of a water conveyance tunnel, characterized in that, The method includes: Based on the digital surface elevation model and multi-source constraint information corresponding to the water conveyance tunnel, multiple grids corresponding to the water conveyance tunnel are determined; wherein, any one of the multiple grids includes surface elevation attributes and constraint attributes; Based on the starting grid and the ending grid among the plurality of grids, determine the straight path corresponding to the starting grid and the ending grid; Based on the surface elevation attributes of each grid in the straight path, continuous high-depth blocking segments in the straight path are identified, resulting in multiple blocking segments; For any one of the multiple blocking segments, the blocking segment is expanded to obtain a search window corresponding to the blocking segment, and multiple local connected regions of the search window are extracted; Based on the plurality of locally connected regions, generate a regional path; and based on the plurality of locally connected regions, determine the internal path of the plurality of locally connected regions; The detour path corresponding to the blocked segment is obtained through the regional path and the internal path of the multiple locally connected regions. The multiple blocked segments in the straight path are replaced by the detour paths corresponding to the multiple blocked segments to generate the target path of the water conveyance tunnel.

2. The method according to claim 1, characterized in that, The method involves identifying continuous high-depth obstruction segments in the straight path based on the surface elevation attributes of each grid cell, resulting in multiple obstruction segments, including: For any grid cell in the straight path, determine the corresponding ground elevation based on the grid cell's position coordinates; Based on the surface elevation of the grid, determine whether the grid is in a high burial depth state; The length of the high-depth section is obtained based on a grid of multiple consecutive high-depth burial states. High-depth burial sections with a length greater than the preset length threshold are identified as blocking sections.

3. The method according to claim 1, characterized in that, The step of expanding the blocked segment to obtain the search window corresponding to the blocked segment includes: For any blocking segment, based on the starting point index, ending point index, and a preset number of extended grids of the blocking segment on the straight path, the target starting point index and the target ending point index are obtained, wherein the starting point index is the index of the starting point grid and the ending point index is the index of the ending point grid. The target starting point is obtained based on the target starting point index, and the target ending point is obtained based on the target ending point index; Based on the target starting point and the target ending point, obtain the normal vector corresponding to the direction vector between the target starting point and the target ending point; The search window is obtained based on the target starting point, the target ending point, the normal vector, and the initial expansion width.

4. The method according to claim 3, wherein obtaining the target start index and target end index based on the start index, end index, and preset number of extended grids of the blocking segment on the straight path includes: Subtracting the starting point index from the number of extended grid cells yields the target starting point index; The target endpoint index is obtained by adding the endpoint index to the extended grid number.

5. The method according to claim 4, characterized in that, The search window is obtained based on the target starting point, the target ending point, the normal vector, and the initial expansion width, including: The coordinates of the first vertex are obtained by adding the position coordinates of the target starting point to the extended coordinates, wherein the extended coordinates are obtained by multiplying the normal vector by the initial extended width; Subtracting the extended coordinates from the position coordinates of the target starting point yields the coordinates of the second vertex. Subtracting the extended coordinates from the position coordinates of the target endpoint yields the coordinates of the third vertex. Add the position coordinates of the target endpoint to the extended coordinates to obtain the coordinates of the fourth vertex; The search window is obtained based on the coordinates of the first vertex, the second vertex, the third vertex, and the fourth vertex.

6. The method according to claim 5, characterized in that, After obtaining the search window based on the target starting point, the target ending point, the normal vector, and the initial expansion width, the method further includes: If the search window cannot extract a locally connected region, and the initial expansion width is not greater than a preset threshold, then the initial expansion width is added to a preset value to obtain an updated expansion width. After determining the updated expansion width as the initial expansion width, the step of obtaining the search window based on the target start point, the target end point, the normal vector, and the initial expansion width is re-executed; or, If the search window cannot extract a locally connected region, and the initial expansion width is greater than a preset threshold, then the search ends.

7. The method according to claim 1, characterized in that, The extraction of multiple locally connected regions of the search window includes: For any given search window, the grid cells with constraint attributes set to a specified value are identified as passable grid cells. For any passable grid, other passable grids adjacent to the passable grid are determined as grids that have a connectivity relationship with the passable grid; The plurality of locally connected regions are obtained based on each passable grid and the grids that are connected to each passable grid.

8. The method according to claim 3, characterized in that, Based on the multiple locally connected regions, a regional path is generated, including: For any two locally connected regions, determine the boundary distance between the two locally connected regions based on the boundary points in the two locally connected regions; If the boundary distance is not greater than a preset length threshold, then the two locally connected regions are taken as region nodes, and the straight line corresponding to the boundary distance is taken as an edge, thus obtaining a region topology graph. A regional topology network is obtained based on multiple regional topology maps, wherein the regional topology network includes multiple regional topology maps; Based on the first locally connected region where the target starting point is located and the second locally connected region where the target ending point is located, a regional path is determined between the first locally connected region and the second locally connected region in the regional topology network.

9. The method according to claim 1, characterized in that, The step of determining the internal paths of the plurality of locally connected regions based on the plurality of locally connected regions includes: For any locally connected region, the internal path of the locally connected region is obtained based on the two boundary points in the locally connected region; The step of obtaining the detour path corresponding to the blocked segment through the regional path and the internal paths of the multiple locally connected regions includes: The regional path and the internal paths of the multiple locally connected regions are sequentially spliced ​​together in a preset order to obtain the detour path corresponding to the blocking segment.

10. An electronic device, characterized in that, The electronic device includes: At least one processor; and A memory communicatively connected to the at least one processor; wherein, The memory stores a computer program that can be executed by the at least one processor, the computer program being executed by the at least one processor to enable the at least one processor to perform the method for determining the path of the water conveyance tunnel as described in any one of claims 1-9.

Images