Tunnel fissure rock mass grouting diffusion radius and hole arrangement design method and system

Abstract

The application belongs to the technical field of underground engineering, and discloses a tunnel fissure rock mass grouting diffusion radius and hole arrangement design method and system, which comprises the following steps: a three-dimensional model of tunnel fissure is established within the grouting range, a fissure fitting surface is obtained according to the model, a center of the fissure fitting surface is obtained, the center is projected on the tunnel face to obtain a fissure surface projection point; all the fissure surface projection points are clustered and grouped, and a minimum covering circle of each cluster group is established to obtain the center coordinates and the radius of the minimum covering circle; the relationship between the slurry diffusion radius and the grouting hole position and quantity is established in each minimum covering circle; and the slurry diffusion radius and the grouting hole quantity are iteratively optimized to obtain the optimal slurry diffusion radius and the grouting hole quantity. The application effectively reduces the subjectivity in the traditional design method, improves the scientificity and accuracy of the grouting scheme, and thus improves the effect and economic benefit of grouting reinforcement.

Description

Technical Field

[0001] This invention relates to the field of underground engineering technology, and in particular to a method and system for designing the diffusion radius and hole layout of grouting in fractured rock masses in tunnels. Background Technology

[0002] The statements in this section are merely background information related to the present invention and do not necessarily constitute prior art.

[0003] During tunnel construction, major engineering disasters such as collapses and sudden water inrushes are frequently encountered, severely impacting construction progress and posing serious threats to the ecological environment and the safety of construction workers. To address these issues, grouting technology has become a crucial means of preventing and controlling tunnel water and mud inrush disasters, and it has been widely applied in practical engineering projects. When geological conditions, such as the distribution of fissures near the tunnel face, are largely known, pre-grouting of the unexcavated surrounding rock can effectively enhance the rock mass's bearing capacity and impermeability, reduce potential collapses and water inrushes during excavation, minimize the impact on construction equipment and personnel, and improve construction safety and excavation efficiency.

[0004] The design of a grouting scheme includes the design of grouting parameters, hole layout, and grouting materials and proportions. Among these, the design of grouting parameters, such as the grout diffusion range, and the layout scheme are the key aspects of the grouting design work, and to a certain extent, determine the effectiveness of the grouting reinforcement. The grout diffusion radius is determined by multiple factors, including the permeability of the stratum being grouted, the characteristics of the grouting material, and the grouting pressure. Within a reasonable grout diffusion range, a larger grout diffusion radius requires fewer grouting holes, but also results in a greater amount of ineffective grouting. Therefore, scientifically selecting the grout diffusion radius and rationally laying out the grouting holes is crucial for ensuring grouting effectiveness and improving economic efficiency.

[0005] Traditional methods for selecting the grout diffusion radius typically rely on empirical values, with grouting hole layout design based on these values. However, these traditional methods fail to establish a sufficient objective link between crack distribution and grouting design. Relying solely on experience to select the grout diffusion radius and design the grouting hole layout can be somewhat arbitrary, and improper design may lead to inadequate grout injection or localized over-grouting. Summary of the Invention

[0006] To address the aforementioned issues, this invention proposes a method and system for designing the diffusion radius and hole layout of grouting in fractured rock masses in tunnels. It statistically analyzes the spatial distribution information of fracture surfaces contained in the fracture model, establishing the guiding role of the fracture model in grouting design. This provides a theoretical basis for the design of grout diffusion radius and hole layout, effectively reducing the subjectivity in traditional design methods, improving the scientific nature and accuracy of grouting schemes, and thus enhancing the effectiveness and economic benefits of grouting reinforcement.

[0007] To achieve the above objectives, the present invention adopts the following technical solution:

[0008] In a first aspect, the present invention provides a method for designing the diffusion radius and hole layout of grouting in fractured rock mass of a tunnel, comprising the following steps:

[0009] Determine the grouting range, establish a three-dimensional model of the tunnel fracture within the grouting range, obtain the fracture fitting surface near the front of the tunnel face based on the three-dimensional model of the tunnel fracture, obtain the center of the fracture fitting surface circle, project the center of the fracture fitting surface circle onto the tunnel face, and obtain the fracture surface projection point.

