Reactor component cutting method

Abstract

The embodiment of the invention relates to the technical field of computer-aided simulation, in particular to a reactor component cutting method. The cutting method comprises the following steps from S1 to S5: S1: obtaining geometric parameters and physical attribute parameters of a reactor; s2, determining a digital model of the reactor according to the geometric parameters and the physical attribute parameters of the reactor; s3, according to the digital model, determining geometric parameters of each block after the reactor is cut into blocks; s4, cutting the reactor according to the geometric parameters of each cut block to obtain each cut block; and S5, verifying the geometric parameters of each block, and determining that each block meets a predetermined requirement. According to the cutting method provided by the embodiment of the invention, the weight and the shape of each cut block can meet the requirements, so that the block with the weight and the shape meeting the requirements is obtained in the actual cutting process, and subsequent loading work is facilitated.

Description

Technical Field

[0001] The embodiments of the present application relate to the field of computer-aided simulation technology, and in particular to a method for cutting a reactor component. Background Art

[0002] The statements herein merely provide background information related to the present application and do not necessarily constitute prior art.

[0003] The reactor has a large volume. After the reactor is decommissioned, it needs to be cut and the cut pieces are placed in a loading container for subsequent transportation. If the reactor is cut randomly or the cut pieces are placed randomly in the loading container, the loading space of the loading container will be wasted, thereby increasing the number of times the cut pieces are transported. Summary of the invention

[0004] A brief overview of the present application is provided below in order to provide a basic understanding of certain aspects of the present application. It should be understood that this overview is not an exhaustive overview of the present application. It is not intended to identify the key or important parts of the present application, nor is it intended to limit the scope of the present application. Its purpose is merely to present certain concepts in a simplified form as a prelude to a more detailed description discussed later.

[0005] An embodiment of the present application provides a method for cutting reactor components, including the following steps S1 to S5: S1: obtaining geometric parameters and physical property parameters of the reactor; S2: determining a digital model of the reactor based on the geometric parameters and physical property parameters of the reactor; S3: determining the geometric parameters of each block after the reactor is cut into pieces based on the digital model; S4: cutting the reactor based on the geometric parameters of each block to obtain each block after cutting; S5: verifying the geometric parameters of each block to determine whether each block meets predetermined requirements.

[0006] The reactor component cutting method provided in the embodiment of the present application can ensure that the weight and shape of each block after cutting meet the requirements by simulating the cutting of the reactor digital model and verifying the geometric parameters of each block, thereby obtaining blocks with weight and shape meeting the requirements in the actual cutting process to facilitate subsequent loading work. BRIEF DESCRIPTION OF THE DRAWINGS

[0007] In order to further illustrate the above and other advantages and features of the present application, the specific embodiments of the present application are further described in detail below in conjunction with the accompanying drawings. The accompanying drawings together with the following detailed description are included in this specification and form a part of this specification. Elements with the same function and structure are represented by the same reference numerals. It should be understood that these drawings only describe typical examples of the present application and should not be regarded as limiting the scope of the present application.

[0008] Figure 1 is a schematic flow chart of a cutting method provided according to an embodiment of the present application;

[0009] Figure 2 It is a schematic diagram of the effect of verifying whether the cutting device will interfere with the existence space of the reactor in one embodiment of the present application;

[0010] Figure 3a This is a schematic diagram of the effect of verifying the feasibility of cutting in an embodiment of the present application;

[0011] Figure 3b is a schematic diagram of the effect of verifying the feasibility of cutting in another embodiment of the present application;

[0012] Figure 4 It is a schematic diagram of using polygons instead of blocks in one embodiment of the present application;

[0013] Figure 5 is a schematic diagram of a critical polygon of an embodiment of the present application;

[0014] Figure 6 is a schematic diagram of an inner critical polygon of an embodiment of the present application;

[0015] Figure 7 is a schematic diagram of a proposed discharge position of an embodiment of the present application;

