Material cutting method, device, control system, storage medium and electronic device

Abstract

The present invention discloses a material cutting method, device, control system, storage medium and electronic device. Among them, the method includes: receiving attribute information of the material to be cut; inputting the attribute information of the material to be cut into a computing engine configured with a cutting optimization model, and generating nesting layout data of the material to be cut by using a greedy algorithm based on the lowest center-of-gravity positioning strategy and preset constraint conditions; obtaining an optimal cutting path based on the nesting layout data and a tabu search algorithm; wherein, the optimal cutting path includes a cutting path with the shortest cutting time for the material to be cut; generating a cutting control instruction corresponding to the material to be cut according to the optimal cutting path; and performing a cutting operation on the material to be cut according to the cutting control instruction to obtain a target cutting member. The present invention solves the technical problems of low utilization rate of steel and high consumption cost caused by the steel cutting method in the related art.

Description

Technical Field

[0001] The present invention relates to the technical field of automatic control, and in particular, to a method, device, control system, storage medium and electronic device for cutting materials. Background Art

[0002] Prefabricated buildings are a direction that needs to be vigorously developed. As one of the main structural types of prefabricated buildings, steel structures have the advantages of high strength, light self-weight, and environmental friendliness. Steel plates are used as their main component materials, and usually a flame cutter is used to cut according to different component requirements. The steel structure industry has a high degree of customization and various specifications of steel components. Currently, manual nesting of cutting parts of different specifications required on steel plates is mainly used, and only the cutting parts required for a single steel component are cut each time, resulting in a lack of nesting planning in terms of batches, a large amount of waste of the remaining amount of steel cutting, and low utilization rate of steel. Summary of the Invention

[0003] Embodiments of the present invention provide a method, device, control system, storage medium and electronic device for cutting materials, so as to at least solve the technical problems of low utilization rate of steel and high consumption cost caused by the steel cutting method in the related art.

[0004] According to one aspect of the embodiments of the present invention, a method for cutting materials is provided, including: receiving attribute information of the material to be cut;

[0005] Inputting the attribute information of the material to be cut into a computing engine configured with a cutting optimization model, and generating nesting layout data of the material to be cut by using a greedy algorithm based on a lowest center of gravity positioning strategy and preset constraint conditions; wherein, the nesting layout data includes an optimal cutting function value, and the optimal cutting function value corresponds to the minimum value of the linear weighted sum of the remaining area, cutting path length and cutter idle stroke length of the material to be cut; the lowest center of gravity positioning strategy is that when arranging polygons in the cutting shape, without overlapping of the polygons, the center of gravity of the polygon is close to the bottom edge of the material to be cut; obtaining an optimal cutting path based on the nesting layout data and a tabu search algorithm; wherein, the optimal cutting path includes a cutting path with the shortest cutting time for the material to be cut; generating a cutting control instruction corresponding to the material to be cut according to the optimal cutting path; and performing a cutting operation on the material to be cut according to the cutting control instruction to obtain a target cutting member.

[0006] According to another aspect of the embodiments of the present invention, a material cutting device is further provided, including: a receiving unit for receiving the attribute information of the material to be cut; a determining unit for inputting the attribute information of the material to be cut into a computing engine configured with a cutting optimization model, and generating nesting layout data of the material to be cut by using a greedy algorithm based on the lowest center-of-gravity positioning strategy and preset constraint conditions; wherein, the nesting layout data includes an optimal cutting function value, and the optimal cutting function value corresponds to the minimum value of the linear weighted sum of the remaining area of the material to be cut, the cutting path length, and the cutter idle stroke length; the lowest center-of-gravity positioning strategy is that when arranging polygons in the cutting shape, without overlap of the polygons, the center of gravity of the polygons is close to the bottom edge of the material to be cut; an obtaining unit for obtaining an optimal cutting path based on the nesting layout data and a tabu search algorithm; wherein, the optimal cutting path includes a cutting path with the shortest cutting time for the material to be cut; a generating unit for generating a cutting control instruction corresponding to the material to be cut according to the optimal cutting path; an executing unit for performing a cutting operation on the material to be cut according to the cutting control instruction to obtain a target cutting member.

[0007] According to still another aspect of the embodiments of the present invention, a material cutting control system is further provided, which is characterized by including a computing engine, a client, a storage server, and a numerical control cutting machine; wherein:

[0008] The client is used for receiving the attribute information of the material to be cut and sending the attribute information and a calculation request of the material to be cut to the computing engine;

[0009] The computing engine is used for inputting the attribute information of the material to be cut into a computing engine configured with a cutting optimization model, generating nesting layout data of the material to be cut by using a greedy algorithm based on the lowest center-of-gravity positioning strategy and preset constraint conditions; wherein, the nesting layout data includes an optimal cutting function value, and the optimal cutting function value corresponds to the minimum value of the linear weighted sum of the remaining area of the material to be cut, the cutting path length, and the cutter idle stroke length; the lowest center-of-gravity positioning strategy is that when arranging polygons in the cutting shape, without overlap of the polygons, the center of gravity of the polygons is close to the bottom edge of the material to be cut; obtaining an optimal cutting path based on the nesting layout data and a tabu search algorithm; wherein, the optimal cutting path includes a cutting path with the shortest cutting time for the material to be cut; generating a cutting control instruction corresponding to the material to be cut according to the optimal cutting path;

[0010] The storage server is used for storing the cutting control instruction;

[0011] The numerical control cutting machine is used for calling the cutting control instruction from the storage server and performing cutting numerical control instruction recognition and cutting operation.

[0012] According to another aspect of the embodiments of the present invention, an electronic device is further provided, including a memory and a processor. A computer program is stored in the memory, and the processor is configured to execute the above-mentioned material cutting method through the computer program.

[0013] According to another aspect of the embodiments of the present invention, a computer-readable storage medium is further provided. A computer program is stored in the computer-readable storage medium, wherein the computer program is configured to execute the above-mentioned material cutting method when running.

[0014] In the embodiments of the present invention, the method includes receiving attribute information of a material to be cut; inputting the attribute information of the material to be cut into a computing engine configured with a cutting optimization model to determine target cutting data; wherein the target cutting data includes an optimal cutting function value, and the optimal cutting function value corresponds to the minimum value of the linear weighted sum of the remaining area of the material to be cut, the cutting path length, and the idle stroke length of the cutting tool; generating a cutting control instruction corresponding to the material to be cut according to the target cutting data; and performing a cutting operation on the material to be cut according to the cutting control instruction to obtain a target cutting member. In the above method, since the target cutting data includes an optimal cutting function value, and the optimal cutting function value corresponds to the minimum value of the linear weighted sum of the remaining area of the material to be cut, the cutting path length, and the idle stroke length of the cutting tool, the embodiments of the present invention not only reduce the cost in the steel cutting process, but also significantly improve the utilization rate of steel, thereby solving the technical problems of low utilization rate of steel and high consumption cost caused by the steel cutting method in the related art. Description of the Drawings

