A jumper cutting method, system and electronic device

Abstract

The present application belongs to the automatic control cutting technical field, and relates to a kind of jump piece cutting method, system and electronic equipment.The method comprises: obtaining all the cutting pieces in the current cutting window, each cutting piece has corresponding sequential number, judging the adjacent relationship of any two cutting pieces, obtaining the adjacent cutting piece corresponding to each cutting piece, presetting the upper limit of group number, based on the group number upper limit, each cutting piece is allocated to the cutting piece group without adjacent cutting piece, each group of cutting pieces is cut in turn according to the cutting piece group order, and pause is executed between adjacent two groups of cutting, and the connection processing operation of subsequent cutting process is carried out.Effectively solve the technical pain points of material displacement and wrinkle in multi-layer cutting, ensure the cutting precision and cutting edge quality, and at the same time, without reducing the cutting efficiency or increasing additional auxiliary steps, the cutting efficiency, precision and stability are considered, and the core problem of balancing the two in the existing cutting technology is solved.

Description

Technical Field

[0001] This invention belongs to the field of automatic control cutting technology, and relates to a method, system and electronic equipment for skip-piece cutting. Background Technology

[0002] In automated multi-layer cutting operations, vacuum adsorption is often used to fix multiple stacked materials to ensure the stability of the cutting process. For materials with low air permeability, vacuum adsorption struggles to form a uniform and stable adsorption force on the upper layer of multi-layer materials, easily leading to uneven adsorption or insufficient adsorption strength. When using traditional continuous cutting methods, continuous cutting of adjacent areas can easily cause displacement, wrinkles, or skewing of the upper layer of material, resulting in decreased cutting accuracy and difficulty in guaranteeing the quality of the cut piece outline and edges. To reduce the risk of material displacement, existing methods typically reduce the number of cutting layers, decrease the cutting speed, or add auxiliary positioning steps, which significantly reduces overall work efficiency. Summary of the Invention

[0003] The purpose of this invention is to address the aforementioned problems in existing technologies by proposing a method for cutting skip-pieces.

[0004] The objective of this invention can be achieved through the following technical solution: a method for cutting skip-pieces, comprising: Retrieves all cut pieces within the current cropping window, each cut piece having a corresponding sequential number; Determine the adjacency relationship between any two cut pieces to obtain the adjacent cut pieces corresponding to each cut piece; A preset maximum number of groups is set, and each piece of fabric is assigned to a group of fabric pieces that has no adjacent pieces based on the maximum number of groups. Cut each group of cut pieces in sequence according to the order of the cut pieces, and pause between two adjacent groups of cut pieces to perform the connection processing operation for subsequent cut processes.

[0005] As an optional embodiment of the present invention, determining the adjacency relationship between any two cut pieces includes: Determine the outer contour lines corresponding to the two cut pieces respectively; Determine whether the outline point on the outer contour line of one of the cut pieces is located within the area formed by the outer contour of the other cut piece; If so, then the two cut pieces are determined to be intersecting adjacent cut pieces.

[0006] As an optional embodiment of the present invention, determining the adjacency relationship between any two cut pieces further includes: If the two pieces do not intersect, based on their corresponding outer contours, both outer contours are treated as closed polygons. Traverse all edges of two closed polygons and calculate the shortest distance between each edge segment. If the shortest distance is less than a preset distance threshold, then the two cut pieces are determined to be adjacent cut pieces.

[0007] As an optional embodiment of the present invention, each cut piece is assigned to a cut piece group with no adjacent cut pieces based on the maximum number of groups, including: Determine the adjacent cut pieces corresponding to each cut piece and its assigned cut piece group number; Assign the current piece to the first piece group that is not occupied by an adjacent piece.

[0008] As an optional embodiment of the present invention, before assigning each piece to a piece group with no adjacent pieces based on the maximum number of groups, the method further includes: Create a grouping array for the fabric pieces, with the array size matching the total number of fabric pieces; Initialize the array elements to preset values, which are used to represent the unassigned group number of the cut pieces with the corresponding sequential numbers.

[0009] As an optional embodiment of the present invention, the pieces are cut sequentially according to the order of the pieces, including: Starting from the first cutting piece group, cut the pieces sequentially according to their group numbers, from smallest to largest. Cut the pieces in the same group according to their order of numbering, from smallest to largest.