[0010] Cluster all the projection points of the fracture surface and establish the minimum covering circle for each cluster group to obtain the center coordinates and radius of the minimum covering circle.

[0011] Within each minimum coverage circle, establish the relationship between the slurry diffusion radius and the location and number of grouting holes;

[0012] With the goal of minimizing grouting cost within each minimum coverage circle, the grout diffusion radius and the number of grouting holes are iteratively optimized to obtain the optimal grout diffusion radius and the number of grouting holes.

[0013] As an alternative implementation method, a three-dimensional model of the tunnel fracture is established, specifically as follows:

[0014] Acquire scanned images of the working face and high-resolution unfolded images of the borehole;

[0015] A semantic segmentation model is used to intelligently identify cracks in the scanned images of the tunnel face and the high-definition unfolded images of the borehole, resulting in crack-identified images of the tunnel face and the borehole.

[0016] A three-dimensional model of tunnel fractures was established based on the fracture identification images of the tunnel face and the fracture identification images of the borehole.

[0017] As an alternative implementation method, the minimum covering circle of each cluster group is established based on the random incremental method. The problem of finding the minimum covering circle of all projection points in each cluster group is transformed into several sub-problems to be solved. The covering circle is continuously updated and iterated until the constraint condition that all projection points are covered is met is satisfied.

[0018] As an alternative implementation, within each minimum coverage circle, the relationship between the slurry diffusion radius and the position and number of grouting holes is established based on the positional relationship between the slurry diffusion circle and the minimum coverage circle. The specific steps are as follows:

[0019] Projecting the grouting channel onto the working face, we obtain a series of circular grout diffusion projections. The radius of the grout diffusion projection circle is the grout diffusion radius.

[0020] The minimum slurry diffusion radius is selected as the initial value of the slurry diffusion projection circle radius. The first slurry diffusion projection circle is drawn at the origin with the center of the minimum coverage circle as the origin. Other slurry diffusion projection circles are drawn in a certain area in a quincunx pattern.

[0021] Traverse all slurry diffusion projection circles, retain slurry diffusion projection circles that do not intersect with the minimum coverage circle but whose center is inside the minimum coverage circle, or those that intersect with the minimum coverage circle, and calculate the number of slurry diffusion projection circles to obtain the grouting hole positions and number when the slurry diffusion radius is a certain value.

[0022] As an alternative implementation method, the slurry diffusion radius is increased within a certain range to establish a functional relationship between the slurry diffusion radius and the number of grouting holes.

[0023] As an alternative implementation method, the constraints for iteratively optimizing the slurry diffusion radius and the number of grouting holes include the relationship between the slurry diffusion radius and the number of grouting holes, the range of values ​​for the slurry diffusion radius, and the range of values ​​for the number of grouting holes.

[0024] Secondly, the present invention provides a system for designing the diffusion radius and hole layout of grouting in fractured rock masses in tunnels, comprising:

[0025] The projection point acquisition module is configured to: determine the grouting range, establish a three-dimensional model of the tunnel fracture within the grouting range, obtain the fracture fitting surface near the front of the tunnel face based on the three-dimensional model of the tunnel fracture, obtain the center of the fracture fitting surface, and project the center of the fracture fitting surface onto the tunnel face to obtain the fracture surface projection point.

[0026] The clustering and grouping module is configured to: cluster all fracture surface projection points and establish the minimum covering circle for each cluster group, and obtain the center coordinates and radius of the minimum covering circle;

[0027] The problem construction module is configured to establish the relationship between the slurry diffusion radius and the location and number of grouting holes within each minimum coverage circle;

[0028] The problem-solving module is configured to: with the goal of minimizing the grouting cost within each minimum coverage circle, iteratively optimize the grout diffusion radius and the number of grouting holes to obtain the optimal grout diffusion radius and the number of grouting holes.

[0029] Thirdly, the present invention provides an electronic device including a memory and a processor, and computer instructions stored in the memory and running on the processor, wherein the computer instructions, when executed by the processor, perform the method described in the first aspect.

[0030] Fourthly, the present invention provides a computer-readable storage medium for storing computer instructions, which, when executed by a processor, perform the method described in the first aspect.

[0031] Fifthly, the present invention provides a computer program product, including a computer program that, when executed by a processor, implements the method described in the first aspect.

