Packaging box layout method and device

Abstract

The application is suitable for the technical field of packaging boxes, and particularly relates to a packaging box layout method and device. The method comprises the following steps: when none of the packaging boxes in a packaging box set is laid out, laying out a packaging box with the largest area in the packaging box set and determining the packaging box as a first packaging box; laying out one of other packaging boxes; determining a group of candidate packaging boxes from the packaging box set; for each candidate packaging box, obtaining a probability that the candidate packaging box is a second packaging box according to the planar features of the first packaging box and the planar features of the candidate packaging box; determining the second packaging box according to the probabilities that the candidate packaging boxes are the second packaging box; laying out the second packaging box; and repeating the above steps until all the packaging boxes in the packaging box set are laid out. Therefore, the packaging box layout method provided by the application can continuously and accurately lay out various packaging boxes, thereby improving the layout efficiency.

Description

TECHNICAL FIELD

[0001] The application belongs to the technical field of packaging boxes, and particularly relates to a packaging box layout method and device. BACKGROUND

[0002] Packaging box layout refers to, in the production and manufacturing process of packaging boxes, carefully arranging and laying out the unfolded diagrams of multiple packaging boxes on raw materials (such as paperboard, plastic board, etc.) according to the sizes, shapes and specifications of the materials used, so as to improve the utilization rate of raw materials, reduce material waste, reduce production costs, and at the same time, take into account the convenience and efficiency of production and processing.

[0003] The prior art relies on offline calculation, that is, a packaging box layout scheme is generated in advance and stored, but when facing emergency orders, packaging box design changes or small-batch production of packaging boxes, it takes a long time to recalculate the packaging box layout scheme, resulting in production delay. The traditional layout algorithm has poor adaptability to irregular shapes, and a large number of blank areas are easily generated when laying out special-shaped packaging boxes, resulting in low material utilization. Therefore, the layout efficiency of multiple packaging boxes in the production process of packaging boxes is low. SUMMARY

[0004] The embodiments of the application provide a packaging box layout method and device, which can continuously and accurately layout multiple packaging boxes, thereby improving the layout efficiency.

[0005] In a first aspect, the embodiments of the application provide a packaging box layout method, comprising:

[0006] obtaining a planar feature of each packaging box in a packaging box set to be laid out; wherein the packaging box set comprises a first packaging box and other packaging boxes, the first packaging box comprises a laid-out packaging box, and the planar feature comprises the size of an unfolded diagram;

[0007] In the case that none of the packaging boxes in the packaging box set is laid out, laying out a packaging box with the largest area in the packaging box set and determining it as the first packaging box;

[0008] laying out one of the other packaging boxes:

[0009] determining a group of candidate packaging boxes from the packaging box set; wherein in the case that the other packaging boxes comprise multiple packaging boxes, the candidate packaging box is one of the other packaging boxes with a similarity greater than a similarity threshold to the contour of the unfolded diagram of the first packaging box, and in the case that the other packaging boxes comprise one packaging box, the candidate packaging box is the one of the other packaging boxes;

[0010] For each of the candidate packaging boxes, a probability that the candidate packaging box is a second packaging box is obtained according to the planar feature of the first packaging box and the planar feature of the candidate packaging box, wherein the second packaging box is a current layout target;

[0011] The second packaging box is determined according to the probabilities that the candidate packaging boxes are the second packaging box.

[0012] The second packaging box is laid out.

[0013] The step of laying out one of the other packaging boxes is repeated until all the packaging boxes in the packaging box set are laid out.

[0014] The technical solutions provided in the embodiments of the present application have at least the following technical effects:

[0015] The packaging box layout method provided in the embodiments of the present application obtains the planar feature of each packaging box in a packaging box set to be laid out. When none of the packaging boxes in the packaging box set is laid out, a packaging box with the largest area in the packaging box set is laid out and determined as a first packaging box. One of the other packaging boxes is laid out. A group of candidate packaging boxes is determined from the packaging box set. For each of the candidate packaging boxes, a probability that the candidate packaging box is a second packaging box is obtained according to the planar feature of the first packaging box and the planar feature of the candidate packaging box. The second packaging box is determined according to the probabilities that the candidate packaging boxes are the second packaging box. The second packaging box is laid out. The step of laying out one of the other packaging boxes is repeated until all the packaging boxes in the packaging box set are laid out. Therefore, the packaging box layout method provided in the embodiments of the present application forms a closed-loop iterative process by removing the laid-out packaging boxes after each layout and determining the newly determined second packaging box as the first packaging box in the next round. Only the matching problem of the current layout target and the candidate packaging box needs to be processed each time, rather than calculating the permutation and combination of all the packaging boxes at one time, which converts the combination explosion problem into linear iteration and is beneficial to reducing the calculation complexity. The similarity between the unfolded graphic contour of the first packaging box and the other packaging boxes is calculated, and the other packaging boxes with a similarity greater than a similarity threshold are selected as the candidate packaging boxes, which effectively reduces the search range. The current layout target is taken as the core, and only the local matching relationship between the current layout target and the candidate packaging boxes is considered, which is beneficial to improving the layout speed and is suitable for small-batch and multi-variety packaging box production scenarios.

[0016] In a possible implementation of the first aspect, the determining a group of candidate packaging boxes from the packaging box set comprises:

[0017] A plurality of key points of each packaging box in the packaging box set are obtained by uniformly sampling the unfolded graphic contour of each packaging box in the packaging box set.

[0018] For each key point of each of the packaging boxes in the set of packaging boxes, a polar histogram of each key point to other key points is calculated to obtain a shape context vector;

[0019] A minimum matching cost of each of the other packaging boxes is obtained according to the shape context vector of the first packaging box and the shape context vectors of the other packaging boxes;

[0020] The corresponding similarity is obtained according to each of the minimum matching costs;

[0021] A group of the candidate packaging boxes is determined from the set of packaging boxes according to each of the similarities.

[0022] In a possible implementation manner of the first aspect, the determining a group of the candidate packaging boxes from the set of packaging boxes according to each of the similarities comprises:

[0023] A group of third packaging boxes with the similarity greater than the similarity threshold is determined from the set of packaging boxes according to each of the similarities;