[0010] The present invention also proposes a skip-piece cutting system, comprising: The "Get Piece" module is used to retrieve all pieces of fabric within the current cropping window. Each piece of fabric has a corresponding sequential number. The adjacent detection module is used to determine the adjacent relationship between any two pieces of fabric and obtain the adjacent pieces of each piece of fabric. The grouping module is used to preset the upper limit of the number of groups, and based on the upper limit of the number of groups, assign each piece of fabric to a group of fabric pieces without adjacent pieces. The cutting module is used to cut each group of cut pieces sequentially according to the order of the cut pieces, and to pause between two adjacent groups of cut pieces to perform the connection processing operation for subsequent cutting processes.

[0011] As an optional embodiment of the present invention, determining adjacent modules includes: The outer contour line acquisition module is used to determine the outer contour lines corresponding to the two cut pieces respectively; The intersection detection module is used to determine whether the outline point on the outer contour line of one piece of fabric is located within the area formed by the outer contour of another piece of fabric. If so, the two pieces of fabric are determined to be intersecting adjacent pieces of fabric.

[0012] As an optional embodiment of the present invention, the method for determining adjacent modules further includes: The distance calculation module is used to calculate the shortest distance between the two edge segments when the outer contours of the two pieces are determined to be non-intersecting based on the corresponding outer contour lines. The module treats the outer contours of the two pieces as closed polygons, traverses all the edges of the two closed polygons, and calculates the shortest distance between the edge segments. The distance determination module is used to determine that two cut pieces are adjacent cut pieces if the shortest distance is less than a preset distance threshold.

[0013] The present invention also provides an electronic device, comprising: processor; Memory used to store processor-executable instructions; The processor is configured to implement the aforementioned chip clipping method when executing executable instructions.

[0014] Compared with existing technologies, the standardized management of cut pieces in this invention provides a precise basis for subsequent grouping. Based on a preset maximum number of groups, each cut piece is assigned a group of cut pieces without adjacent cut pieces, fundamentally avoiding the problem of continuous cutting caused by adjacent cut pieces being in the same group. Finally, the cut pieces are cut sequentially according to the order of the cut piece groups, and pause and lamination operations are performed between adjacent groups. This effectively solves the technical pain points of easy material displacement and wrinkling in multi-layer cutting, ensuring cutting accuracy and cut piece edge quality. At the same time, it does not reduce cutting efficiency or add extra auxiliary steps, taking into account cutting efficiency, accuracy and stability, and solving the core problem that it is difficult to balance the two in existing cutting technologies. Attached Figure Description

[0015] Figure 1 This is a flowchart of a skip-piece cutting method according to an embodiment of the present invention; Figure 2 This is a block diagram of a skip-piece cutting system according to an embodiment of the present invention. Detailed Implementation

[0016] The following are specific embodiments of the present invention, which are described in conjunction with the accompanying drawings. However, the present invention is not limited to these embodiments.

[0017] Example 1 Based on the technical problems highlighted in the background, this embodiment proposes a skip-piece cutting method, suitable for automated cutting scenarios of non-breathable materials, such as... Figure 1 As shown, it includes: S1: Get all cut pieces in the current cutting window, each cut piece has a corresponding sequential number; S2, determine the adjacent relationship between any two pieces of fabric to obtain the adjacent pieces of each piece of fabric; S3, preset the upper limit of the number of groups, and based on the upper limit of the number of groups, assign each piece of fabric to a piece of fabric group with no adjacent pieces of fabric; S4. Cut each group of cut pieces in sequence according to the order of the cut pieces, and perform pause and lamination operations between two adjacent cut pieces.

[0018] To address the issue of easy patterning when cutting multiple layers of non-breathable fabric, this embodiment divides non-adjacent cut pieces into cut piece groups based on a distance threshold, and combines group cutting with inter-group pause lamination to stabilize the vacuum adsorption effect and ensure cutting accuracy.

