Cutter path planning method, device, system, storage medium and program product

Abstract

The application discloses a knife cutting path planning method, device, system, storage medium and program product. The knife cutting path planning method comprises the following steps: determining a graphic level and a level processing sequence of a plurality of graphics to be processed; determining a knife cutting angle of the graphics of each graphic level; and determining a knife cutting path based on the level processing sequence and the knife cutting angle of the graphics of each graphic level. The application is used to solve the problem of processing failure caused by the failure to plan a knife cutting path in combination with the position and the knife cutting angle of the graphics to be processed.

Description

Technical Field

[0001] This invention relates to the field of computer technology, and specifically to a method, device, system, storage medium, and program product for knife-cutting path planning. Background Technology

[0002] Laser processing equipment and other cutting devices require determining the cutting path based on the graphic to be processed before processing. However, when there are multiple graphics to be processed, if the cutting path is not determined in advance based on the position and cutting angle of the graphics, processing errors can easily occur. Summary of the Invention

[0003] The main objective of this invention is to provide a cutting path planning method, device, system, storage medium, and program product to solve the problem of processing errors caused by the inability to plan the cutting path in conjunction with the position and cutting angle of the graphic to be processed.

[0004] To achieve the above objectives, the present invention provides a knife-cutting path planning method, comprising the following steps:

[0005] Determine the graphic hierarchy and processing order of the multiple graphics to be processed;

[0006] Determine the cutting angle of the graphics at each graphic level;

[0007] The target cutting path is determined based on the hierarchical processing sequence and the cutting angle of the graphics at each graphic level.

[0008] In one embodiment, determining the graphic hierarchy and processing order of the multiple graphics to be processed includes:

[0009] Obtain the graphic positions of multiple graphics to be processed;

[0010] When multiple graphics are nested, the graphics are divided into levels according to the nesting relationship, and the multiple graphics levels are sorted in order from the inside to the outside to determine the processing order of the multiple graphics levels.

[0011] When multiple graphics do not have a nested relationship, the processing order of the multiple graphics is determined to be the same.

[0012] In one embodiment, determining the cutting angle of the graphic at each graphic level includes:

[0013] Determine the number of graphics at each graphic level;

[0014] When there is only one graphic at the same graphic level, determine the cutting angle of that graphic.

[0015] When there are multiple graphics at the same graphic level, the starting graphic to be processed at that graphic level is determined. Starting from the starting graphic to be processed, the remaining graphics to be processed are cyclically processed, and the one closest to the previous graphic to be processed is determined as the next graphic to be processed, until the graphic processing order of all graphics at the same graphic level is determined, and the cutting angle of each graphic is determined in turn according to the graphic processing order.

[0016] In one embodiment, determining the cutting angle of the graphic at each graphic level includes:

[0017] Determine the number of graphics at each graphic level;

[0018] When there is only one graphic at the same graphic level, determine the cutting angle of that graphic.

[0019] When there are multiple graphics at the same graphic level, determine the processing priority of the graphics at that graphic level in the X and Y directions;

[0020] Based on the processing priority, the processing order of all graphics at the same graphic level is determined, and the cutting angle of each graphic is determined sequentially according to the processing order.

[0021] In one embodiment, determining the graphic processing order of all graphics at the same graphic level based on the processing priority includes:

[0022] When the processing priority is characterized by prioritizing processing in the X direction, the processing order of all graphics at the same graphic level is determined sequentially from left to right in the X direction.

[0023] And / or,

[0024] When the processing priority is characterized by prioritizing processing in the Y direction, the processing order of all graphics at the same graphic level is determined sequentially from top to bottom in the Y direction.

[0025] In one embodiment, determining the cutting angle of the graphic at each graphic level includes:

[0026] When the current graphic level is the initial processing level, determine the starting angle of the cutting of the first graphic to be processed, and then determine the cutting angles of the remaining graphics to be processed in sequence, so that the difference between the starting angle of the cutting of the next graphic to be processed and the ending angle of the cutting of the previous graphic to be processed is within the set difference range.

[0027] When the current graphic level is not the initial processing level, the cutting start angle of the starting graphic to be processed in the current graphic level is determined based on the cutting end angle of the cutting tool in the previous graphic level, and the cutting angles of the remaining graphics to be processed are determined in sequence, so that the difference between the cutting start angle of the next graphic to be processed and the cutting end angle of the previous graphic to be processed in the same graphic level is within the set difference range.

[0028] In one embodiment, determining the target cutting path based on the hierarchical processing sequence and the cutting angle of the graphics at each graphic level includes:

[0029] Generate the cutting path corresponding to each graphic level based on the cutting angle of the graphic at each graphic level;

[0030] According to the hierarchical processing order, all cutting paths are sequentially associated to obtain the target cutting path.

[0031] In one embodiment, determining the target cutting path based on the hierarchical processing sequence and the cutting angle of the graphics at each graphic level includes:

[0032] Based on the hierarchical processing sequence and the cutting angle of the graphics at each graphic level, candidate cutting paths and the cutting end angle of the candidate cutting paths are obtained.

[0033] When there is only one candidate cutting path, the candidate cutting path is determined as the target cutting path;

[0034] When multiple candidate cutting paths are obtained, the candidate cutting path with the cutting end angle closest to the cutter's zero-angle is determined as the target cutting path.

[0035] In one embodiment, the knife-cutting path planning method further includes the following steps:

[0036] Determine the thickness of the material to be processed for the multiple graphics to be processed, and determine the cutting height based on the material thickness.

[0037] To achieve the above objectives, the present invention also provides a laser processing apparatus, comprising:

[0038] slide rail;

[0039] A processing head, which is slidably mounted on the slide rail;

[0040] A communication component, the communication component being configured to receive a target cutting path obtained according to the steps of the cutting path planning method described above;

[0041] A controller that controls the movement of the processing head on the slide rail to perform processing based on the target cutting path.

[0042] To achieve the above objectives, the present invention also provides a laser processing system, comprising:

[0043] Laser processing equipment, the laser processing equipment comprising a processing equipment base plate and a processing head, the processing equipment base plate including a processing area for placing processing materials, the processing head being used to move on the processing area; and

[0044] A terminal device that communicates with the laser processing equipment, the terminal device being used to execute the blade path planning method described above.

[0045] To achieve the above objectives, the present invention also provides a computer-readable storage medium storing a knife-cutting path planning program thereon, which, when executed by a processor, implements the steps of the knife-cutting path planning method as described above.

[0046] To achieve the above objectives, the present invention also provides a computer program product, including a knife-cutting path planning program, which, when executed by a processor, implements the steps of the knife-cutting path planning method as described above.

[0047] Compared with the prior art, the present invention has the following beneficial effects:

[0048] This process involves determining the graphic hierarchy and processing sequence of multiple graphics to be processed; determining the cutting angle of each graphic hierarchy; and determining the target cutting path based on the processing sequence and the cutting angle of each graphic hierarchy. By determining the graphic hierarchy and processing sequence of multiple graphics to be processed, and combining the graphic positions to plan the processing path, global planning of the cutting path for the graphics to be processed is achieved. This reduces potential processing errors, ensures the stability and reliability of the processing process, and improves processing efficiency and quality, meeting the cutting requirements of different graphics. Determining the cutting angle of each graphic hierarchy and planning the cutting path accordingly reduces the target cutting path and tool turning time, further avoiding the non-productive time occupied by multiple and large tool turns during the processing of each graphic hierarchy, effectively improving processing efficiency. Attached Figure Description

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