[0016] Figure 8 is a schematic diagram of a dischargeable position of an embodiment of the present application;

[0017] Figure 9a is a schematic diagram of the outline areas of all polygons of an embodiment of the present application;

[0018] Figure 9b is a schematic diagram of the enveloping rectangular area of ​​an embodiment of the present application;

[0019] Fig.9c is a schematic diagram of an overlapping area S3 of an embodiment of the present application;

[0020] Fig.10 is a schematic diagram of a layout diagram output by an embodiment of the present application;

[0021] Fig.11 It is a curve chart of the relationship between the maximum plane utilization rate of the cut pieces and the total cutting time and the total number of cut pieces generated by an embodiment of the present application.

[0022] It should be noted that the drawings are not necessarily drawn to scale, but are merely shown in a schematic manner that does not affect the reader's understanding.

[0023] Description of reference numerals: 100, cut; 200, polygon; 300, critical polygon; 400, inner critical polygon; 500, sample arrangement area; 600, intended sample arrangement position; 700, possible sample arrangement position;

[0024] 10. Cutting device; 20. Cutting laser; 30. Reactor assembly. DETAILED DESCRIPTION

[0025] Exemplary embodiments of the present application will be described below in conjunction with the accompanying drawings. For the sake of clarity and conciseness, not all features of the actual implementation are described in the specification. However, it should be understood that many implementation-specific decisions must be made in the process of developing any such actual implementation in order to achieve the developer's specific goals, such as meeting those constraints related to the system and business, and these constraints may vary from implementation to implementation. In addition, it should be understood that although the development work may be very complex and time-consuming, it is only a routine task for those skilled in the art who benefit from the content of this application.

[0026] It is also necessary to explain here that, in order to avoid obscuring the present application due to unnecessary details, only the device structure and / or processing steps closely related to the scheme according to the present application are shown in the accompanying drawings, while other details that are not very relevant to the present application are omitted.

[0027] The disclosure below provides a plurality of different embodiments or examples to implement the present application. In order to simplify the disclosure of the present application, the parts and methods of specific examples are described below. Of course, they are merely examples, and the purpose is not to limit the present application. In the description of the embodiments of the present application, the meaning of "multiple" is at least two, such as two, three, etc., unless otherwise clearly and specifically limited.

[0028] When a decommissioned reactor is cut into multiple pieces, if the shapes and weights of the pieces are similar, loading space and time can be saved when the pieces are loaded into a loading container. However, the structure of the reactor is relatively complex, and the shapes of different positions vary greatly. It is very difficult to cut the reactor into pieces that meet the requirements.

[0029] To solve the above problems, see Figure 1 , an embodiment of the present application provides a reactor component cutting method, comprising the following steps S1 to S5:

[0030] S1: Obtain the geometric parameters and physical property parameters of the reactor.

[0031] S2: Determine the digital model of the reactor based on the geometric parameters and physical property parameters of the reactor.

[0032] S3: According to the digital model, determine the geometric parameters of each block after the reactor is cut.

[0033] S4: Cut the reactor according to the geometric parameters of each cut block to obtain each cut block.

[0034] S5: Verify the geometric parameters of each cut block to ensure that each cut block meets the predetermined requirements.

[0035] The reactor component cutting method provided in the embodiment of the present application can ensure that the weight and shape of each block after cutting meet the requirements by simulating the cutting of the reactor digital model and verifying the geometric parameters of each block, thereby obtaining blocks with weight and shape meeting the requirements in the actual cutting process to facilitate subsequent loading work.

[0036] In some embodiments, in step S3, the following steps S31 to S33 are also included:

[0037] S31: Determine the relationship between the geometric parameters of each cut block and the total number of cut blocks according to the digital model.

[0038] S32: Determine the total number of cut blocks according to the value range of the geometric parameters of each cut block and the relationship between the geometric parameters of each cut block and the total number of cut blocks.

[0039] S33: Determine the geometric parameters of each cut block according to the total number of cut blocks.

