CN108857092B

CN108857092B - Laser cutting path planning method and device, storage medium and computer equipment

Info

Publication number: CN108857092B
Application number: CN201810785295.6A
Authority: CN
Inventors: 封雨鑫; 陈焱; 高云峰
Original assignee: Shenzhen Han's Smc Technology Co ltd; Han s Laser Technology Industry Group Co Ltd
Current assignee: Shenzhen Han's Smc Technology Co ltd; Han s Laser Technology Industry Group Co Ltd
Priority date: 2018-07-17
Filing date: 2018-07-17
Publication date: 2020-10-13
Anticipated expiration: 2038-07-17
Also published as: CN108857092A

Abstract

The invention relates to a laser cutting path planning method, a device, a storage medium and computer equipment, which are used for acquiring part information and layout information of a part to be cut; numbering the parts to be cut to obtain a numbered combination; acquiring cutting track information with the shortest path according to the number combination, the part information and the layout information; and planning the cutting path according to the number combination, the part information and the layout information corresponding to the cutting track information with the shortest path to obtain path planning information. By numbering and combining parts to be cut, after the length of a cutting track corresponding to each combination is calculated, the combination corresponding to the shortest track is selected as the optimal part cutting sequence, and path planning is carried out, so that the shortest overall cutting path can be ensured, the laser cutting time is shortened, the laser cutting efficiency is improved, and the scientificity and rationality of the laser cutting path planning are improved.

Description

Laser cutting path planning method and device, storage medium and computer equipment

Technical Field

The invention relates to the technical field of laser cutting, in particular to a laser cutting path planning method, a laser cutting path planning device, a storage medium and computer equipment.

Background

With the development of automation control technology, the application of laser cutting is more and more extensive. Laser cutting is to irradiate a material to be cut with a high-power laser beam, and the irradiated portion of the material to be cut is heated and evaporated to form a slit with a narrow width (e.g., about 0.1 mm). And during the cutting process, controlling the cutting path of the laser beam to control the forming position of the cutting seam, thereby completing the laser cutting operation of the material to be cut.

In the laser cutting process, in order to improve the cutting efficiency, laser cutting path planning is required. The conventional technology usually adopts an "n" type algorithm to complete path planning, which is explained by using a cutting path example in fig. 1 (a dotted line in fig. 1 represents a cutting sequence), wherein the "n" type algorithm refers to that a part located at a corner is selected as a cutting starting point, cutting is performed from top to bottom, after the parts in the same row are cut, the part is moved to the right to cut another row of parts from bottom to top until all parts are cut.

However, the "n" type algorithm in the conventional technology is only suitable for the case of a small number of parts and a regular arrangement of parts, and when the number or types of parts are taught a lot or the arrangement of parts is irregular, the path planning scheme obtained by the "n" type algorithm may have a situation of a long cutting path or a long cutting time, resulting in a low cutting efficiency, and thus causing an unscientific and unreasonable problem in the path planning scheme.

Disclosure of Invention

In view of the foregoing, it is necessary to provide a laser cutting path planning method, device, storage medium, and computer apparatus with more scientific and reasonable path planning.

A laser cutting path planning method comprises the following steps:

acquiring part information and layout information of a part to be cut;

numbering the parts to be cut, and numbering and sequencing the parts according to the numbers corresponding to the parts to be cut to obtain a numbered combination, wherein the numbered combination represents the cutting sequence of the corresponding parts to be cut;

obtaining cutting track information corresponding to each number combination according to the number combination, the part information and the layout information, and obtaining the cutting track information with the shortest path from the cutting track information of each number combination;

and planning the cutting path according to the number combination corresponding to the cutting track information with the shortest path, the part information and the layout information to obtain path planning information.

A laser cutting path planning apparatus, comprising:

the information acquisition module is used for acquiring part information and layout information of the part to be cut;

the numbering and combining module is used for numbering the parts to be cut and carrying out numbering and sequencing processing according to the numbers corresponding to the parts to be cut to obtain numbering combinations, and the numbering combinations represent the cutting sequence of the corresponding parts to be cut;

the track calculation module is used for obtaining cutting track information corresponding to each serial number combination according to the serial number combination, the part information and the layout information, and obtaining the cutting track information with the shortest path from the cutting track information of each serial number combination;

and the path planning module is used for planning the cutting path according to the number combination corresponding to the cutting track information with the shortest path, the part information and the layout information to obtain path planning information.

A computer device comprising a memory and a processor, the memory storing a computer program, the processor implementing the steps of the above-described laser cutting path planning method when executing the computer program.

A computer-readable storage medium, on which a computer program is stored which, when being executed by a processor, carries out the steps of the above-mentioned laser cutting path planning method.

The laser cutting path planning method, the laser cutting path planning device, the storage medium and the computer equipment acquire part information and layout information of parts to be cut; numbering the parts to be cut, and numbering and sequencing the parts according to the numbers corresponding to the parts to be cut to obtain a number combination, wherein the number combination represents the cutting sequence of the corresponding parts to be cut; obtaining cutting track information corresponding to each number combination according to the number combination, the part information and the layout information, and obtaining the cutting track information with the shortest path from the cutting track information of each number combination; and planning the cutting path according to the number combination, the part information and the layout information corresponding to the cutting track information with the shortest path to obtain path planning information. By numbering and combining parts to be cut, after the length of a cutting track corresponding to each combination is calculated, the combination corresponding to the shortest track is selected as the optimal part cutting sequence, and path planning is carried out, so that the shortest overall cutting path can be ensured, the laser cutting time is shortened, the laser cutting efficiency is improved, and the scientificity and rationality of the laser cutting path planning are improved.

Drawings

FIG. 1 is a schematic diagram illustrating a path planning of laser cutting in the prior art;

FIG. 2 is a schematic profile view of a part being laser cut;

FIG. 3 is an illustration of a layout of parts in laser cutting;

FIG. 4 is a schematic flow chart illustrating a method for planning a laser cutting path according to an embodiment;

FIG. 5 is a schematic diagram of a lead-in trace in one embodiment;

FIG. 6 is a flow diagram that illustrates the cross-handling of combinations of numbers in one embodiment;

FIG. 7 is a flowchart illustrating an embodiment of combinatorial variation processing on numbering combinations;

FIG. 8 is a diagram illustrating an example of a co-edge cut optimization process in one embodiment;

FIG. 9 is a schematic diagram of an example of a no-lift cutting optimization process in one embodiment;

FIG. 10 is a schematic diagram of an example of a flight cut optimization process in one embodiment;

FIG. 11 is a diagram illustrating an example of a hierarchical cut optimization process in one embodiment;