[0050] Figure 1This is a flowchart of an embodiment of the knife-cutting path planning method of the present invention;

[0051] Figure 2 A detailed flowchart of step S100 of an embodiment of the blade cutting path planning method of the present invention;

[0052] Figure 3 A partial flowchart of step S200 of an embodiment of the blade cutting path planning method of the present invention;

[0053] Figure 4 A partial flowchart of step S200 of an embodiment of the blade cutting path planning method of the present invention;

[0054] Figure 5 A partial flowchart of step S200 of an embodiment of the blade cutting path planning method of the present invention;

[0055] Figure 6 This is a partial flowchart of step S300 of an embodiment of the blade cutting path planning method of the present invention;

[0056] Figure 7 This is a partial flowchart of step S300 of an embodiment of the blade cutting path planning method of the present invention;

[0057] Figure 8 This is a schematic diagram of the graphic to be processed applied in an embodiment of the present invention;

[0058] Figure 9 A schematic diagram of the graphic to be processed, applied to another embodiment of the present invention;

[0059] Figure 10 A schematic diagram of the graphic to be processed, applied in another embodiment of the present invention;

[0060] Figure 11 This is a schematic diagram of the graphic to be processed, applied in another embodiment of the present invention.

[0061] The realization of the objective, functional features and advantages of the present invention will be further explained in conjunction with the embodiments and with reference to the accompanying drawings. Detailed Implementation

[0062] The technical solutions of the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those of ordinary skill in the art without creative effort are within the scope of protection of the present invention.

[0063] It should be noted that if all directional indications in the embodiments of the present invention are only used to explain the relative positional relationship and movement of each component in a specific posture, the directional indications will also change accordingly if the specific posture changes.

[0064] In this invention, the use of terms such as "first," "second," etc., is for descriptive purposes only and should not be construed as indicating or implying their relative importance, or implicitly specifying the number of technical features indicated. Therefore, a feature defined with "first" or "second" may explicitly or implicitly include at least one of those features. If the description in this invention refers to "A and / or B," it indicates that solution A or solution B is included, or that solutions A and B are included. Furthermore, the technical solutions of various embodiments can be combined with each other, but this must be based on the ability of those skilled in the art to implement them. When the combination of technical solutions is contradictory or impossible to implement, it should be considered that such a combination of technical solutions does not exist and is not within the scope of protection claimed by this invention.

[0065] Laser processing equipment such as laser engraving equipment, laser cutting equipment, and blade cutting equipment require determining the processing path based on the graphic to be processed before processing. Taking blade cutting as an example, when there are multiple graphics to be processed, if the cutting path is not determined in advance based on the position of the graphic to be processed and the cutting angle, processing errors are likely to occur.

[0066] To address the issue of machining errors caused by failing to plan the cutting path based on the position of the graphic to be processed and the cutting angle, refer to Figures 1 to 7 This application proposes a cutting path planning method, device, system, storage medium, and program product. The method determines the target cutting path based on the graphic hierarchy, processing sequence, and cutting angle of multiple graphics to be processed, reducing processing errors and optimizing processing results. Specifically, the storage medium is a computer-readable storage medium; the system is a laser processing system, which includes processing equipment and a terminal device communicating with the processing equipment. The processing equipment includes a base plate and a processing head. The base plate is used to hold the processing material, and the processing head is used to move on the base plate; the terminal device is used to execute the cutting path planning method described below.

[0067] Reference Figure 1 The knife-cutting path planning method includes the following steps:

[0068] Step S100: Determine the graphic hierarchy and processing order of the multiple graphics to be processed;

[0069] Step S200: Determine the cutting angle of the graphics at each graphic level;

[0070] Step S300: Determine the target cutting path based on the hierarchical processing sequence and the cutting angle of the graphics at each graphic level.

[0071] In some optional embodiments of this application, step S100 may specifically be, but is not limited to, determining the graphic hierarchy and processing order of the multiple graphics to be processed according to their nesting relationship, overlapping relationship, graphic spacing, relative position, and other positional relationships. This is used to adjust and determine the graphic hierarchy and layer order of the graphics to be processed according to their shape, position, and other graphic positional relationships.

[0072] After determining the graphic hierarchy of multiple graphics to be processed, the cutting angle of each graphic hierarchy is determined. The graphics at each hierarchy are then sorted, and the cutting angles for graphics within the same hierarchy are determined. By combining graphic position planning with machining path planning, global planning of the cutting path for the graphics to be processed can be achieved, reducing potential machining errors, ensuring the stability and reliability of the machining process, and improving machining efficiency and quality. This approach is suitable for processing graphics with different shapes, locations, and other graphic characteristics, expanding the machinable range and meeting the cutting requirements of various graphics.

[0073] By determining the processing sequence of each graphic level and the graphic itself, and after determining the cutting angle of one graphic level, the cutting angle of the next graphic level is determined according to the processing sequence. By planning the cutting path by associating the cutting angles of different graphic levels, the target cutting path and tool turning time can be reduced. Furthermore, it avoids the non-productive time occupied by multiple tool turns and large-amplitude tool turns when processing each graphic level, effectively improving processing efficiency and avoiding the problem of multiple large-amplitude tool turns required in the generated target cutting path.

[0074] By planning the cutting path using a determined cutting angle suitable for the machined graphic, the number of tool lifts, tool turns, and tool turn amplitudes can be reduced. This reduces tool wear caused by excessive tool turns and large turn amplitudes, extending tool life and lowering production costs. Furthermore, it avoids affecting machining accuracy due to excessively large cutting angles, thereby improving machining precision and optimizing the cutting process.

[0075] It should be noted that the cutting path planning scheme shown in this application is suitable for planning cutting paths for graphics to be processed with different graphic positions, shapes, and other graphic features. The determined graphic levels can be one or any number of levels: when there is only one graphic level, after determining the cutting angles of all graphics to be processed, the cutting path is determined based on the cutting angles of all graphics; when there are multiple graphic levels, the cutting angles of the graphics at each graphic level are determined sequentially based on the processing order of the graphic levels, until the cutting angles of the graphics at all graphic levels are determined, and then the target cutting path is generated based on the cutting angles of all graphics at all graphic levels.

[0076] Furthermore, in some optional embodiments of this application, when performing step S300, which determines the target cutting path based on the hierarchical processing sequence and the cutting angle of the graphics at each graphic level, multiple sets of candidate cutting paths may be generated when there are multiple cutting angles for the graphics at each graphic level (multiple candidate cutting angles appear). In response to this situation, the target cutting path can be determined by simulating and calculating tool wear (predicting tool wear) using software, thereby ensuring processing quality. Alternatively, the number of tool turns in multiple candidate cutting paths can be calculated using an algorithm, and the set with the fewest tool turns can be determined as the target cutting path. Or, the cutting path can be simplified by optimizing the direction of the cutting path in the X, Y, or other different directions, such as optimizing the W-axis rotation amplitude, making the cutting path more aesthetically pleasing. It should be noted that the acquired candidate cutting paths also include X-direction and Y-direction cutting paths. When machining materials with high precision requirements, excessive Y-direction movement can introduce additional errors and vibrations, affecting machining accuracy and quality. Therefore, the path with fewer Y-direction movements and shorter distances can be selected as the target cutting path. Specifically, the Y-direction path of each candidate cutting path is acquired, and the path with the fewest Y-direction paths (or the shortest Y-direction path) among multiple candidate paths is determined as the target cutting path. Furthermore, high-precision machine tools can be used to further reduce angular errors during tool turning. The cutting path planning method can be further improved by modifying the machining equipment, the software algorithm, or by using software path simulation, to select a better target cutting path.