[0019] This embodiment first obtains all the cut pieces that need to be cut within the current cutting window. Each cut piece has a corresponding sequential number, which indicates the original cutting order. For example, if there are 5 cut pieces in the current cutting window, these cut pieces can be regular or irregular in shape. The user can determine the original cutting order of each cut piece according to actual needs. Without sequential numbers, accurate grouping and orderly cutting of the cut pieces cannot be achieved, leading to a chaotic cutting process. Then, the adjacency relationship between any two cut pieces within the cutting window is determined, clarifying the adjacent objects of each cut piece and providing a basis for grouping operations.

[0020] Simultaneously, a maximum group size is preset. Based on this maximum, each cut piece is assigned a group with no adjacent cut pieces, avoiding cutting conflicts caused by disordered grouping and ensuring that there are no adjacent cut pieces within the same group, thus reducing material displacement problems during cutting at the source. Finally, each group of cut pieces is cut sequentially according to the order of the cut piece groups, with a pause between cutting adjacent groups to perform subsequent cutting process connection operations (positioning, fixing, lamination, etc.), further stabilizing the material adsorption state, ensuring cutting accuracy, and avoiding material displacement, wrinkles, and other problems caused by continuous cutting, balancing cutting efficiency and cutting quality. This process continues until all cut pieces in the current cutting window have been cut. According to the above process, cutting continues into the next cutting window.

[0021] Preferably, determining the adjacency relationship between any two cut pieces includes: Determine the outer contour lines corresponding to the two cut pieces respectively; Determine whether the outline point on the outer contour line of one of the cut pieces is located within the area formed by the outer contour of the other cut piece; If so, then the two cut pieces are determined to be intersecting adjacent cut pieces.

[0022] Each piece of fabric is a closed shape, and its outermost outline is its outer contour, or closed contour line. When determining adjacency, the system quickly identifies whether two pieces intersect or overlap by checking if a point on the outer contour of one piece falls within the closed area enclosed by the outer contour of another piece. For example, if a corner point on the contour of piece A is located inside the closed area of ​​piece B, then the two pieces are considered to overlap and intersect, and are therefore adjacent pieces.

[0023] Preferably, determining the adjacency relationship between any two cut pieces further includes: If the two pieces do not intersect, based on their corresponding outer contours, both outer contours are treated as closed polygons. Traverse all edges of two closed polygons and calculate the shortest distance between each edge segment. If the shortest distance is less than a preset distance threshold, then the two cut pieces are determined to be adjacent cut pieces.

[0024] For two non-intersecting cut pieces, their outer contours are treated as closed polygons. By traversing all edges and calculating the shortest distance between them, the proximity between the cut pieces can be quantitatively determined. If this shortest distance is less than a preset distance threshold, it indicates that the two cut pieces are close in position and are still prone to mutual interference and displacement during continuous cutting; therefore, they are also considered adjacent cut pieces. The preset distance threshold can be flexibly set according to actual cutting requirements such as material type, number of cutting layers, and equipment precision to adapt to the adjacent determination accuracy requirements under different working conditions.

[0025] Preferably, assigning each cut piece to a cut piece group with no adjacent cut pieces based on the maximum number of groups includes: Determine the adjacent cut pieces corresponding to each cut piece and its assigned cut piece group number; Assign the current piece to the first piece group that is not occupied by an adjacent piece.

[0026] Preferably, before assigning each piece of fabric to a group of fabric pieces without adjacent pieces based on the maximum number of groups, the method further includes: Create a grouping array for the fabric pieces, with the array size matching the total number of fabric pieces; Initialize the array elements to preset values, which are used to represent the unassigned group number of the cut pieces with the corresponding sequential numbers.

[0027] This embodiment establishes a patch grouping array G, the size of which is the same as the total number of patches in the current cutting window, for example, the number of patches is... =5, so the size of array G is 5. Array G stores the group number corresponding to each piece of fabric. Therefore, the size of array G must be consistent with the number of pieces of fabric to store the group numbers corresponding to all pieces of fabric. For the sequential number of each piece of fabric, denoted by i, G[i] represents the group number of the i-th piece of fabric. The array elements are initialized to a preset value (such as -1) to indicate that the corresponding piece of fabric has not yet been assigned a group number. After grouping, the corresponding group number of the piece of fabric is written to the corresponding position in the array.