[0040] The value range of the geometric parameters of each cut block will be limited by the relevant parameters of the specific equipment. For example, when the number of cut blocks is too small, the weight of a single cut block will be too heavy, making it impossible to be lifted by the lifting device. Therefore, the geometric parameter of the weight of the cut block will be limited by the maximum lifting weight of the lifting device. The geometric parameters of each cut block determined by the above method can meet the parameter requirements of the specific equipment, thereby ensuring that the cutting work can be completed smoothly.

[0041] In some embodiments, in step S32, the total number of slices satisfies the following expression:

[0042]

[0043] Where X is the total number of blocks; g1(X) is the chord length corresponding to the outer arc length of a single block; b1 is the bottom side length of the loading container used to load the blocks; g2(X) is the weight of a single block; b2 is the maximum lifting weight of the lifting device used to lift the blocks; T(X) is the total cutting time; Z(X) is the space utilization rate, and st represents the linear constraint.

[0044] Through the above expressions, the total cutting time, space utilization, side length of the loading container and the maximum lifting weight of the lifting device can be optimized by multi-objective optimization to calculate the accurate total number of cut pieces.

[0045] In some embodiments, in step S31, the relationship between the chord length corresponding to the outer arc length of a single cut block and the total number of cut blocks satisfies the following expression:

[0046]

[0047] Where r is the radius of the outer arc of the cut block.

[0048] According to the above expression, the relationship between the chord length corresponding to the outer arc length of a single cut block and the total number of cut blocks can be obtained more accurately, so as to more accurately determine the range of the total number of cut blocks.

[0049] In some embodiments, in step S31, the relationship between the weight of a single cut piece and the total number of cut pieces satisfies the following expression:

[0050]

[0051] Where M is the mass of the structure to be cut.

[0052] According to the above expression, the relationship between the weight of a single cut piece and the total number of cut pieces can be obtained more accurately, so as to more accurately determine the range of the total number of cut pieces.

[0053] In some embodiments, in step S31, the relationship between the total cutting time and the total number of cut pieces satisfies the following expression:

[0054]

[0055] Wherein, r1 and r2 are the radii of the outer arc and inner arc to be cut respectively, d is the sum of the radial and axial movement distances of the cutting device, and ν is the cutting speed of the cutting device.

[0056] According to the above expression, the relationship between the total cutting time and the total number of cut pieces can be obtained more accurately to more accurately determine the range of the total number of cut pieces.

[0057] In some embodiments, in step S32, the plane utilization of the cut block in the two-dimensional plane is used as the space utilization of the cut block in the loading container.

[0058] By converting the spatial utilization of the cut pieces in the loading container into the plane utilization of the cut pieces in a two-dimensional plane, the variable in one dimension can be reduced and the calculation process can be simplified.

[0059] In some embodiments, the cutting method also includes the following steps: replacing the cut block with a polygon; generating a nesting area, and generating critical polygons and inner critical polygons based on the polygon replacing the cut block; determining the position of the reference polygon in the nesting area; determining the best nesting position of the next polygon based on the nesting position of the reference polygon; determining the best nesting position of each polygon in turn, and obtaining the plane utilization of the cut block in the two-dimensional plane based on the best nesting position.

[0060] By using the above method, the optimal placement method corresponding to different numbers of blocks and the space utilization under the placement method can be determined. By comparing the space utilization corresponding to different numbers of blocks, the range of the total number of cut blocks can be determined more accurately.

[0061] In some embodiments, in step S5, verifying the geometric parameters of each cut block includes: verifying the feasibility of cutting; and verifying whether the cutting device will have spatial interference with the digital model of the reactor.

[0062] In the process of cutting, in addition to considering the properties of the reactor, it is also necessary to consider the relationship between the reactor and the cutting equipment. For example, when the gap between the reactor components is not enough for the cutting device, such as a manipulator, to pass through, it means that there is spatial interference with the cutting device. Although the total number of cuts meets the requirements, this cutting method is not feasible. By verifying the feasibility of cutting, the unfeasible cutting scheme can be modified in time to ensure the smooth completion of the cutting operation.