[0077] Reference Figure 2 In one embodiment, step S100, determining the graphic hierarchy and processing order of the multiple graphics to be processed, includes:

[0078] Step S110: Obtain the graphic positions of the multiple graphics to be processed;

[0079] Step S120: When multiple graphics have a nested relationship, divide the graphics into levels according to the nesting relationship, and sort the multiple graphics levels in order from the inside to the outside to determine the processing order of the multiple graphics levels.

[0080] Step S130: When there is no nesting relationship between the graphic positions of multiple graphics, determine that the processing order of the multiple graphics is the same.

[0081] Optionally, the cutting path planning method shown in this application can be used to call pre-stored graphic information, or to obtain images in various formats such as SVG images containing multiple graphics to be processed, or other graphic information related to the graphics to be processed, input from the keyboard, external devices, etc. After obtaining the graphic positions of the multiple graphics to be processed based on the obtained graphic information, the multiple graphics to be processed are captured in order from the outside to the inside to determine whether there is a nested relationship between the graphic positions of the multiple graphics.

[0082] When cutting closed or complex shapes, if multiple shapes are nested and the outer shape is processed first, the cut outer shape can cause the nested, unprocessed shapes inside to shift or even fall off, resulting in misalignment of the cutting blade. This leads to errors in the cutting process, affecting stability and quality. Furthermore, repositioning the unprocessed shapes after this shift increases alignment time, further impacting efficiency. Therefore, determining the nesting relationship and processing order of the shapes before cutting can prevent issues like cutting the outer shape first from affecting the processing of the inner shapes and the overall quality.

[0083] This application establishes an outside-in judgment mechanism to judge all graphics, identifying graphics with nested relationships while determining their positions, and generating graphic hierarchy based on the nesting relationships, thus enabling priority processing of internal graphics. Specifically, after determining the positions of multiple graphics to be processed, graphic hierarchy is divided according to the nesting relationships of their positions, and graphics with nested relationships are sorted sequentially from the inside out to determine the first graphic hierarchy, second graphic hierarchy, third graphic hierarchy, etc. Specifically, refer to... Figure 8 , Figure 9Let Figure 1, Figure 2, ..., Figure n represent the first graphic level, the second graphic level, and so on, respectively. The nested relationship between the graphics is manifested in the overlap between the upper graphic level and the lower graphic level. The graphics of the upper graphic level are nested within the graphics of the lower graphic level. That is, the upper graphic level is contained within the graphics of the lower graphic level, and all the graphics of the upper graphic level overlap with at least some of the graphics of the lower graphic level.

[0084] In some other alternative embodiments of this application, the cutting origin is located outside the multiple graphics to be processed. Specifically, step S100 can be further refined as follows: determine the position of the cutting origin, capture the graphic positions of the multiple graphics to be processed in an outward-inward order starting from the cutting origin, determine the graphic level of the multiple graphics to be processed according to the nesting relationship of the graphic positions, and sort the determined graphic levels from the cutting origin in an ascending order to determine the layer processing order.

[0085] It should be noted that in this application, the graphic to be processed can be determined based on graphic features such as graphic position and graphic shape, and there is no limitation on whether the cutting paths of graphics at the same graphic level or graphics at different levels are separate or overlap.

[0086] Reference Figure 3 In one embodiment, according to the principle of closest proximity, the closest ones are processed first. Step S200, determining the cutting angle of the graphics at each graphic level, includes:

[0087] Step S211: Determine the number of graphics at each graphic level;

[0088] Step S212: When there is only one graphic at the same graphic level, determine the cutting angle of that graphic.

[0089] Step S213: When there are multiple graphics at the same graphic level, determine the starting graphic to be processed at that graphic level. Starting from the starting graphic to be processed, cyclically execute the process of determining the graphic to be processed that is closest to the previous graphic among the remaining graphics to be processed as the next graphic to be processed, until the graphic processing order of all graphics at the same graphic level is determined, and the cutting angle of each graphic is determined in turn according to the graphic processing order.

[0090] Optionally, the graphic closest to the cutting origin among the graphics to be processed at the same graphic level can be determined as the starting graphic to be processed at that graphic level; or, the graphic closest to the cutting origin is only used as the starting graphic to be processed at the current graphic level when the current graphic level is the initial processing level, and when the current graphic level is not the initial processing level, the graphic closest to the last graphic to be processed in the previous graphic level is determined as the starting graphic to be processed at the current graphic level.

[0091] Following the principle of proximity, after determining the starting graphic to be processed at a graphic level, the graphic closest to the starting graphic is selected from the remaining graphics at the same level and designated as the second graphic to be processed at that level. This process is repeated until the processing order of all graphics at the same level is determined. Specifically, the graphic closest to the previous graphic can be determined by comparing its coordinates. This allows processing to begin from the starting graphic at the graphic level, prioritizing the closest graphic and simplifying the cutting path.

[0092] Besides determining the processing order of graphics at the same graphic level based on the distance between adjacent graphics, the processing order can also be directly determined based on the distance between the graphics and the cutting origin when graphics at the same graphic level are arranged according to a certain positional pattern. In another embodiment, step S200, determining the cutting angle of each graphic level, includes:

[0093] Determine the number of graphics at each graphic level;

[0094] When there is only one graphic at the same graphic level, determine the cutting angle of that graphic.

[0095] When there are multiple graphics at the same graphic level, the distances between the multiple graphics at that graphic level and the cutting origin are sorted in ascending order to determine the graphic processing order of the graphics at the same graphic level, and the cutting angle of each graphic is determined sequentially according to the graphic processing order.

[0096] Understandably, following the principle of proximity, the distance between all graphics to be processed at the same graphic level and the cutting origin is calculated. Based on the distance between all graphics at the same graphic level and the cutting origin, the processing order of all graphics at the same graphic level is determined. Then, the cutting angle of each graphic is determined sequentially according to the processing order. This is to prioritize processing the graphics closest to the cutting origin and simplify the cutting path.

[0097] In actual processing, due to the differences in the position and shape of multiple graphics to be processed, simply planning the cutting path based solely on the principle of shortest distance may result in complex paths that are inconvenient to process. Figure 10 Taking the graphics to be processed as an example, when planning the cutting path, it is inevitable that most of the graphics to be processed are arranged or distributed in a certain direction, but some graphics deviate from the distribution direction. In this case, if the processing order of graphics is determined only according to the principle of closest distance, there may be situations where the graphics that deviate from the distribution in the middle are skipped and then the graphics that deviate are processed again. After processing the graphics that deviate, other graphics are processed along the arrangement direction. Multiple back-and-forth movements can easily lead to a complex cutting path and make processing inconvenient.

[0098] To solve this problem, the most suitable cutting path for actual processing can be determined by selecting the processing direction. In one embodiment of this application, the most suitable target path for processing is found by determining the processing priority of the graphic in different directions. Specifically, refer to... Figure 4 In one embodiment, S200, determining the cutting angle of the graphic at each graphic level includes:

[0099] Step S221: Determine the number of graphics at each graphic level;

[0100] Step S222: When there is only one graphic at the same graphic level, determine the cutting angle of that graphic.

[0101] Step S223: When there are multiple graphics at the same graphic level, determine the processing priority of the graphics at that graphic level in the X and Y directions.

[0102] Step S224: Determine the processing order of all graphics at the same graphic level based on processing priority, and determine the cutting angle of each graphic in turn according to the processing order.

[0103] Optionally, when there is only one graphic to be processed at the same graphic level, the cutting angle of the graphic at that graphic level can be determined by directly determining the cutting angle of that graphic. When there are multiple graphics to be processed at the same graphic level, the processing priority of the graphics at that graphic level in the X direction is determined, the processing order of the multiple graphics in the X direction is determined, and the cutting angle of each graphic is determined sequentially according to the processing order; and, the processing priority of the graphics at that graphic level in the Y direction is determined, the processing order of the multiple graphics in the Y direction is determined, and the cutting angle of each graphic is determined sequentially according to the processing order; by determining the processing priority in the two different directions of X and Y, the most suitable target path for processing is found.

[0104] Understandably, by determining the processing priority of the graphic in different directions, the most suitable target path for processing is found. When planning the cutting path, processing is done either in the X direction or in the Y direction, and similarly... Figure 11 Taking the graphic to be processed as an example, when executing step S223, the processing priority of the graphic in the X and Y directions can be directly determined. This is determined through graphic position analysis, algorithm selection, and other methods. The path of processing in the Y direction is more complex than that in the X direction. Therefore, it is determined that processing in the X direction is preferred. When executing step S224, the processing order of all graphics is determined based on the processing priority in the X direction, and the cutting angle of each graphic is determined in turn according to the processing order.

[0105] By planning the path based on either the X or Y direction, the cutting path can be optimized, reducing unnecessary tool movement and ensuring that the optimal cutting path is used as the target cutting path to control the machining process. This setting avoids overly complex cutting paths that are only determined by the shortest distance principle without further considering the graphic distribution pattern. It also ensures that the target cutting path is more aesthetically pleasing and conforms to the graphic layout pattern.

[0106] In one embodiment, step S224, determining the graphic processing order of all graphics at the same graphic level based on processing priority, includes:

[0107] When processing priority is represented by processing priority in the X direction, the processing order of all graphics at the same graphic level is determined sequentially from left to right in the X direction.

[0108] And / or,

[0109] When processing priority is represented by prioritizing processing in the Y direction, the processing order of all graphics at the same graphic level is determined sequentially from top to bottom in the Y direction.

[0110] Understandably, when planning the cutting path based on the processing priority of graphics in different directions, processing can be done either in the X direction or the Y direction. If processing in the X direction is prioritized, the processing order of all graphics at the same graphic level is determined sequentially from left to right in the X direction; if processing in the Y direction is prioritized, the processing order of all graphics at the same graphic level is determined sequentially from top to bottom in the Y direction.

[0111] It should be noted that, in the embodiments of this application, in addition to determining the graphic processing order according to the principle of closest proximity and processing the closest graphics first, and further determining the cutting angle of each graphic level through the aforementioned steps S211, S212, S213 and related steps; it is also possible to select a processing direction, processing based on the processing priority of either the X or Y direction, and further determining the cutting angle of each graphic level through the aforementioned steps S221, S222, S223, S224 and related steps. Either of the aforementioned two schemes can be chosen for implementation; or, the processing path can be determined first according to the principle of closest proximity, and then the most suitable target path can be found by selecting a processing direction; or, the processing path can be determined first by selecting a processing direction, and then the most suitable target path can be found by selecting the closest proximity.

[0112] To mitigate the impact of large-amplitude tool rotation on machining results, refer to Figure 5 In one embodiment, step S200, determining the cutting angle of the graphic at each graphic level, includes: determining the current graphic level;

[0113] Step S231: When the current graphic level is the initial processing level, determine the cutting start angle of the initial graphic to be processed, and determine the cutting angles of the remaining graphics to be processed in sequence, so that the difference between the cutting start angle of the next graphic to be processed and the cutting end angle of the previous graphic to be processed is within the set difference range.

[0114] Step S232: When the current graphic level is not the initial processing level, determine the starting angle of the cutting of the initial graphic to be processed in the current graphic level based on the cutting end angle of the cutting tool in the previous graphic level, and determine the cutting angles of the remaining other graphics to be processed in sequence, so that the difference between the cutting start angle of the next graphic to be processed in the same graphic level and the cutting end angle of the previous graphic to be processed is within the set difference range.

[0115] Understandably, using the first graphic level in at least one defined graphic level as the initial processing level, the cutting angle of the graphic to be processed in each graphic level is determined sequentially from the initial processing level according to the hierarchical processing order. Simultaneously, the processing path of the graphic is determined. Specifically, the cutting angle includes a cutting start angle and a cutting end angle. The processing path of each graphic includes the cutting start angle, the outline of the graphic, and the cutting end angle of the graphic. The cutting end angle of the graphic is determined by the angle encountered during processing along the outline of the graphic from the cutting start angle. Thus, it can be used to process the graphics of each graphic level sequentially from the initial processing level during processing.

[0116] When the current graphic level is the initial processing level, the cutting start angle of the initial graphic to be processed is directly used as the cutting start angle of this graphic level. Specifically, any set angle can be used as the cutting start angle of the initial graphic to be processed, and this cutting start angle is stored. Alternatively, to reduce the impact of large-scale tool rotation on the processing effect, the cutting start angle of the initial graphic to be processed is determined by the minimum rotation angle relative to the cutting processing origin, and this cutting start angle is stored. Starting from the initial graphic to be processed, the cutting angles of the remaining graphics to be processed in the initial processing level are determined sequentially according to the graphic processing order determined in the aforementioned embodiments, so that the difference between the cutting start angle of the next graphic to be processed and the cutting end angle of the previous graphic to be processed is within a set difference range. When the current graphic level is not the initial processing level, it is necessary to determine the starting angle of the cutting of the initial graphic to be processed in the current graphic level based on the cutting end angle of the cutting blade in the previous graphic level. After determining the starting angle of the cutting of the initial graphic to be processed in the current graphic level, the cutting angles of the remaining other graphics to be processed in the current graphic level are determined sequentially according to the graphic processing order determined in the aforementioned embodiment, so that the difference between the starting angle of the cutting of the next graphic to be processed in the current graphic level and the cutting end angle of the previous graphic to be processed is within the set difference range. Specifically, the difference between the cutting start angle of the next pattern to be processed and the cutting end angle of the previous pattern to be processed must be within a set range. Specifically, when there is a significant positional deviation between the next and previous patterns, the next pattern may have multiple cutting start angles. These cutting start angles are used as candidate cutting start angles. Optionally, the candidate cutting start angle that is equal to or closest to the cutting end angle of the previous pattern is determined as the cutting start angle of the next pattern. Alternatively, a specific numerical range of the difference is preset according to actual processing needs, and candidate cutting start angles whose difference from the cutting end angle of the previous pattern falls within this range are determined as the cutting start angle of the next pattern. This is to avoid the problems of needing multiple tool turns and large tool turn angles when moving from the last pattern to the first pattern of the next level, or from one pattern to the next.