[0024] A group of the candidate packaging boxes is determined from the third packaging boxes according to a remaining area of a preset material area.

[0025] In a possible implementation manner of the first aspect, the obtaining, for each of the candidate packaging boxes, the probability that the candidate packaging box is the second packaging box according to the planar feature of the first packaging box and the planar feature of the candidate packaging box comprises:

[0026] For each of the candidate packaging boxes, a cooperative feature pair is obtained according to the planar feature of the first packaging box and the planar feature of the candidate packaging box; wherein the cooperative feature pair is used to reflect the fitting degree of the candidate packaging box and the first packaging box;

[0027] The probability that the candidate packaging box is the second packaging box is obtained according to the cooperative feature pair.

[0028] In a possible implementation manner of the first aspect, the cooperative feature pair comprises a rotation angle of the candidate packaging box and an overlapping contour length of the first packaging box and the candidate packaging box; and the obtaining the cooperative feature pair according to the planar feature of the first packaging box and the planar feature of the candidate packaging box comprises:

[0029] A corresponding circumscribed polygon is obtained according to the planar feature of the first packaging box and the planar feature of the candidate packaging box; wherein the circumscribed polygon refers to a minimum polygon containing an unfolded graph of a packaging box;

[0030] rotating a circumscribed polygon of the candidate packaging box around a circumscribed polygon of the first packaging box;

[0031] in a case where a distance between any pair of edges of the circumscribed polygon of the candidate packaging box and the circumscribed polygon of the first packaging box is determined to be less than a distance threshold in the rotating, determining the rotation angle and a corresponding overlap profile length; wherein the rotation angle comprises a rotation angle of the candidate packaging box and an orbit angle of the candidate packaging box around the first packaging box.

[0032] In a possible implementation manner of the first aspect, the planar feature further comprises a marking path, the marking path comprising an indentation path and / or a punch path; and the determining the probability that the candidate packaging box is the second packaging box according to the collaborative feature comprises:

[0033] in a case where the marking path of the candidate packaging box is determined to be continuous with the marking path of the first packaging box according to the rotation angle, accumulating lengths of the marking paths of the candidate packaging box and the first packaging box to obtain a marking path length;

[0034] determining the probability that the candidate packaging box is the second packaging box according to the overlap profile length and the corresponding marking path length.

[0035] In a possible implementation manner of the first aspect, the determining the probability that the candidate packaging box is the second packaging box according to the overlap profile length and the corresponding marking path length comprises:

[0036] normalizing the overlap profile length according to a perimeter of the candidate packaging box to obtain a profile overlap rate;

[0037] normalizing the marking path length according to a total marking path length of each packaging box in the set of packaging boxes to obtain a marking path efficiency;

[0038] determining the probability that the candidate packaging box is the second packaging box according to the profile overlap rate and the marking path efficiency.

[0039] In a possible implementation manner of the first aspect, the determining the second packaging box according to the probability that each candidate packaging box is the second packaging box comprises:

[0040] ranking the probabilities that each candidate packaging box is the second packaging box, and determining the candidate packaging box corresponding to the maximum probability as the second packaging box.

[0041] In a possible implementation manner of the first aspect, the method is applied to a packaging box layout device, the packaging box layout device is in communication connection with a die-cutting device, and the method further comprises:

[0042] After the layout, for each of the set of packaging boxes, a space index is used to quickly query adjacent packaging boxes in the preset material area, to obtain a shortest marking path and a shortest cutting path;

[0043] The shortest marking path and the shortest cutting path are sent to the die-cutting device.

[0044] In a second aspect, an embodiment of the present application provides a packaging box layout device, comprising:

[0045] An acquisition module is configured to acquire planar features of each packaging box in a set of packaging boxes to be laid out; wherein the set of packaging boxes comprises a first packaging box and other packaging boxes, the first packaging box comprises a packaging box that has been laid out, and the planar features comprise sizes of unfolded graphics;

[0046] A first layout module is configured to, in a case where each of the set of packaging boxes has not been laid out, lay out a packaging box with the largest area in the set of packaging boxes and determine the packaging box as the first packaging box;

[0047] An other layout module is configured to lay out one of the other packaging boxes:

[0048] A candidate packaging box module is configured to determine a group of candidate packaging boxes from the set of packaging boxes; wherein, in a case where the other packaging boxes comprise a plurality of packaging boxes, the candidate packaging box is one of the other packaging boxes that has a similarity to an outline of an unfolded graphic of the first packaging box greater than a similarity threshold, and in a case where the other packaging boxes comprise one packaging box, the candidate packaging box is the one of the other packaging boxes;

[0049] A probability module is configured to, for each of the candidate packaging boxes, obtain a probability that the candidate packaging box is a second packaging box according to planar features of the first packaging box and planar features of the candidate packaging box; wherein the second packaging box is a current layout target;

[0050] A second packaging box module is configured to determine the second packaging box according to the probability that each of the candidate packaging boxes is the second packaging box;

[0051] A second layout module is configured to lay out the second packaging box;

[0052] A repeating module is configured to repeat the step of laying out one of the other packaging boxes until all of the packaging boxes in the set of packaging boxes have been laid out.

[0053] In a third aspect, an embodiment of the present application provides a packaging box layout device, comprising a memory, a processor, and a computer program stored in the memory and capable of running on the processor, and the processor implements the method according to any one of the first aspect when executing the computer program.

[0054] In a fourth aspect, an embodiment of the present application provides a computer readable storage medium, which stores a computer program, and the computer program is executed by a processor to implement the method according to any one of the first aspect.

[0055] In a fifth aspect, an embodiment of the present application provides a computer program product, which, when running on a packaging box layout device, causes the packaging box layout device to execute the method according to any one of the first aspect.

[0056] It can be understood that the beneficial effects of the second aspect to the fifth aspect can be referred to the related description of the first aspect, which will not be repeated here. BRIEF DESCRIPTION OF DRAWINGS

[0057] In order to more clearly illustrate the technical solutions in the embodiments of the present application, the drawings needed to be used in the embodiments or prior art description will be briefly introduced. Obviously, the drawings in the following description are only some embodiments of the present application, and other drawings can be obtained by those skilled in the art without creative labor.

