The problem of optimal cutting of honeycomb blocks is considered in the article. The urgency of using irregular shapes application cutting from honeycomb blocks made of modern composite materials is substantiated. The problem is to obtain a cut of a given shape from honeycomb blocks. The optimal cutting plane of the single cell face of a honeycomb block is found on the basis of calculations for the stability and stretching force in adjacent faces applying a finite element method. The problem of obtaining faces and nodal points of a honeycomb block when calculating the coordinates of the optimal cut points of a real honeycomb block using machine vision methods. The most suitable algorithms, a part of the OpenCV library, are considered. The authors decided to develop their own algorithm for recognizing an irregular cellular structure since the existed algorithms did not solve the stated problem. As opposed to existing algorithms, the proposed one finds all the nodal points and faces even on the deformed sections of the honeycomb block avoiding false faces. The method helps to find coordinates of all nodal points and determine the connection of adjacent points with a face. As a result, real faces, not perfect geometrically, are replaced by line segments. The test result proves its correctness and practical applicability. The proposed method solves an optimal cutting problem of aluminum honeycomb block. It should be noted that the proposed method is customizable and can be applied to any honeycomb or cellular panels.INDEX TERMS Image recognition, composite materials, cutting tools, machine vision.

No abstract

The article considers solving the problem of precision cutting of honeycomb blocks. The urgency of using arbitrary shapes application cutting from honeycomb blocks made of modern composite materials is substantiated. The problem is to obtain a cut of the given shape from honeycomb blocks. The complexity of this problem is in the irregular pattern of honeycomb blocks and the presence of double edges, which forces an operator to scan each block before cutting. It is necessary to take into account such restrictions as the place and angle of the cut and size of the knife, its angle when cutting and the geometry of cells. For this problem solving, a robotic complex has been developed. It includes a device for scanning the geometry of a honeycomb block, software for cutting automation and a cutting device itself. The software takes into account all restrictions on the choice of the location and angle of the operating mechanism. It helps to obtain the highest quality cut and a cut shape with the best strength characteristics. An actuating device has been developed and implemented for both scanning and cutting of honeycomb blocks directly. The necessary tests were carried out on real aluminum honeycomb blocks. Some technical solutions are used in the cutting device to improve the quality of cutting honeycomb blocks. The tests have shown the effectiveness of the proposed complex. Robotic planar cutting made it possible to obtain precise cutting with a high degree of repeatability.

The article describes the application of the Hough transform to a honeycomb block image. The problem of cutting a mold from a honeycomb block is described. A number of image transformations are considered to increase the efficiency of the Hough algorithm. A method for obtaining a binary image using a simple threshold, a method for obtaining a binary image using Otsu binarization, and the Canny Edge Detection algorithm are considered. The method of binary skeleton (skeletonization) is considered, in which the skeleton is obtained using 2 main morphological operations: Dilation and Erosion. As a result of a number of experiments, the optimal sequence of processing the original image was revealed, which allows obtaining the coordinates of the maximum number of faces. This result allows one to choose the optimal places for cutting a honeycomb block, which will improve the quality of the resulting shapes.

No abstract