[0117] This also avoids the non-productive time caused by multiple cutter turns and large cutter turns from taking up processing time, effectively improving processing efficiency and reducing the impact of the cutting angle on the processing effect.

[0118] The cutting angle includes the cutting start angle and the cutting end angle. The machining point indicates the position from which machining begins on the graphic to be processed. The cutting start angle refers to the angle at which machining begins on the graphic, and the cutting end angle refers to the angle at which machining ends on the corresponding graphic. For non-closed graphics, the starting and ending machining points do not coincide; for closed graphics, the starting and ending machining points coincide. The steps S231 and S232 above, which sequentially determine the cutting angles of the remaining graphics to be processed, can be further refined as follows:

[0119] Starting from the initial graphic to be processed, multiple candidate processing points for the next graphic to be processed and multiple candidate cutting start angles corresponding to each candidate processing point are determined by the cutting end angle of the previous graphic to be processed.

[0120] The cut start angle of the next graphic to be processed is determined as the one with the smallest difference between the multiple candidate cut start angles and the cut end angle of the previous graphic.

[0121] The process is repeated until the cutting angles of the remaining graphics to be processed are obtained.

[0122] An angle analysis is performed on each graphic to be processed. Taking a closed shape as an example, multiple candidate machining points for the next graphic are determined by the machining points of the previous graphic. The starting angles for cutting are calculated by tracing the path from the machining points of the previous graphic to these candidate points. The final cutting angle for the next graphic is further determined by comparing the differences between these starting angles and the ending angle of the previous graphic. This simplifies the cutting path from one graphic to the next and eliminates unreasonable machining points and paths.

[0123] The starting angle of the cutter for the next workpiece is determined by the difference between the starting angle of the cutter's movement and the ending angle of the cutter's movement from the previous workpiece to the next workpiece (i.e., the degree of rotation of the cutter from the previous workpiece to the next workpiece). Based on this determined starting angle, the machining points for the next workpiece are further determined, ensuring that the difference between the starting and ending angles is within a set range. This reduces unnecessary tool turning, further minimizing tool wear, extending equipment life, and lowering maintenance costs. Furthermore, it reduces machining defects such as low machining accuracy caused by angle mismatch during cutter turning, resulting in more rational tool path planning. This approach determines the tool path with the minimum tool turning while reducing the difficulty of tool angle adjustment and machining complexity.

[0124] Furthermore, in this application, the cutting end angle corresponding to each workpiece can be determined based on the cutting start angle and the shape (outline) of the workpiece. To facilitate automatic selection of machining points and CNC programming, specifically, the cutting path planning method also includes storing at least one of the following: the cutting start angle of the initial workpiece, the cutting start angle of each workpiece, the cutting end angle, or other cutting angles.

[0125] Reference Figure 6 In one embodiment, step S300, determining the target cutting path based on the hierarchical processing sequence and the cutting angle of the graphics at each graphic level, includes:

[0126] Step S311: Generate the cutting path corresponding to each graphic level based on the cutting angle of the graphic at each graphic level.

[0127] Step S312: According to the hierarchical processing order, associate all cutting paths in sequence and obtain the target cutting path.

[0128] Specifically, the cutting start angle of the starting graphic to be processed in the next graphic level is determined by using the cutting end angle of the cutting tool in the previous graphic level (the cutting end angle of the last graphic to be processed in the previous graphic level). The cutting processing path of each graphic level is determined sequentially according to the processing order of the levels. This is used to associate the cutting processing path of the next graphic level with the cutting processing path of the previous graphic level. This process is repeated, and by sequentially associating all cutting processing paths, the target cutting path is obtained.

[0129] As an optional example, multiple graphics with the same processing order can be grouped according to their hierarchical processing sequence. This allows for the determination of the target cutting path by first planning the paths of graphics with nested relationships. Figure 10 For example, we can get the path from the left triangle 1 → rectangle 2 → circle 2 → circle 3, then to the right triangle 1 → circle 1 → pentagon 2 → rectangle 3, and then to rectangle 4 → rectangle 5.

[0130] As another optional example, one can first plan the paths for graphics at the same level (graphics of the same graphic hierarchy), and then plan the paths for graphics of the next graphic hierarchy. Specifically, first plan the paths for all graphics in the first graphic hierarchy, then sequentially plan the paths for all graphics in the second graphic hierarchy, the third graphic hierarchy, and so on, to obtain the target cutting path. Figure 10 For example, we can get the path from left triangle 1 → right circle 1 → right triangle 1 → right pentagon 2 → left circle 2 → left rectangle 2 → left circle 3 → right rectangle 3, and then to rectangle 4 → rectangle 5.

[0131] In this application, a target cutting path can be optionally generated based on the cutting angles of all the graphics to be processed, and processing control instructions for controlling the operation of the laser processing equipment can be generated according to the determined target cutting path, thereby realizing centralized management of the cutting processing path and controlling the completion of processing of all the graphics to be processed; alternatively, after executing the step of generating a cutting processing path corresponding to each graphic level based on the cutting angle of each graphic level, the processing equipment can be controlled to complete the processing of the graphic at that level. This is used to alternately execute the planning and control of cutting paths for different graphic levels according to the divided graphic levels, and also to sequentially associate all cutting processing paths according to the processing order of each graphic level after the planning and processing of the cutting processing path is completed, and obtain the target cutting path for easy user reference. The specific method of controlling the processing can be set according to actual conditions, and is not limited here.

[0132] Because the cutting path needs to be determined based on the cutting angle during processing, if multiple graphics to be processed are close to the cutting origin, multiple candidate cutting paths with different cutting angles and paths will be generated. If processing is carried out directly according to any of the planned candidate cutting paths, the cutting tool may deviate too much after processing, and a large angle turn is required to bring the cutting tool angle to zero. A large angle turn can easily affect the service life of the cutting tool.

[0133] To address this issue and verify whether the generated cutting path is the most suitable for actual machining, in one embodiment of this application, the most suitable target path for machining is found by comparing whether the turning angle at the end of machining is closest to the zero-angle of the cutting tool. Figure 7 In one embodiment, the step of determining the target cutting path in step S300 includes:

[0134] Step S331: Based on the hierarchical processing sequence and the cutting angle of the graphics at each graphic level, obtain the candidate cutting path and the cutting end angle of the candidate cutting path;

[0135] Step S332: When there is only one candidate cutting path, determine the candidate cutting path as the target cutting path;

[0136] Step S333: When there are multiple candidate cutting paths, the candidate cutting path whose cutting end angle is closest to the zero angle of the cutting blade is determined as the target cutting path.

[0137] The target cutting path is determined based on the cutting angle. The candidate cutting path whose ending angle at the end of machining is closest to the cutter's zero-point angle is selected as the target cutting path. This optimizes the W-axis rotation angle of the cutter, ensuring that regardless of the number of rotations during machining, the cutter ends machining at an angle closest to 360 degrees or another zero-point angle. This also reduces the W-axis rotation amplitude. Determining the target cutting path by optimizing the W-axis rotation amplitude reduces tool wear caused by tool rotation, extends tool life, and lowers production costs.

[0138] In one embodiment, the knife-cutting path planning method further includes the following steps:

[0139] Determine the thickness of the material to be processed for the multiple graphics to be processed, and determine the cutter lift-off height based on the material thickness. This is used to adjust the cutter's Z-axis lift-off height according to the material thickness, avoiding both insufficient lift-off height affecting processing results and excessive lift-off height affecting processing efficiency, thereby saving processing time and energy.