[0063] Figure 2 A schematic diagram is shown of the effect of verifying whether the cutting device will interfere with the existence space of the reactor in an embodiment of the present application. It can be seen that when the cutting device 10 simulated in the figure cuts one of the reactor components 30, the cutting device 10 "passes through" another reactor component 30, which means that in the actual cutting process, when the cutting device 10 cuts one of the reactor components 30, it will be blocked by another reactor component 30 and cannot be cut. Therefore, in actual cutting, this scheme is not used to cut the reactor.

[0064] In some embodiments, verifying the feasibility of cutting includes: simulating a cutting laser; and determining whether the simulated cutting laser can completely cut through the digital model of the reactor.

[0065] The length of the cutting laser is limited. If the reactor is thicker in one direction, the cutting laser cannot cut through the reactor, resulting in failure of cutting. By simulating the cutting laser and judging whether the cutting laser can completely cut through the digital model of the reactor, the above situation can be avoided and the cutting operation can be completed smoothly.

[0066] Figure 3a and Figure 3b The schematic diagrams of the effects of verifying the feasibility of cutting in two different embodiments are shown, wherein Figure 3a In the simulation, the length of the cutting laser 20 is shorter than the thickness of the reactor assembly 30, so it is determined that the simulated cutting laser cannot cut through the reactor, and this solution is not used to cut the reactor in actual cutting. Figure 3b In the embodiment, the length of the cutting laser 20 is longer than the thickness of the reactor assembly 30, so it is judged that the simulated cutting laser can cut through the reactor, and this solution can be used to cut the reactor in actual cutting.

[0067] In some embodiments, step S1 includes the following steps: setting a plurality of reference devices inside and outside the reactor, and establishing a coordinate system about the reactor according to the positions of the reference devices; setting a plurality of scanning points inside the reactor, recording the coordinates of the scanning points, and scanning the reactor at the scanning points, converting the scanned photos into point cloud data, and obtaining the geometric parameters and physical property parameters of the reactor according to the point cloud data.

[0068] In some embodiments, step S2 includes the following steps: importing point cloud data into modeling software, using modeling software to remove content that is not related to the reactor in the point cloud data, splicing and coloring the processed point cloud data according to the position of a reference device, and converting the spliced ​​and colored point cloud data into a digital model of the reactor.

[0069] like Figure 4 As shown, in some embodiments, polygons are used to replace cut blocks, specifically including: for cut blocks 100 with circular arcs, polygons 200 composed of the circumscribed polygon and the inscribed polygon of the circular arc are used to replace the cut blocks, where the polygons 200 meet two conditions: one is that the cut blocks can be completely covered, and the other is that the area is the smallest. Using polygons 200 to replace cut blocks 100 can simplify calculations when determining the arrangement positions of the cut blocks later.

[0070] like Figure 5 As shown, in some embodiments, a critical polygon 300 is generated based on the polygon 200 that replaces the cut block, specifically including: numbering the polygons, for example, numbering them as A, B, C..., for two polygons A and C, when polygon A and polygon C are in contact, a reference point is determined on polygon C, so that polygon C returns to the initial position after circling polygon A once, and polygon C does not rotate during the movement. The movement trajectory of the reference point is the critical polygon NFP AC By establishing the critical polygon 300, the subsequent processing process can be simplified.

[0071] like Figure 6As shown, in some embodiments, the inner critical polygon 400 is generated according to the polygon 200 replacing the cut block, specifically including: establishing a sample arrangement area 500 for simulating the bottom of the loading container, where the sample arrangement area 500 can be, for example, an inscribed decagon of the circular loading container, and in the case where the polygon C and the sample arrangement area 500 are in contact and do not intersect, a reference point is determined on the polygon C, so that the polygon C returns to the initial position after a circle around the sample arrangement area 500, and the polygon C does not rotate during the movement. The movement trajectory of the reference point is the inner critical polygon INFP C By establishing the inner critical polygon 400 , it can be ensured that the polygon C will not exceed the range of the pattern arrangement area 500 when moving on or inside the inner critical polygon.