[0028] This embodiment also creates a Boolean array `Used` for each piece i to mark which piece group numbers have been occupied by its neighboring pieces. The length of the `Used` array is consistent with the preset maximum number of groups. Array G is used to record the piece group numbers of each piece, and the `Used` array is used to temporarily mark the group numbers occupied by neighboring pieces. When assigning a piece group number to the current piece, the occupied group numbers are obtained by traversing its neighboring pieces and querying array G. These group numbers are marked as occupied in the `Used` array. Then, the `Used` array is traversed again to determine the available piece group numbers, and the available piece group numbers are written to the corresponding positions in array G, thus completing the assignment of the piece group number to the current piece.

[0029] Specifically, taking a quantity of 5 pieces as an example, numbered as Piece 1, Piece 2, Piece 3, Piece 4, and Piece 5. The preset maximum number of groups is 4, and the length of array G is 5, with indices 0-4 corresponding to Piece 1 through Piece 5 respectively. The initial array G = [-1, -1, -1, -1, -1]. The length of the Used array is 4, corresponding to whether group 1, group 2, group 3, and group 4 are occupied. Assuming that according to the aforementioned judgment rules, the following adjacency relationships are obtained: Piece 1 is adjacent to Piece 2, Piece 2 is adjacent to Piece 3, Piece 3 is adjacent to Piece 4, and Piece 4 is adjacent to Piece 5.

[0030] First, assign a group number to piece 1. At this time, no adjacent piece 1 has occupied the piece group. Initialize Used=[0,0,0,0], where 0 indicates that the group is not occupied and 1 indicates that the group has been occupied. Take the first available piece group 1 and store it in array G, i.e., G[0]=1. The current array G is updated to: G=[1,-1,-1,-1,-1].

[0031] Next, assign a group number to piece 2, traverse array G, find that its adjacent piece 1 occupies group 1, and its adjacent piece 3 has not yet occupied a group, mark Used=[1,0,0,0], take the first available piece group 2, store it in array G, that is, G[1]=2, the current array G is updated to: G=[1,2,-1,-1,-1].

[0032] Next, assign a group number to piece 3, traverse array G, find that its adjacent piece 2 occupies group 2, and its adjacent piece 4 has not yet occupied a group, mark Used=[0, 1, 0, 0], take the first available piece group 1, store it in array G, that is, G[2]=1, the current array G is updated to: G=[1, 2, 1, -1, -1].

[0033] Next, assign a group number to piece 4, traverse array G, find that its adjacent piece 3 occupies group 1, and its adjacent piece 5 has not yet occupied a group, mark Used=[1,0,0,0], take the first available piece group 2, store it in array G, that is, G[3]=2, and update the current array G to: G=[1,2,1,2,-1].

[0034] Finally, assign a group number to piece 5, traverse array G, find that its adjacent piece 4 occupies group 2, mark Used=[0, 1, 0, 0], take the first available piece group 1, store it in array G, that is, G[4]=1, the current array G is updated to: G=[1, 2, 1, 2, 1].

[0035] The `Used` array is used to temporarily mark the group numbers of the cutting pieces, preventing the current piece from falling into the same group as adjacent pieces. After traversing the `Used` array to determine the first available group number, this group number is written to the corresponding position in array G, completing the allocation. By limiting the specific allocation logic of the piece group numbers, and in conjunction with creating an array G that matches the total number of pieces and initializing it, the grouping status of each piece can be clearly distinguished, avoiding omissions, misallocations, or group confusion. At the same time, available group numbers can be quickly determined based on the already assigned group numbers of adjacent pieces, ensuring that adjacent pieces are not assigned to the same group, providing reliable data support for subsequent stable cutting.

[0036] Preferably, the pieces are cut sequentially according to the order of the pieces, including: Starting from the first cutting piece group, cut the pieces sequentially according to their group numbers, from smallest to largest. Cut the pieces in the same group according to their order of numbering, from smallest to largest.