[0140] In one embodiment, after performing step S300, which involves determining the target cutting path based on the hierarchical processing sequence and the cutting angle of the graphics at each graphic level, the cutting path planning method further includes the following steps:

[0141] Generate processing control instructions based on the determined target processing path;

[0142] The processing control command is sent to the laser processing equipment to control the processing head of the laser processing equipment to process the material according to the target cutting path.

[0143] In addition to directly issuing processing control commands to the laser processing equipment after determining the target processing path and controlling the laser processing equipment to process, this application can also generate a gcode file or other format processing file containing processing control commands based on the planned cutting path, and control the laser processing equipment to process by issuing the processing file to the laser processing equipment.

[0144] The specific implementation process of the knife-cutting path planning method in this application is as follows:

[0145] The process involves obtaining the positions of multiple graphics to be processed. When these graphics are nested, they are divided into levels according to this nesting relationship. These levels are then sorted sequentially from the inside out to determine the processing order. When the graphics are not nested, the processing order is determined to be the same for all graphics. This process is used to determine the graphic levels and processing order of the multiple graphics to be processed.

[0146] Among them, reference Figure 10When planning the path for this type of graphic, the processing path can be determined by selecting the processing direction. Starting from the cutting origin, the number of graphics at this level is determined, and based on the processing priority in the X direction, the processing order of all graphics is determined sequentially from left to right, and the cutting order of each graphic is further determined.

[0147] Reference Figure 8 , 9 11. When planning the path for such graphics, the processing order is determined according to the principle of proximity, processing graphics that are closest first, and the path is planned accordingly. Specifically, the first graphic level in at least one defined graphic level is taken as the initial processing level. The cutting angle of the graphics to be processed in each graphic level is determined sequentially from the initial processing level according to the processing order of the levels. When the current graphic level is the initial processing level, the cutting start angle of the initial graphic to be processed is directly taken as the cutting start angle of that graphic level. Starting from the initial graphic to be processed, the process is repeated to determine the graphic to be processed next from the remaining graphics to be processed that are closest to the previous graphic to be processed, until the graphic processing order of all graphics in the same graphic level is determined. The cutting angle of each graphic in the same graphic level is then determined sequentially according to the graphic processing order, so that the difference between the cutting start angle of the next graphic to be processed and the cutting end angle of the previous graphic to be processed is within a set difference range. When the current graphic level is not the initial processing level, it is necessary to determine the starting graphic to be processed in this graphic level and the starting angle of cutting of the starting graphic to be processed based on the cutting end angle of the cutting tool in the previous graphic level. After determining the starting angle of cutting of the starting graphic to be processed in this graphic level, starting from the starting graphic to be processed, the remaining graphic to be processed is cyclically processed, and the graphic closest to the previous graphic to be processed is determined as the next graphic to be processed, until the graphic processing order of all graphics in the same graphic level is determined. Then, according to the graphic processing order, the cutting angle of each graphic in the same graphic level is determined in sequence, so that the difference between the cutting start angle of the next graphic to be processed in this graphic level and the cutting end angle of the previous graphic to be processed is within the set difference range.

[0148] Based on the cutting angle of each graphic level, a cutting path is generated corresponding to each graphic level. The cutting start angle of the starting graphic to be processed in the next graphic level is determined by using the cutting end angle of the cutting tool in the previous graphic level (the cutting end angle of the last graphic to be processed in the previous graphic level). The cutting path of each graphic level is determined sequentially according to the processing order of the levels. The cutting path of the next graphic level is associated with the cutting path of the previous graphic level. This process is repeated until all cutting paths are associated in sequence to obtain candidate cutting paths.

[0149] Starting from the cutting origin, capture the positions of multiple graphics to be processed in an outward-to-inward order. Divide the graphics into levels according to the nesting relationship, and sort the multiple graphics levels in a nesting order from the inside out. Determine that there are three graphics levels: a first graphics level, a second graphics level, and a third graphics level. The first graphics level includes three graphics 1 (a1, a2, a3), the second graphics level includes two graphics 2 (b1, b2), and the third graphics level includes one graphics 3 (c1). Among them, the three graphics 1 (a1, a2, a3) of the first graphics level are nested in one of the graphics 2 (b1) of the second graphics level.

[0150] Based on the distance from the cutting origin, among the three graphics in the first graphic level, a1 is closest to the cutting origin. a1 is chosen as the starting graphic to be processed. Then, a2 is determined to be closest to a1, and a3 is closest to a2. Therefore, the processing order for the graphics in the first graphic level is a1→a2→a3. Based on the distance to a3, b1 is determined to be closest to a3. Therefore, after processing a3, the processing order for the graphics in the second graphic level is b1→b2. Since the third graphic level only contains graphic c1, c1 is processed after b2.

[0151] To mitigate the impact of large-scale tool rotation on the machining effect, the cutting start angle of a1 is determined by the minimum rotation angle relative to the cutting origin. The cutting end angle of a1 is determined along its contour. The cutting start angle of a2 is determined by the cutting end angle of a1, ensuring that the cutting start angle of a2 is equal to (or the difference is within a set range) the cutting end angle of a1. Similarly, the cutting start angle of a3 is determined based on the cutting end angle of a2, and the cutting start angle of b1 is determined based on the cutting end angle of a3, and so on, until the cutting start angle of c1 is determined. A cutting path is generated corresponding to each graphic level based on the cutting angle of the graphic. Candidate cutting paths are obtained by sequentially associating all cutting paths.

[0152] by Figure 10For example, when triangle 1 on the left is determined to be the first graphic level closest to the origin, a cutting path is generated for each graphic level based on the cutting angle of the graphic. All cutting paths are then sequentially associated to obtain candidate cutting paths: from triangle 1 on the left → rectangle 2 → circle 2 → circle 3, then to triangle 1 on the right → circle 1 → pentagon 2 → rectangle 3, then to rectangle 4 → rectangle 5, to first plan the paths for graphics with nested relationships; or, from triangle 1 on the left → rectangle 2 → circle 2 → circle 3, then to circle 1 on the right → triangle 1 → pentagon 2 → rectangle 3, then to rectangle 4 → rectangle 5, to first plan the paths for graphics with nested relationships; or, from triangle 1 on the left → rectangle 2 → circle 2 → circle 3, then to circle 1 on the right → triangle 1 → pentagon 2 → rectangle 3, then to rectangle 4 → rectangle 5. The path can be planned by first planning the nested shapes: Shape 2 → Rectangle 3, then Rectangle 4 → Rectangle 5. Alternatively, it can be planned by first planning the paths of shapes at the same level (shapes of the same level), then planning the paths of shapes at the next level, resulting in candidate cutting paths for shapes 2, 3, and 4 after planning the paths of all shapes 1. Other candidate cutting paths are also possible, but will not be elaborated here. It should be noted that when planning the paths of nested shapes, after determining the cutting end angle of the left circle 3 in the intermediate process, the closest of the two shapes (Round 1 and Circle 1) can be selected as the next shape to be processed based on their relative distance. Alternatively, the difference within a set range can be used to directly determine whether the next shape to be processed is the right triangle 1 or the right circle 1. After determining the next graphic to be processed, only one of the aforementioned candidate cutting paths is obtained in the end. The specific path can be determined based on the actual position of each graphic, such as its coordinates, and is not limited here.