FIG. 12 is a schematic structural diagram of a laser cutting path planning apparatus according to an embodiment;

fig. 13 is a schematic structural diagram of a laser cutting path planning apparatus in another embodiment.

Detailed Description

Before explaining the technical solution of the present application, some relevant matters in the laser cutting technology will be explained first.

The most basic geometric unit of the laser cutting pattern is a contour, and the contour is a closed pattern consisting of straight lines and circular arcs. For any simple or complex contour, the connecting point of a straight line and a straight line, the connecting point of a straight line and a circular arc and the connecting point of a circular arc and a circular arc can be defined as the vertex of the contour, while the straight line or the circular arc forming the contour is defined as an edge, and for a circular contour, the vertex can be at any position. Referring to fig. 1, typical contours include circles, polygons, irregular contours composed of straight lines and circular arcs, and the like.

The parts are formed by combining profiles, and are the most direct output products of laser cutting. As shown in fig. 2, a complete part to be machined includes an outer contour and several inner contours, for example, part a in fig. 2 includes outer contour a1 and inner contours a2, A3, a4, a5, part B includes outer contour B1 and inner contour B2; there are also parts which have only an outer contour and no inner contour, for example part C in fig. 2 only comprises an outer contour C1. For a designed part, the relative positions of the various contours that make up the part are fixed; for different parts and the internal profiles of different parts, the relative positions of the parts can be changed along with the different placement positions of the parts on the plate.

In the actual laser cutting process, a plurality of identical or different parts are generally subjected to batch cutting processing on a whole plate in a layout mode, and the layout mode needs to be optimized through a nesting algorithm so as to ensure the highest utilization rate of the plate and the reasonability of the cutting process. After the typesetting is completed, the positions of all the parts and the outlines are determined, and finally all the parts are processed on the raw material plate by laser cutting according to the typesetted graphic file. FIG. 3 is an illustration of part layout during a laser cutting process.

The specific processing process of laser cutting comprises the following steps: firstly, a cutting head is moved to a first part in a free space mode under the condition that laser output is not started; then starting laser output, and cutting a first contour of the first part; after the first contour of the first part is cut, the first part is moved to the starting point of the next contour in an idle mode, and the next contour is machined; and after all the profiles of the first part are cut, the first part is moved to the starting point of the next part in an idle mode, the next part is machined, and the steps are repeated until all the profiles of all the parts are cut. In the laser cutting process, under the condition that the laser output is not started, the stroke of the idle movement of the cutting head is an idle stroke.

In the laser cutting process, in order to improve cutting efficiency, in the conventional technology, when a laser cutting path is planned, a path is generally planned by using an "n" type algorithm as shown in fig. 1, however, the "n" type algorithm is only suitable for the cases of a small number of parts and a regular arrangement of the parts, and when the number or the types of the parts are large or the arrangement of the parts is irregular, a path planning scheme obtained by using the "n" type algorithm may have a situation of a long cutting path or a long cutting time, resulting in low cutting efficiency.

The laser cutting path planning method is provided for solving the problems in the prior art, the parts to be cut are sequenced in the cutting sequence, and the lengths of the corresponding cutting paths are calculated, so that the shortest cutting path can be screened out, the path planning is carried out according to the shortest cutting path, and the cutting efficiency can be improved.

In one embodiment, as shown in fig. 4, a laser cutting path planning method is provided, which includes the following steps:

and S100, acquiring part information and layout information of the part to be cut. In the laser cutting process, a plurality of identical or different parts to be cut need to be arranged on a whole plate, the arrangement mode needs to be combined with part information (such as shape, size and the like) of the parts to be cut, and optimization is carried out through a trepanning algorithm so as to ensure the highest utilization rate of the plate and the reasonability of the cutting process. After the layout is finished, the positions of all parts and contours are determined, and layout information is acquired according to the positions of the parts and the contours, wherein the part information can be acquired before the layout or after the layout.

And S200, numbering the parts to be cut, and numbering and sequencing the parts according to the numbers corresponding to the parts to be cut to obtain a number combination, wherein the number combination represents the cutting sequence of the corresponding parts to be cut. After the part information and the layout information of the part to be cut are obtained, numbering is performed on the part to be cut, that is, each part to be cut has a corresponding number, for example, a part a in fig. 2 corresponds to the number 1, a part B corresponds to the number 2, and a part C corresponds to the number 3. The format of the part number is not unique, and the part number can be a number in a numerical form, a number in an alphabetical form, or a number in other coding forms. After the parts to be cut are numbered, the numbers corresponding to the parts to be cut are numbered and sequenced to obtain number combinations, and the number combinations represent the cutting sequence of the corresponding parts to be cut. Also taking the part in fig. 2 as an example, the number combinations such as 123, 231, 321, etc. are available according to numbers 1, 2, 3, each of which characterizes the cutting order of part A, B, C, i.e. 123 indicates laser cutting according to the cutting order of part A, B, C, 321 indicates laser cutting according to the cutting order of part C, B, A, and so on.

And step S300, obtaining the cutting track information corresponding to each number combination according to the number combination, the part information and the layout information, and obtaining the cutting track information with the shortest path from the cutting track information of each number combination. After the number combinations are obtained through number sorting processing, the corresponding cutting track information is obtained according to the cutting sequence of the part to be cut corresponding to each number combination, the part information (such as contour information) of the part to be cut and layout information, and the cutting path length corresponding to each number combination is calculated. During the whole laser cutting process, the cutting path comprises the contour path of each part to be cut and the idle stroke path between each contour. The contour path is determined by the contour information of the part to be cut; the idle stroke path is determined by the cutting sequence of the parts to be cut. And after the cutting path length corresponding to each number combination is obtained through calculation, the cutting path length with the shortest path is screened out, and the cutting track information with the shortest path is obtained.

Specifically, when calculating the idle stroke path between each contour, assuming that N parts to be cut exist on the plate subjected to layout completion, the outer contour of the part N (N is more than or equal to 1 and less than or equal to N) has V_nA vertex with a K inside_nInner contour of the unit, K (K is more than or equal to 1 and less than or equal to K)_n) Each inner contour has M_k,nA vertex. V_n,lL (1 is more than or equal to l is less than or equal to V) of the outer contour of the part n_n) A vertex, V_n,k,mM (1. ltoreq. M. ltoreq.M) of the kth inner contour of the part n_n,k) A vertex. Theoretically, the cutting starting point of the contour can be at any position of the contour, but in practice, the starting point is generally defined at the position of the vertex of the contour or the center point of one edge of the contour, and assuming that the cutting starting points of the contour are all defined at the first vertex of the lower left corner of the contour, the cutting idle stroke distance can be calculated by the following formula:

when the part to be cut comprises the inner contour and the outer contour at the same time, the inner contour is cut firstly, and then the outer contour is cut. Each part only has one outer contour, so the planning of the cutting sequence of each part can be simplified into the problem of searching the shortest path between the cutting starting points of the outer contours of each part; the planning of the cutting sequence of each inner contour of the part can be simplified into the problem of finding the shortest path between the cutting starting points of each inner contour of the part, and all points need to be ensured to be reached and started only once. N cutting starting points to be sequenced are arranged, each cutting starting point is expressed in an array form, the name of the array is represented by letter and number subscripts, and the content of the array is the coordinate value of the cutting starting point, so that the expression mode is as follows:

startPoint_i[x,y](i＝0,1,2,...,n) (3)

wherein x and y are coordinate values of the point in horizontal and vertical directions, respectively, and the number group name of each cutting start point is taken as the code of each point, such as startPoint₁，startPoint₂And the like, the permutation and combination of the array names can represent the sequencing mode of the cutting starting points. d_ijRepresenting the path distance from the ith starting point to the jth starting point, the mathematical model of the shortest path between the cutting starting points is established as follows:

x_ij∈{0,1},i,j＝1,2,...,n,i≠j (8)

according to the mathematical model formula, the cutting path lengths corresponding to different cutting sequences can be calculated, and the cutting path length with the shortest path can be screened out.

And S400, planning the cutting path according to the number combination, the part information and the layout information corresponding to the cutting track information with the shortest path to obtain path planning information. And after the cutting track information with the shortest path is obtained through screening, planning the cutting path according to the number combination corresponding to the cutting track information with the shortest path, the part information of the part to be cut and the layout information to obtain path planning information.

The embodiment provides a laser cutting path planning method, which includes numbering and combining parts to be cut, selecting a combination corresponding to a shortest path as an optimal part cutting sequence after calculating the length of a cutting path corresponding to each combination, and planning the path, so that the shortest overall cutting path can be ensured, the laser cutting time is shortened, the laser cutting efficiency is improved, and the scientificity and rationality of laser cutting path planning are improved.

In one embodiment, in the process of obtaining the shortest cutting path through the number sorting combination, theoretically, only one enumeration and one global comparison can really find out the global optimal solution. When the number of parts to be cut is small, the method of enumeration and global comparison is advisable, and the global optimal solution can be really found out. However, when the number of parts to be cut is large, which results in a large number of numbering combinations, the calculation amount caused by the method of enumeration and global comparison is very large, which is time-consuming, and hardly feasible or unnecessary in practical application. Therefore, the selection of the number combinations needs to meet the balance between the optimization effect and the actual efficiency, and the inventor of the application finds that the number of the number combinations is more suitable for about 50000 in the planning process of the laser cutting path, namely, when the number of the number combinations formed by the parts to be cut is less than or equal to 50000, the methods of one-to-one enumeration and global comparison can be adopted; when the number of the number combinations formed by the parts to be cut is larger than 50000, only 50000 number combinations are selected for comparison. The cutting path length corresponding to 50000 number combinations can be calculated within a short time, and the final cutting sequence result can meet the actual requirement.

Further, for practical application of laser cutting path planning, selection range limitation can be performed on number combinations selected and compared according to some basic conditions, so that the calculation efficiency and the optimization degree of solution can be remarkably improved. For example, basic conditions for selecting the range restriction are a cutting start point, a proximity requirement of a cutting order, and the like. The embodiment provides a laser cutting path planning method, and when the number of parts to be cut is large, which results in a large number of numbering combinations, a relatively optimal solution can be found within a limited time and calculation complexity range, so as to solve the actual industrial problem.

In one embodiment, the path planning information further comprises lead-in trajectory information. Because the laser is started with a certain delay, the cutting seam at the cutting starting point can be over-burnt usually, and the quality can not meet the requirements of the processing technology. It is therefore necessary to add a lead-in at each starting point of the cut, the starting point of the lead-in being the actual starting point of the contour cut. The lead-in wires are typically small straight lines, the lead-in wires of the inner profile typically being added inside the profile and the lead-in wires of the outer profile typically being added outside the profile. In order to facilitate the introduction of lead-ins, the cut start point of the outline is generally defined at the midpoint of the longest side of the outline, and if there is not enough room for the addition of lead lines, the midpoint of the other sides is tried from the next longest side until a suitable cut start point is found. Fig. 5 is a schematic diagram of a lead-in trace according to an example. The embodiment can prevent the cutting seam at the cutting starting point from being burnt excessively by adding the lead-in wire at the cutting starting point, and ensures the cutting quality.

In an embodiment, for the case that the number of parts to be cut is large, which results in a large number of numbering combinations, in the process of finding a relatively optimal solution, in order to further improve the optimization degree of the result, in the process of planning the laser cutting path, the obtained numbering combinations may be subjected to combination and intersection processing, as shown in fig. 6, and step S200 includes steps S212 to S218.

And S212, performing preliminary sequencing according to the numbers corresponding to the parts to be cut to obtain the number combinations with the preset number. The preset number may be a fixed value, for example 50000 in the previous embodiment, or the preset number may be a ratio of the total number of the part number combinations, and the ratio may be a fixed ratio or a floating ratio.

Step S214, selecting any number combination from the obtained number combinations as a first type number combination, and selecting partial number ordering of the first type number combination as a first type sub-ordering combination. And after the number combinations with the preset number are obtained, selecting any number combination as a first type of number combination, and intercepting a first type of sub-sequencing combination from the first type of number combination to perform combined cross processing.

Step S216 is to select a second type number combination from the obtained other number combinations, where the second type number combination includes a second type sub-ordering combination composed of all numbers in the first type sub-ordering combination, the second type sub-ordering combination has the same length as the first type sub-ordering combination, and the second type sub-ordering combination is different from the first type sub-ordering combination. After the first type number combination and the first type sub-ordering combination are selected, a second type number combination meeting the requirements is selected from other number combinations, and the second type sub-ordering combination is intercepted from the second type number combination to carry out combined cross processing.

Step S218, the position exchange processing is performed on the first type sub-sorting combination and the second type sub-sorting combination, so as to obtain a number combination different from the first type number combination and the second type number combination. After the first-class number combination, the first-class sub-ordering combination, the second-class number combination and the second-class sub-ordering combination are obtained, the first-class number combination and the second-class number combination are subjected to combined cross processing, namely the positions of the first-class sub-ordering combination and the second-class sub-ordering combination are exchanged, and a new number combination is obtained.