[0058] Figure 1 is a flowchart of a packaging box layout method provided by an embodiment of the present application;

[0059] Figure 2 is an example diagram of packaging box layout provided by an embodiment of the present application;

[0060] Figure 3 is an implementation flowchart of steps S310 and S315 in the packaging box layout method provided by an embodiment of the present application;

[0061] Figure 4 is an implementation flowchart of steps S321, S322 and S3222 in the packaging box layout method provided by an embodiment of the present application;

[0062] Figure 5 is an implementation flowchart of steps S320 and S330 in the packaging box layout method provided by an embodiment of the present application;

[0063] Figure 6 is a structural diagram of a packaging box layout device provided by an embodiment of the present application;

[0064] Figure 7FIG. 1 is a structural schematic diagram of a packaging box layout equipment provided by an embodiment of the present application. DETAILED DESCRIPTION

[0065] In the following description, specific details are set forth, such as particular system configurations, techniques, etc., in order to provide a thorough understanding of embodiments of the present application. However, persons having ordinary skill in the art will appreciate that embodiments of the present application can be practiced without these specific details. In other instances, well-known systems, structures, circuits, and techniques have not been shown in detail in order not to obscure the understanding of this description.

[0066] It should be understood that the term "comprises" when used in this specification and the appended claims specifies the presence of stated features, integers, steps, operations, elements, and / or components, but does not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, and / or groups thereof.

[0067] It should also be understood that the term "and / or" when used in this specification and the appended claims, such as in the phrases "A and / or B" and "A and / or B and / or C", means any combination of one or more of the associated listed items and can be interpreted as "one or more of A and B" or "one or more of A, B, and C".

[0068] As used in this specification and the appended claims, the term "if' can be construed to mean "when" or "upon" or "in response to determining" or "in response to detecting", depending on the context. Similarly, the phrase "if it is determined" or "if [a described condition or event] is detected" can be construed to mean "upon determining" or "in response to determining" or "upon detecting [the described condition or event]" or "in response to detecting [the described condition or event]", depending on the context.

[0069] In addition, the terms "first", "second", "third", etc. as used in the description of the specification and the appended claims are merely used for distinguishing, and cannot be understood as indicating or implying relative importance.

[0070] Reference in the specification to "one embodiment" or "some embodiments" means that a particular feature, structure, or characteristic described in connection with the embodiment is included in at least one embodiment of the application. The appearances of the phrase "in one embodiment" or "in some embodiments" in various places in the specification are not necessarily all referring to the same embodiment, although it can. The terms "comprising", "including", "having" and the like are meant to be interpreted open-ended when used in the description and claims unless otherwise noted. That is, these terms are meant not to exclude but to include other components or steps as well.

[0071] In the related art, offline calculation is relied on, that is, a carton layout scheme is generated in advance and stored, but when facing urgent orders, carton design changes or small-batch production of cartons, it takes a long time to recalculate the carton layout scheme, resulting in production delay. The traditional layout algorithm has poor adaptability to irregular shapes, and a large number of blank areas are easily generated when laying out special-shaped cartons, and the material utilization rate is low. Therefore, the layout efficiency of multiple cartons is low in the current carton production process.

[0072] To solve the above problems, the embodiments of the present application provide a carton layout method and equipment. In the method, the planar features of each carton in the set of cartons to be laid out are obtained; in the case that none of the cartons in the set of cartons has been laid out, the largest carton in the set of cartons is laid out and determined as the first carton; one of the other cartons is laid out: a group of candidate cartons is determined from the set of cartons; for each candidate carton, the probability that the candidate carton is the second carton is obtained according to the planar features of the first carton and the planar features of the candidate carton; the second carton is determined according to the probability that each candidate carton is the second carton; the second carton is laid out; the step of laying out one of the other cartons is repeated until all the cartons in the set of cartons have been laid out. Therefore, the carton layout method provided by the embodiments of the present application forms a closed-loop iterative process by removing the laid-out cartons after each layout and determining the newly determined second carton as the first carton of the next round. Only the matching problem between the current layout target and the candidate carton needs to be processed each time, rather than calculating the permutation and combination of all cartons at one time, which converts the combination explosion problem into linear iteration, which is beneficial to reduce the computational complexity; by calculating the similarity between the unfolded graphic contour of the first carton and the other cartons, and selecting the other cartons with a similarity greater than a similarity threshold as candidate cartons, the search range is effectively reduced; taking the current layout target as the core, only the local matching relationship between the current layout target and the candidate carton is considered, which is beneficial to improve the layout speed and suitable for small-batch, multi-variety carton production scenarios.

[0073] The carton layout method provided by the embodiments of the present application can be applied to a carton layout equipment, at which time the carton layout equipment is the execution subject of the carton layout method provided by the embodiments of the present application, and the embodiments of the present application do not limit the specific type of the carton layout equipment.

[0074] For example, the packaging box layout device can be a tablet computer, a notebook computer, an ultra-mobile personal computer (UMPC), a netbook, a desktop computer, a handheld device with wireless communication function, a computing device, or other processing device connected to a wireless modem, a computer, a laptop, a handheld computing device, etc., but is not limited thereto.

[0075] In order to better understand the packaging box layout method provided by the embodiments of the present application, the specific implementation process of the packaging box layout method provided by the embodiments of the present application is exemplarily introduced as follows.

[0076] Figure 1 A schematic flowchart of the packaging box layout method provided by the embodiments of the present application is shown, and the packaging box layout method comprises:

[0077] S100, obtaining the planar features of each packaging box in a packaging box set to be laid out. The packaging box set comprises a first packaging box and other packaging boxes, the first packaging box comprises a packaging box that has been laid out, and the planar features comprise the size of an unfolded figure.

[0078] It can be understood that each packaging box in the packaging box set to be laid out can refer to a complete packaging box or a component of the packaging box.

[0079] Exemplarily, the unfolded figure (such as DXF format) of each packaging box in the packaging box set to be laid out can be derived, the contour coordinate points of the unfolded figure of each packaging box are parsed, for each packaging box, the size (length, width) of the minimum circumscribed rectangle and the convex hull of the contour polygon are calculated, and the planar features of each packaging box are obtained. The process parameters (such as the paperboard texture direction, the die cutting line position of the die cutting equipment, i.e. the marking path of the packaging box) in the packaging box production process can also be extracted as additional features.