[0153] When there is only one candidate cutting path, the candidate cutting path is determined as the target cutting path; when there are multiple candidate cutting paths, the candidate cutting path whose cutting end angle is closest to the cutter's zeroing angle is determined as the target cutting path.

[0154] Alternatively, further optimization measures can be taken to obtain the target cutting path.

[0155] Finally, processing control commands are generated based on the determined target processing path and sent to the laser processing equipment to control the processing head of the laser processing equipment to process the material according to the target cutting path.

[0156] This invention also provides a laser processing device, which can be, but is not limited to, a laser cutting device or a blade cutting device. The laser processing device includes a slide rail, a processing head, a communication component, and a controller. The processing head can be, but is not limited to, a laser head, a blade cutting head, a cutting head, a pen tip, or a drill bit, and is slidably mounted on the slide rail. The slide rail is used to drive the processing head to reciprocate along the X and Y directions. The communication component is used to receive a target blade cutting path obtained according to the steps of the blade cutting path planning method in the above embodiments. The controller, based on the target blade cutting path, controls the processing head to move on the slide rail for processing.

[0157] The laser processing equipment provided in this application employs the cutting path planning method described in the above embodiments to solve the problem of processing errors caused by the inability to plan the cutting path in conjunction with the position and cutting angle of the graphic to be processed. Compared with the prior art, the beneficial effects of the laser processing equipment provided in this application are the same as those of the cutting path planning method provided in the above embodiments, and other technical features of the laser processing equipment are the same as those disclosed in the methods of the above embodiments, and will not be repeated here.

[0158] It should be noted that the cutting path planning method of this application is mainly described using cutting processing equipment as an example. When applied to other laser processing equipment, the cutting head can be replaced with the corresponding processing head or other processing components, and the cutting path can be replaced accordingly. This is not limited here.

[0159] The present invention also provides a laser processing system, including a laser processing device and a terminal device communicating with the laser processing device. The laser processing device includes a processing device base plate and a processing head. The processing device base plate includes a processing area for placing processing materials, and the processing head is used to move within the processing area. The terminal device is used to execute the blade path planning method described above.

[0160] Optionally, the terminal device includes at least one processor; and a memory communicatively connected to the at least one processor; wherein the memory stores a cutting path planning program that can be executed by the at least one processor, the cutting path planning program being executed by the at least one processor to enable the at least one processor to execute the cutting path planning method in the above embodiments.

[0161] The terminal devices in this application embodiment may include, but are not limited to, mobile terminals such as mobile phones, laptops, digital broadcast receivers, PDAs (Personal Digital Assistants), PADs (Portable Application Description), PMPs (Portable Media Players), and in-vehicle terminals (e.g., in-vehicle navigation terminals), as well as fixed terminals such as digital TVs and desktop computers. The computer devices, such as terminal devices, shown in this application are merely examples and should not impose any limitations on the functionality and scope of use of the embodiments in this application.

[0162] Computer devices, such as terminal devices, may include control components such as processing units (e.g., central processing unit, graphics processing unit, etc.), which can perform various appropriate actions and processes based on programs stored in read-only memory (ROM) or loaded from storage devices into random access memory (RAM). RAM also stores various programs and data required for the operation of the computer device. The processing unit, ROM, and RAM are interconnected via a bus. Input / output (I / O) interfaces are also connected to the bus. Typically, the following systems can be connected to the I / O interface: input devices including, for example, touchscreens, touchpads, keyboards, mice, image sensors, microphones, accelerometers, gyroscopes, etc.; output devices including, for example, liquid crystal displays (LCDs), speakers, vibrators, etc.; storage devices including, for example, magnetic tape, hard disks, etc.; and communication devices. Communication devices allow the computer device to communicate wirelessly or wiredly with other devices to exchange data.

[0163] Specifically, according to the embodiments disclosed in this application, the processes described above with reference to the flowcharts can be implemented as computer software programs. For example, embodiments disclosed in this application include a computer program product comprising a computer program carried on a computer-readable medium, the computer program containing program code for performing the methods shown in the flowcharts. In such embodiments, the computer program can be downloaded and installed from a network via a communication device, or installed from a storage device, or installed from a ROM. When the computer program is executed by a processing device, it performs the functions defined in the methods of the embodiments disclosed in this application.

[0164] The terminal device provided in this application employs the cutting path planning method in the above embodiments to solve the problem of processing errors caused by the inability to plan the cutting path in conjunction with the position and cutting angle of the graphic to be processed. Compared with the prior art, the beneficial effects of the computer device provided in this application are the same as those of the cutting path planning method provided in the above embodiments, and other technical features of the computer device are the same as those disclosed in the method of the previous embodiment, and will not be repeated here.

[0165] It should be understood that the various parts disclosed in this application can be implemented using hardware, software, firmware, or a combination thereof. In the description of the above embodiments, specific features, structures, materials, or characteristics can be combined in any suitable manner in one or more embodiments or examples.

[0166] The above description is merely a specific embodiment of this application, but the scope of protection of this application is not limited thereto. Any variations or substitutions that can be easily conceived by those skilled in the art within the scope of the technology disclosed in this application should be included within the scope of protection of this application. Therefore, the scope of protection of this application should be determined by the scope of the claims.

[0167] This application provides a computer-readable storage medium storing a knife-cutting path planning program, which, when executed by a processor, implements the steps of the knife-cutting path planning method as described in the above embodiment.

[0168] The computer-readable storage medium provided in this application may be, for example, a USB flash drive, but is not limited to, electrical, magnetic, optical, electromagnetic, infrared, or semiconductor systems, devices, or any combination thereof. More specific examples of computer-readable storage media may include, but are not limited to: electrical connections with one or more wires, portable computer disks, hard disks, random access memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM or flash memory), optical fiber, portable compact disk read-only memory (CD-ROM), optical storage devices, magnetic storage devices, or any suitable combination thereof. In this embodiment, the computer-readable storage medium may be any tangible medium containing or storing a program that can be used by or in conjunction with an instruction execution system, system, or device. The program code contained on the computer-readable storage medium may be transmitted using any suitable medium, including but not limited to: wires, optical cables, RF (Radio Frequency), etc., or any suitable combination thereof.

[0169] The aforementioned computer-readable storage medium may be included in a computer device or may exist independently without being assembled into a computer device.

[0170] The aforementioned computer-readable storage medium carries one or more programs that, when executed by a computer device, cause the computer device to: determine the graphic hierarchy and processing order of the multiple graphics to be processed; determine the cutting angle of the graphics at each graphic hierarchy; and determine a target cutting path based on the processing order and the cutting angle of the graphics at each graphic hierarchy.

[0171] Computer program code for performing the operations of this application can be written in one or more programming languages ​​or a combination thereof, including object-oriented programming languages ​​such as Java, Smalltalk, and C++, and conventional procedural programming languages ​​such as the "C" language or similar programming languages. The program code can be executed entirely on the user's computer, partially on the user's computer, as a standalone software package, partially on the user's computer and partially on a remote computer, or entirely on a remote computer or server. In cases involving remote computers, the remote computer can be connected to the user's computer via any type of network—including a Local Area Network (LAN) or a Wide Area Network (WAN)—or can be connected to an external computer (e.g., via the Internet using an Internet service provider).