Specifically, the above-described process is described as an example only for the purpose of explaining the combined intersection processing process. Assuming that the number of parts to be cut is 5, the corresponding numbers are 1, 2, 3, 4, 5 respectively, selecting a number combination {1, 2, 3, 4, 5} from the obtained number combinations as a first kind of number combination, and selecting {1, 2} as a first kind of sub-ordering combination, when selecting a second kind of number combination, the second kind of number combination needs to include a sub-ordering combination {1, 2} or {2, 1}, and the sub-ordering combination {1, 2} is the same as the first kind of sub-ordering combination, and does not meet the requirement, so the second kind of number combination must include the sub-ordering combination {2, 1}, assuming that the selected second kind of number combination is {4, 2, 1, 3, 5}, at this time, the second kind of sub-ordering combination is {2, 1}, and performing position exchange processing on the first kind of sub-ordering combination {1, 2} and the second kind of sub-ordering combination {2, 1}, and obtaining different number combinations {2, 1, 3, 4, 5} and {4, 1, 2, 3, 5} from the first type number combination {1, 2, 3, 4, 5} and the second type number combination {4, 2, 1, 3, 5 }.

Further, after the preset number of number combinations is obtained in step S212, a step of calculating a cutting path length corresponding to each number combination may be further included. In the process of performing combined intersection processing on the obtained number combinations, the number combinations with shorter cutting path lengths can be selected according to the cutting path length calculation results to perform combined intersection processing, so that the optimization degree of the results can be further improved.

It should be noted that, the more the number of combined cross processing times of the number combination, the more ideal the optimization degree of the final result, however, the calculation time is also correspondingly increased, so the selection of the number of combined cross processing times needs to satisfy the balance between the optimization effect and the actual efficiency.

According to the laser cutting path planning method provided by the embodiment, aiming at the condition that the number of parts to be cut is large and the number of numbering combinations is large, in the process of searching for a relatively optimal solution, combination cross processing is carried out on the obtained numbering combinations, so that the optimization degree of the result can be further improved, and in addition, the balance between the optimization effect and the actual efficiency can be met by setting the cross probability.

In an embodiment, for the case that the number of parts to be cut is large, which results in a large number of numbering combinations, in the process of finding a relatively optimal solution, in order to further improve the optimization degree of the result, in the process of planning the laser cutting path, the obtained numbering combinations may be subjected to combination variation processing, as shown in fig. 7, and step S200 includes steps S222 to S228.

And step S222, performing preliminary sequencing according to the numbers corresponding to the parts to be cut to obtain the number combinations with the preset number. The preset number may be a fixed value, for example 50000 in the previous embodiment, or the preset number may be a ratio of the total number of the part number combinations, and the ratio may be a fixed ratio or a floating ratio.

In step S224, any number combination is selected from the obtained number combinations as a third kind of number combination, and a partial number ordering of the third kind of number combination is selected as a third kind of sub-ordering combination. And after the preset number of number combinations are obtained, selecting any number combination as a third type number combination, and intercepting a third type sub-sequencing combination from the third type number combination to perform combined cross processing.

Step S226, perform sorting transformation on the third-type sub-sorting combination to obtain a fourth-type sub-sorting combination different from the third-type sub-sorting combination. And after the third type number combination and the third type sub-ordering combination are selected, carrying out ordering transformation processing on the third type sub-ordering combination to obtain a fourth type sub-ordering combination.

Step S228, remove the third type sub-sort combination in the third type number combination, and add the fourth type sub-sort combination to the position corresponding to the third type sub-sort combination, so as to obtain a number combination different from the third type number combination. And replacing the third type of sub-sequencing combination in the third type of numbering combination with the fourth type of sub-sequencing combination to obtain a new numbering combination.

Specifically, the above-described process is described as an example only for the purpose of explaining the combined mutation process. Assuming that the number of parts to be cut is 5, the corresponding numbers are 1, 2, 3, 4 and 5 respectively, selecting a number combination {1, 2, 3, 4 and 5} as a third kind number combination, selecting {3, 4 and 5} as a third kind sub-ordering combination from the obtained number combinations, and performing ordering transformation processing on the third kind sub-ordering combination {3, 4 and 5} to obtain a fourth kind sub-ordering combination different from the third kind sub-ordering combination {3, 4 and 5}, such as {5, 3 and 4 }. And replacing the third type sub-ordered combination {3, 4, 5} in the third type number combination {1, 2, 3, 4, 5} with the fourth type sub-ordered combination {5, 3, 4} to obtain a new number combination {1, 2, 5, 3, 4 }.

Further, after the preset number of number combinations is obtained in step S222, a step of calculating a cutting path length corresponding to each number combination may be further included. In the process of performing combined mutation processing on the obtained number combinations, the number combinations with shorter cutting path lengths can be selected according to the cutting path length calculation results to perform combined mutation processing, so that the optimization degree of the results can be further improved.

It should be noted that, the more the number of combined mutation processes of the numbered combination, the more ideal the optimization degree of the final result, however, the calculation time is also correspondingly increased, so the selection of the number of combined mutation processes needs to satisfy the balance between the optimization effect and the actual efficiency. .

According to the laser cutting path planning method provided by the embodiment, aiming at the condition that the number of parts to be cut is large and the number of numbering combinations is large, in the process of searching for a relatively optimal solution, the obtained numbering combinations are subjected to combination variation processing, so that the optimization degree of the result can be further improved, and in addition, the balance between the optimization effect and the actual efficiency can be met by setting the variation probability.

The laser cutting path planning method provided by the embodiment can maximally find the optimal solution of the cutting sequence in the limited operation time range, so that the shortest cutting path track planning can be realized, the shortest cutting path track planning enables the total length of the cutting path to be shortest, and the subsequent cutting speed can be ensured to be optimal from the source. Aiming at the practical application of laser cutting, the laser cutting principle and the laser cutting process are combined, in the laser cutting path planning method, optimization can be further performed on the basis of the shortest cutting path trajectory planning, so that the cutting efficiency is further improved, and effective optimization methods comprise common edge cutting optimization, non-raising cutting optimization, flight cutting optimization, layered cutting optimization and the like.