[0032] Compared with the prior art, the beneficial effects of the present invention are as follows:

[0033] (1) The tunnel fracture rock mass grouting diffusion radius and hole layout design method provided by the present invention establishes an objective relationship between the tunnel fracture model and the selection of grout diffusion radius and hole layout design in grouting design based on the statistical analysis of the spatial distribution information of fracture surface contained in the fracture model. This significantly improves the information utilization rate of the geological fracture model, provides a theoretical basis for grout diffusion radius and hole layout design, effectively reduces the subjectivity in traditional design methods, and makes grouting design and hole layout design more scientific and reasonable.

[0034] (2) The method of establishing the minimum covering circle for the center of the fracture fitting surface adopted in this invention regularizes the required grouting area based on the clustering and grouping of the fracture fitting surface, providing a basis for directional grouting treatment; through clustering algorithm and hole location optimization, the grouting diffusion completely covers the required grouting area, ensuring that the grouting channel passes through all fracture surfaces in the grouting area, while avoiding the waste of useless grouting in areas with good geological conditions, thus improving the effect and economic benefits of grouting reinforcement.

[0035] (3) The tunnel fracture rock mass grouting diffusion radius and hole layout design method provided by the present invention establishes a grouting scheme design optimization method with grouting cost as the optimization target, realizes dynamic optimization and adjustment of grouting treatment, thereby effectively improving the construction efficiency of grouting treatment, and effectively controlling grouting cost under the premise of ensuring grouting treatment effect, and realizing the dual optimization of engineering efficiency and economic benefits.

[0036] Advantages of additional aspects of the invention will be set forth in part in the description which follows, and in part will be obvious from the description, or may be learned by practice of the invention. Attached Figure Description

[0037] The accompanying drawings, which form part of this invention, are used to provide a further understanding of the invention. The illustrative embodiments of the invention and their descriptions are used to explain the invention and do not constitute an improper limitation of the invention.

[0038] Figure 1 This is a flowchart of the tunnel fracture rock mass grouting diffusion radius and hole layout design method provided in Embodiment 1 of the present invention;

[0039] Figure 2 A flowchart for establishing the minimum covering circle of the present invention;

[0040] Figure 3 This is a flowchart illustrating the iterative optimization process for the slurry diffusion radius and the number of grouting holes in this invention. Detailed Implementation

[0041] The present invention will be further described below with reference to the accompanying drawings and embodiments.

[0042] It should be noted that the following detailed descriptions are exemplary and intended to provide further illustration of the invention. Unless otherwise specified, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this invention pertains.

[0043] It should be noted that the terminology used herein is for the purpose of describing particular embodiments only and is not intended to limit the scope of exemplary embodiments according to the invention. As used herein, unless the context clearly indicates otherwise, the singular form is intended to include the plural form as well. Furthermore, it should be understood that 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.

[0044] Where there is no conflict, the embodiments and features in the embodiments of the present invention can be combined with each other.

[0045] Example 1

[0046] like Figure 1 As shown, this embodiment provides a method for designing the diffusion radius and hole layout of grouting in fractured rock masses in tunnels, including the following steps:

[0047] S1. Determine the grouting range, establish a three-dimensional model of the tunnel fracture within the grouting range, obtain the fracture fitting surface near the front of the tunnel face based on the three-dimensional model of the tunnel fracture, obtain the center of the fracture fitting surface, project the center of the fracture fitting surface onto the tunnel face, and obtain the fracture surface projection point.

[0048] S2. Cluster all the projection points of the fracture surface and establish the minimum covering circle for each cluster group to obtain the center coordinates and radius of the minimum covering circle.

[0049] S3. Within each minimum coverage circle, establish the relationship between the slurry diffusion radius and the location and number of grouting holes;

[0050] S4. With the goal of minimizing the grouting cost within each minimum coverage circle, iteratively optimize the grout diffusion radius and the number of grouting holes to obtain the optimal grout diffusion radius and the number of grouting holes.

[0051] First, S1, determine the grouting range, establish a three-dimensional model of the tunnel fracture within the grouting range, obtain the fracture fitting surface near the front of the tunnel face based on the three-dimensional model of the tunnel fracture, obtain the center of the fracture fitting surface circle, and project the center of the fracture fitting surface circle onto the tunnel face to obtain the fracture surface projection point.