[0072] In some embodiments, determining the position of a reference polygon in the pattern arrangement area 500 specifically includes: generating the pattern arrangement area 500, first determining the position of a first polygon A in the pattern arrangement area 500, and then determining the position of a second polygon B based on the critical polygon of polygon A and polygon B, where polygon A and polygon B are reference polygons.

[0073] like Figure 7 and Figure 8 As shown, in some embodiments, according to the arrangement position of the reference polygon, the optimal arrangement position of the next polygon is determined, specifically including: according to the critical polygon NFP of polygon C and polygon A AC , the critical polygon NFP of polygon C and polygon B BC and the inner critical polygon INFP between polygon C and the pattern arrangement area 500 C Determine the proposed arrangement position 600 of polygon C, where the proposed arrangement position 600 is the critical polygon NFP AC , critical polygon NFP BC and the inner critical polygon INFP C All vertices and their intersections.

[0074] Further, according to the determined proposed arrangement position 600, the arrangement position 700 of the polygon C is determined. Here, the arrangement position 700 is the position of the proposed arrangement position 600 located in the inner critical polygon INFP. C On the critical polygon NFP AC , critical polygon NFP BC Points outside.

[0075] like Figures 9a to 9cAs shown, after setting polygon C in one of the available arrangement positions, the contour area S1, the enveloping rectangle area S2 and the overlapping area S3 of all polygons are obtained, wherein the contour area S is the area of ​​the polygon formed by the boundary lines of all polygons and the plate contour, the enveloping rectangle area S2 is the area of ​​the smallest rectangle that can cover all polygons, and the overlapping area S3 is the overlapping area of ​​the smallest rectangle that can cover the current arrangement polygon and the smallest rectangle that can cover the adjacent polygon. The best arrangement position of polygon C is determined according to the following sequence: first compare the contour area S1 when polygon C is set in different arrangement positions, when S1 has a unique minimum value, the position where the value is obtained is the best arrangement position of polygon C; when there are multiple positions that make S1 obtain the minimum value, compare the enveloping rectangle area S2 of polygon C at these positions, when S2 has a unique minimum value, the position where the value is obtained is the best arrangement position of polygon C; when there are multiple positions that make S2 ​​obtain the minimum value, compare the overlapping area S3 of polygon C at these positions, and the position where S3 takes the maximum value is the best arrangement position of polygon C. In some embodiments, polygon C may be set only on vertices of nestable positions to reduce the amount of calculation.

[0076] According to the above steps, the best nesting position of each polygon is determined in turn. Each time the best nesting position is determined, all polygons whose positions have been determined need to be considered. When a certain polygon does not have a nesting point, the above steps are terminated and the nesting diagram according to the nesting method is output. Fig.10 It is a schematic diagram of a layout diagram outputted by an embodiment of the present application, in which the ratio of the sum of the areas of the polygons 200 to the total area of ​​the layout region 500 is the plane utilization rate of the cut block in the two-dimensional plane.

[0077] In the above steps, the positions of the first polygon A and the second polygon B have a great influence on the plane utilization of the cut in the two-dimensional plane. Based on the above reasons, in some embodiments, multiple sample areas 500 can be generated, the position of the first polygon A in each sample area 500 is randomly generated, and the position of the second polygon B is randomly generated based on the critical polygon. More sample areas 500 are generated through operations such as crossover and mutation in the genetic algorithm. The above-mentioned operation of determining the plane utilization is performed on each sample area 500, and the plane utilization of multiple sample areas 500 is used as a fitness function, and the maximum value of the fitness function is output. When the maximum value is greater than or equal to the predetermined utilization, the maximum value of the fitness function is output as the maximum plane utilization Z of the total number of cuts. max(X). When the maximum value is less than the predetermined utilization rate, the existing layout area 500 is subjected to crossover, mutation and other operations to generate more layout areas 500, and the maximum value of the fitness function is recalculated. Each time a group of layout areas 500 is generated and the maximum value of the fitness function is calculated once, it is called an iteration. When the maximum value is greater than or equal to the predetermined utilization rate, or the number of iterations reaches the predetermined number of iterations, the maximum value of the fitness function under this condition is output as the maximum plane utilization rate Z of the total number of cuts. max (X).