In one embodiment, the laser cutting path planning method further comprises a co-edge cutting optimization process based on the shortest cutting path trajectory planning. When the layout of the parts to be cut is carried out, certain gaps can be kept among the parts to be cut, and the cutting process of each part is also carried out independently mostly. However, if the outer contour of the part to be machined has a large number of long straight edges, cutting in the basic shortest path planning manner is not the fastest machining manner. When typesetting, the long straight edges of the adjacent parts are spliced together, so that the track of the overlapped part only needs to be cut once, and the total length of the cut track can be greatly shortened, thereby realizing the optimization treatment of the common-edge cutting. In this embodiment, the part information includes profile information; after the step S400, the laser cutting path planning method further includes a step S500 (not shown in the figure), where the co-edge cutting analysis processing is performed according to the contour information, when the contour information of the part to be cut satisfies a preset co-edge cutting condition, the co-edge cutting optimization processing is performed on the layout information of the part to be cut, and the path planning information is correspondingly optimized according to a co-edge cutting optimization processing result. When carrying out the common edge cutting analysis processing, mainly carry out the analysis according to the profile information of adjacent part of waiting to cut, if adjacent part of waiting to cut all includes long straight flange, and through treating the part of waiting to cut and carry out operations such as translation, rotation, when the adjacent long straight flange of waiting to cut the part can be pieced together, then can carry out the common edge cutting optimal treatment, through translation, operation such as rotation will be should adjacent to wait to cut the part and carry out the stock layout again, so that adjacent long straight flange of waiting to cut the part is pieced together, and carry out corresponding optimal treatment to path planning information according to the common edge cutting optimal treatment result, after the optimal treatment, this long straight flange only need cut once can.

Specifically, the basic process for achieving the co-edge cutting is as follows: firstly, cutting a first part according to a cutting sequence defined by path planning information, and finding a common edge of the first part and a second part; then, cutting the second part from one end point of the common edge of the two parts, and finishing the cutting of the second part when the second end point of the common edge is reached, so that the cutting path of the common edge only needs to be cut once; and the following parts are continuously cut according to the logic until all the parts are cut, and all the common edges only need to be cut once, so that the length of a cutting path can be greatly shortened, and the integral cutting speed is improved.

As shown in fig. 8, an example of the common-edge cutting optimization processing is provided, the left side of fig. 8 is a schematic diagram of part cutting without the common-edge cutting optimization processing, and the right side of fig. 8 is a schematic diagram of part cutting after the common-edge cutting optimization processing, for the rectangular part a and the trapezoidal part B in the figure, the long edge of the rectangular part a and the long bottom edge of the trapezoidal part B can be regarded as long straight edges, so that the trapezoidal part B can be moved up to splice the long edge of the rectangular part a and the long bottom edge of the trapezoidal part B together. According to the cutting sequence in fig. 8, it can be seen that the cutting path length after the co-edge cutting optimization process is smaller than the cutting path length that is not optimized, and the path optimization value is the length value of the long side of the rectangular part a (the long bottom side of the trapezoidal part B).

It should be noted that, in the process of the co-edge cutting optimization processing, the lengths of the two long straight sides that can be subjected to the co-edge cutting optimization processing may be the same or different. When the lengths of the two long straight sides are the same, the path optimization value is the length value of the two long straight sides; when the lengths of the two long straight sides are different, the path optimization value is the length value of the shorter side of the two long straight sides.

On the basis of the shortest cutting path trajectory planning, the cutting path length can be shortened and the overall cutting speed is increased by performing the co-edge cutting optimization processing, so that the cutting efficiency is improved.

In one embodiment, the laser cutting path planning method further comprises a non-head-up cutting optimization process based on the shortest cutting path trajectory planning. The basic logic of laser dicing is: firstly, positioning a laser cutting head to the starting point of a target contour; then starting follow-up control; after the servo is in place, starting auxiliary gas output; starting laser output after the output air pressure is in place; delaying for waiting for a moment, starting track interpolation, adjusting laser power in real time according to track speed, simultaneously adjusting the height between the cutting head and the plate in real time through follow-up control, ensuring that a focus is always in a proper position, continuously outputting auxiliary gas to assist in finishing the cutting process, closing the laser, closing the gas, closing the follow-up control after contour cutting is finished, lifting the cutting head to a safe height, then moving to the next contour, and repeating the steps until all the contours are cut. In the cutting process, the follow-up is required to be closed and the cutting head is lifted to a safe height after each contour is cut, then the contour is moved to the next contour, the follow-up is started again, and then the next cutting is carried out.

Because the follow-up control of the laser cutting is controlled according to the difference value between the detection height position and the calibrated height position of the capacitance sensor, the speed is generally slower in order to prevent the overshoot from colliding with the plate. The repeated opening and closing follow-up has a great influence on the overall cutting speed, and particularly in the case of a large number of profiles and a small profile size, if the process of opening and closing follow-up control is repeated for each profile, the cutting efficiency is very low. In fact, the need to close the follower and lift the head to move to the next profile after each profile has been cut is to avoid the head from colliding when passing through the cut area during the empty movement. Because the capacitive sensor will not detect the surface of the plate when passing through the cut area, the cutting head will directly descend and impact the worktable.

In this embodiment, the path planning information includes idle travel trajectory information; after step S400, the laser cutting path planning method further includes step S600 (not shown in the figure), previewing the laser cutting path trajectory according to the path planning information, adjusting the sub-sorting combination corresponding to the empty path trajectory if the empty path trajectory passes through the cut region in the laser cutting path trajectory, so that the empty path trajectory corresponding to the adjusted sub-sorting combination avoids the cut region, and performing corresponding optimization processing on the path planning information according to the adjustment result. When the optimization processing of non-head-up cutting is carried out, the cutting path track is mainly adjusted, so that the whole laser cutting path track cannot pass through any cut area, the follow-up control can be started all the time in the whole cutting process, the non-head-up cutting is realized, and the cutting speed is improved.

Specifically, the basic process for realizing the non-raising head cutting is as follows: firstly previewing a laser cutting path track according to path planning information, traversing contours one by one, comparing the track passed by an idle stroke with the cut contour, if the idle stroke track passes through the cut region, adjusting the cutting starting point of the current contour, then repeatedly judging whether the idle stroke track still passes through the cut region, if all available cutting starting points are tried, the cut region still cannot be avoided, trying to bypass the cut contour, or manually adjusting a local cutting path near the contour, and finally ensuring that all tracks do not pass through the cut region, thereby realizing non-raising cutting on the basis.

As shown in fig. 9, an example of the non-raising head cutting optimization processing is provided, the left side of fig. 9 is a schematic diagram of the part cutting without the non-raising head cutting optimization processing, the right side of fig. 9 is a schematic diagram of the part cutting without the raising head cutting optimization processing, in the left schematic diagram, the part cutting sequence is { a, B, C }, and it can be seen from the cutting path shown in the figure that, after the part a is cut, the idle stroke trajectory L1 pointing to the part B from the part a passes through the cut region of the part a; after the part B is cut, the idle stroke trajectory L2 directed from the part B to the part C passes through the cut region of the part B. Since both the idle stroke trajectories L1 and L2 pass through the already cut region, it is necessary to perform the non-raising cutting optimization process.