[0172] The flowcharts and block diagrams in the accompanying drawings illustrate the architecture, functionality, and operation of possible implementations of systems, methods, and computer program products according to various embodiments of this application. In this regard, each block in a flowchart or block diagram may represent a module, segment, or portion of code containing one or more executable instructions for implementing a specified logical function. It should also be noted that in some alternative implementations, the functions indicated in the blocks may occur in a different order than those indicated in the drawings. For example, two consecutively indicated blocks may actually be executed substantially in parallel, and they may sometimes be executed in reverse order, depending on the functions involved. It should also be noted that each block in the block diagrams and / or flowcharts, and combinations of blocks in the block diagrams and / or flowcharts, can be implemented using a dedicated hardware-based system that performs the specified function or operation, or using a combination of dedicated hardware and computer instructions.

[0173] The modules involved in the embodiments of this application can be implemented in software or hardware. The name of the module does not, in some cases, constitute a limitation on the unit itself.

[0174] The readable storage medium provided in this application is a computer-readable storage medium that stores computer-readable program instructions (i.e., a computer program) for executing the above-described cutting path planning method, thereby solving the problem of processing errors caused by the inability to plan the cutting path in conjunction with the position and cutting angle of the graphic to be processed. Compared with the prior art, the beneficial effects of the computer-readable storage medium provided in this application are the same as those of the cutting path planning method provided in the above embodiments, and will not be repeated here.

[0175] This application also provides a computer program product, including a knife-cutting path planning program, which, when executed by a processor, implements the steps of the knife-cutting path planning method as described in the above embodiments.

[0176] The computer program product provided in this application is used to solve the problem of machining errors caused by the inability to plan the cutting path based on the position and cutting angle of the graphic to be processed. Compared with the prior art, the beneficial effects of the computer program product provided in this application are the same as the beneficial effects of the cutting path planning method provided in the above embodiments, and will not be repeated here.

[0177] The above description is merely an optional embodiment of the present invention and does not limit the patent scope of the present invention. All equivalent structural transformations made using the contents of the present invention's specification and drawings under the inventive concept of the present invention, or direct / indirect applications in other related technical fields, are included within the patent protection scope of the present invention.

Claims

1. A knife-cutting path planning method, characterized in that, Includes the following steps: Determine the graphic hierarchy and processing order of the multiple graphics to be processed; Determine the cutting angle of the graphics at each graphic level; The target cutting path is determined based on the hierarchical processing sequence and the cutting angle of the graphics at each graphic level. The determination of the cutting angle for each graphic level includes: When the current graphic level is the initial processing level, determine the starting angle of the cutting of the first graphic to be processed, and then determine the cutting angles of the remaining graphics to be processed in sequence, so that the difference between the starting angle of the cutting of the next graphic to be processed and the ending angle of the cutting of the previous graphic to be processed is within the set difference range. When the current graphic level is not the initial processing level, the cutting start angle of the starting graphic to be processed in the current graphic level is determined based on the cutting end angle of the cutting tool in the previous graphic level, and the cutting angles of the remaining graphics to be processed are determined in sequence, so that the difference between the cutting start angle of the next graphic to be processed and the cutting end angle of the previous graphic to be processed in the same graphic level is within the set difference range.

2. The cutting path planning method according to claim 1, characterized in that, The determination of the graphic hierarchy and processing order of the multiple graphics to be processed includes: Obtain the graphic positions of multiple graphics to be processed; When multiple graphics are nested, the graphics are divided into levels according to the nesting relationship, and the multiple graphics levels are sorted in order from the inside to the outside to determine the processing order of the multiple graphics levels. When multiple graphics do not have a nested relationship, the processing order of the multiple graphics is determined to be the same.

3. The cutting path planning method according to claim 1, characterized in that, The determination of the cutting angle for each graphic level includes: Determine the number of graphics at each graphic level; When there is only one graphic at the same graphic level, determine the cutting angle of that graphic. When there are multiple graphics at the same graphic level, the starting graphic to be processed at that graphic level is determined. Starting from the starting graphic to be processed, the remaining graphics to be processed are cyclically processed, and the one closest to the previous graphic to be processed is determined as the next graphic to be processed, until the graphic processing order of all graphics at the same graphic level is determined, and the cutting angle of each graphic is determined in turn according to the graphic processing order.

4. The cutting path planning method according to claim 1, characterized in that, The determination of the cutting angle for each graphic level includes: Determine the number of graphics at each graphic level; When there is only one graphic at the same graphic level, determine the cutting angle of that graphic. When there are multiple graphics at the same graphic level, determine the processing priority of the graphics at that graphic level in the X and Y directions; Based on the processing priority, the processing order of all graphics at the same graphic level is determined, and the cutting angle of each graphic is determined sequentially according to the processing order.

5. The cutting path planning method according to claim 4, characterized in that, The process of determining the processing order of all graphics at the same graphic level based on the processing priority includes: When the processing priority is characterized by prioritizing processing in the X direction, the processing order of all graphics at the same graphic level is determined sequentially from left to right in the X direction. And / or, When the processing priority is characterized by prioritizing processing in the Y direction, the processing order of all graphics at the same graphic level is determined sequentially from top to bottom in the Y direction.

6. The knife-cutting path planning method according to any one of claims 1-5, characterized in that, The determination of the target cutting path based on the hierarchical processing sequence and the cutting angle of the graphics at each graphic level includes: Generate the cutting path corresponding to each graphic level based on the cutting angle of the graphic at each graphic level; According to the hierarchical processing order, all cutting paths are sequentially associated to obtain the target cutting path.

7. The knife-cutting path planning method according to any one of claims 1-5, characterized in that, The determination of the target cutting path based on the hierarchical processing sequence and the cutting angle of the graphics at each graphic level includes: Based on the hierarchical processing sequence and the cutting angle of the graphics at each graphic level, candidate cutting paths and the cutting end angle of the candidate cutting paths are obtained. When there is only one candidate cutting path, the candidate cutting path is determined as the target cutting path; When multiple candidate cutting paths are obtained, the candidate cutting path with the cutting end angle closest to the cutter's zero-angle is determined as the target cutting path.

8. The knife-cutting path planning method according to any one of claims 1-5, characterized in that, The cutting path planning method further includes the following steps: Determine the thickness of the material to be processed for the multiple graphics to be processed, and determine the cutting height based on the material thickness.

9. A laser processing device, characterized in that, include: Slide rail; A processing head, which is slidably mounted on the slide rail; A communication component, the communication component being configured to receive a target cutting path obtained from the steps of the cutting path planning method according to any one of claims 1-8; A controller that controls the movement of the processing head on the slide rail to perform processing based on the target cutting path.

10. A laser processing system, characterized in that, include: Laser processing equipment, the laser processing equipment comprising a processing equipment base plate and a processing head, the processing equipment base plate including a processing area for placing processing materials, the processing head being used to move on the processing area; and A terminal device that communicates with the laser processing equipment, the terminal device being used to execute the cutting path planning method according to any one of claims 1-8.

11. A computer-readable storage medium storing a knife-cutting path planning program thereon, characterized in that, When the knife-cutting path planning program is executed by the processor, it implements the steps of the knife-cutting path planning method as described in any one of claims 1-8.

12. A computer program product, comprising a knife-cutting path planning program, characterized in that, When the knife-cutting path planning program is executed by the processor, it implements the steps of the knife-cutting path planning method as described in any one of claims 1-8.

Images