[0037] Once the array G is determined to be G=[1, 2, 1, 2, 1], the cutting order within cutting group 1 can be determined as: cutting piece 1, cutting piece 3, and cutting piece 5, and the cutting order within cutting group 2 as cutting piece 2 and cutting piece 4. First, the cutting pieces within cutting group 1 are cut, following the order from smallest to largest: cutting piece 1 first, then cutting piece 3, and finally cutting piece 5. After cutting the pieces within cutting group 1 is complete, cutting is paused and a lamination operation is performed. After lamination is complete, the cutting pieces within cutting group 2 are cut, first cutting piece 2, and finally cutting piece 4. Following this process, all cutting pieces within the current cutting window are cut, and then all cutting pieces within other cutting windows are cut sequentially. By clearly defining the order of cutting, we can ensure that the cutting groups cut in an orderly manner according to their group numbers, and that the cutting pieces within each group are cut in order according to their sequential numbers. This avoids path redundancy and material displacement caused by chaotic cutting order, and reduces cutting deviation.

[0038] The above methods enable standardized management of cut pieces, providing a precise basis for subsequent grouping. Based on the preset maximum number of groups, each cut piece is assigned a group with no adjacent cut pieces, fundamentally avoiding the continuous cutting problem caused by adjacent cut pieces being in the same group. Finally, the cut pieces are cut sequentially according to the group order, and pause and lamination operations are performed between adjacent groups. This effectively solves the technical pain points of easy material displacement and wrinkling in multi-layer cutting, ensuring cutting accuracy and cut piece edge quality. At the same time, there is no need to reduce cutting efficiency or add extra auxiliary steps, balancing cutting efficiency, accuracy and stability, and solving the core problem of difficulty in balancing the two in existing cutting technologies.

[0039] Example 2 Based on the principles described in Embodiment 1, a skip-piece cutting system 100 is also proposed, such as... Figure 2 As shown, it includes: The piece acquisition module 110 is used to acquire all pieces within the current cutting window, and each piece has a corresponding sequential number. The adjacent detection module 120 is used to determine the adjacent relationship between any two cut pieces and obtain the adjacent cut pieces corresponding to each cut piece. Grouping module 130 is used to preset the upper limit of the number of groups, and based on the upper limit of the number of groups, assign each piece of fabric to a piece of fabric group with no adjacent pieces of fabric. The cutting module 140 is used to cut each group of cut pieces sequentially according to the order of the cut pieces, and to pause between two adjacent groups of cut pieces to perform the connection processing operation of subsequent cutting processes.

[0040] Preferably, determining adjacent modules 120 includes: The outer contour line acquisition module is used to determine the outer contour lines corresponding to the two cut pieces respectively; The intersection detection module is used to determine whether the outline point on the outer contour line of one piece of fabric is located within the area formed by the outer contour of another piece of fabric. If so, the two pieces of fabric are determined to be intersecting adjacent pieces of fabric.

[0041] Preferably, determining adjacent modules 120 further includes: The distance calculation module is used to calculate the shortest distance between the two edge segments when the outer contours of the two pieces are determined to be non-intersecting based on the corresponding outer contour lines. The module treats the outer contours of the two pieces as closed polygons, traverses all the edges of the two closed polygons, and calculates the shortest distance between the edge segments. The distance determination module is used to determine that two cut pieces are adjacent cut pieces if the shortest distance is less than a preset distance threshold.

[0042] Example 3 Furthermore, an electronic device is proposed, comprising: processor; Memory used to store processor-executable instructions; The processor is configured to implement a chip clipping method of Embodiment 1 when executing executable instructions.

[0043] It should be noted that all directional indications (such as up, down, left, right, front, back, etc.) in the embodiments of the present invention are only used to explain the relative positional relationship and movement of each component in a certain specific posture (as shown in the figure). If the specific posture changes, the directional indication will also change accordingly.

[0044] Furthermore, it should be noted that the use of terms such as "first," "second," and "a" in this invention 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 as "first" or "second" may explicitly or implicitly include at least one of that feature. In the description of this invention, "a plurality of" means at least two, such as two, three, etc., unless otherwise explicitly specified. The terms "connection," "fixed," etc., should be interpreted broadly. For example, "fixed" can mean a fixed connection, a detachable connection, or an integral part; it can mean a mechanical connection or an electrical connection; it can mean a direct connection or an indirect connection through an intermediate medium; it can mean the internal communication of two elements or the interaction between two elements, unless otherwise explicitly specified. Those skilled in the art can understand the specific meaning of the above terms in this invention according to the specific circumstances.

[0045] Furthermore, the technical solutions of the various embodiments of the present invention can be combined with each other, but only if they are feasible for those skilled in the art. If the combination of technical solutions is contradictory or cannot be implemented, it should be considered that such combination of technical solutions does not exist and is not within the scope of protection claimed by the present invention.