Firstly, the optimization processing of non-raising cutting is performed on the part a, as shown in the schematic diagram on the right side of fig. 9, the cutting starting point of the part a can be adjusted to the highest point position, and the contour of the part a starts to be cut at the highest point position, so that the idle stroke track from the part a to the part B does not pass through the cut area, and the shortest distance of the idle stroke track can be ensured. After the part A is cut, the cutting can be carried out according to the original cutting { A, B, C }, the cutting starting point of the part B is positioned on the uppermost edge of the part B in the drawing according to the idea of cutting the part A, the cutting of the part B is finished from the cutting starting point, and after the part B is cut, the part B is moved to the part C in an idle stroke to finish the cutting of the part C. After the part a is cut, the cutting may be performed in the order of { a, C, B } in the right diagram of fig. 9 instead of the original cutting { a, B, C }. In the drawing, the idle stroke trajectory directed from the part C to the part B is perpendicular to the long side of the part B, and the idle stroke trajectory is slightly inclined in the drawing to perform a distinctive display function. The two cutting methods can enable the idle stroke track to avoid the cut area, and the cutting path distances of the two cutting methods are the same and are the shortest cutting path distance.

This embodiment is through adjusting cutting path orbit to make whole laser cutting path orbit not pass through any cutting region, like this in whole cutting process alright open follow-up control always, realize not raising the head cutting, promote cutting speed, thereby improve cutting efficiency.

In one embodiment, the laser cutting path planning method further comprises a flight cutting optimization process based on the shortest cutting path trajectory planning. The flight cutting is a path planning mode which is used for cutting the edges of all the graphs facing the same direction at one time aiming at the whole-column graphs with regular arrangement, and finally realizing the batch cutting of all the graphs. In this embodiment, after the step S400, the laser cutting path planning method further includes a step S700 (not shown in the figure), performing flight cutting analysis processing according to the part information and the layout information, and performing corresponding optimization processing on the path planning information according to a result of the flight cutting analysis processing when the part information and the layout information satisfy a preset flight cutting condition.

According to a conventional cutting path planning mode, the contours are cut individually according to the sequence, and each axis of the machine tool needs to be accelerated and decelerated frequently due to the change of the cutting direction in each contour, so that the efficiency is influenced. For regularly arranged array patterns, a flight cutting mode can be adopted to optimize a cutting path and improve the cutting speed.

In order to realize flight cutting, the matching of path planning and laser output is needed, firstly, the parts are arranged in an array mode, edges of all graphs facing to the same direction are planned in the same cutting path in a unified mode, and then batch unified cutting is carried out. The cutting head moves forward along the direction of a certain edge of the contour, on the passing track, only the part which is overlapped with the contour track needs to be cut, and other areas can not be cut. The specific method is that the laser output is started immediately to cut when the cutting head reaches the edge to be cut, the laser output is stopped instantly after the edge is cut, namely the edge is about to enter a non-cutting area, but the cutting head continues to move forwards, and the operation is repeated until all the outlines in the direction are cut, and then the cutting head turns to the other direction.

As shown in fig. 10, an example of the flight cutting optimization process is provided, the left side of fig. 10 is a schematic diagram of the part cutting without the flight cutting optimization process, and the right side of fig. 10 is a schematic diagram of the part cutting after the flight cutting optimization process, and as can be seen from fig. 10, if the cutting is performed by the trajectory planning method without the flight cutting optimization process on the left side, there are 21 turns in total, and the cutting is performed by the trajectory planning method after the flight cutting optimization process on the right side, there are only 11 turns. During the laser cutting process, the more the rotation direction is, the more frequent the acceleration and deceleration is, and the cutting speed is reduced. For large-scale whole-column patterns, the flight cutting optimization processing can greatly improve the cutting speed by reducing the steering times.

It should be noted that, when performing the flight cutting optimization, because the preset flight cutting condition is special, that is, the parts to be cut are required to be the array type graphs with regular arrangement, the flight cutting optimization may be performed after the path planning information is obtained in step S400; or after the part information and layout information of the part to be cut are acquired in step S100, if it is determined that the part to be cut satisfies the preset flight cutting condition, that is, the part to be cut is an array type graph with a regular arrangement, the path planning information may also be directly acquired according to the cutting path obtained by the flight cutting optimization processing.

The embodiment carries out flight cutting optimization processing through the path planning information of the part to be cut meeting the preset flight cutting condition, and can effectively reduce the steering times, thereby improving the cutting speed and further improving the cutting efficiency.

In one embodiment, the laser cutting path planning method further comprises a hierarchical cutting optimization process based on the shortest cutting path trajectory planning. The layered cutting is to distribute the contour on different cutting layers according to the size of the contour size under the condition that the size difference of each contour size in the part is large, set a parameter group suitable for the contour size of the cutting layer aiming at different cutting layers, and simultaneously carry out cutting layer by layer according to the size of the contour in sequence during cutting. Therefore, the profiles with different sizes can be cut by adopting the most appropriate parameter set, the cutting precision can be ensured, and the cutting speed can be ensured.

In the actual laser cutting process, appropriate power curve, process parameters, speed, acceleration and other parameter values need to be set, so that the cutting can be finished efficiently and with high quality. Different material types, different sheet thicknesses and different profile dimensions have different requirements for the above-mentioned parameter values. In conventional cutting methods, each profile inside a part is usually cut with the same parameters, i.e. each profile of different size is cut with the same speed, acceleration and power curve, however, this results in a reduction of the overall cutting speed. Since generally, to ensure accuracy, the power curve slope for the small profile is lower, the cutting speed and acceleration values are smaller, while the power curve slope for the large profile is higher and greater speeds and accelerations can be accommodated. If the profiles with different sizes are cut by using the same process parameters, in order to ensure that the cutting quality of each profile is qualified, only the parameter set with the lowest performance can be used for cutting all the profiles, so that the overall cutting efficiency is very low.

In this embodiment, the part information includes inner contour size information, and the path planning information includes inner contour cutting sequence information of the part; after the step S400, the laser cutting path planning method further includes a step S800 (not shown in the figure), performing size difference calculation processing according to the inner contour size information of the same part to be cut, when the difference of the inner contour sizes of the parts of the same part to be cut reaches a preset size difference, performing grouping processing on the inner contours of the parts to be cut according to the inner contour size information, wherein the inner contours of the same group have the same cutting priority, and performing corresponding optimization processing on the cutting sequence information of the inner contours of the parts according to the grouping processing result.