[0015] The drawings described herein are used to provide a further understanding of the present invention and constitute a part of this application. The schematic embodiments of the present invention and their descriptions are used to explain the present invention and do not constitute an improper limitation to the present invention. In the drawings:

[0016] Figure 1 is a schematic diagram of an application environment of an optional material cutting method according to an embodiment of the present invention;

[0017] Figure 2 is a schematic diagram of an application environment of another optional material cutting method according to an embodiment of the present invention;

[0018] Figure 3 is a schematic flowchart of an optional material cutting method according to an embodiment of the present invention;

[0019] Figure 4 is a schematic flowchart of another optional material cutting method according to an embodiment of the present invention;

[0020] Figure 5It is a schematic flowchart of another optional material cutting method according to an embodiment of the present invention;

[0021] Figure 6 It is a schematic flowchart of another optional material cutting method according to an embodiment of the present invention;

[0022] Figure 7 It is a schematic structural diagram of an optional material cutting control system according to an embodiment of the present invention;

[0023] Figure 8 It is a schematic structural diagram of an optional material cutting device according to an embodiment of the present invention;

[0024] Figure 9 It is a schematic structural diagram of an optional electronic device according to an embodiment of the present invention. Detailed implementation manners

[0025] In order to enable those skilled in the art to better understand the solution of the present invention, the technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings in the embodiments of the present invention. Obviously, the described embodiments are only a part of the embodiments of the present invention, rather than all the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those of ordinary skill in the art without creative efforts shall fall within the protection scope of the present invention.

[0026] It should be noted that the terms "first", "second", etc. in the specification and claims of the present invention and the above-mentioned drawings 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 under appropriate circumstances so that the embodiments of the present invention described herein can be implemented in an order other than those illustrated or described herein. In addition, the terms "comprising" and "having" and any variations thereof are intended to cover non-exclusive inclusion. For example, a process, method, system, product or device including a series of steps or units is not necessarily limited to those clearly listed steps or units, but may include other steps or units not clearly listed or inherent to these processes, methods, products or devices.

[0027] According to one aspect of the embodiments of the present invention, a material cutting method is provided. Optionally, as an optional implementation manner, the above material cutting method can be but is not limited to being applied to, for example, Figure 1In the application environment shown. The application environment includes: a terminal device 102 for human-computer interaction with the user, a network 104, and a server 106. There can be human-computer interaction between the user 108 and the terminal device 102, and a material cutting application program runs in the terminal device 102. The above terminal device 102 includes a human-computer interaction screen 1022, a processor 1024, and a memory 1026. The human-computer interaction screen 1022 is used to display the attribute information of the material to be cut; the processor 1024 is used to obtain the attribute information of the material to be cut. The memory 1026 is used to store the attribute information of the above-mentioned material to be cut.

[0028] In addition, the server 106 includes a database 1062 and a processing engine 1064. The database 1062 is used to store the attribute information of the above-mentioned material to be cut. The processing engine 1064 is used to input the attribute information of the above-mentioned material to be cut into a computing engine configured with a cutting optimization model to determine target cutting data; wherein, the above-mentioned target cutting data includes an optimal cutting function value, and the above-mentioned optimal cutting function value corresponds to the minimum value of the linear weighted sum of the remaining area of the material to be cut, the cutting path length, and the cutter idle stroke length;

[0029] Generate a cutting control instruction corresponding to the above-mentioned material to be cut according to the above-mentioned target cutting data; send the above-mentioned cutting control instruction to the client of the above-mentioned terminal device 102.

[0030] In one or more embodiments, the above-mentioned material cutting method of the present application can be applied to Figure 2 the application environment shown. As Figure 2 shown, there can be human-computer interaction between the user 202 and the user device 204. The user device 204 includes a memory 206 and a processor 208. In this embodiment, the user device 204 can, but is not limited to, perform the operations performed by the above-mentioned terminal device 102 to obtain a cutting control instruction.

[0031] Optionally, the above-mentioned terminal device 102 and user device 204 include, but are not limited to, terminals such as mobile phones, tablets, laptops, PCs, in-vehicle electronic devices, wearable devices, etc. The above-mentioned network 104 can include, but is not limited to, a wireless network or a wired network. Among them, the wireless network includes: WIFI and other networks that implement wireless communication. The above-mentioned wired network can include, but is not limited to: wide area network, metropolitan area network, local area network. The above-mentioned server 106 can include, but is not limited to, any hardware device that can perform calculations. The above-mentioned server can be a single server, or a server cluster composed of multiple servers, or a cloud server. The above is only an example, and no limitation is made thereto in this embodiment.

[0032] To solve the above technical problems, as an alternative embodiment, an embodiment of the present invention provides a method for cutting materials, including the following steps:

[0033] S1. Receive the attribute information of the material to be cut.

[0034] In the embodiment of the present invention, the attribute information of the material to be cut includes, but is not limited to, component batch, polygon specifications of the component, component quantity, component type, and steel plate specifications for cutting, etc.

[0035] S2. Input the attribute information of the material to be cut into a computing engine configured with a cutting optimization model to determine the target cutting data; wherein, the target cutting data includes the optimal cutting function value, and the optimal cutting function value corresponds to the minimum value of the linear weighted sum of the remaining area of the material to be cut, the cutting path length, and the cutter idle stroke length.

[0036] In the embodiment of the present invention, the target cutting data includes that the model optimization target value is the minimum of the linear weighted sum of the remaining area of the steel, the cutting path length, and the idle stroke length, that is, f = min(ω 1 P steel S + ω 2 P cut D cut + ω 3 P labor D empty ), where ω 1 , ω 2 , ω 3 are all configurable weight parameters, P steel , P cut , P labor are the costs required for the corresponding items, S is the remaining area, D cut is the cutting path length, D empty is the idle stroke length; f is the model optimization target value.

[0037] S3. Generate a cutting control instruction corresponding to the material to be cut according to the target cutting data.

[0038] In the embodiment of the present invention, the cutting control instruction can be used for, but is not limited to, various numerical control cutting machines, or cutting instruments such as numerical control cutters.

[0039] S4. Execute a cutting operation on the material to be cut according to the cutting control instruction to obtain the target cutting component.