[0080] S200, in the case that none of the packaging boxes in the packaging box set has been laid out, laying out the packaging box with the largest area in the packaging box set and determining it as the first packaging box.

[0081] Exemplarily, the packaging box with the largest area in the packaging box set can be placed at the upper left corner of the layout plate, i.e. the preset material area, the position coordinates (such as (0, 0)) thereof are recorded, the packaging box is marked as “laid out”, and the packaging box is removed from the packaging box set to be laid out.

[0082] S300, laying out one of the other packaging boxes:

[0083] Exemplarily, one of the other packaging boxes can be placed in the adjacent area (e.g., right side or below) of the first packaging box in the remaining area of the preset material area, and the placement point of the one of the other packaging boxes can be generated in the scan line order (e.g., from left to right, from top to bottom).

[0084] S310, determining a set of candidate packaging boxes from the set of packaging boxes. Where the other packaging boxes include a plurality of packaging boxes, the candidate packaging box is one of the other packaging boxes having a similarity greater than a similarity threshold to the unfolded graphic contour of the first packaging box, and where the other packaging boxes include one packaging box, the candidate packaging box is the one of the other packaging boxes.

[0085] Exemplarily, the contour similarity of the other packaging box to the unfolded graphic of the first packaging box can be calculated using an IoU (Intersection over Union) or a contour matching algorithm (e.g., Hausdorff distance), and the candidate packaging box can be selected from the set of packaging boxes according to the contour similarity.

[0086] S320, for each candidate packaging box, obtaining a probability that the candidate packaging box is the second packaging box according to the planar features of the first packaging box and the planar features of the candidate packaging box. The second packaging box is the current layout target.

[0087] It can be understood that the planar features of the first packaging box refer to the features of the overall unfolded graphic of the laid-out packaging box and the current layout target.

[0088] Exemplarily, for each candidate packaging box, the size proportion similarity and the contour similarity of each candidate packaging box to the first packaging box can be obtained according to the planar features of the first packaging box and the planar features of the candidate packaging box, and the probability that the candidate packaging box is the second packaging box can be calculated by weighting the size proportion similarity and the contour similarity.

[0089] S330, determining the second packaging box according to the probability that each candidate packaging box is the second packaging box.

[0090] Exemplarily, the candidate packaging box that can be laid out can be determined according to the planar features of each candidate packaging box and the remaining area of the preset layout area, and the candidate packaging box having the largest probability can be selected as the second packaging box.

[0091] S340, laying out the second packaging box.

[0092] Exemplarily, as Figure 2As shown, the placeable position of the second packaging box can be calculated in the remaining area of the preset material area by a NFP (No-Fit Polygon) algorithm, a splicing position closest to the first packaging box is preferentially selected, the second packaging box is removed from the set of packaging boxes to be laid out, and is marked as "laid out".

[0093] S400, the step of laying out one of the other packaging boxes is repeated until all the packaging boxes in the set of packaging boxes are laid out.

[0094] Exemplarily, the step S300 can be executed in a loop, each time the latest laid-out packaging box is added to the first packaging box, and a second packaging box is searched for in the set of packaging boxes to be laid out according to the planar features of the first packaging box, until all the packaging boxes are laid out. If only one packaging box is left in the set of packaging boxes to be laid out in a certain loop, the packaging box is directly laid out to the remaining area of the preset material area; if the remaining area of the preset material area cannot lay out any packaging box in the set of packaging boxes to be laid out in a certain loop, the remaining packaging boxes in the set of packaging boxes to be laid out are laid out to a new preset material area, the largest packaging box in the set of packaging boxes is laid out and determined as the first packaging box, and the step S300 is executed in a loop again.

[0095] In a possible implementation, refer to Figure 3 S310, a group of candidate packaging boxes is determined from the set of packaging boxes, including:

[0096] S311, a plurality of key points of each packaging box in the set of packaging boxes are obtained by uniformly sampling on the unfolded graphic contour of each packaging box in the set of packaging boxes.

[0097] Exemplarily, a contour polygon can be extracted from the unfolded graphic of each packaging box, key points are equidistantly sampled along the contour, the sampling interval is 1 / N (N is the number of sampling points, such as N=20) of the contour perimeter, and the plurality of key points of each packaging box are obtained according to the sampling interval and the contour polygon of each packaging box.

[0098] S312, for the plurality of key points of each packaging box in the set of packaging boxes, a polar histogram of each key point to other key points is calculated to obtain a shape context vector.

[0099] Exemplarily, for each key point of each packaging box, a polar coordinate of the key point to all other key points of the packaging box is calculated, a polar coordinate space is divided into a plurality of bins, the number of key points in each bin is counted, a histogram is formed, and the histograms of all the key points of each packaging box are spliced into a global vector to obtain the shape context vector.

[0100] S313, obtaining a minimum matching cost of each of the other packaging boxes according to the shape context vector of the first packaging box and the shape context vectors of the other packaging boxes.

[0101] Exemplarily, the matching cost of the shape context vector of the first packaging box and the shape context vector of each of the other packaging boxes can be calculated using a cost function such as Earth Mover's Distance (EMD) or Chi-square (χ²) distance, and the optimal correspondence between the key points is found by the Hungarian algorithm to obtain the minimum matching cost.

[0102] S314, obtaining a corresponding similarity according to each minimum matching cost.

[0103] Exemplarily, each minimum matching cost can be normalized, that is, mapped to the interval [0, 1], to obtain the corresponding similarity.

[0104] S315, determining a group of candidate packaging boxes from the packaging box set according to each similarity.

[0105] Exemplarily, in a case where the total area of the minimum circumscribed rectangles of all packaging boxes in the packaging box set to be laid out is less than the area of the preset material area, the packaging boxes with a similarity greater than a similarity threshold value (such as 0.7) can be selected as candidate packaging boxes. If each similarity is less than the similarity threshold value, the candidate packaging boxes can be selected according to the similarity ranking (such as the first n packaging boxes).