Specifically, when the inner contours of the parts to be cut are grouped according to the information of the inner contour dimensions, the contour dimensions may be the span sizes of the inner contours in the X-Y directions, and the span sizes in the X-Y directions may be calculated according to the maximum coordinate value and the minimum coordinate value of the inner contours in the X direction and the maximum coordinate value and the minimum coordinate value of the inner contours in the Y direction. It should be noted that, the factors such as the side length, the perimeter, and the area of the inner contour may also be used as the contour size, so as to implement the grouping processing of the inner contour of the part to be cut as the basis.

As shown in fig. 11, an example of a hierarchical cutting optimization process is provided, where the part a on the template includes a plurality of inner contours, and the difference of the inner contour sizes reaches a preset size difference, and at this time, according to the information of the inner contour sizes of the part a, such as the span size in the X-Y direction, the inner contours of the part a are divided into three groups, where the first group includes inner contours a11, a12, a13, the second group includes inner contours a21, a22, a23, a24, a25, a26, and the third group includes inner contours a31, a32, a33, a34, a35, and when the cutting path is planned, the inner contours in each group may be cut sequentially in the cutting order (the direction of the dotted arrows) in the drawing.

According to the embodiment, layered cutting optimization processing is carried out according to the inner contour dimension information of the part to be cut, so that the contours of all sizes can be cut at the optimal cutting speed and the optimal acceleration, the overall cutting speed can be greatly improved under the condition that the difference of the contour dimension is large, and the cutting efficiency is further improved.

In one embodiment, based on the shortest cutting path trajectory planning, the laser cutting path planning method includes two or more optimization processes of the above embodiments, namely, the common edge cutting optimization process, the non-raising cutting optimization process, the flying cutting optimization process, and the hierarchical cutting optimization process. For example, when part of the parts to be cut meet the preset co-edge cutting condition, the co-edge cutting optimization processing can be performed on the path planning information corresponding to the part meeting the condition; when part of the parts to be cut meet the preset conditions of other optimization processes, the path planning information corresponding to the part of the parts can be optimized correspondingly.

In the embodiment, the path planning information is optimized through two or more processing modes of the common-edge cutting optimization processing, the non-raising cutting optimization processing, the flying cutting optimization processing and the layered cutting optimization processing, so that the cutting speed and the cutting efficiency can be further improved.

In one embodiment, as shown in fig. 12, a laser cutting path planning apparatus is provided, the apparatus includes an information obtaining module 100, a numbering combination module 200, a track calculating module 300, and a path planning module 400, the information obtaining module 100 is configured to obtain part information and layout information of a part to be cut; the numbering combination module 200 is used for numbering the parts to be cut, and numbering and sequencing the parts according to the numbers corresponding to the parts to be cut to obtain numbering combinations, and the numbering combinations represent the cutting sequences of the corresponding parts to be cut; the track calculation module 300 is configured to obtain cutting track information corresponding to each serial number combination according to the serial number combination, the part information, and the layout information, and obtain cutting track information with a shortest path from the cutting track information of each serial number combination; the path planning module 400 is configured to plan a cutting path according to the number combination, the part information, and the layout information corresponding to the cutting trajectory information with the shortest path, so as to obtain path planning information.

The embodiment provides a laser cutting path planning device, through treating the part of treating cutting and numbering and combination processing, after the cutting orbit length that every combination corresponds is calculated, the combination that the shortest orbit corresponds is selected as the optimal part cutting order, and carries out the path planning, can guarantee that whole cutting path is shortest to shorten laser cutting time, improve laser cutting efficiency, improve the scientificity and the rationality of laser cutting path planning.

In one embodiment, as shown in fig. 13, the laser cutting path planning apparatus further includes an optimization processing module 500, and the optimization processing module 500 is configured to perform one or more of the optimization processing of the common edge cutting, the optimization processing of the non-raising head cutting, the optimization processing of the flight cutting, and the optimization processing of the layered cutting in the foregoing embodiments.

For specific definition of the laser cutting path planning device, reference may be made to the above definition of the laser cutting path planning method, which is not described herein again. All or part of the modules in the laser cutting path planning device can be realized by software, hardware and a combination thereof. The modules can be embedded in a hardware form or independent from a processor in the computer device, and can also be stored in a memory in the computer device in a software form, so that the processor can call and execute operations corresponding to the modules.

In one embodiment, a computer device is provided, comprising a memory and a processor, the memory having a computer program stored therein, the processor implementing the following steps when executing the computer program: acquiring part information and layout information of a part to be cut; numbering the parts to be cut, and numbering and sequencing the parts according to the numbers corresponding to the parts to be cut to obtain a number combination, wherein the number combination represents the cutting sequence of the corresponding parts to be cut; obtaining cutting track information corresponding to each number combination according to the number combination, the part information and the layout information, and obtaining the cutting track information with the shortest path from the cutting track information of each number combination; and planning the cutting path according to the number combination, the part information and the layout information corresponding to the cutting track information with the shortest path to obtain path planning information.

According to the computer equipment, the parts to be cut are numbered and combined, after the cutting track length corresponding to each combination is calculated, the combination corresponding to the shortest track is selected as the optimal part cutting sequence, and the path planning is carried out, so that the shortest overall cutting path can be ensured, the laser cutting time is shortened, the laser cutting efficiency is improved, and the scientificity and rationality of the laser cutting path planning are improved.

In one embodiment, a computer-readable storage medium is provided, having a computer program stored thereon, which when executed by a processor, performs the steps of: acquiring part information and layout information of a part to be cut; numbering the parts to be cut, and numbering and sequencing the parts according to the numbers corresponding to the parts to be cut to obtain a number combination, wherein the number combination represents the cutting sequence of the corresponding parts to be cut; obtaining cutting track information corresponding to each number combination according to the number combination, the part information and the layout information, and obtaining the cutting track information with the shortest path from the cutting track information of each number combination; and planning the cutting path according to the number combination, the part information and the layout information corresponding to the cutting track information with the shortest path to obtain path planning information.

According to the storage medium, the parts to be cut are numbered and combined, after the cutting track length corresponding to each combination is calculated, the combination corresponding to the shortest track is selected as the optimal part cutting sequence, and path planning is carried out, so that the shortest overall cutting path can be ensured, the laser cutting time is shortened, the laser cutting efficiency is improved, and the scientificity and rationality of laser cutting path planning are improved.