[0040] In an embodiment of the present invention, attribute information of a material to be cut is received; the attribute information of the material to be cut is input into a computing engine configured with a cutting optimization model to determine target cutting data; wherein the target cutting data includes an optimal cutting function value, and the optimal cutting function value corresponds to the minimum value of a linear weighted sum of the remaining area of the material to be cut, the cutting path length, and the idle stroke length of the cutting tool; a cutting control instruction corresponding to the material to be cut is generated according to the target cutting data; and a cutting operation is performed on the material to be cut according to the cutting control instruction to obtain a target cutting component. In the above method, since the target cutting data includes an optimal cutting function value, and the optimal cutting function value corresponds to the minimum value of a linear weighted sum of the remaining area of the material to be cut, the cutting path length, and the idle stroke length of the cutting tool, the utilization rate of steel is improved, thereby solving the technical problems of low utilization rate of steel and high consumption cost caused by the steel cutting method in the related art.

[0041] In one or more embodiments, the inputting the attribute information of the material to be cut into a computing engine configured with a cutting optimization model to determine target cutting data includes:

[0042] Based on the lowest center-of-gravity positioning strategy and preset constraint conditions, nesting layout data of the material to be cut is generated by using a greedy algorithm; wherein, the lowest center-of-gravity positioning strategy is that when arranging polygons in the cutting shape, the center of gravity of the polygon is close to the bottom edge of the material to be cut without overlap of the polygons.

[0043] Specifically, the center of gravity of each polygon can be calculated based on the triangle cutting method.

[0044] Based on the nesting layout data and a tabu search algorithm, an optimal cutting path is obtained; wherein the optimal cutting path includes a cutting path with the shortest cutting time for the material.

[0045] Here, the tabu search algorithm is a global step-by-step optimization algorithm. By putting the reached local optimal points into a tabu list and no longer searching for the points in the tabu list repeatedly, it is possible to avoid falling into a local optimum.

[0046] As an optional implementation manner, as Figure 3 shown, an embodiment of the present invention provides a material cutting method, including the following steps:

[0047] S302, receiving attribute information of a material to be cut;

[0048] S304. Input the attribute information of the material to be cut into a computing engine configured with a cutting optimization model. Based on the lowest center-of-gravity positioning strategy and preset constraint conditions, use the greedy algorithm to generate nesting layout data for the material to be cut; wherein, the nesting layout data includes an optimal cutting function value, and the optimal cutting function value corresponds to the minimum value of the linear weighted sum of the remaining area of the material to be cut, the cutting path length, and the idle stroke length of the cutting tool; the lowest center-of-gravity positioning strategy is that when arranging polygons in the cutting shape, without overlap of the polygons, the center of gravity of the polygons is close to the bottom edge of the material to be cut.

[0049] S306. Obtain the optimal cutting path based on the nesting layout data and the tabu search algorithm; wherein, the optimal cutting path includes the cutting path with the shortest cutting time for the material.

[0050] S308. Generate a cutting control instruction corresponding to the material to be cut according to the optimal cutting path.

[0051] S310. Perform a cutting operation on the material to be cut according to the cutting control instruction to obtain the target cut component.

[0052] In one or more embodiments, the above-mentioned generation of the nesting layout data for the material to be cut by using the greedy algorithm based on the lowest center-of-gravity positioning strategy and preset constraint conditions includes:

[0053] For each component in different batches, perform the following operations:

[0054] Configure the nesting two-dimensional plane to have the same length and width as the material to be cut.

[0055] For the two bottom corners of the above-mentioned nesting two-dimensional plane, obtain all the polygons required for different types of components in the current batch, and obtain the loss value when placed according to the lowest center-of-gravity positioning strategy, and select the arrangement set corresponding to the polygon with the smallest loss value; wherein, the above-mentioned loss value is the linear weighted sum of the first sum and the second sum, the first sum is the sum of the outer contour lengths of all polygons placed in the plane, and the second sum is the sum of the void areas formed by the above-mentioned polygons and the starting side of the nesting two-dimensional plane.

[0056] When the remaining components in the current batch cannot be placed in the above-mentioned nesting two-dimensional plane, or when the arrangement of all components in the current batch is completed, calculate the optimal cutting function value corresponding to the nesting two-dimensional plane.

[0057] When the above-mentioned optimal cutting function value is the smallest, use the arrangement set of the above-mentioned polygons as the nesting layout data of the above-mentioned nesting two-dimensional plane.

[0058] In one or more embodiments, the above-mentioned material cutting method further includes:

[0059] Calculate the above loss value in such a way that when the polygons share a common side, the contour length is only calculated once, and when the polygon shares a common side with the nesting two-dimensional plane, the length is not calculated.

[0060] In one or more embodiments, obtaining the optimal cutting path based on the above nesting layout data and the tabu search algorithm includes:

[0061] Initialize the fixed starting and ending points of cutting, and obtain all the closed figures in the above nesting layout data and the set of vertices corresponding to the closed figures; wherein, the above fixed starting and ending points include a fixed starting point and a fixed ending point;

[0062] Configure the tabu list in the above nesting layout data as an empty set, the neighborhood list as a set of closed figures, and the path list as an empty linked list;

[0063] Add the above fixed starting point to the above path list;

[0064] Traverse all the vertices corresponding to the set of closed figures in the above neighborhood list, and calculate the expected cutting path; wherein, the above expected cutting path is the sum of a first path and a second path, the above first path is the path sum from the above fixed starting point through subsequent vertices in the current path list, and the above second path is the path from the last point in the above path list to the above fixed ending point;

[0065] Select the vertex with the shortest above expected cutting path as the successor point and add it to the above path list, and add the closed figure to which the control point belongs to the above tabu list until the above neighborhood list is an empty list;

[0066] Add the above fixed ending point to the above path list;

[0067] Determine the path connecting the points in the above path list as the above optimal cutting path.

[0068] In one or more embodiments, the above preset constraint conditions include a spatial constraint condition and a sequential constraint condition;

[0069] The above spatial constraint condition includes: the above polygons to be arranged do not exceed the boundary of the material to be cut, and the above polygons do not overlap with each other;

[0070] The above sequential constraint condition includes: the polygons forming the same component are in adjacent positions, the components of the same batch need to be placed close to each other, and the components of different batches are arranged in sequence according to the batch order.

[0071] In the related art, nesting software is used to improve the utilization rate of steel, helping enterprises increase efficiency and production. However, the current nesting software does not consider the arrangement order of cut parts, resulting in a relatively long time interval for the completion of cutting of cut parts required for the same component, which affects the welding and output efficiency of the component. In addition, the current nesting algorithm only aims to maximize the utilization rate of steel, ignoring the carbon emissions and waste of idle travel time during the cutting process. Therefore, how to balance the steel plate utilization rate, the arrangement order of cut parts, the flame cutting path and the total idle travel time during the nesting process, and obtain the optimal nesting and cutting plan using the steel plate nesting optimization method based on cutting path optimization has become one of the keys to cost reduction, efficiency improvement, energy conservation and emission reduction in the steel structure industry.

