Knowledge-driven automatic arrangement method for two-dimensional polygonal cloth pieces

Abstract

The invention discloses a knowledge-driven automatic arrangement method for two-dimensional polygonal cloth pieces. The method comprises the following steps: calculating and obtaining external critical polygons between every two polygons; arranging the multiple polygons in a descending order, for the polygons to be arranged, calculating the inscribed critical polygons of the polygons to be arranged for the fabric and the circumscribed critical polygons of the polygons to be arranged for the arranged polygons, calculating the optimal placement position through a local fitness model, and obtaining the initial arrangement result of the polygons; performing optimizing by utilizing the local fitness model and the knowledge-driven model to obtain optimized material arrangement results of a plurality of polygons, and continuously performing optimizing to obtain an optimal material arrangement result within a preset time. The method is suitable for adopting a more concise and efficient method on an optimization model, the algorithm iteration efficiency is high, the consumed time is shorter, the utilization rate is obviously improved, the method is more efficient in facing a large sample data set, a more satisfactory result can be obtained in a short time, and the method is more suitable for an actual production environment.

Description

technical field [0001] The invention belongs to a two-dimensional polygon layout method in the field of computer graphics, in particular to a knowledge-driven two-dimensional polygon automatic layout method. Background technique [0002] The emission problem of two-dimensional irregular polygons is a combinatorial optimization problem, which requires placing a given set of two-dimensional polygons in a rectangular container, where each polygon is not necessarily a convex polygon, and requires that all polygons do not overlap with other polygons or exceed the rectangle Containers, such a layout is feasible. A rectangular container has a fixed width, while its length can be changed to fit all polygons within it. The goal is to find a feasible layout that minimizes the length of the container. The emission problem of 2D irregular polygons has some variation with the rotation of the polygon: (1) any angle of rotation is allowed, (2) a limited number of angles are allowed, and ...

AI Technical Summary

Problems solved by technology

This type of intelligent optimization algorithm does have a good effect on the polygon emission optimization problem, but the characteristic of the intelligent optimization algorithm is that it takes too long and the randomness of the early optimization results is relatively large, so the samples used in the research of most scholars are based on Small sample model, but not suitable for actual production environment

For example, in the textile fields such as sofas and clothes, there are often hundreds of pieces of fabrics that need to be laid out. At this time, using intelligent optimization algorithms, the required time for laying out will be difficult to estimate, which will cause the actual production to stagnate.

Images