It will be understood by those skilled in the art that all or part of the processes of the methods of the embodiments described above can be implemented by hardware related to instructions of a computer program, which can be stored in a non-volatile computer-readable storage medium, and when executed, can include the processes of the embodiments of the methods described above. Any reference to memory, storage, database, or other medium used in the embodiments provided herein may include non-volatile and/or volatile memory, among others. Non-volatile memory can include read-only memory (ROM), Programmable ROM (PROM), Electrically Programmable ROM (EPROM), Electrically Erasable Programmable ROM (EEPROM), or flash memory. Volatile memory can include Random Access Memory (RAM) or external cache memory. By way of illustration and not limitation, RAM is available in a variety of forms such as Static RAM (SRAM), Dynamic RAM (DRAM), Synchronous DRAM (SDRAM), Double Data Rate SDRAM (DDRSDRAM), Enhanced SDRAM (ESDRAM), Synchronous Link DRAM (SLDRAM), Rambus Direct RAM (RDRAM), direct bus dynamic RAM (DRDRAM), and memory bus dynamic RAM (RDRAM).

The technical features of the embodiments described above may be arbitrarily combined, and for the sake of brevity, all possible combinations of the technical features in the embodiments described above are not described, but should be considered as being within the scope of the present specification as long as there is no contradiction between the combinations of the technical features.

The above-mentioned embodiments only express several embodiments of the present invention, and the description thereof is more specific and detailed, but not construed as limiting the scope of the invention. It should be noted that, for a person skilled in the art, several variations and modifications can be made without departing from the inventive concept, which falls within the scope of the present invention. Therefore, the protection scope of the present patent shall be subject to the appended claims.

Claims

1. A laser cutting path planning method is characterized by comprising the following steps:

acquiring part information and layout information of a part to be cut;

numbering the parts to be cut, and numbering and sequencing the parts according to the numbers corresponding to the parts to be cut to obtain a numbering combination, wherein the numbering combination represents the cutting sequence of the corresponding parts to be cut, and the numbering and sequencing comprises the following steps: performing preliminary sequencing according to the number corresponding to the part to be cut to obtain the number combinations of the preset number; obtaining a new number combination based on the number combinations of the preset number;

2. The method for planning a laser cutting path according to claim 1, wherein the step of obtaining a new number combination based on the preset number of number combinations comprises:

selecting any number combination from the obtained number combinations as a first type number combination, and selecting partial number ordering of the first type number combination as a first type sub-ordering combination;

selecting a second type of number combination from the obtained other number combinations, wherein the second type of number combination comprises a second type of sub-ordering combination consisting of all numbers in the first type of sub-ordering combination, the length of the second type of sub-ordering combination is the same as that of the first type of sub-ordering combination, and the second type of sub-ordering combination is different from that of the first type of sub-ordering combination;

and performing position exchange processing on the first type of sub-sequencing combination and the second type of sub-sequencing combination to obtain a number combination different from the first type of number combination and the second type of number combination.

3. The method for planning a laser cutting path according to claim 1, wherein the step of obtaining a new number combination based on the preset number of number combinations further comprises:

selecting any number combination from the obtained number combinations as a third type number combination, and selecting partial number ordering of the third type number combination as a third type sub-ordering combination;

carrying out sorting transformation processing on the third type of sub-sorting combination to obtain a fourth type of sub-sorting combination different from the third type of sub-sorting combination;

and removing the third type of sub-sequencing combination in the third type of numbering combination, and adding the fourth type of sub-sequencing combination to the position corresponding to the third type of sub-sequencing combination to obtain a numbering combination different from the third type of numbering combination.

4. The laser cutting path planning method according to claim 1, wherein the part information includes contour information; after the step of planning the cutting path according to the number combination corresponding to the cutting trajectory information with the shortest path, the part information and the layout information to obtain path planning information, the method further comprises the following steps:

and performing co-edge cutting analysis processing according to the contour information, performing co-edge cutting optimization processing on the layout information of the part to be cut when the contour information of the part to be cut meets a preset co-edge cutting condition, and performing corresponding optimization processing on the path planning information according to a co-edge cutting optimization processing result.

5. The laser cutting path planning method according to claim 1, wherein the path planning information includes idle stroke trajectory information; after the step of planning the cutting path according to the number combination corresponding to the cutting trajectory information with the shortest path, the part information and the layout information to obtain path planning information, the method further comprises the following steps:

previewing a laser cutting path track according to the path planning information, adjusting a sub-sorting combination corresponding to the empty path track if the empty path track passes through a cut area in the laser cutting path track so as to enable the empty path track corresponding to the adjusted sub-sorting combination to avoid the cut area, and performing corresponding optimization processing on the path planning information according to an adjustment result.

6. The method for planning a laser cutting path according to claim 1, wherein after the step of planning a cutting path according to the number combination corresponding to the cutting trajectory information having the shortest path, the part information, and the layout information to obtain path planning information, the method further comprises:

and performing flight cutting analysis processing according to the part information and the layout information, and performing corresponding optimization processing on the path planning information according to a flight cutting analysis processing result when the part information and the layout information meet preset flight cutting conditions.

7. The laser cutting path planning method of claim 1, wherein the part information includes inner contour dimension information, and the path planning information includes inner contour cutting sequence information of the part; after the step of planning the cutting path according to the number combination corresponding to the cutting trajectory information with the shortest path, the part information and the layout information to obtain path planning information, the method further comprises the following steps:

and calculating size difference values according to the inner contour size information of the same part to be cut, grouping the inner contours of the parts to be cut according to the inner contour size information when the difference value of the inner contour sizes of the parts of the same part to be cut reaches a preset size difference value, wherein the inner contours of the same group have the same cutting priority, and correspondingly optimizing the cutting sequence information of the inner contours of the parts according to the grouping processing result.

8. A laser cutting path planning apparatus, comprising:

the numbering combination module is used for numbering the parts to be cut and carrying out numbering and sequencing processing according to the numbers corresponding to the parts to be cut to obtain numbering combinations, and the numbering combinations represent the cutting sequence of the corresponding parts to be cut, wherein the numbering and sequencing processing comprises the following steps: performing preliminary sequencing according to the number corresponding to the part to be cut to obtain the number combinations of the preset number; obtaining a new number combination based on the number combinations of the preset number;

9. A computer device comprising a memory and a processor, the memory storing a computer program, characterized in that the processor, when executing the computer program, implements the steps of the laser cutting path planning method according to any one of claims 1 to 7.

10. A computer-readable storage medium, on which a computer program is stored, which, when being executed by a processor, carries out the steps of the laser cutting path planning method according to any one of claims 1 to 7.