[0046] The specific embodiments described herein are merely illustrative of the spirit of the invention. Those skilled in the art to which this invention pertains may make various modifications or additions to the described specific embodiments or use similar methods to substitute them, without departing from the spirit of the invention or exceeding the scope defined by the appended claims.

Claims

1. A method for cutting skip-piece panels, characterized in that, include: Retrieves all cut pieces within the current cropping window, each cut piece having a corresponding sequential number; Determine the adjacency relationship between any two cut pieces to obtain the adjacent cut pieces corresponding to each cut piece; A preset maximum number of groups is set, and each piece of fabric is assigned to a group of fabric pieces that has no adjacent pieces based on the maximum number of groups. Cut each group of cut pieces in sequence according to the order of the cut pieces, and pause between two adjacent groups of cut pieces to perform the connection processing operation for subsequent cut processes.

2. The method according to claim 1, characterized in that, Determine the adjacency relationship between any two cut pieces, including: Determine the outer contour lines corresponding to the two cut pieces respectively; Determine whether the outline point on the outer contour line of one of the cut pieces is located within the area formed by the outer contour of the other cut piece; If so, then the two cut pieces are determined to be intersecting adjacent cut pieces.

3. The method according to claim 1, characterized in that, Determining the adjacency relationship between any two cut pieces also includes: If the two pieces do not intersect, based on their corresponding outer contours, both outer contours are treated as closed polygons. Traverse all edges of two closed polygons and calculate the shortest distance between each edge segment. If the shortest distance is less than a preset distance threshold, then the two cut pieces are determined to be adjacent cut pieces.

4. The method according to claim 1, characterized in that, Based on the maximum number of groups, each piece of fabric is assigned to a group of fabric pieces with no adjacent pieces, including: Determine the adjacent cut pieces corresponding to each cut piece and its assigned cut piece group number; Assign the current piece to the first piece group that is not occupied by an adjacent piece.

5. The method according to claim 1, characterized in that, Before assigning each piece to a piece group with no adjacent pieces based on the maximum number of groups, the process also includes: Create a group array for the cut pieces, with the array size matching the total number of cut pieces; Initialize the array elements to preset values, which are used to represent the unassigned group number of the cut pieces with the corresponding sequential numbers.

6. The method according to claim 1, characterized in that, Cut the pieces in the order they are cut, including: Starting from the first cutting piece group, cut the pieces sequentially according to their group numbers, from smallest to largest. Cut the pieces in the same group according to their order of numbering, from smallest to largest.

7. A skip-piece cutting system, characterized in that, include: The "Get Piece" module is used to retrieve all pieces of fabric within the current cropping window. Each piece of fabric has a corresponding sequential number. The adjacent detection module is used to determine the adjacent relationship between any two pieces of fabric and obtain the adjacent pieces of each piece of fabric. The grouping module is used to preset the upper limit of the number of groups, and based on the upper limit of the number of groups, assign each piece of fabric to a piece of fabric group with no adjacent pieces of fabric. The cutting module is used to cut each group of cut pieces sequentially according to the order of the cut pieces, and to pause between two adjacent groups of cut pieces to perform the connection processing operation for subsequent cutting processes.

8. The system according to claim 7, characterized in that, Determining adjacent modules includes: The outer contour line acquisition module is used to determine the outer contour lines corresponding to the two cut pieces respectively; The intersection detection module is used to determine whether the outline point on the outer contour line of one piece of fabric is located within the area formed by the outer contour of another piece of fabric. If so, the two pieces of fabric are determined to be intersecting adjacent pieces of fabric.

9. The system according to claim 7, characterized in that, Determining adjacent modules also includes: The distance calculation module is used to calculate the shortest distance between the two edge segments when the outer contours of the two pieces are determined to be non-intersecting based on the corresponding outer contours of the two pieces. The distance determination module is used to determine that two cut pieces are adjacent cut pieces if the shortest distance is less than a preset distance threshold.

10. An electronic device, characterized in that, include: processor; Memory used to store processor-executable instructions; The processor is configured to implement the skip clipping method described in any one of claims 1-6 when executing executable instructions.

Images