[0078] Through the above steps, the best arrangement method can be found from a variety of arrangement methods, so as to more accurately determine the total number of cut pieces.

[0079] In some embodiments, step S32 further includes: generating a curve graph showing the relationship between the maximum plane utilization rate of the cut pieces and the total cutting time and the total number of cut pieces, and determining the total number of cut pieces based on the curve graph combined with other constraints.

[0080] It is easy to understand that when the total number of cuts reaches a certain value, the plane utilization of the cuts will basically not change if the total number of cuts is increased, but the total cutting time will further increase with the total number of cuts. By generating a curve graph, the optimal total number of cuts can be obtained at a glance.

[0081] See also Fig.11 , Fig.11 This is a graph of the relationship between the maximum plane utilization of the blocks and the total cutting time and the total number of blocks generated by an embodiment of the present application. The curve L1 in the figure represents the total cutting time, and the curve L2 represents the plane utilization of the blocks. It can be seen that when the total number of blocks is 10, the plane utilization of the blocks reaches the maximum of 76%, and as the total number of blocks further increases, the plane utilization of the blocks basically does not change. However, the total cutting time continues to increase from 8.8 minutes when there are 10 blocks to 10.8 minutes when there are 14 blocks. From the above content, it can be obtained that when the remaining constraints are met, 10 blocks is the optimal total number of blocks. When other constraints are not met, it is necessary to combine other constraints to jointly determine the optimal total number of blocks. For example, in the above embodiment, if the lifting weight of the lifting device requires the total number of blocks to be greater than or equal to 12, then 12 is the optimal total number of blocks.

[0082] The reactor component cutting method provided by the present application is described below with reference to specific embodiments.

[0083] A plurality of reference devices are set up inside and outside the reactor, and a coordinate system of the reactor is established according to the positions of the reference devices. A plurality of scanning points are set up inside the reactor, and the coordinates of the scanning points are recorded. The reactor is scanned at the scanning points, and the scanned photos are converted into point cloud data. The geometric parameters and physical property parameters of the reactor are obtained according to the point cloud data.

[0084] Import the point cloud data into the modeling software, use the modeling software to remove the content that is not for the reactor in the point cloud data, splice and color the processed point cloud data according to the position of the reference device, and convert the spliced ​​and colored point cloud data into a digital model of the reactor. According to the digital model, determine the chord length corresponding to the outer arc length of the cut block, the weight of a single cut block, the spatial utilization rate of the cut block, and the total cutting time, and determine the total number of cut blocks based on the above parameters. According to the total number of cut blocks, determine the geometric parameters of each cut block. According to the geometric parameters of each cut block, cut the reactor to obtain each cut block after cutting. Verify the geometric parameters of each cut block to verify whether the simulated laser can cut through the digital model of the reactor and whether the cutting device will interfere with the digital model of the reactor in space.

[0085] When determining the spatial utilization of the cut block, a polygon is used to replace the cut block. According to the polygon replacing the cut block, a critical polygon and an inner critical polygon are generated to generate multiple nesting areas. In each nesting area, the nesting position of the reference polygon is determined. According to the nesting position of the reference polygon, the best nesting position of the next polygon is determined. The best nesting position of each polygon is determined in turn until there is no nesting point in the new polygon. The nesting diagram and plane utilization corresponding to the nesting position are output. The multiple nesting areas are processed by genetic algorithm to obtain the maximum plane utilization, which is used as the spatial utilization under the total number of cut blocks.