[0106] Through the above steps S311 to S315, the packaging box contour is described by the shape context, and high-precision similarity evaluation of the special-shaped packaging box is realized by combining the cost function and the dynamic threshold screening. The special-shaped packaging box can be adapted, the similar shape priority layout can reduce material fragmentation, and the material utilization rate can be improved.

[0107] Optionally, referring to Figure 3 , S315, determining a group of candidate packaging boxes from the packaging box set according to each similarity, comprising:

[0108] S3151, determining a group of third packaging boxes with a similarity greater than a similarity threshold value from the packaging box set according to each similarity.

[0109] Exemplarily, in a case where the total area of the minimum circumscribed rectangles of all packaging boxes in the packaging box set to be laid out is not less than the area of the preset material area, the packaging box set is traversed, and the packaging boxes with a similarity greater than a similarity threshold value are retained, which are recorded as third packaging boxes. If each similarity is less than the similarity threshold value, the third packaging boxes can be determined according to the similarity ranking (such as the first n packaging boxes).

[0110] S3152, Arrange samples within the preset material area, and determine a set of candidate packaging boxes from the third packaging box based on the remaining area of ​​the preset material area.

[0111] For example, after layout within a preset material area, the remaining area is updated in real time (by subtracting layout boxes using Boolean subtraction). For each box in the third packaging box, its outline is first checked to see if it can be completely embedded into the remaining area through rotation and displacement. Then, boxes whose aspect ratio matches the local shape of the remaining area are prioritized as candidate boxes (e.g., if the remaining area is a narrow strip, long strip boxes are prioritized for layout). The area utilization rate and shape similarity of each box in the remaining area can be obtained based on the remaining area and each box in the third packaging box. The layout score of each box in the third packaging box is obtained by weighted summation of each area utilization rate and each shape similarity. Candidate boxes are selected based on each layout score.

[0112] Traditional nesting algorithms rely solely on size matching while ignoring shape similarity. Static nesting orders (such as descending order by area) cannot adapt to the dynamic shapes of remaining areas. Through steps S3151 to S3152, similarity pre-screening and remaining area adaptation can avoid multiple cuts or fragmentation caused by shape mismatch, thereby improving material utilization and nesting efficiency.

[0113] In one possible implementation, please refer to Figure 5 S320, For each candidate packaging box, the probability that the candidate packaging box is the second packaging box is obtained based on the planar features of the first packaging box and the planar features of the candidate packaging box, including:

[0114] S321, for each candidate packaging box, a collaborative feature pair is obtained based on the planar features of the first packaging box and the planar features of the candidate packaging box. The collaborative feature pair reflects the fit between the candidate packaging box and the first packaging box.

[0115] For example, geometric features (such as convex hull, minimum bounding rectangle) and topological features (such as number of holes) can be extracted from the planar features of the first packaging box, and collaborative feature pairs can be obtained by extracting features of the same dimension for each candidate packaging box based on the planar features of the candidate packaging boxes.

[0116] S322, based on the collaborative feature pair, obtain the probability that the candidate packaging box is the second packaging box.

[0117] For example, model training data can be obtained from historical layout cases. Logistic regression or random forest models can be trained based on the model training data (inputting a pair of collaborative feature pairs of packaging boxes and outputting the probability that one packaging box in the pair is arranged around the other packaging box). A probability model can be obtained by inputting the collaborative feature pairs into the probability model to obtain the probability that the candidate packaging box is the second packaging box.

[0118] By the above steps S321 to S322, the multi-dimensional collaborative feature pair is constructed, the shape and topological fitness are comprehensively evaluated, the probability is output based on the data-driven model, and the dynamic threshold screening is supported.

[0119] Optionally, referring to Figure 4 , the collaborative feature pair includes a rotation angle of the candidate packaging box and an overlapping contour length of the first packaging box and the candidate packaging box. The collaborative feature pair is obtained according to the planar features of the first packaging box and the planar features of the candidate packaging box in S321, including:

[0120] S3211, a corresponding circumscribed polygon is obtained according to the planar features of the first packaging box and the planar features of the candidate packaging box. The circumscribed polygon refers to the smallest polygon containing the unfolded shape of the packaging box.