[0052] The grouting reinforcement range (i.e., the grouting range) includes the circumferential reinforcement range and the longitudinal reinforcement range, both of which can be calculated based on empirical formulas or directly derived from geological conditions and experience.

[0053] A three-dimensional model of the tunnel fracture was established within the grouting area, specifically as follows:

[0054] Acquire scanned images of the working face and high-resolution unfolded images of the borehole;

[0055] A semantic segmentation model is used to intelligently identify cracks in the scanned images of the tunnel face and the high-resolution unfolded images of the borehole, resulting in crack-identified images of the tunnel face and the borehole.

[0056] A three-dimensional model of the tunnel fracture was established based on the images of the tunnel face and borehole fractures.

[0057] Obtaining the coordinates of the projection points of the center of each crack fitting surface onto the tunnel face includes:

[0058] Based on the 3D model of the tunnel fracture, the fracture fitting surface near the front of the tunnel face is obtained. Then, the center of the fracture fitting surface within the grouting range is obtained. The center of the fracture fitting surface is projected onto the tunnel face to obtain the coordinates of the fracture surface projection point. x i , z i ).

[0059] S2. Cluster all the projection points of the fracture surface and establish the minimum covering circle for each cluster group to obtain the center coordinates and radius R of the minimum covering circle.

[0060] Clustering is performed by processing the projection points of the fracture surface using a clustering algorithm to obtain several cluster groups. Algorithms that can be used include hierarchical clustering, Mean Shift clustering, spectral clustering, and DBSCAN clustering. Preferably, aggregated hierarchical clustering is used, and the specific implementation method is as follows:

[0061] Data preparation: Project the coordinates of the fracture surface points ( x i , z i The dataset is organized into a clustering dataset.

[0062] Calculate the distance matrix: Select a metric to measure the similarity or distance between data points. Euclidean distance is preferred. Calculate the distance between each pair of fracture surface projection points in the dataset, forming a distance matrix. The Euclidean distance calculation formula is: .

[0063] Initialize clustering: Treat each fracture surface projection point in the dataset as a separate cluster.

[0064] Merging clusters: In the distance matrix, select the two clusters with the smallest distance, merge these two clusters into a new cluster, and update the distance matrix. When updating the distance matrix, a fully connected layer can be selected as the method for calculating the inter-cluster distance, that is, the distance between the two points farthest apart between two clusters is selected, which can make the shape of the newly generated cluster tend to be circular.

[0065] Iterative merging operation: Repeat the steps of merging clusters until all clusters are merged into a large cluster containing all fracture surface projection points.

[0066] Generate a dendrogram and select an appropriate number of clusters: Record and plot the merging process for each iteration into a dendrogram. The horizontal axis of the dendrogram represents data points or clusters, and the vertical axis represents the distance between clusters. Based on the structure of the dendrogram, select an appropriate threshold for cutting to determine the final number of clusters. The fracture surface projection points contained within each cluster form a cluster group.

[0067] Furthermore, the minimum coverage circle for each cluster group is established based on the random increment method, such as... Figure 2 As shown, the problem of finding the minimum covering circle of all projected points within each cluster group is transformed into several sub-problems to be solved. The covering circle is continuously updated and iterated until the constraint condition that all projected points are covered is met is satisfied. The specific implementation method is as follows:

[0068] To ensure algorithm stability, all fracture surface projection points in each cluster are randomly ordered. Let the processed point set be... Let the initial state of the minimum covering circle C be containing the first point p1, i.e., the center of the circle is p1 and the radius is 0. Construct a three-layer loop: the first loop starts from the second point p2 and checks each point one by one whether it is inside the current minimum covering circle C. If point p... i If (1≤i<n) is inside the circle (including on the circle), then skip that point and continue checking the next point; if point p i Outside circle C, then p i Construct a new circle C with center C and radius 0. i Enter the second loop. The second loop goes from p1 to p... i-1 In the set of points, check in turn whether these points are on circle C.i Inside. If point p j (1≤j<i) in circle C i If the point is within the range, skip that point and continue checking the next point; if point p... j In circle C i Outside, then p i p j Construct a new circle C at the diameter break point. j Enter the third loop. The third loop goes from p1 to p... j-1 In the set of points, check in turn whether these points are on circle C. j Inside. If point p k (1≤k<j) in circle C j If the point is within the range, skip that point and continue checking the next point; if point p... k In circle C j Outside, then p i p j and p k Construct a new circle C for a point on the circle. k After the third loop completes, the updated circle C will be... k Assign the value to circle C and return to the second loop; after the second loop ends, return to the first loop, until all points in the point set P have been traversed. At this point, circle C is the smallest covering circle that can cover all the fracture surface projection points in the cluster group.

[0069] By repeating the above search process in each cluster group, the minimum covering circle of each cluster group, along with its center coordinates and radius, can be obtained.

[0070] S3. Within each minimum coverage circle, establish the relationship between the slurry diffusion radius and the location and number of grouting holes.

[0071] Within each minimum coverage circle, the relationship between the grout diffusion radius and the position and number of grouting holes is established based on the positional relationship between the grout diffusion circle and the minimum coverage circle. Specific steps include:

[0072] Projecting the grouting channels onto the working face yields a series of circular grout diffusion projections, where the grouting channels are arranged in a quincunx pattern, and the radius r of the grout diffusion projection circle is the grout diffusion radius.

[0073] Select the minimum slurry diffusion radius r min Radius of the projected circle for slurry diffusion r The initial value is set, and the first slurry diffusion projection circle is drawn at the origin (0,0) with the center of the small covering circle as the origin. Other slurry diffusion projection circles are drawn in the region [-R,R] in a quincunx pattern.

[0074] Traverse all slurry diffusion projection circles, retain slurry diffusion projection circles that do not intersect with the minimum covering circle but whose center is inside the minimum covering circle, or those that intersect with the minimum covering circle, and calculate the number of slurry diffusion projection circles. This gives the position and number n of the grouting holes when the slurry diffusion radius is r.

[0075] Furthermore, the slurry diffusion radius r is made within [ r min , r max Within the interval, the slurry diffusion radius *r* is increased, and a functional relationship is established between the slurry diffusion radius *r* and the number of grouting holes *n*. r min , r max The results are obtained through field tests, assuming the grout material ratio is determined. Specifically, the number of grouting holes is consistent within a certain grout diffusion radius; that is, the decrease in the number of grouting holes is abrupt as the grout diffusion radius increases. Therefore, the grout diffusion radius can be used as a reference point. r Number of grouting holes n The relationship is fitted as a piecewise function.

[0076] The specific steps are as follows:

[0077] 1. Select a certain step size Δ r The above method is used to obtain a series of discrete data points. r , n ), and sort these data points according to r The values ​​are arranged in ascending order.

[0078] 2. Find n The value changes accordingly r Values, these r The value serves as the breakpoint of the piecewise function.

[0079] 3. Establish a piecewise function, for each interval, n The value is fixed and can be represented as:

[0080] ;

[0081] in, r 1, r 2, ... are the segmentation points. n 1, n 2, ... are the corresponding ones n value.

[0082] 4. Adjust the step size Δ r Then, collect discrete data again and substitute it into the piecewise function for verification to check whether the function fits the data correctly. If the fitting accuracy is low, the piecewise function needs to be adjusted again.

[0083] S4. With the goal of minimizing the grouting cost within each minimum coverage circle, iteratively optimize the grout diffusion radius and the number of grouting holes to obtain the optimal grout diffusion radius and the number of grouting holes.

[0084] like Figure 3 As shown, the iterative optimization of the slurry diffusion radius and the number of grouting holes belongs to the mixed integer nonlinear programming problem. Possible solution methods include: branch and bound method, Benders decomposition method, heuristic algorithms, etc. As a preferred method, the branch and bound method is selected, and the specific implementation method is as follows:

[0085] Determine the objective function. The grouting cost can be expressed as s = u ( r )+v( n ), where u ( r The radius of slurry diffusion is . r The cost of slurry materials at that time, v( n The value u represents the drilling cost when the number of grouting holes is n. r ) can be represented as ,in a Cost per unit volume of slurry material; v( n ) can be represented as Where b is the unit cost of drilling construction, including the cost of drill bits, water, etc., and c is other basic costs, including equipment purchase or rental fees, labor costs, etc.

[0086] Define the constraints. These constraints include the relationship between the slurry diffusion radius and the number of grouting holes. The range of values ​​for the slurry diffusion radius [ r min , r max The range of values ​​for the number of grouting holes is [1, ...]. n max ]and n ∈Z + The range of values ​​for the grout diffusion radius can be obtained through field tests, provided the grout material ratio is determined. The maximum number of grouting holes... n max The appropriate method should be chosen based on the actual situation on site.

[0087] To optimize problem relaxation, set initial upper and lower bounds for the objective function. Remove the number of grouting holes. n The constraint is an integer, which transforms the problem into a nonlinear programming problem with only continuous variables. Solving this problem yields the initial lower bound of the objective function s, and the initial upper bound is set to a large value, which can be positive infinity.

[0088] Branching to generate subproblems. The number of grouting holes is chosen for branching. Specifically, for the relaxed nonlinear programming problem, the variables are assumed... n The current range of values ​​is , will variables n Divided into two sub-intervals and This results in two nonlinear programming subproblems. For each newly generated subproblem, the branching process described above is repeated, continuously refining the space to form a tree structure, where each node represents a subproblem.

[0089] Update the upper bound of the objective function. After each branch, solve the resulting subproblems and check the lower bound of their objective functions. s *Is it better than the current upper bound, i.e., the grouting cost is lower? If so, update the upper bound to the lower bound of the objective function of this subproblem. s * and record the corresponding variable value. n *、 r *; If not, then discard the subproblem and do not need to branch further on this subproblem, i.e., pruning operation.

[0090] Repeat the branching, bounding, and pruning operations described above to gradually narrow the search space until all subproblems are pruned or the preset number of iterations is reached. If the number of grouting holes recorded at this point... n If the integer is not an integer, then search for nearby integer points. Substitute these integer points into the objective function, calculate and compare the objective function values, and select the integer that minimizes the objective function value. The resulting global upper bound is the optimal solution to the mixed-integer nonlinear programming problem, i.e., the minimum cost of grouting within the current minimum coverage circle.

[0091] The optimal solutions for all minimum covering circles constitute the overall optimal solution, which represents the minimum grouting cost within the grouting range, along with the corresponding number of grouting holes and the grout diffusion radius. The grouting holes are arranged in a quincunx pattern within each minimum covering circle, thus determining the hole placement.

[0092] Example 2

[0093] This embodiment provides a system for designing the diffusion radius and borehole layout of grouting in fractured rock masses in tunnels, including:

[0094] The projection point acquisition module is configured to: determine the grouting range, establish a three-dimensional model of the tunnel fracture within the grouting range, obtain the fracture fitting surface near the front of the tunnel face based on the three-dimensional model of the tunnel fracture, obtain the center of the fracture fitting surface, and project the center of the fracture fitting surface onto the tunnel face to obtain the fracture surface projection point.

[0095] The clustering and grouping module is configured to: cluster all fracture surface projection points and establish the minimum covering circle for each cluster group, and obtain the center coordinates and radius of the minimum covering circle;

[0096] The problem construction module is configured to establish the relationship between the slurry diffusion radius and the location and number of grouting holes within each minimum coverage circle;

[0097] The problem-solving module is configured to: with the goal of minimizing the grouting cost within each minimum coverage circle, iteratively optimize the grout diffusion radius and the number of grouting holes to obtain the optimal grout diffusion radius and the number of grouting holes.

[0098] It should be noted that the above modules correspond to the steps described in Embodiment 1, and the examples and application scenarios implemented by the above modules and the corresponding steps are the same, but are not limited to the content disclosed in Embodiment 1. It should also be noted that the above modules, as part of the system, can be executed in a computer system such as a set of computer-executable instructions.

[0099] In further embodiments, the following is also provided:

[0100] An electronic device includes a memory and a processor, as well as computer instructions stored in the memory and running on the processor, wherein the computer instructions, when executed by the processor, perform the method described in Embodiment 1. For brevity, further details are omitted here.

[0101] It should be understood that in this embodiment, the processor can be a central processing unit (CPU), or it can be other general-purpose processors, digital signal processors (DSPs), application-specific integrated circuits (ASICs), programmable gate arrays (FPGAs), or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. The general-purpose processor can be a microprocessor or any conventional processor, etc.

[0102] Memory may include read-only memory and random access memory, and provides instructions and data to the processor. A portion of memory may also include non-volatile random access memory. For example, memory may also store information about the device type.

[0103] A computer-readable storage medium for storing computer instructions, which, when executed by a processor, perform the method described in Embodiment 1.

[0104] The method in Example 1 can be directly implemented by a hardware processor, or implemented by a combination of hardware and software modules within the processor. The software modules can reside in readily available storage media in the field, such as random access memory, flash memory, read-only memory, programmable read-only memory, electrically erasable programmable memory, or registers. This storage medium is located in memory, and the processor reads information from the memory and, in conjunction with its hardware, completes the steps of the above method. To avoid repetition, a detailed description is not provided here.

[0105] A computer program product includes a computer program that, when executed by a processor, implements the method described in Embodiment 1.

[0106] The present invention also provides at least one computer program product tangibly stored on a non-transitory computer-readable storage medium. The computer program product includes computer-executable instructions, such as instructions included in program modules, which execute in a device on a target real or virtual processor to perform the processes / methods described above. Typically, program modules include routines, programs, libraries, objects, classes, components, data structures, etc., that perform specific tasks or implement specific abstract data types. In various embodiments, the functionality of program modules can be combined or divided among program modules as needed. The machine-executable instructions for the program modules can execute within a local or distributed device. In a distributed device, the program modules can reside in both local and remote storage media.

[0107] The computer program code used to implement the methods of the present invention may be written in one or more programming languages. This computer program code 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 computer or other programmable data processing device, the program code causes the functions / operations specified in the flowcharts and / or block diagrams to be implemented. The program code may be executed entirely on a computer, partially on a computer, as a stand-alone software package, partially on a computer and partially on a remote computer, or entirely on a remote computer or server.

[0108] In the context of this invention, computer program code or related data may be carried by any suitable carrier to enable a device, apparatus, or processor to perform the various processes and operations described above. Examples of carriers include signals, computer-readable media, and so on. Examples of signals may include electrical, optical, radio, sound, or other forms of propagation signals, such as carrier waves, infrared signals, etc.

[0109] Those skilled in the art will recognize that the units and algorithm steps described in conjunction with the embodiments herein can be implemented in electronic hardware or a combination of computer software and electronic hardware. Whether these functions are implemented in hardware or software depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of this application.

[0110] While the specific embodiments of the present invention have been described above in conjunction with the accompanying drawings, this is not intended to limit the scope of protection of the present invention. Those skilled in the art should understand that various modifications or variations that can be made by those skilled in the art without creative effort based on the technical solutions of the present invention are still within the scope of protection of the present invention.

Claims

1. A method for designing the diffusion radius and borehole layout of grouting in fractured rock mass of tunnels, characterized in that... Includes the following steps: Determine the grouting range, establish a three-dimensional model of the tunnel fracture within the grouting range, obtain the fracture fitting surface near the front of the tunnel face based on the three-dimensional model of the tunnel fracture, obtain the center of the fracture fitting surface circle, project the center of the fracture fitting surface circle onto the tunnel face, and obtain the fracture surface projection point. Cluster all the projection points of the fracture surface and establish the minimum covering circle for each cluster group to obtain the center coordinates and radius of the minimum covering circle. Within each minimum coverage circle, establish the relationship between the slurry diffusion radius and the location and number of grouting holes; With the goal of minimizing grouting cost within each minimum coverage circle, the grout diffusion radius and the number of grouting holes are iteratively optimized to obtain the optimal grout diffusion radius and the number of grouting holes. Within each minimum coverage circle, the relationship between the grout diffusion radius and the position and number of grouting holes is established based on the positional relationship between the grout diffusion circle and the minimum coverage circle. The specific steps are as follows: Projecting the grouting channel onto the working face, we obtain a series of circular grout diffusion projections. The radius of the grout diffusion projection circle is the grout diffusion radius. The minimum slurry diffusion radius is selected as the initial value of the slurry diffusion projection circle radius. The first slurry diffusion projection circle is drawn at the origin with the center of the minimum coverage circle as the origin. Other slurry diffusion projection circles are drawn in a certain area in a quincunx pattern. Traverse all slurry diffusion projection circles, retain slurry diffusion projection circles that do not intersect with the minimum coverage circle but whose center is inside the minimum coverage circle, or those that intersect with the minimum coverage circle, and calculate the number of slurry diffusion projection circles to obtain the grouting hole positions and number when the slurry diffusion radius is a certain value.

2. The method for designing the diffusion radius and hole layout of grouting in fractured rock mass in tunnels as described in claim 1, characterized in that, Establish a three-dimensional model of the tunnel fracture, specifically as follows: Acquire scanned images of the working face and high-resolution unfolded images of the borehole; A semantic segmentation model is used to intelligently identify cracks in the scanned images of the tunnel face and the high-definition unfolded images of the borehole, resulting in crack-identified images of the tunnel face and the borehole. A three-dimensional model of tunnel fractures was established based on the fracture identification images of the tunnel face and the fracture identification images of the borehole.

3. The method for designing the diffusion radius and hole layout of grouting in fractured rock mass in tunnels as described in claim 1, characterized in that, The minimum covering circle for each cluster group is established based on the random incremental method. The problem of finding the minimum covering circle for all projected points in each cluster group is transformed into several sub-problems to be solved. The covering circle is continuously updated and iterated until the constraint condition that all projected points are covered is met.

4. The method for designing the diffusion radius and hole layout of grouting in fractured rock mass in tunnels as described in claim 1, characterized in that, The diffusion radius of the slurry is increased within a certain range, and a functional relationship between the diffusion radius of the slurry and the number of grouting holes is established.

5. The method for designing the diffusion radius and hole layout of grouting in fractured rock mass in tunnels as described in claim 1, characterized in that, The constraints for iterative optimization of the grout diffusion radius and the number of grouting holes include the relationship between the grout diffusion radius and the number of grouting holes, the range of values ​​for the grout diffusion radius, and the range of values ​​for the number of grouting holes.

6. A grouting diffusion radius and hole layout design system for fractured rock mass in tunnels, characterized in that, include: The projection point acquisition module is configured to: determine the grouting range, establish a three-dimensional model of the tunnel fracture within the grouting range, obtain the fracture fitting surface near the front of the tunnel face based on the three-dimensional model of the tunnel fracture, obtain the center of the fracture fitting surface, and project the center of the fracture fitting surface onto the tunnel face to obtain the fracture surface projection point. The clustering and grouping module is configured to: cluster all fracture surface projection points and establish the minimum covering circle for each cluster group, and obtain the center coordinates and radius of the minimum covering circle; The problem construction module is configured to establish the relationship between the slurry diffusion radius and the location and number of grouting holes within each minimum coverage circle; The problem-solving module is configured to: with the goal of minimizing the grouting cost within each minimum coverage circle, iteratively optimize the grout diffusion radius and the number of grouting holes to obtain the optimal grout diffusion radius and the number of grouting holes; Within each minimum coverage circle, the relationship between the grout diffusion radius and the position and number of grouting holes is established based on the positional relationship between the grout diffusion circle and the minimum coverage circle. The specific steps are as follows: Projecting the grouting channel onto the working face, we obtain a series of circular grout diffusion projections. The radius of the grout diffusion projection circle is the grout diffusion radius. The minimum slurry diffusion radius is selected as the initial value of the slurry diffusion projection circle radius. The first slurry diffusion projection circle is drawn at the origin with the center of the minimum coverage circle as the origin. Other slurry diffusion projection circles are drawn in a certain area in a quincunx pattern. Traverse all slurry diffusion projection circles, retain slurry diffusion projection circles that do not intersect with the minimum coverage circle but whose center is inside the minimum coverage circle, or those that intersect with the minimum coverage circle, and calculate the number of slurry diffusion projection circles to obtain the grouting hole positions and number when the slurry diffusion radius is a certain value.

7. An electronic device, characterized in that, It includes a memory and a processor, as well as computer instructions stored in the memory and running on the processor, which, when executed by the processor, perform the method according to any one of claims 1-5.

8. A computer-readable storage medium, characterized in that, Used to store computer instructions, which, when executed by a processor, perform the method described in any one of claims 1-5.

9. A computer program product, characterized in that, Includes a computer program, which, when executed by a processor, implements the method described in any one of claims 1-5.

Images