[0072] Based on the above embodiments, in another application embodiment, as Figure 4 shown, the above-mentioned material cutting method further includes the following steps:

[0073] Step 1: Model the nesting problem, abstract the steel plate nesting problem into a polygon arrangement problem in a two-dimensional plane, and define the model input, model constraints and optimization objectives;

[0074] The above model input is the batch of components (the above-mentioned target cutting components), the polygon specifications of the components, the number of components, the types of components, and the steel plate specifications for cutting;

[0075] The above model constraints include:

[0076] Spatial constraint, that is, the polygons to be arranged cannot exceed the boundary of the steel plate for cutting, and the polygons cannot overlap each other.

[0077] Order constraint, that is, the polygons forming the same component need to be placed close to each other, the components of the same batch need to be placed close to each other, and the components of different batches are arranged in sequence according to the batch order.

[0078] The above model optimization objective is to minimize the linear weighted sum of the remaining area of the steel, the cutting path length, and the total time required for cutting.

[0079] Step 2: Solve the nesting layout. Based on the lowest center of gravity positioning strategy and the model in Step 1, use the greedy algorithm to generate a steel plate nesting layout plan; the lowest center of gravity positioning strategy is that when arranging polygons, on the premise that the polygons do not overlap, make the center of gravity of the polygons close to the bottom edge of the steel plate, improve the distribution density of the nesting area, and improve the utilization rate of the steel plate to be cut.

[0080] Step 3: Optimize the cutting path. Based on the tabu search algorithm, perform path planning on the layout plan generated in Step 2 to obtain the cutting path with the shortest operation time;

[0081] The specific implementation method of the above Step 2 includes the following steps:

[0082] Step 2.1: Initialize the nesting two-dimensional plane. The length and width of the above two-dimensional plane are the same as those of the steel plate used for cutting, and calculate the centroid of each polygon based on the triangle cutting method;

[0083] Step 2.2: For the two bottom corners of the two-dimensional plane, take all the polygons required for different types of components in the current batch, calculate the loss value when placing them according to the idea of the lowest centroid, and select the polygon arrangement method with the smallest loss value;

[0084] The above loss value is the linear weighted sum of the sum of the outer contour lengths of all polygons in the plane after placement and the sum of the void areas formed by the polygons and the starting side of the plane placement. Among them, when polygons share a side, the contour length is only calculated once, and when a polygon shares a side with the plane, the length is not calculated.

[0085] Step 2.3: Take the polygons required for other components in the current batch, calculate the loss value when placing them according to the idea of the lowest centroid, and select the polygon arrangement method with the smallest loss value;

[0086] Step 2.4: Repeat Step 2.3 until all the components in this batch are arranged, or no other components in this batch can be placed in the current plane;

[0087] Step 2.5: Calculate the objective function value in Step 1 of each nesting layout plan obtained in the previous steps, and select the plan with the smallest objective function value as the optimal layout plan for the current batch (including the above-mentioned target cutting data);

[0088] Step 2.6: If there are still unarranged components in this batch or there are still unarranged batches, repeat Steps 2.2 to 2.5, otherwise end.

[0089] The specific implementation method of the above Step 3 includes the following steps:

[0090] Step 3.1: Initialize the fixed start and end points of cutting, obtain all the closed figures and their corresponding vertex sets in the optimized layout plan obtained in Step 2, initialize the taboo table as an empty set, initialize the neighborhood table as the set of closed figures, and initialize the path table as an empty linked list;

[0091] Step 3.2: Initialize the current point as the fixed start point of cutting, and add the start point to the path table;

[0092] Step 3.3: Traverse all the vertices corresponding to the closed figures in the neighborhood table, calculate the expected cutting path, select the vertex with the shortest expected cutting path as the successor point and add it to the path table, and at the same time add the closed figure to which the control point belongs to the taboo table; the above expected cutting path is the sum of the paths from the start point through the subsequent vertices in the current path table and the path from the last point in the path table to the fixed end point;

[0093] Step 3.4: Repeat Step 3.3 until the domain table is empty, add the fixed termination point to the path table, and the path connected by the order of the points in the path table is the cutting order with the shortest time consumption.

[0094] According to another aspect of the present application, as Figure 7 shown, an optimized steel plate nesting cutting control system based on cutting paths provided by an embodiment of the present invention includes: a client, a computing engine, a storage server, and a numerical control cutting machine. The client sends the model input and calculation request to the computing engine. After the computing engine generates the nesting plan, it saves the numerical control file to the storage server. When operating the numerical control cutting machine for cutting, it calls the numerical control file from the storage server for numerical control instruction recognition and cutting operation.

[0095] Step 1: Model the nesting problem, abstract the steel plate nesting problem into a polygon arrangement problem in a two-dimensional plane, and define the model input, model constraints, and optimization objectives;

[0096] The above model input is the total number of batches M of components, the number of components N, the number of component types O, the set P of polygon cutting pieces required for each component = {P 1 , P 2 , …, P p} and its specifications, the set of polygon cutting piece vertices v = {v 1 , v 2 , …, v q}, the required steel plate material, and the steel plate specifications L×W for cutting; where L is the length of the steel plate to be cut, and W is the width of the steel plate to be cut.

[0097] The above model constraint conditions include:

[0098] Spatial constraint conditions, that is, the polygons to be arranged cannot exceed the boundary of the steel plate for cutting, and the polygons cannot overlap;

[0099] Order constraint conditions, that is, the polygons forming the same component need to be placed close to each other, the components of the same batch need to be placed close to each other, and the components of different batches are arranged in sequence according to the batch order;

[0100] The above model optimization objective value is the minimum linear weighted sum of the remaining area of the steel, the cutting path length, and the idle travel length, that is, f = min(ω 1 P steel S + ω 2 P cut D cut + ω 3 P labor D empty ), where ω 1 , ω 2 , ω 3 are all configurable weight parameters, Psteel 、P cut 、P labor is the cost required for corresponding items, S is the remaining area, D cut is the cutting path length, D empty is the idle stroke length; f is the model optimization objective value.

[0101] As Figure 5 shown, the operation process of step 2 above includes the following steps:

[0102] Step 2.1: Initialize the total number of batches of components M, the number of components N, the number of component types O, the set of polygon cutting parts P required for each component, and the nesting two-dimensional plane L×W. The length and width of the above plane are the same as the steel plate used for cutting. Calculate the centroid of each polygon based on the triangle cutting method;

[0103] Step 2.2: Select any one type of component in the current batch;

[0104] Step 2.3: For the two bottom corners of the two-dimensional plane, calculate the loss value when all the polygons P corresponding to this component are placed according to the idea of the lowest centroid, and select the polygon arrangement method with the smallest loss value for placement;

[0105] The above loss value is the linear weighted sum l = ω ′ of the gap area formed by the polygon in the two-dimensional plane after placement and the starting side of the plane placement and the sum of the contour lengths of all closed figures L 4 S left + ω 5 ∑D L′ , where ω 4 , ω 5 are both configurable weight parameters, S left represents the gap area formed by the polygon in the two-dimensional plane after placement and the starting side of the plane placement, D L′ represents the sum of the contour lengths of all closed figures L' in the two-dimensional plane; when polygons share edges, the contour length is only calculated once, and when a polygon shares an edge with the plane, the length is not calculated.

[0106] Step 2.4: Take the required polygons of other components in the current batch, calculate the loss value l when placed according to the idea of the lowest centroid, and select the component with the smallest l value and the corresponding polygon arrangement method for placement.

[0107] Step 2.5: Repeat step 2.4 until all the components in this batch are arranged. When no other components in this batch can be placed in the current plane, add an empty two-dimensional plane to continue the arrangement.

[0108] Step 2.6: Replace the type of the initial component, repeat Steps 2.3 to 2.5, obtain the layout schemes under different types of initial components, calculate the objective function value f of each nesting layout scheme, and select the scheme with the smallest f value as the optimal layout scheme for the current plane;

[0109] Step 2.7: If there are still batches not arranged, repeat Steps 2.2 to 2.6, otherwise end.

[0110] As Figure 6 shown, the operation process of Step 3 includes the following steps:

[0111] Step 3.1: Initialize the fixed starting point v 0 and the ending point v d for cutting, obtain all the closed figures L ′ in the optimized layout scheme obtained in Step 2 and their corresponding vertex sets v, and initialize the taboo list T as an empty set The neighborhood list A is a set of closed figures, and the path list is an empty linked list Q = [];