[0121] Exemplarily, the convex hull algorithm (such as Andrew's monotone chain) or the minimum area circumscribed rectangle algorithm (rotating calipers method) can be used to generate the corresponding circumscribed polygon according to the planar features of the first packaging box and the planar features of the candidate packaging box.

[0122] S3212, the circumscribed polygon of the candidate packaging box is rotated around the circumscribed polygon of the first packaging box.

[0123] Exemplarily, the feasible rotation angle can be determined according to the remaining area of the preset material area and the circumscribed polygon of the candidate packaging box, and the circumscribed polygon of the candidate packaging box is rotated around the circumscribed polygon of the first packaging box according to the feasible rotation angle.

[0124] S3213, in the case that the distance between any pair of edges of the circumscribed polygon of the candidate packaging box and the circumscribed polygon of the first packaging box is less than the distance threshold during rotation, the rotation angle and the corresponding overlapping contour length are determined. The rotation angle includes the rotation angle of the candidate packaging box and the revolution angle around the first packaging box.

[0125] Exemplarily, the shortest distance from any edge of the circumscribed polygon of the candidate packaging box to any edge of the circumscribed polygon of the first packaging box can be calculated, and in the case that the shortest distance between any pair of edges of the circumscribed polygon of the candidate packaging box and the circumscribed polygon of the first packaging box is less than the distance threshold during rotation, the rotation angle is recorded, and the corresponding overlapping contour length is calculated (i.e. the distance from any point on the edge of the circumscribed polygon of the candidate packaging box to any point on the circumscribed polygon of the first packaging box is calculated, and the overlapping contour length is obtained according to the point on the edge of the circumscribed polygon of the candidate packaging box which is less than the distance threshold).

[0126] By the above steps S3211 to S3213, a compact bounding polygon is generated, the calculation complexity is reduced; all possible poses of the candidate packaging box are simulated, the optimal solution is covered; and the effective pose is screened based on the geometric distance and the overlapping contour length, and the material utilization rate is improved.

[0127] Optionally, referring to Figure 4 , the planar feature further includes a marking path, and the marking path includes an indentation path and / or a punching path. S322, the probability that the candidate packaging box is the second packaging box according to the cooperative feature includes:

[0128] S3221, in the case that the candidate packaging box is determined to be continuous with the marking path of the first packaging box according to the rotation angle, the length of the marking path of the candidate packaging box and the first packaging box is accumulated to obtain the marking path length.

[0129] Illustratively, the position coordinates of the candidate packaging box and the first packaging box in the preset material area can be determined according to the rotation angle, the Euclidean distance of the marking path of the candidate packaging box and the first packaging box is determined according to the position coordinates, if the Euclidean distance is less than a preset threshold, the marking path of the candidate packaging box and the first packaging box is continuous, and the length of the marking path of the candidate packaging box and the first packaging box is accumulated to obtain the marking path length (the indentation path and the punching path are accumulated respectively).

[0130] S3222, the probability that the candidate packaging box is the second packaging box is obtained according to the overlapping contour length and the corresponding marking path length.

[0131] Illustratively, the overlapping contour length and the corresponding marking path length can be normalized and weighted summed to obtain a comprehensive score, and the comprehensive score is converted to obtain the probability that the candidate packaging box is the second packaging box according to the number of candidate packaging boxes.

[0132] By the above steps S3221 to S3222, the space utilization and the process compatibility are considered comprehensively, which is helpful to adapt to the requirements of different types of packaging boxes, and also helps to improve the layout speed and support the rapid decision-making of packaging box automation production.

[0133] Illustratively, referring to Figure 4 , S3222, the probability that the candidate packaging box is the second packaging box is obtained according to the overlapping contour length and the corresponding marking path length, including:

[0134] S32221, the overlapping contour length is normalized to obtain the contour overlapping rate according to the perimeter of the candidate packaging box.

[0135] Illustratively, the overlapping contour length can be normalized to obtain the contour overlapping rate according to the proportion of the overlapping contour length to the perimeter of the candidate packaging box.

[0136] S32222, normalize the marking path length according to the total marking path length of each packaging box in the packaging box set to obtain the marking path efficiency.

[0137] Exemplarily, the marking path length can be normalized according to the proportion of the marking path length to the total marking path length to obtain the marking path efficiency.

[0138] S32223, obtain the probability that the candidate packaging box is the second packaging box according to the contour overlap rate and the marking path efficiency.

[0139] Exemplarily, the contour overlap rate and the marking path efficiency can be weighted and summed and normalized to obtain the probability that the candidate packaging box is the second packaging box.

[0140] The prior art does not consider the overall process burden of multiple packaging boxes on the set, and may select a packaging box with an extremely long path but low space utilization, causing the die-cutting equipment to be overloaded or the packaging box layout to fail. Through the above steps S32221 to S32223, the perimeter normalization eliminates the size deviation, accurately measures the space sharing rate, normalizes the total length of the set, reflects the proportion of process resource consumption, outputs the optimal solution through the weighted probability model, balances the space and process demand, and enhances the production stability.

[0141] In a possible implementation, please refer to Figure 5 S330, determining the second packaging box according to the probability that each candidate packaging box is the second packaging box, comprising:

[0142] S331, sorting the probability that each candidate packaging box is the second packaging box, and determining the candidate packaging box corresponding to the maximum probability as the second packaging box.

[0143] Exemplarily, the probability that each candidate packaging box is the second packaging box can be sorted, and the candidate packaging box corresponding to the maximum probability can be determined as the second packaging box. If multiple candidate packaging boxes have the same probability, the candidate packaging box with a larger contour overlap rate is preferentially selected as the second packaging box.

[0144] Through the above step S331, the optimal second packaging box is selected by using probability sorting and secondary conditions, avoiding layout conflicts and improving layout efficiency.

[0145] In a possible implementation, please refer to Figure 5 applied to a packaging box layout device, the packaging box layout device is in communication connection with a die-cutting device, and the method further comprises:

[0146] S500, after layout, for each packaging box in the packaging box set, using a space index to quickly query adjacent packaging boxes in a preset material area to obtain a shortest marking path and a shortest cutting path.

[0147] Exemplarily, the preset material area can be meshed, and for the coordinate information of each packaging box in the packaging box set in the preset material area, adjacent grids are recursively combined to form a spatial index (such as an R-tree or a quadtree structure), and the spatial index is used to quickly query the adjacent packaging box and the marked path thereof in the preset material area, and Dijkstra algorithm or the like is used to obtain the shortest marked path and the shortest cutting path.

[0148] S600, the shortest marked path and the shortest cutting path are sent to the die-cutting device.

[0149] Exemplarily, the coordinate point sequence of the shortest marked path and the shortest cutting path can be sent to the die-cuting device.

[0150] The prior art usually directly transmits original coordinate data, which occupies bandwidth and easily causes the die-cutting device to wait for data timeout, thereby reducing the production cycle. Through the above steps S500 to S600, the adjacent path is quickly queried by using the spatial index, large-scale irregular box processing is supported, and the packaging box production efficiency is improved.

[0151] It should be understood that the size of the serial number of each step in the above embodiment does not mean the order of execution, and the execution order of each process should be determined according to its function and internal logic, and should not constitute any limitation on the implementation process of the embodiments of the present application.

[0152] Corresponding to the packaging box layout method described in the above embodiments, the embodiments of the present application also provide a packaging box layout device, and each module of the device can realize each step of the packaging box layout method. Figure 6 A structural block diagram of the packaging box layout device provided by the embodiments of the present application is shown, and only parts related to the embodiments of the present application are shown for ease of illustration.

[0153] Referring to Figure 6 The device comprises:

[0154] An acquisition module is configured to acquire the planar feature of each packaging box in a packaging box set to be laid out; wherein the packaging box set comprises a first packaging box and other packaging boxes, the first packaging box comprises a packaging box that has been laid out, and the planar feature comprises the size of an unfolded figure;

[0155] A first layout module is configured to, in a case where each packaging box in the packaging box set has not been laid out, lay out a packaging box with the largest area in the packaging box set and determine it as the first packaging box;

[0156] An other layout module is configured to lay out one of the other packaging boxes:

[0157] a candidate package module configured to determine a set of candidate packages from the set of packages, wherein, in a case that the other packages include a plurality of packages, the candidate package is one of the other packages having a similarity greater than a similarity threshold to the unfolded graphical profile of the first package, and in a case that the other packages include one package, the candidate package is the one of the other packages;

[0158] a probability module configured to, for each of the candidate packages, obtain a probability that the candidate package is a second package according to the planar features of the first package and the planar features of the candidate package, wherein the second package is a current layout target;

[0159] a second package module configured to determine the second package according to the probability that each of the candidate packages is the second package;

[0160] a second layout module configured to layout the second package;

[0161] a repeating module configured to repeat the step of laying out the one of the other packages until all the packages in the set of packages are laid out.

[0162] It should be noted that the information interaction between the above modules, the execution process and the like, since based on the same concept as the method embodiments of the present application, the specific functions and the technical effects brought by them can be referred to the method embodiments part, and will not be repeated here.

[0163] Those skilled in the art can clearly understand that, for the convenience and brevity of description, only the above-mentioned division of each functional unit and module is exemplified, and in actual application, the above-mentioned functions can be completed by different functional units and modules according to needs, that is, the internal structure of the device is divided into different functional units or modules to complete all or part of the functions described above. Each functional unit and module in the embodiment can be integrated in one processing unit, or each unit can exist physically, or two or more units can be integrated in one unit. The above integrated unit can be realized in the form of hardware or software. In addition, the specific names of each functional unit and module are only for easy distinction, and do not limit the protection scope of the present application. The specific working process of the units and modules in the device can refer to the corresponding process in the foregoing method embodiments, and will not be repeated here.

[0164] The present application also provides a package layout device, Figure 7 The structure diagram of the package layout device provided by an embodiment of the present application is shown in FIG. 1. As shown in FIG. 1, Figure 7As shown, the packaging box layout device 7 of the embodiment includes at least one processor 70 (only one is shown in the figure), Figure 7 at least one memory 71 (only one is shown in the figure), Figure 7 and a computer program 72 stored in the at least one memory 71 and executable on the at least one processor 70, wherein the processor 70 executes the computer program 72 to enable the packaging box layout device 7 to implement the steps in any of the packaging box layout method embodiments described above, or to enable the packaging box layout device 7 to implement the functions of the modules / units in the device embodiments described above.

[0165] For example, the computer program 72 can be divided into one or more modules / units stored in the memory 71 and executed by the processor 70 to complete the present application. The one or more modules / units can be a series of computer program instruction segments capable of completing a specific function, which are used to describe the execution process of the computer program 72 in the packaging box layout device 7.

[0166] The packaging box layout device 7 can be a desktop computer, a notebook, a palm computer, a cloud server, and other computing devices. The packaging box layout device can include, but is not limited to, the processor 70, the memory 71. Those skilled in the art can understand that Figure 7 The packaging box layout device 7 is only an example and does not constitute a limitation on the packaging box layout device 7, and can include more or fewer components than those shown, or combine certain components, or different components, for example, can also include input / output devices, network access devices, buses, etc.

[0167] The processor 70 can be a central processing unit (CPU), and the processor 70 can also be other general-purpose processors, digital signal processors (DSP), application specific integrated circuits (ASIC), field-programmable gate arrays (FPGA) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. The general-purpose processor can be a microprocessor or the processor can also be any conventional processor.

[0168] The memory 71 can be an internal storage unit of the carton layout device 7 in some embodiments, for example, a hard disk or a memory of the carton layout device 7. The memory 71 can also be an external storage device of the carton layout device 7 in other embodiments, for example, a plug-in hard disk, a smart media card (SMC), a secure digital (SD) card, a flash card, etc. equipped on the carton layout device 7. Further, the memory 71 can include both the internal storage unit and the external storage device of the carton layout device 7. The memory 71 is used to store an operating system, an application program, a boot loader, data, and other programs, etc., for example, program codes of the computer program, etc. The memory 71 can also be used to temporarily store data that has been output or is to be output.

[0169] The embodiments of the present application also provide a computer readable storage medium, which stores a computer program. The computer program is executed by a processor to implement the steps in any of the above method embodiments.

[0170] The embodiments of the present application provide a computer program product. When the computer program product is run on a carton layout device, the carton layout device implements the steps in any of the above method embodiments.

[0171] The integrated unit, if realized in the form of a software function unit and sold or used as an independent product, can be stored in a computer readable storage medium. Based on such understanding, the present application can implement all or part of the processes in the above embodiments by a computer program to instruct related hardware to complete, and the computer program can be stored in a computer readable storage medium. The computer program is executed by a processor to implement the steps in each of the above method embodiments. The computer program includes computer program codes, which can be in the form of source codes, object codes, executable files or some intermediate forms. The computer readable medium at least includes any entity or device capable of carrying the computer program codes to the carton layout device, a recording medium, a computer memory, a read-only memory (ROM), a random access memory (RAM), an electrical carrier signal, a telecommunication signal and a software distribution medium. For example, a U disk, a mobile hard disk, a magnetic disk or an optical disk, etc.

[0172] In the above embodiments, the description of each embodiment has its own focus, and the parts not described or recorded in detail in a certain embodiment can be referred to the relevant description of other embodiments.

[0173] Those skilled in the art can understand that the units and algorithm steps of each example described in combination with the embodiments disclosed herein can be realized by electronic hardware or a combination of computer software and electronic hardware. Whether the functions are realized in hardware or software depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods to realize the described functions for each specific application, but such implementation should not be considered beyond the scope of the present application.

[0174] In the embodiments provided in the present application, it should be understood that the disclosed packaging box layout device and method can be implemented in other ways. For example, the packaging box layout device embodiments described above are merely illustrative. For example, the division of the modules or units is only a logical function division, and there can be another division manner in actual implementation. For example, a plurality of units or components can be combined or integrated into another system, or some features can be ignored or not executed. In addition, the coupling or direct coupling or communication connection between the units shown or discussed can be indirect coupling or communication connection through some interfaces, devices or units, and can be electrical, mechanical or other forms.

[0175] The units described as separate components can or can not be physically separate, and the components shown as units can or can not be physical units, i.e. can be located in one place or distributed on a plurality of network units. Part or all of the units can be selected according to actual needs to achieve the purpose of the embodiments.

[0176] The above-described embodiments are only used to illustrate the technical solutions of the present application, but not to limit them; although the present application has been described in detail with reference to the foregoing embodiments, those skilled in the art should understand that the technical solutions recorded in the foregoing embodiments can be modified, or some technical features can be replaced by equivalent ones; and these modifications or replacements do not make the corresponding technical solutions deviate from the spirit and scope of the technical solutions of the embodiments of the present application, and should be included in the protection scope of the present application.

Claims

1. A method for arranging packaging boxes, characterized in that, include: Obtain the planar features of each packaging box in the set of packaging boxes to be arranged; wherein, the set of packaging boxes includes a first packaging box and other packaging boxes, the first packaging box includes the arranged packaging boxes, and the planar features include the dimensions of the unfolded graphic; If none of the boxes in the set of boxes are arranged, the box with the largest area in the set of boxes is arranged and determined as the first box. Arrange one of the other packaging boxes in a layout: A set of candidate packaging boxes is determined from the set of packaging boxes; wherein, when the other packaging boxes include multiple packaging boxes, the candidate packaging box is one of the other packaging boxes whose similarity to the unfolded graphic outline of the first packaging box is greater than a similarity threshold, and when the other packaging boxes include one packaging box, the candidate packaging box is one of the other packaging boxes; For each candidate packaging box, the probability that the candidate packaging box is the second packaging box is obtained based on the planar features of the first packaging box and the planar features of the candidate packaging box; wherein, the second packaging box is the current sorting target; The second packaging box is determined based on the probability that each of the candidate packaging boxes is the second packaging box; Arrange the second packaging box in a layout; Repeat the step of arranging one of the other packaging boxes until all packaging boxes in the packaging box set have been arranged, including: adding the latest arranged packaging box to the first packaging box, and searching for the second packaging box in the packaging box set to be arranged according to the planar features of the first packaging box, until all packaging boxes have been arranged. Wherein, for each candidate packaging box, obtaining the probability that the candidate packaging box is the second packaging box based on the planar features of the first packaging box and the planar features of the candidate packaging box includes: For each candidate packaging box, a pair of complementary features is obtained based on the planar features of the first packaging box and the planar features of the candidate packaging box; wherein, the pair of complementary features is used to reflect the degree of fit between the candidate packaging box and the first packaging box; The probability that the candidate packaging box is the second packaging box is obtained based on the collaborative features; The collaborative feature pair includes the rotation angle of the candidate packaging box and the overlap contour length of the first packaging box and the candidate packaging box; obtaining the collaborative feature pair based on the planar features of the first packaging box and the planar features of the candidate packaging box includes: The corresponding circumscribed polygon is obtained based on the planar features of the first packaging box and the planar features of the candidate packaging box; wherein, the circumscribed polygon refers to the smallest polygon that contains the unfolded shape of the packaging box. Rotate the outer polygon of the candidate packaging box around the outer polygon of the first packaging box; If, during rotation, the distance between any pair of sides of the circumscribed polygon of the candidate packaging box and the circumscribed polygon of the first packaging box is less than a distance threshold, the rotation angle and the corresponding overlapping contour length are determined; wherein, the rotation angle includes the rotation angle of the candidate packaging box and the revolution angle around the first packaging box; The planar features further include marking paths, which include indentation paths and / or perforation paths; the step of obtaining the probability that the candidate packaging box is the second packaging box based on the collaborative features includes: If the marking paths of the candidate packaging box and the first packaging box are determined to be continuous based on the rotation angle, the lengths of the marking paths of the candidate packaging box and the first packaging box are summed to obtain the marking path length. The probability that the candidate packaging box is the second packaging box is obtained based on the overlapping contour length and the corresponding mark path length.

2. The packaging box layout method as described in claim 1, characterized in that, The step of determining a set of candidate packaging boxes from the set of packaging boxes includes: Multiple key points of each package in the package set are obtained by uniformly sampling the unfolded graphic outline of each package in the package set; For each key point in the set of packaging boxes, calculate the polar coordinate histogram of each key point to other key points to obtain the shape context vector; The minimum matching cost for each of the other boxes is obtained based on the shape context vector of the first box and the shape context vectors of the other boxes. The corresponding similarity is obtained based on the minimum matching cost for each of the above. A set of candidate packaging boxes is determined from the set of packaging boxes based on the aforementioned similarity.

3. The packaging box layout method as described in claim 2, characterized in that, The step of determining a set of candidate packaging boxes from the set of packaging boxes based on the aforementioned similarities includes: Based on the aforementioned similarity scores, a third set of packaging boxes with similarity scores greater than the aforementioned similarity threshold is determined from the set of packaging boxes; Arrange the samples within the preset material area, and determine a set of candidate packaging boxes from the third packaging box based on the remaining area of ​​the preset material area.

4. The packaging box layout method as described in claim 1, characterized in that, The step of obtaining the probability that the candidate packaging box is the second packaging box based on the overlapping contour length and the corresponding marker path length includes: The overlap rate is obtained by normalizing the overlapping contour length based on the perimeter of the candidate packaging box. The marking path efficiency is obtained by normalizing the marking path length based on the total marking path length of each packaging box in the packaging box set. The probability that the candidate packaging box is the second packaging box is obtained based on the contour overlap rate and the marking path efficiency.

5. The packaging box layout method as described in claim 1, characterized in that, The step of determining the second packaging box based on the probability that each of the candidate packaging boxes is the second packaging box includes: The probability of each candidate packaging box being the second packaging box is ranked, and the candidate packaging box with the highest probability is determined as the second packaging box.

6. The packaging box arrangement method as described in claim 3, characterized in that, The method, applied to a packaging box layout device, wherein the packaging box layout device is communicatively connected to a die-cutting device, further includes: After the layout is completed, for each box in the set of boxes, the spatial index is used within the preset material area to quickly query the neighboring boxes and obtain the shortest marking path and the shortest cutting path. The shortest marking path and the shortest cutting path are sent to the die-cutting device.

7. A packaging box layout device, comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, characterized in that, When the processor executes the computer program, it implements the method as described in any one of claims 1 to 6.

Images