[0086] After obtaining the space utilization under different total number of cuts, a curve graph of the maximum plane utilization of the cuts and the total cutting time and the total number of cuts is generated, and the total number of cuts is determined based on the curve graph combined with other constraints.

[0087] Regarding the embodiments of the present application, it should also be noted that, in the absence of conflict, the embodiments of the present application and the features therein can be combined with each other to obtain new embodiments.

[0088] The above are only specific implementation methods of the present application, but the protection scope of the present application is not limited thereto. The protection scope of the present application shall be based on the protection scope of the claims.

Claims

1. A method for cutting a reactor component, characterized in that: The following steps are involved: S1: Obtaining geometric parameters and physical property parameters of the reactor; S2: Determine a digital model of the reactor according to geometric parameters and physical property parameters of the reactor; S3: determining geometric parameters of each block after the reactor is cut into blocks according to the digital model; S4: cutting the reactor according to the geometric parameters of each cut block to obtain each cut block; S5: Verify the geometric parameters of each cut block to ensure that each cut block meets the predetermined requirements.

2. The cutting method according to claim 1, characterized in that: In step S3, the following steps are also included: S31: Determine the relationship between the geometric parameters of each cut block and the total number of cut blocks according to the digital model; S32: determining the total number of cut blocks according to the value range of the geometric parameter of each cut block and the relationship between the geometric parameter of each cut block and the total number of cut blocks; S33: Determine the geometric parameters of each cut block according to the total number of cut blocks.

3. The cutting method according to claim 2, characterized in that: In step S32, the total number of slices satisfies the following expression: Where X is the total number of blocks; g1(X) is the chord length corresponding to the outer arc length of a single block; b1 is the bottom side length of the loading container used to load the blocks; g2(X) is the weight of a single block; b2 is the maximum lifting weight of the lifting device used to lift the blocks; T(X) is the total cutting time; Z(X) is the space utilization rate, and st represents the linear constraint.

4. The cutting method according to claim 3, characterized in that: In step S31, the relationship between the chord length corresponding to the outer arc length of the single cut block and the total number of cut blocks satisfies the following expression: Where r is the radius of the outer arc of the cut block.

5. The cutting method according to claim 3, characterized in that: In step S31, the relationship between the weight of the single cut piece and the total number of cut pieces satisfies the following expression: Where M is the mass of the structure to be cut.

6. The cutting method according to claim 3, characterized in that: In step S31, the relationship between the total cutting time and the total number of cut pieces satisfies the following expression: Wherein, r1 and r2 are the radii of the outer arc and inner arc to be cut respectively, d is the sum of the radial and axial movement distances of the cutting device, and ν is the cutting speed of the cutting device.

7. The cutting method according to claim 3, characterized in that: In step S32, the plane utilization of the cut block on the two-dimensional plane is used as the space utilization of the cut block in the loading container.

8. The cutting method according to claim 7, characterized in that: The following steps are also included: Use polygons instead of blocks; Generate a sample arrangement area, and generate a critical polygon and an inner critical polygon according to the polygon that replaces the cut block; Determine the position of the reference polygon in the pattern arrangement area; Determine the best arrangement position of the next polygon according to the arrangement position of the reference polygon; The optimal arrangement position of each polygon is determined in turn, and the plane utilization rate of the cut block in the two-dimensional plane is obtained according to the optimal arrangement position.

9. The cutting method according to claim 1, characterized in that: In step S5, the verification of the geometric parameters of each cut block includes: Verify the feasibility of cutting; Verify whether the cutting device will have spatial interference with the digital model of the reactor.

10. The cutting method according to claim 9, characterized in that: The feasibility of verifying the cutting includes: Simulate cutting laser; Determine whether the simulated cutting laser can completely cut through the digital model of the reactor.

Images