[0112] Step 3.2: Initialize the current point as the fixed starting point v = v 0 , and add the starting point to the path list Q = [v 0 ;

[0113] Step 3.3: Traverse all the vertices corresponding to the closed figures in the neighborhood list A, calculate the expected cutting path D p , select the vertex v p with the smallest D i value as the successor point and add it to the path list Q = Q + [v i , at the same time set the current point v = v i , and add the closed figure L i to which the control point v ′ i belongs to the taboo list T = T ∪ {L ′ i}, and the neighborhood list A = A - T.

[0114] The above expected path is the sum of the path from the starting point in the current path list through subsequent vertices and the path from the last point v q in the path list to the fixed ending point where i ranges from 1 to q - 1; d(v 0 , v 1 ) represents the distance from the fixed starting point v 0 for cutting to the first point v 1 in the path list, and d(v q , v d ) represents the distance from the last point in the path list to the fixed ending point.

[0115] Step 3.4: Repeat Step 3.3 until the domain table Add the fixed termination point v d to the path table Q = Q + [v d , and the path connecting the points in the path table Q is the shortest-time-consuming cutting order.

[0116] The embodiments of the present invention also have the following beneficial effects:

[0117] The embodiments of the present invention take multiple criteria such as steel plate utilization rate, length of the flame cutting path, and length of the idle stroke path as optimization objectives, and determine nesting while considering the steel structure batch order and the composition of the cut components of the members, improving the cutting efficiency of the steel plate, reducing the carbon emissions of the factory, and providing guarantee for the enterprise to increase efficiency and reduce emissions.

[0118] It should be noted that for the foregoing method embodiments, for the sake of simple description, they are all expressed as a series of action combinations. However, those skilled in the art should know that the present invention is not limited by the described action sequence, because according to the present invention, certain steps can be performed in other sequences or simultaneously. Secondly, those skilled in the art should also know that the embodiments described in the specification are all preferred embodiments, and the actions and modules involved are not necessarily essential to the present invention.

[0119] According to another aspect of the embodiments of the present invention, there is also provided a material cutting device for implementing the above-mentioned material cutting method. As Figure 8 shown, the device includes:

[0120] A receiving unit 802, configured to receive the attribute information of the material to be cut;

[0121] A determining unit 804, configured to input the attribute information of the material to be cut into a computing engine configured with a cutting optimization model, and generate nesting layout data of the material to be cut by using a greedy algorithm based on the lowest center of gravity positioning strategy and preset constraint conditions; wherein, the nesting layout data includes an optimal cutting function value, and the optimal cutting function value corresponds to the minimum value of the linear weighted sum of the remaining area of the material to be cut, the length of the cutting path, and the length of the cutter idle stroke; the lowest center of gravity positioning strategy is that when arranging polygons in the cutting shape, without overlap of the polygons, the center of gravity of the polygons is close to the bottom edge of the material to be cut;

[0122] An obtaining unit 806, configured to obtain an optimal cutting path based on the nesting layout data and a tabu search algorithm; wherein, the optimal cutting path includes the cutting path with the shortest time-consuming for cutting the material

[0123] A generating unit 808, configured to generate a cutting control instruction corresponding to the material to be cut according to the optimal cutting path

[0124] An execution unit 810, configured to perform a cutting operation on the material to be cut according to the cutting control instruction, and obtain a target cutting member.

[0125] In an embodiment of the present invention, the method includes receiving attribute information of a material to be cut; inputting the attribute information of the material to be cut into a computing engine configured with a cutting optimization model to determine target cutting data, where the target cutting data includes an optimal cutting function value, and the optimal cutting function value corresponds to the minimum value of a linear weighted sum of the remaining area of the material to be cut, the cutting path length, and the cutter idle stroke length; generating a cutting control instruction corresponding to the material to be cut according to the target cutting data; and performing a cutting operation on the material to be cut according to the cutting control instruction to obtain a target cutting member. In the above method, since the target cutting data includes an optimal cutting function value, and the optimal cutting function value corresponds to the minimum value of a linear weighted sum of the remaining area of the material to be cut, the cutting path length, and the cutter idle stroke length, the utilization rate of steel is improved, and thus the technical problem of low utilization rate of steel caused by the steel cutting method in the related art is solved.

[0126] In one or more embodiments, the generating unit 808 specifically includes:

[0127] For each component in different batches, perform the following operations:

[0128] A first configuration module, configured to configure the nesting two-dimensional plane and the material to be cut to have the same length and width.

[0129] A first obtaining module, configured to, for two bottom corners of the nesting two-dimensional plane, obtain all polygons required for different types of components in the current batch, and obtain a loss value when the centroid lowest positioning strategy is placed, and select a permutation set corresponding to the polygon with the smallest loss value; where the loss value is a linear weighted sum of a first sum and a second sum, the first sum is the sum of the outer contour lengths of all polygons placed in the plane, and the second sum is the sum of the gap areas formed by the polygon and the starting side of the nesting two-dimensional plane.

[0130] A first calculation module, configured to calculate the optimal cutting function value corresponding to the nesting two-dimensional plane when the remaining components in the current batch cannot be placed in the nesting two-dimensional plane or when the arrangement of all components in the current batch is completed.

[0131] A first determination module, configured to, when the optimal cutting function value is the smallest, use the permutation set of the polygons as the nesting layout data of the nesting two-dimensional plane.

[0132] In one or more embodiments, the material cutting device further includes:

[0133] A calculation unit is configured to calculate the loss value in such a way that the contour length is only calculated once when the polygons share a common side, and the length is not calculated when the polygon shares a common side with the nesting two-dimensional plane.

[0134] In one or more embodiments, the first obtaining module specifically includes:

[0135] A second obtaining subunit is configured to initialize the fixed start and end points of the cutting, and obtain all the closed figures in the nesting layout data and the set of vertices corresponding to the closed figures; wherein the fixed start and end points include a fixed start point and a fixed end point.

[0136] A first configuration subunit is configured to configure the taboo table in the nesting layout data as an empty set, the domain table as a set of closed figures, and the path table as an empty linked list.

[0137] A first adding subunit is configured to add the fixed start point to the path table.

[0138] A first calculating subunit is configured to traverse all the vertices corresponding to the set of closed figures in the domain table, and calculate the expected cutting path; wherein the expected cutting path is the sum of a first path and a second path, the first path is the path sum from the fixed start point in the current path table through subsequent vertices, and the second path is the path from the last point in the path table to the fixed end point.

[0139] A second determining subunit is configured to select the vertex with the shortest expected cutting path as the successor point and add it to the path table, and add the closed figure to which the control point belongs to the taboo table until the domain table is an empty table.

[0140] A second adding subunit is configured to add the fixed end point to the path table.

[0141] A third determining subunit is configured to determine the path obtained by connecting the points in the path table in sequence as the optimal cutting path.

[0142] In one or more embodiments, the preset constraint conditions include a space constraint condition and a sequence constraint condition.

[0143] The space constraint condition includes: the polygons to be arranged do not exceed the boundary of the material to be cut, and the polygons do not overlap with each other.

[0144] The sequence constraint condition includes: the polygons forming the same component are in adjacent positions, the components of the same batch need to be placed close to each other, and the components of different batches are arranged in sequence according to the batch order.

[0145] According to another aspect of the embodiments of the present invention, there is also provided a material cutting control system for implementing the above-mentioned material cutting method. The system includes a computing engine, a client, a storage server, and a numerical control cutting machine; wherein:

[0146] The above-mentioned client is used to receive the attribute information of the material to be cut, and send the attribute information of the material to be cut and a calculation request to the computing engine;

[0147] The above-mentioned computing engine is used to determine the target cutting data, and generate a numerical control file of the cutting control instruction corresponding to the material to be cut according to the above-mentioned target cutting data; wherein, the above-mentioned target cutting data includes the optimal cutting function value, and the optimal cutting function value corresponds to the minimum value of the linear weighted sum of the remaining area of the material to be cut, the cutting path length, and the idle stroke length of the cutting tool;

[0148] The above-mentioned storage server is used to store the above-mentioned numerical control file;

[0149] The above-mentioned numerical control cutting machine is used to call the above-mentioned numerical control file from the above-mentioned storage server, and perform cutting numerical control instruction recognition and cutting operations.

[0150] According to another aspect of the embodiments of the present invention, there is also provided an electronic device for implementing the above-mentioned material cutting method. The electronic device may be Figure 9 the terminal device or server shown in the figure. In this embodiment, the electronic device is taken as an example of the terminal for illustration. As Figure 9 shown in the figure, the electronic device includes a memory 902 and a processor 904. A computer program is stored in the memory 902, and the processor 904 is configured to execute the steps in any of the above method embodiments through the computer program.

[0151] Optionally, in this embodiment, the above-mentioned electronic device may be at least one of multiple network devices in a computer network.

[0152] Optionally, in this embodiment, the above-mentioned processor may be configured to execute the following steps through the computer program:

[0153] S1, receive the attribute information of the material to be cut;

[0154] S2. Input the attribute information of the material to be cut into a computing engine configured with a cutting optimization model. Based on the lowest center-of-gravity positioning strategy and preset constraint conditions, use the greedy algorithm to generate nesting layout data for the material to be cut. Among them, the nesting layout data includes the optimal cutting function value, and the optimal cutting function value corresponds to the minimum value of the linear weighted sum of the remaining area of the material to be cut, the cutting path length, and the idle stroke length of the cutting tool. The lowest center-of-gravity positioning strategy means that when arranging polygons in the cutting shape, without overlap of the polygons, the center of gravity of the polygons is close to the bottom edge of the material to be cut.

[0155] S3. Obtain the optimal cutting path based on the nesting layout data and the tabu search algorithm. Among them, the optimal cutting path includes the cutting path with the shortest cutting time for the material.

[0156] S4. Generate a cutting control instruction corresponding to the material to be cut according to the optimal cutting path.

[0157] S5. Perform a cutting operation on the material to be cut according to the cutting control instruction to obtain the target cut component.

[0158] Optionally, those of ordinary skill in the art can understand that Figure 9 The structure shown is only for illustration. The electronic device can also be a smart phone (such as an Android phone, an iOS phone, etc.), a tablet computer, a handheld computer, and terminal devices such as Mobile Internet Devices (MID), PAD, etc. Figure 9 It does not limit the structure of the above electronic device. For example, the electronic device may further include more or fewer components (such as a network interface, etc.) than those shown Figure 9 in the figure, or have a different configuration from that shown Figure 9 in the figure.

[0159] Among them, the memory 902 can be used to store software programs and modules, such as the program instructions / modules corresponding to the material cutting method and device in the embodiments of the present invention. The processor 904 executes various functional applications and data processing by running the software programs and modules stored in the memory 902, that is, implements the above-mentioned material cutting method. The memory 902 may include a high-speed random access memory, and may also include a non-volatile memory, such as one or more magnetic storage devices, flash memory, or other non-volatile solid-state memories. In some instances, the memory 902 may further include a memory remotely disposed relative to the processor 904, and these remote memories can be connected to the terminal through a network. Examples of the above network include but are not limited to the Internet, enterprise intranet, local area network, mobile communication network, and combinations thereof. Among them, the memory 902 can specifically but not limitedly be used to store information such as target cutting data. As an example, as Figure 9 shown, the above-mentioned memory 902 may include but are not limited to the receiving unit 802, the determining unit 804, the obtaining unit 806, the generating unit 808, and the executing unit 810 in the above-mentioned material cutting device. In addition, it may further include but are not limited to other module units in the above-mentioned material cutting device, which will not be elaborated in this example.

[0160] Optionally, the above-mentioned transmission device 906 is used to receive or send data via a network. Specific examples of the above network may include a wired network and a wireless network. In one instance, the transmission device 906 includes a network adapter (Network Interface Controller, NIC), which can be connected to other network devices and routers through a network cable, so as to communicate with the Internet or a local area network. In one instance, the transmission device 906 is a radio frequency (RF) module, which is used to communicate with the Internet wirelessly.

[0161] In addition, the above-mentioned electronic device further includes: a display 908, which is used to display the above-mentioned target cutting data; and a connection bus 910, which is used to connect each module component in the above-mentioned electronic device.

[0162] In other embodiments, the above-mentioned terminal device or server may be a node in a distributed system. Among them, the distributed system may be a blockchain system, and the blockchain system may be a distributed system formed by connecting the multiple nodes through network communication. Among them, the nodes can form a peer-to-peer (P2P, Peer To Peer) network, and any form of computing device, such as a server, a terminal, and other electronic devices, can become a node in the blockchain system by joining the peer-to-peer network.

[0163] According to one aspect of the present application, there is provided a computer program product or a computer program, which includes computer instructions stored in a computer-readable storage medium. The processor of the computer device reads the computer instructions from the computer-readable storage medium, and the processor executes the computer instructions, so that the computer device executes the above-mentioned material cutting method, wherein the computer program is configured to execute the steps in any one of the above method embodiments when running.

[0164] Optionally, in this embodiment, the above-mentioned computer-readable storage medium may be configured to store a computer program for executing the following steps:

[0165] S1. Receive the attribute information of the material to be cut;

[0166] S2. Input the attribute information of the material to be cut into a computing engine configured with a cutting optimization model, and generate nesting layout data of the material to be cut by using a greedy algorithm based on the lowest center-of-gravity positioning strategy and preset constraint conditions; wherein, the nesting layout data includes an optimal cutting function value, and the optimal cutting function value corresponds to the minimum value of the linear weighted sum of the remaining area of the material to be cut, the cutting path length, and the cutter idle stroke length; the lowest center-of-gravity positioning strategy is that when arranging polygons in the cutting shape, without overlapping of the polygons, the center of gravity of the polygons is close to the bottom edge of the material to be cut;

[0167] S3. Obtain an optimal cutting path based on the nesting layout data and a tabu search algorithm; wherein, the optimal cutting path includes a cutting path with the shortest time-consuming for cutting the material;

[0168] S4. Generate a cutting control instruction corresponding to the material to be cut according to the optimal cutting path;

[0169] S5. Perform a cutting operation on the material to be cut according to the cutting control instruction to obtain a target cutting member.

[0170] Optionally, in this embodiment, those of ordinary skill in the art can understand that all or part of the steps in the above-mentioned various methods can be completed by a program instructing the relevant hardware of the terminal device, and the program can be stored in a computer-readable storage medium, and the storage medium may include: a flash drive, a read-only memory (ROM), a random access memory (RAM), a magnetic disk, an optical disc, etc.

[0171] The serial numbers of the above embodiments of the present invention are only for description and do not represent the advantages and disadvantages of the embodiments.

[0172] If the integrated unit in the above embodiments is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in the above computer-readable storage medium. Based on such an understanding, the technical solution of the present invention, in essence, or the part that contributes to the prior art, or all or part of the technical solution, can be embodied in the form of a software product. The computer software product is stored in the storage medium and includes several instructions for causing one or more computer devices (which can be a personal computer, a server, or a network device, etc.) to execute all or part of the steps of the methods in the various embodiments of the present invention.

[0173] In the above embodiments of the present invention, the descriptions of the various embodiments have their own emphases. For the parts not detailed in a certain embodiment, reference can be made to the relevant descriptions of other embodiments.

[0174] In the several embodiments provided by the present application, it should be understood that the disclosed client can be implemented in other ways. Among them, the device embodiments described above are only illustrative. For example, the division of units is only a logical function division. In actual implementation, there can be other division methods. For example, multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the displayed or discussed couplings or direct couplings or communication connections to each other can be through some interfaces. The indirect couplings or communication connections of units or modules can be in electrical or other forms.

[0175] The units described as separate components may or may not be physically separated. The components shown as units may or may not be physical units, that is, they can be located in one place or distributed to multiple network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of this embodiment.

[0176] In addition, the functional units in the various embodiments of the present invention can be integrated in a processing unit, or each unit can exist physically alone, or two or more units can be integrated in one unit. The above integrated units can be implemented in the form of hardware or in the form of software functional units.

[0177] The above are only the preferred embodiments of the present invention. It should be noted that for those of ordinary skill in the art, without departing from the principle of the present invention, several improvements and refinements can still be made, and these improvements and refinements should also be regarded as the protection scope of the present invention.

Claims

1. A method for cutting materials, characterized in that, comprising: receiving the attribute information of the material to be cut; inputting the attribute information of the material to be cut into a computing engine configured with a cutting optimization model, and generating nesting layout data for the material to be cut by using a greedy algorithm based on the lowest center of gravity positioning strategy and preset constraint conditions; wherein, the nesting layout data includes an optimal cutting function value, and the optimal cutting function value corresponds to the minimum value of the linear weighted sum of the remaining area of the material to be cut, the cutting path length, and the idle stroke length of the cutting tool; the lowest center of gravity positioning strategy is that when arranging polygons in the cutting shape, without overlap of the polygons, the center of gravity of the polygons is close to the bottom edge of the material to be cut; obtaining an optimal cutting path based on the nesting layout data and a tabu search algorithm; wherein, the optimal cutting path includes a cutting path with the shortest cutting time for the material; generating a cutting control instruction corresponding to the material to be cut according to the optimal cutting path; performing a cutting operation on the material to be cut according to the cutting control instruction to obtain a target cut component.

2. The method according to claim 1, characterized in that, the generating of the nesting layout data for the material to be cut by using a greedy algorithm based on the lowest center of gravity positioning strategy and preset constraint conditions includes: performing the following operations for each component in different batches: configuring the nesting two-dimensional plane to have the same length and width as the material to be cut; for the two bottom corners of the nesting two-dimensional plane, obtaining all the polygons required for different types of components in the current batch, and obtaining the loss value when placed according to the lowest center of gravity positioning strategy, and selecting the arrangement set corresponding to the polygon with the smallest loss value; wherein, the loss value is the linear weighted sum of a first sum and a second sum, the first sum is the sum of the outer contour lengths of all the polygons placed in the plane, and the second sum is the sum of the gap areas formed by the polygons and the starting side of the nesting two-dimensional plane; when the remaining components in the current batch cannot be placed in the nesting two-dimensional plane, or when all the components in the current batch are arranged, calculating the optimal cutting function value corresponding to the nesting two-dimensional plane; when the optimal cutting function value is the smallest, taking the arrangement set of the polygons as the nesting layout data of the nesting two-dimensional plane.

3. The method according to claim 2, characterized in that, the method further includes: calculating the loss value in such a way that the contour length is only calculated once when the polygons share a side, and the length is not calculated when the polygons share a side with the nesting two-dimensional plane.

4. The method according to claim 2, characterized in that, the obtaining of the optimal cutting path based on the nesting layout data and a tabu search algorithm includes: initializing the fixed start and end points of the cutting, and obtaining all the closed figures in the nesting layout data and the vertex set corresponding to the closed figures; wherein, the fixed start and end points include a fixed starting point and a fixed ending point; configuring the tabu list in the nesting layout data as an empty set, the neighborhood list as a set of closed figures, and the path list as an empty linked list; adding the fixed starting point to the path list; Traverse all vertices corresponding to the set of closed figures in the domain table, and calculate the cutting expected path; wherein, the cutting expected path is the sum of a first path and a second path, the first path is the sum of the paths from the fixed starting point to subsequent vertices in the current path table, and the second path is the path from the last point in the path table to the fixed ending point; Select the vertex with the shortest cutting expected path as the successor point and add it to the path table, and add the closed figure to which the control point belongs to the taboo table until the domain table is an empty table; Add the fixed ending point to the path table; Determine the path obtained by connecting the points in the path table in sequence as the optimal cutting path.

5. The method according to claim 1, wherein, the preset constraint conditions include spatial constraint conditions and sequential constraint conditions; the spatial constraint conditions include: the polygons to be arranged do not exceed the boundary of the material to be cut, and the polygons do not overlap each other; the sequential constraint conditions include: the polygons forming the same component are in adjacent positions, the components of the same batch need to be placed close to each other, and the components of different batches are arranged in sequence according to the batch order.

6. A material cutting device, wherein, it includes: a receiving unit, configured to receive the attribute information of the material to be cut; a determining unit, configured to input the attribute information of the material to be cut into a computing engine configured with a cutting optimization model, and generate nesting layout data of the material to be cut by using a greedy algorithm based on the lowest center-of-gravity positioning strategy and preset constraint conditions; wherein, the nesting layout data includes an optimal cutting function value, and the optimal cutting function value corresponds to the minimum value of the linear weighted sum of the remaining area of the material to be cut, the cutting path length, and the cutter idle stroke length; the lowest center-of-gravity positioning strategy is that when arranging the polygons in the cutting shape, without overlap of the polygons, the center of gravity of the polygons is close to the bottom edge of the material to be cut; an obtaining unit, configured to obtain an optimal cutting path based on the nesting layout data and a taboo search algorithm; wherein, the optimal cutting path includes the cutting path with the shortest cutting time for the material to be cut a generating unit, configured to generate a cutting control instruction corresponding to the material to be cut according to the optimal cutting path; an executing unit, configured to perform a cutting operation on the material to be cut according to the cutting control instruction to obtain a target cut component.

7. The material cutting device according to claim 6, wherein, the generating unit specifically includes: a first configuration module, configured to configure the nesting two-dimensional plane and the material to be cut to have the same length and width; a first obtaining module, configured to, for the two bottom corners of the above-mentioned nesting two-dimensional plane, obtain all polygons required for different types of components in the current batch, and obtain the loss value when placed according to the lowest center-of-gravity positioning strategy, and select the arrangement set corresponding to the polygon with the smallest loss value; wherein, the above-mentioned loss value is the linear weighted sum of a first sum and a second sum, the above-mentioned first sum is the sum of the outer contour lengths of all polygons placed in the plane, and the above-mentioned second sum is the sum of the void areas formed by the above-mentioned polygons and the starting side of the above-mentioned nesting two-dimensional plane; A first calculation module, configured to calculate the optimal cutting function value corresponding to the nesting two-dimensional plane when the remaining components in the current batch cannot be placed in the nesting two-dimensional plane or when the arrangement of all components in the current batch is completed. A first determination module, configured to use the arrangement set of the polygon as the nesting layout data of the nesting two-dimensional plane when the optimal cutting function value is the smallest.

8. A material cutting control system Characterized in that It includes a calculation engine, a client, a storage server and a numerical control cutting machine; wherein: The client is configured to receive the attribute information of the material to be cut and send the attribute information of the material to be cut and a calculation request to the calculation engine; The calculation engine is configured to input the attribute information of the material to be cut into the calculation engine configured with a cutting optimization model, and generate the nesting layout data of the material to be cut by using a greedy algorithm based on the lowest center of gravity positioning strategy and preset constraint conditions; wherein, the nesting layout data includes an optimal cutting function value, and the optimal cutting function value corresponds to the minimum value of the linear weighted sum of the remaining area of the material to be cut, the cutting path length and the cutter idle stroke length; the lowest center of gravity positioning strategy is to arrange polygons in the cutting shape, and when the polygons do not overlap, make the center of gravity of the polygon close to the bottom edge of the material to be cut; Obtain an optimal cutting path based on the nesting layout data and a tabu search algorithm; wherein, the optimal cutting path includes a cutting path with the shortest cutting time for the material to be cut; Generate a cutting control instruction corresponding to the material to be cut according to the optimal cutting path; The storage server is configured to store the cutting control instruction; The numerical control cutting machine is configured to call the cutting control instruction from the storage server and perform cutting numerical control instruction recognition and cutting operations.

9. An electronic device, including a memory and a processor Characterized in that A computer program is stored in the memory, and the processor is configured to execute the method described in any one of claims 1 to 5 through the computer program.

10. A computer-readable storage medium Characterized in that The computer-readable storage medium includes a stored program, wherein the program executes the method described in any one of claims 1 to 5 when running.

Images