Machining time estimation device, control device and program

Abstract

Provided are a formation time estimation device, a control device, and a program by which it is possible to calculate an estimated time for forming a two-dimensional code. A formation time estimation device, according to an embodiment, comprises a calculation unit that calculates the estimated time for forming a two-dimensional code on an object, using at least one of: the number of cells on which to form the two-dimensional code; the area of the cell on which to form the two-dimensional code; and the formation path for forming the two-dimensional code onto the object.

Description

[Technical Field]

[0001] The present invention relates to a machining time estimation device, a control device, and a program. [Background technology]

[0002] 2. Description of the Related Art There is known an apparatus for processing a two-dimensional code onto a workpiece. Furthermore, even if the same data is recorded, two-dimensional codes will look different if the parameters are different. [Prior art documents] [Patent documents]

[0003] [Patent Document 1] Patent No. 6752398 Summary of the Invention [Problem to be solved by the invention]

[0004] However, there is no known method for determining which two-dimensional code among two-dimensional codes with different parameters is suitable for processing. Furthermore, even for the same two-dimensional code, the ease of processing may differ depending on the processing route. In order to determine which two-dimensional code to use and which processing route to use, it is useful to estimate the time required to process the two-dimensional code.

[0005] The problem to be solved by the embodiments of the present invention is to provide a processing time estimation device, a control device, and a program that are capable of calculating an estimated time required to process a two-dimensional code. [Means for solving the problem]

[0006] The processing time estimation device of the embodiment includes a calculation unit that calculates an estimated time required to process a two-dimensional code into a processing object using at least one of the number of cells to be processed, the area of ​​the cells to be processed, and the processing path for processing the two-dimensional code into the processing object. [Effects of the Invention]

[0007] The present invention can calculate an estimated time required to process a two-dimensional code. [Brief explanation of the drawings]

[0008] [Figure 1] 1 is a block diagram showing an example of a control system according to an embodiment and a main configuration of components included in the control system; [Figure 2] 2 is a flowchart showing an example of processing by a processor in FIG. 1; [Figure 3] 2 is a flowchart showing an example of processing by a processor in FIG. 1; [Figure 4] FIG. 10 is a plan view showing an example of an object on which a two-dimensional code has been cut. [Figure 5] 3A-A line cross-sectional view of the object to be processed shown in FIG. 4. [Figure 6] 10A to 10C are diagrams showing examples of two-dimensional codes generated using different mask patterns. [Figure 7] 10A to 10C are diagrams showing examples of two-dimensional codes generated using different mask patterns. [Figure 8] 10A to 10C are diagrams showing examples of two-dimensional codes generated using different mask patterns. [Figure 9] 10A to 10C are diagrams showing examples of two-dimensional codes generated using different mask patterns. [Figure 10] 10A to 10C are diagrams showing examples of two-dimensional codes generated using different mask patterns. [Figure 11] 10A to 10C are diagrams showing examples of two-dimensional codes generated using different mask patterns. [Figure 12] 10A to 10C are diagrams showing examples of two-dimensional codes generated using different mask patterns. [Figure 13] FIG. [Figure 14] FIG. [Figure 15] FIG. [Figure 16] FIG. [Figure 17] FIG. 2 is a diagram showing an example of a list screen displayed on the display device in FIG. 1. DETAILED DESCRIPTION OF THE INVENTION

[0009] Hereinafter, a numerical control system according to an embodiment will be described with reference to the drawings. Note that the scale of each part in each drawing used in the following description of the embodiment may be changed as appropriate. Also, for the sake of explanation, each drawing used in the following description of the embodiment may omit configurations. Also, in each drawing and in this specification, the same reference numerals indicate similar elements. 1 is a block diagram showing an example of a control system 1 according to an embodiment and a main configuration of components included in the control system 1. The control system 1 is a system that controls an industrial machine 200. The control system 1 includes, as an example, a control device 100 and the industrial machine 200.

[0010] The control device 100 controls the industrial machinery 200 and other components. The control device 100 controls the industrial machinery 200 using, for example, numerical control (NC), computerized numerical control (CNC), or programmable logic controller (PLC). The control device 100 controls the industrial machinery 200 and other components to process a two-dimensional code on the surface of a workpiece. The two-dimensional code may be, for example, a QR Code (registered trademark), Data Matrix, PDF417, or other two-dimensional code. The processing method may be cutting, grinding, electric discharge machining, engraving, or printing. The material of the workpiece is not limited. Examples of the workpiece include metal, resin, glass, wood, rubber, and paper. The control device 100 includes, for example, a processor 110, a read-only memory (ROM) 120, a random-access memory (RAM) 130, an auxiliary storage device 140, a control interface 150, an input device 160, and a display device 170. A bus 180 and other components connect these components. The control device 100 is an example of a machining time estimation device.

[0011] The processor 110 is the central part of a computer that performs various calculations and processes, such as calculations and controls, necessary for the operation of the control device 100. The processor 110 may be, for example, a central processing unit (CPU), a microprocessing unit (MPU), a system on a chip (SoC), a digital signal processor (DSP), a graphics processing unit (GPU), an application-specific integrated circuit (ASIC), a programmable logic device (PLD), or a field-programmable gate array (FPGA). Alternatively, the processor 110 may be a combination of these. The processor 110 may also be a combination of these with a hardware accelerator or the like. The processor 110 controls each component to realize various functions of the control device 100 based on programs such as firmware, system software, and application software stored in the ROM 120 or the auxiliary storage device 140. The processor 110 also executes the processes described below based on the programs. Note that some or all of the programs may be incorporated into the circuitry of the processor 110.

[0012] The ROM 120 and RAM 130 are the main memory devices of the computer with the processor 110 at its core. The ROM 120 is a non-volatile memory used exclusively for reading data. The ROM 120 stores, for example, firmware among the above programs. The ROM 120 also stores data used by the processor 110 when it performs various processes. The RAM 130 is a memory used for reading and writing data. The RAM 130 is used as a work area for storing data that is temporarily used when the processor 110 performs various processes. The RAM 130 is typically a volatile memory.

[0013] The auxiliary storage device 140 is an auxiliary storage device of a computer centered around the processor 110. The auxiliary storage device 140 is, for example, an EEPROM (electric erasable programmable read-only memory), an HDD (hard disk drive), or a flash memory. The auxiliary storage device 140 stores, for example, system software and application software among the above programs. The auxiliary storage device 140 also stores data used by the processor 110 when performing various processes, data generated by the processes in the processor 110, various setting values, and the like.

[0014] The control interface 150 is an interface through which the control device 100 communicates with the industrial machine 200 and the like. The control device 100 controls the industrial machine 200 and the like via the control interface 150.

[0015] The input device 160 accepts operations by an operator of the control device 100. The input device 160 is, for example, a keyboard, a keypad, a touchpad, a mouse, a controller, etc. The input device 160 may also be a device for voice input.

[0016] The display device 170 displays a screen for notifying the operator of the control device 100 of various pieces of information. The display device 170 is, for example, a display such as a liquid crystal display or an organic EL (electro-luminescence) display. A touch panel can also be used as the input device 160 and the display device 170. That is, a display panel provided in the touch panel can be used as the display device 170, and a pointing device provided in the touch panel that allows touch input can be used as the input device 160. The display device 170 is an example of a display unit.

[0017] The bus 180 includes a control bus, an address bus, a data bus, etc., and transmits signals exchanged among the various parts of the control device 100 .

[0018] The industrial machine 200 is, for example, a machine tool, a manipulator, a robot arm, a robot, or a printing device. The industrial machine 200, which is a machine tool, is, for example, a lathe, a milling machine, a laser processing machine, an electric discharge machine, a water jet processing machine, or other machine tools. The industrial machine 200, which is a machine tool, is, for example, an NC machine tool, a CNC machine tool, or other machine tools.

[0019] The operation of the control system 1 according to the embodiment will be described below with reference to Figures 2 and 3. Note that the content of the processing in the following description of the operation is an example, and various processing that can obtain similar results can be used as appropriate. Figures 2 and 3 are flowcharts showing an example of processing by the processor 110 of the control device 100. The processor 110 executes the processing of Figures 2 and 3 based on a program stored in, for example, the ROM 120 or the auxiliary storage device 140.

[0020] In step ST11 of FIG. 2, the processor 110 of the control device 100 acquires processing parameters. The processing parameters are parameters used to process a two-dimensional code on a processing object. The processor 110 acquires the processing parameters, for example, according to an operation input to the input device 160. The processor 110 acquires the processing parameters, for example, according to information input from another device. The processing parameters include, for example, the processing depth d, the processing speed F1, the fast-forward speed F0, and the cell spacing w. Note that the processing parameters may differ depending on the processing method.

[0021] Each processing parameter will be explained using FIG. 4 and FIG. FIG. 4 is a plan view showing an example of a workpiece 300 on which a two-dimensional code 400 (400-0) has been machined. Note that FIG. 4 omits a portion of the workpiece 300. The two-dimensional code 400 shown in FIG. 4 is a QR code. FIG. 4 also shows a portion of a path R (R1). The path R indicates the movement path of the machining tool relative to the workpiece 300. The industrial machine 200 machines the cells in order along the path R. Fig. 5 is a cross-sectional view of the object 300 taken along the line AA shown in Fig. 4. In Fig. 5, boundaries between cells are indicated by dotted lines to make the boundaries easier to understand.

[0022] The processing depth d is the depth to which the two-dimensional code 400 is processed into the workpiece 300. The unit of the processing depth d is millimeters (mm), for example. If the processing method is cutting, the processing depth is the depth to which the workpiece 300 is cut.

[0023] The rapid traverse speed F0 is, for example, the relative speed during which at least one of the machining tool and the workpiece 300 is moved to align the relative positions of the machining tool and the workpiece 300 with the next machining location. Note that while the relative speed is the rapid traverse speed F0, the machining tool is not performing machining. When the workpiece 300 is fixed, the rapid traverse speed F0 is the feed rate at which the machining tool moves. When the machining tool is fixed, the rapid traverse speed F0 is the moving speed of the workpiece 300. The unit of the rapid traverse speed F0 is, for example, millimeters per minute (mm / min). In FIG. 5, the path along which the machining tool moves at the rapid traverse speed F0 is shown by a dashed line as the rapid traverse path. This path is the moving path of the machining tool relative to the workpiece 300.

[0024] The fast-forward speed F0 may be different in the horizontal and depth directions. In this case, the fast-forward speed F0 in the horizontal direction is set to fast-forward speed F0H. The fast-forward speed F0 in the depth direction is set to fast-forward speed F0V.

[0025] The machining speed F1 is, for example, the relative speed between the machining tool and the workpiece 300 during machining. When the workpiece 300 is fixed, the machining speed F1 is the feed rate at which the machining tool moves. When the machining tool is fixed, the machining speed F1 is the moving speed of the workpiece 300. It can also be said to be the speed at which the two-dimensional code 400 is machined into the workpiece 300. When the machining method is cutting, the machining speed is the cutting speed. The unit of the machining speed F1 is, for example, millimeters per minute (mm / min). In Figure 5, the path along which the machining tool moves at the machining speed F1 is shown by a dashed line as the machining path. This path is the movement path of the machining tool relative to the workpiece 300.

[0026] The machining speed F1 may be different in the horizontal direction and the depth direction. In this case, the machining speed F1 in the horizontal direction is referred to as machining speed F1H. The machining speed F1 in the depth direction is referred to as machining speed F1V. The horizontal direction is the direction parallel to the machining surface. The depth direction is the direction perpendicular to the machining surface.

[0027] The cell spacing w is the distance between two adjacent cells (modules) in the two-dimensional code 400. If there is no gap between the two cells, the cell spacing w is equal to the length of one side of the cell. Note that the cell spacing w may differ between the left-right and up-down directions of the two-dimensional code 400, such as when the cell shape is rectangular rather than square. In this case, the cell spacing w in the left-right direction is referred to as the cell spacing wx. The cell spacing w in the up-down direction is referred to as the cell spacing wy. In the two-dimensional code 400 shown in FIG. 4, the cell spacing wx and the cell spacing wy are equal.

[0028] In step ST12, processor 110 acquires data to be converted into a two-dimensional code (hereinafter referred to as "original data"). Processor 110 acquires the original data, for example, in accordance with an operation input to input device 160. Processor 110 acquires the original data in accordance with information input from another device, for example.

[0029] The processor 110 then generates a two-dimensional code using the original data. The processor 110 generates multiple two-dimensional codes with the same original data but different appearances. Multiple two-dimensional codes with the same original data but different appearances are multiple two-dimensional codes that store the same data but have different appearances. The processor 110 generates multiple two-dimensional codes with the same original data but different appearances, for example, by varying at least one of the parameters and algorithms used to generate the two-dimensional code. Examples of such parameters include the mask pattern, error correction level, and mode. As examples, eight types of two-dimensional codes 400-0 to 400-7 generated using eight mask patterns, mask pattern 0 to mask pattern 7, are shown in FIGS. 4 and 6 to 12. Each of FIGS. 6 to 12 illustrates an example of a two-dimensional code 400 generated using a different mask pattern. Two-dimensional codes 400-0 to 400-7 shown in Figures 4 and 6 to 12 are all QR codes generated with an error correction level of L, version 3, and original data of "DEMOPART1-2022.03.28-12:00:00-MACHINE01-NUM00024." The version indicates the size (number of cells) of the QR code. A version 3 QR code is 29 cells high and 29 cells wide, for a total of 841 cells.

[0030] Two-dimensional code 400-0 is a two-dimensional code 400 generated using mask pattern 0. Two-dimensional code 400-1 is a two-dimensional code 400 generated using mask pattern 1. Two-dimensional code 400-2 is a two-dimensional code 400 generated using mask pattern 2. Two-dimensional code 400-3 is a two-dimensional code 400 generated using mask pattern 3. Two-dimensional code 400-4 is a two-dimensional code 400 generated using mask pattern 4. Two-dimensional code 400-5 is a two-dimensional code 400 generated using mask pattern 5. Two-dimensional code 400-6 is a two-dimensional code 400 generated using mask pattern 6. Two-dimensional code 400-7 is a two-dimensional code 400 generated using mask pattern 7.

[0031] In step ST13, processor 110 acquires one of the two-dimensional codes 400 generated in step ST12. Note that processor 110 does not acquire a two-dimensional code 400 that has already been acquired, but acquires one of the two-dimensional codes 400 that have not yet been acquired. The two-dimensional code 400 acquired last in the processing of step ST13 will hereinafter be referred to as the "acquired code."

[0032] In step ST14, processor 110 counts the number of processing cells of the acquired code. The number of processing cells is the number of processing cells. A processing cell is a cell where processing is performed. For example, if the processing method is cutting processing, a processing cell is a cell where cutting is performed. A non-processing cell is a cell where no processing is performed.

[0033] The number of processing cells for each of the two-dimensional codes 400 shown in FIGS. 4 and 6 to 12 is as follows: 2D code 400-0:426 cell 2D code 400-1:438 cell 2D code 400-2:425 cell 2D code 400-3:428 cell 2D code 400-4:441 cell 2D code 400-5:417 cell 2D code 400-6:456 cell 2D code 400-7:416 cell

[0034] In step ST15, processor 110 calculates a penalty score. The penalty score is calculated as a value indicating the readability of the acquired code. If the acquired code is a QR code, the penalty score can be calculated using a method such as that described in JIS X0510. This calculation method involves adding up the loss points calculated as follows. Therefore, in this case, the lower the penalty score, the easier it is to read. Note that dark cells = processed cells, and light cells = unprocessed cells. - Check for blocks with 5 or more consecutive cells of the same color both vertically and horizontally. If there are (5+K1) consecutive blocks, you will lose (3+K1) points (K1 is an integer greater than or equal to 0). - One point will be lost for each block with 2x2 cells of the same color. If a light pattern with a width of 4 or more is placed before or after a pattern with a ratio of 1:1:3:1:1 (dark:light:dark:light:dark), 40 points will be lost. - 10 points are lost for every 5% increase or decrease in the percentage of dark cells from 50%.

[0035] The penalty scores obtained by calculating the number of processing cells for each of the two-dimensional codes 400 shown in FIGS. 4 and 6 to 12 using the above method are as follows: 2D code 400-0:1245 2D code 400-1:1581 2D code 400-2:1463 2D code 400-3:1165 2D code 400-4:1318 2D code 400-5:1439 2D code 400-6:1497 2D code 400-7:1396

[0036] In step ST16, processor 110 acquires one route R from among a plurality of different routes R. Note that processor 110 does not acquire an already acquired route R, but acquires one from among unacquired routes R. The route R acquired last in the processing of step ST16 will hereinafter be referred to as the "acquired route."

[0037] 4 and 13 to 16 show routes R1 to R5 as examples of the route R. Each of Fig. 13 to Fig. 16 shows an example of the route R. Note that Fig. 13 to Fig. 16 show a part of the route R. The following describes routes R1 to R13, but routes R6 to R13 are not shown.

[0038] Let N be the number of cells horizontally and M be the number of cells vertically. Also, the i-th cell is denoted as cell (i). The i-th cell indicates the number of cells you pass through when traveling along route R. Also, the position of a cell is expressed as column x, row y, or (x, y). For example, the top left cell is the cell in column 1, row 1, and is (1, 1). The top right cell is the cell in column N, row 1, and is (N, 1). The bottom left cell is the cell in column 1, row M, and is (1, M). The bottom right cell is the cell in column N, row M, and is (N, M).

[0039] Routes R1 to R4 are winding routes. Route R1 is a route in which the cell (1,1) is the cell (1). For example, the following operations (11) to (14) are repeated until all cells are passed through, resulting in route R1. (11) Proceed in the direction of increasing column numbers until you reach the cell in the Nth column. (12) Go forward one line in the direction of increasing line number. (13) Proceed in the direction of decreasing column numbers until you reach the cell in the first column. (14) Go forward one line in the direction of increasing line number.

[0040] The position (x, y) of cell (i) on route R1 can be expressed by the following formula, for example. y=floor((i-1)÷N)+1 (1) x=((y-1) mod 2)×(N+1)+((-1)^((y-1) mod 2))×(((i-1) mod N)+1) (2) Note that floor() is the floor function, mod is the remainder operator, and ^ indicates the exponent.

[0041] Route R2 is a route that uses cell (N, 1) as cell (1). Route R2 is obtained by repeating the following operations (21) to (24) until all cells are passed through. (21) Proceed in the direction of decreasing column numbers until you reach the cell in the first column. (22) Go forward one line in the direction of increasing line number. (23) Proceed in the direction of increasing column numbers until you reach the cell in the Nth column. (24) Go forward one line in the direction of increasing line number.

[0042] Route R3 is a route that uses cell (1,M) as cell (1). For example, route R3 is obtained by repeating the following operations (31) to (34) until all cells are passed through. (31) Proceed in the direction of decreasing row numbers until you reach the cell on the first row. (32) Move forward one column in the direction of increasing column number. (33) Proceed in the direction of increasing row numbers up to the cell on the Mth row. (34) Move forward one column in the direction of increasing column number.

[0043] Route R4 is a route in which the cell (1,1) is set to cell (1). For example, route R4 is obtained by repeating the following operations (41) to (44) until all cells are passed through. (41) Proceed in the direction of increasing row numbers up to the cell on the Mth row. (42) Move forward one column in the direction of increasing column number. (43) Proceed in the direction of decreasing row numbers until you reach the cell on the first row. (44) Move forward one column in the direction of increasing column number.

[0044] Routes R5 to R12 will be described below. Routes R5 to R12 are spiral routes that proceed from the inside to the outside. Route R5 is a route with cell (X1, Y1) as cell (1). X1 = (1 + N) ÷ 2, Y1 = (1 + M) ÷ 2. However, if (1 + N) ÷ 2 is not an integer, it is rounded down to make it an integer. Also, if (1 + M) ÷ 2 is not an integer, it is rounded up to make it an integer. For example, route R5 is obtained by repeating the following operations (51) to (54) until all cells are passed through. Note that the initial value of p is 1. (51) Proceed p columns in the direction of increasing column number. (52) Go p rows in the direction of decreasing row number, and increase the value of p by 1. (53) Proceed p columns in the direction of decreasing column number. (54) Proceed to the next p columns in the direction of increasing row number. Then, increase the value of p by 1.

[0045] Route R6 is a route with cell (X1, Y1) as cell (1). X1 = (1 + N) ÷ 2, Y1 = (1 + M) ÷ 2. However, if (1 + N) ÷ 2 is not an integer, it is rounded down to make it an integer. Also, if (1 + M) ÷ 2 is not an integer, it is rounded up to make it an integer. For example, route R6 is obtained by repeating the following operations (61) to (64) until all cells are passed through. Note that the initial value of p is 1. (61) Go forward p lines in the direction of decreasing line numbers. (62) Proceed p columns in the direction of increasing column number. Then, increase the value of p by 1. (63) Proceed p lines in the direction of increasing line numbers. (64) Proceed p columns in the direction of decreasing column number. Then, increase the value of p by 1.

[0046] Route R7 is a route with cell (X1, Y1) as cell (1). X1 = (1 + N) ÷ 2, Y1 = (1 + M) ÷ 2. However, if (1 + N) ÷ 2 is not an integer, it is rounded up to an integer. Also, if (1 + M) ÷ 2 is not an integer, it is rounded up to an integer. For example, route R7 is obtained by repeating the following operations (71) to (74) until all cells are passed through. Note that the initial value of p is 1. (71) Go forward p lines in the direction of decreasing line numbers. (72) Proceed p columns in the direction of decreasing column number, and increase the value of p by 1. (73) Go forward p lines in the direction of increasing line numbers. (74) Proceed p columns in the direction of increasing column number. Then, increase the value of p by 1.

[0047] Route R8 is a route with cell (X1, Y1) as cell (1). X1 = (1 + N) ÷ 2, Y1 = (1 + M) ÷ 2. However, if (1 + N) ÷ 2 is not an integer, it is rounded up to an integer. Also, if (1 + M) ÷ 2 is not an integer, it is rounded up to an integer. For example, route R7 is obtained by repeating the following operations (81) to (84) until all cells are passed through. Note that the initial value of p is 1. (81) Proceed p columns in the direction of decreasing column number. (82) Go p rows in the direction of decreasing row number, and increase the value of p by 1. (83) Proceed p columns in the direction of increasing column number. (84) Go to the pth column in the direction of increasing row number, and increase the value of p by 1.

[0048] Route R9 is a route with cell (X1, Y1) as cell (1). X1 = (1 + N) ÷ 2, Y1 = (1 + M) ÷ 2. However, if (1 + N) ÷ 2 is not an integer, it is rounded up to an integer. Also, if (1 + M) ÷ 2 is not an integer, it is rounded down to an integer. For example, route R9 is obtained by repeating the following operations (91) to (94) until all cells are passed through. Note that the initial value of p is 1. (91) Proceed p columns in the direction of decreasing column number. (92) Go p rows in the direction of increasing row number, and increase the value of p by 1. (93) Proceed p columns in the direction of increasing column number. (94) Go to p columns in the direction of decreasing row number, and increase the value of p by 1.

[0049] Route R10 is a route with cell (X1, Y1) as cell (1). X1 = (1 + N) ÷ 2, Y1 = (1 + M) ÷ 2. However, if (1 + N) ÷ 2 is not an integer, it is rounded up to an integer. Also, if (1 + M) ÷ 2 is not an integer, it is rounded down to an integer. For example, route R10 is obtained by repeating the following operations (101) to (104) until all cells have been passed through. Note that the initial value of p is 1. (101) Proceed p lines in the direction of increasing line numbers. (102) Proceed to p columns in the direction of decreasing column number. Then, increase the value of p by 1. (103) Proceed p lines in the direction of decreasing line number. (104) Proceed to the next p columns in the direction of increasing column number. Then, increase the value of p by 1.

[0050] Route R11 is a route with cell (X1, Y1) as cell (1). X1 = (1 + N) ÷ 2, Y1 = (1 + M) ÷ 2. However, if (1 + N) ÷ 2 is not an integer, it is rounded down to make it an integer. Also, if (1 + M) ÷ 2 is not an integer, it is rounded down to make it an integer. For example, route R11 is obtained by repeating the following operations (111) to (114) until all cells are passed through. Note that the initial value of p is 1. (111) Proceed p lines in the direction of increasing line numbers. (112) Proceed to the next p columns in the direction of increasing column number. Then, increase the value of p by 1. (113) Go forward p lines in the direction of decreasing line numbers. (114) Proceed to p columns in the direction of decreasing column number. Then, increase the value of p by 1.

[0051] Route R12 is a route with cell (X1, Y1) as cell (1). X1 = (1 + N) ÷ 2, Y1 = (1 + M) ÷ 2. However, if (1 + N) ÷ 2 is not an integer, it is rounded down to make it an integer. Also, if (1 + M) ÷ 2 is not an integer, it is rounded down to make it an integer. For example, route R11 is obtained by repeating the following operations (121) to (124) until all cells are passed through. Note that the initial value of p is 1. (121) Proceed p columns in the direction of increasing column number. (122) Go forward p lines in the direction of increasing line numbers, and increase the value of p by 1. (123) Advance p columns in the direction of decreasing column number. (124) Go to p columns in the direction of decreasing row number, and increase the value of p by 1.

[0052] Furthermore, route R may be a route obtained by following any of routes R5 to R12 in reverse order. Route R13 will be described as an example of such a route R. Route R13 is a spiral route that proceeds from the outside to the inside. Route R13 is a route with cell (1,1) as cell (1). For example, after performing the following operation (130), route R13 is obtained by repeating operations (131) to (134) until all cells are passed through. The initial value of q is 1. (130) Proceed in the direction of increasing column numbers until you reach the cell in the Nth column. (131) Go forward (Mq) lines in the direction of increasing line numbers. (132) Proceed through (Nq) columns in the direction of decreasing column number, and increase the value of q by 1. (133) Go forward (Mq) lines in the direction of decreasing line number. (134) Proceed through (Nq) columns in the direction of increasing column number, and increase the value of q by 1.

[0053] For example, there are four types of spiral routes R going from the outside to the inside, with four starting positions (1,1), (N,1), (1,M), and (N,M), and two rotation directions (clockwise and counterclockwise). Therefore, there are eight types of spiral routes R going from the outside to the inside.

[0054] Furthermore, the route R is not limited to the route R shown above, and may be any route. All of the routes R shown above pass through all cells without overlapping. However, route R may be a route that passes through the same cell multiple times. Furthermore, none of the routes R shown above proceed diagonally. However, route R may be a route that includes a diagonal portion.

[0055] In step ST17, processor 110 executes the processing time calculation process shown in FIG. 3. The processing time calculation process is a process for calculating the processing time. The processing time is an estimated value of the time required to process the acquired code along the acquisition path. The acquired code and the acquisition path are collectively referred to as the "acquisition combination." The processing time is also an example of an estimated time required to process the two-dimensional code into the processing object.

[0056] In step ST31 of Fig. 3, the processor 110 of the control device 100 allocates variables i and T to the RAM 130 or the like. Then, the processor 110 sets the value of the variable i to 1. Also, the processor 110 sets the value of the variable T to 0. The variable T is a variable used to accumulate the machining time for each cell by repeating steps ST32 to ST39. Also, at the time of ending the processing shown in Fig. 3, the variable T indicates the machining time for the acquired code.

[0057] In step ST32, the processor 110 acquires information about the cell (i) and the cell (i+1) from the acquisition code.

[0058] In step ST33, processor 110 determines whether cell (i) and cell (i+1) are processing cells or non-processing cells. In the two-dimensional code 400 shown in FIG. 4, etc., the black-filled cells are processing cells, and the white cells are non-processing cells.

[0059] If both cell (i) and cell (i+1) are processing cells, processor 110 proceeds to step ST34 in step ST33. In step ST34, the processor 110 adds time T1 to the variable T. Time T1 is the time required to proceed with machining from cell (i) to cell (i+1) when both cell (i) and cell (i+1) are machining cells. In this case, the industrial machine 200 performs machining in the horizontal direction by a cell interval w. Therefore, time T1 can be expressed by the following equation. T1=w / F1H (3)

[0060] If cell (i) is a processed cell and cell (i+1) is a non-processed cell in step ST33, processor 110 proceeds to step ST35. In step ST35, the processor 110 adds time T2 to the variable T. Time T2 is the time required to proceed with machining from cell (i) to cell (i+1) when cell (i) is a machining cell and cell (i+1) is a non-machining cell. In this case, the industrial machine 200 moves the machining tool in the depth direction by a depth d at a rapid traverse rate FOV so as to move away from the workpiece 300. Thereafter, the industrial machine 200 moves the machining tool in the horizontal direction by a cell interval w at a rapid traverse rate FOH. Therefore, time T2 can be expressed by the following equation. T2=d÷F0V+w÷F0H (4)

[0061] In laser processing and the like, it is not necessary to move the processing tool away from the workpiece 300. In this case, therefore, the time T2 may be expressed by the following formula. T2=w÷F0H (5)

[0062] If cell (i+1) is a non-processing cell and cell (i) is a processing cell, processor 110 proceeds to step ST36 in step ST33. In step ST36, processor 110 adds time T3 to variable T. Time T3 is the time required to proceed with machining from cell (i) to cell (i+1) when cell (i+1) is a non-machining cell and cell (i) is a machining cell. In this case, industrial machine 200 moves the machining tool horizontally by a cell interval w at a rapid traverse rate F0H. Thereafter, industrial machine 200 performs machining in the depth direction by a depth d. Therefore, time T3 can be expressed by the following equation. T3=w÷F0H+d÷F1V (6)

[0063] If both cell (i) and cell (i+1) are unprocessed cells in step ST33, processor 110 proceeds to step ST37. In step ST37, processor 110 adds time T4 to variable T. Time T4 is the time required to proceed with machining from cell (i) to cell (i+1) when both cell (i) and cell (i+1) are non-machined cells. In this case, industrial machine 200 moves horizontally by cell interval w at a fast-forward speed F0H. Therefore, time T4 can be expressed by the following equation. T4=w / F0H (7)

[0064] Note that times T1 to T4 are calculated under the assumption that the cell width and the processing width are equal. The processing width is, for example, the width of the tip of the processing tool. However, the cell width and the processing width do not necessarily have to be equal at the actual processing stage.

[0065] After processing any one of steps ST34 to ST37, processor 110 proceeds to step ST38. In step ST38, processor 110 determines whether cell (i+1) is the last cell. For example, if i+1=N×M, cell (i+1) is the last cell. If cell (i+1) is not the last cell, processor 110 determines No in step ST38 and proceeds to step ST39.

[0066] In step ST39, processor 110 increments the value of variable i by 1. After processing step ST39, processor 110 returns to step ST32. Processor 110 accumulates the processing time for each cell in variable T by repeating steps ST32 to ST39 in this manner.

[0067] If cell (i+1) is the last cell, processor 110 determines Yes in step ST38 and ends the processing time calculation process shown in FIG. The processor 110 stores the value of the variable T at the end of the processing time calculation process in the RAM 130 or the auxiliary storage device 140 so that it can be known that this is the processing time of the acquired combination.

[0068] As described above, by processing step ST17, processor 110 functions as an example of a calculation unit that calculates the estimated time required to process the two-dimensional code into the workpiece using the processing path for processing the two-dimensional code into the workpiece.

[0069] For example, for each combination of two-dimensional codes 400-0 to 400-7 and route R1 shown in Figures 4 and 6 to 12, the number of times steps ST34 to ST37 in Figure 3 are executed and the processing time are as follows: Note that each processing parameter is set as follows: Depth d = 1.0 mm Cell spacing w=wx=wy=2.0[mm] Fast forward speed F0=F0V=F0H=10000.0 [mm / min] Machining speed F1=F1V=F1H=1000.0[mm / min]

[0070] 2D code 400-0 ST34: 217 times ST35: 218 times ST36: 218 times ST37: 197 times Processing time: 46.824 seconds

[0071] 2D code 400-1 ST34: 246 times ST35: 191 times ST36: 191 times ST37: 212 times Processing time: 49.254 seconds

[0072] · 2D code 400-2 ST34: 214 times ST35: 211 times ST36: 210 times ST37: 205 times Processing time: 47.058 seconds

[0073] 2D code 400-3 ST34: 213 times ST35: 215 times ST36: 214 times ST37: 198 times Processing time: 47.214 seconds

[0074] 2D code 400-4 ST34: 242 times ST35: 199 times ST36: 198 times ST37: 201 times Processing time: 49.290 seconds

[0075] 2D code 400-5 ST34: 217 times ST35: 200 times ST36: 199 times ST37: 224 times Processing time: 46.656 seconds

[0076] QR code 400-6 ST34: 255 times ST35: 201 times ST36: 200 times ST37: 184 times Processing time: 50.826 seconds

[0077] QR code 400-7 ST34: 217 times ST35: 199 times ST36: 198 times ST37: 226 times Processing time: 46.590 seconds

[0078] Table 1 also shows the processing time for each of the 32 combinations of the two-dimensional codes 400-0 to 400-7 shown in FIGS. 4 and 6 to 12 and the routes R1 to R4.

[0079] [Table 1]

[0080] In step ST18, the processor 110 determines whether all routes R have been acquired. If all routes R have been acquired, the processor 110 determines No in step ST18 and returns to step ST16. On the other hand, if there is a route R that has not been acquired, the processor 110 determines Yes in step ST18 and proceeds to step ST19. Note that when proceeding to step ST19, the processor 110 sets all routes R to an unacquired state. That is, the processor 110 sets all routes R to an unacquired state. As described above, processor 110 calculates the processing time for each combination of the acquired code and each route R by repeating steps ST16 to ST18.

[0081] In step ST19, processor 110 determines whether all of the two-dimensional codes 400 generated in step ST12 have been acquired. If there are any two-dimensional codes 400 that have not been acquired, processor 110 determines No in step ST19 and returns to step ST13. On the other hand, if all of the two-dimensional codes 400 have been acquired, processor 110 determines Yes in step ST19 and returns to step ST14. As described above, the processor 110 repeats steps ST12 to ST19 to obtain the number of processing cells, penalty score, and processing time for each combination of each two-dimensional code 400 and each route R.

[0082] In step ST20, processor 110 determines which combination to use to process two-dimensional codes 400 onto object 300. That is, processor 110 determines which of the two-dimensional codes 400 generated in step ST12 to process and which route R to use. Examples of methods for determining combinations are shown below (A1) to (A2).

[0083] (A1) Method of determining using the number of processed cells. The processor 110 compares the number of processing cells of each two-dimensional code 400 and determines to process the two-dimensional code 400 with the fewest number of processing cells into the object 300. The processor 110 then determines to process the two-dimensional code 400 into the object 300 using the combination of the two-dimensional code 400 and the route R that has the shortest processing time.

[0084] The processor 110 may also take into consideration the penalty score when determining the two-dimensional code 400 to be processed into the workpiece 300. For example, the processor 110 excludes two-dimensional codes 400 whose penalty scores are equal to or greater than a predetermined threshold, and determines the two-dimensional code 400 to be processed into the workpiece 300 from among the two-dimensional codes 400 other than those excluded.

[0085] For example, the processor 110 ranks each two-dimensional code 400 by its penalty score, and determines the two-dimensional code 400 to be processed into the workpiece 300 from among the two-dimensional codes 400 that have a rank equal to or higher than a predetermined rank.

[0086] For example, the processor 110 may calculate a determination score using a predetermined function based on the number of processing cells and the penalty score, and may determine the two-dimensional code 400 with the best determination score as the two-dimensional code 400 to be processed into the object 300.

[0087] (A2) A method of determining using the processing time for each combination. The processor 110 compares the processing time of each combination and determines to process the two-dimensional code 400 into the workpiece 300 using the combination with the shortest processing time.

[0088] The processor 110 may also take the penalty score into consideration when determining the combination to be used for processing. For example, the processor 110 excludes combinations that include two-dimensional codes 400 whose penalty scores are equal to or greater than a predetermined threshold, and determines combinations to be used for processing from among the combinations other than those excluded.

[0089] For example, the processor 110 ranks each two-dimensional code 400 by its penalty score, and determines the combination to be used for processing from among combinations including two-dimensional codes 400 that are ranked at or above a predetermined rank.

[0090] For example, the processor 110 may calculate a decision score using a predetermined function based on the processing time and the penalty score, and may then determine the combination with the best decision score as the combination to be used for processing.

[0091] (A3) A method determined by the user (the operator of the control device 100). Processor 110 generates an image corresponding to list screen SC1 as shown in Fig. 17. Then, processor 110 instructs display device 170 to display this generated image. In response to the display instruction, display device 170 displays list screen SC1.

[0092] FIG. 17 is a diagram showing an example of the list screen SC1 displayed on the display device 170. As shown in FIG. The list screen SC1 is a screen that displays a list of information about each combination. The list screen SC1 is also a screen that allows the user to instruct the control device 100 which combination to use. The list screen SC1 includes, for example, an area AR1 and an enter button B1.

[0093] The area AR1 is an area for displaying a list of combinations. In area AR1 of FIG. 17, there are four types of routes R: routes R1 to R4. In area AR1 of FIG. 17, the combinations are sorted and arranged in order of processing time. However, the display order of the combinations in area AR1 is not limited to processing time order. In area AR1 of FIG. 17, the two-dimensional code 400, the route R, the processing time, and the penalty score ranking are displayed for each combination. However, area AR1 may also display information about the combination other than the processing time and penalty score ranking. This information may be, for example, the penalty score, the parameters used to generate the two-dimensional code 400, and the algorithm used to generate the two-dimensional code 400.

[0094] Furthermore, each combination displayed in the area AR1 can be selected by a user operation. The decision button 1 is a button that the user operates when instructing the control device 100 to process the two-dimensional code 400 into the workpiece 300 using the combination selected in the area AR1. When the decision button 1 is operated, the processor 110 decides to process the two-dimensional code 400 into the workpiece 300 using the combination selected in the area AR1.

[0095] As described above, processor 110 functions as an example of a display control unit that displays the estimated time for each of a plurality of two-dimensional codes on the display unit by displaying list screen SC1.

[0096] Moreover, the processor 110 functions as an example of a display control unit that displays the estimated time for each of a plurality of processing paths on the display unit by displaying the list screen SC1.

[0097] In addition, by performing the processing of step ST20 using (A1) or (A2), etc., processor 110 functions as an example of a decision unit that determines which of multiple two-dimensional codes to process into the object to be processed by comparing the estimated time for each of multiple two-dimensional codes.

[0098] In addition, by performing the processing of step ST20 using (A1) or (A2), etc., the processor 110 functions as an example of a decision unit that determines which of the multiple processing paths to use to process the two-dimensional code into the object to be processed by comparing the estimated time for each of the multiple processing paths.

[0099] In addition, by performing the processing of step ST20 using (A3) or the like, processor 110 functions as an example of a decision unit that decides which of multiple two-dimensional codes to process into the object to be processed based on the operation input.

[0100] In addition, by performing processing of step ST20 using (A3) or the like, processor 110 functions as an example of a decision unit that determines, based on operation input, which of multiple processing paths to use to process the two-dimensional code into the object to be processed.

[0101] In step ST21, the processor 110 controls the industrial machine 200 to process the two-dimensional code 400 into the workpiece 300 using the combination determined in step ST20. That is, the processor 110 controls the industrial machine 200 to process the two-dimensional code 400 included in the combination into the workpiece 300 using the route R included in the combination.

[0102] The industrial machine 200 processes the two-dimensional code 400 on the workpiece 300 under the control of the control device 100.

[0103] By performing the process of step ST21, the processor 110 functions as an example of a control unit that controls an industrial machine so as to process a two-dimensional code into a workpiece.

[0104] After the process of step ST21, processor 110 ends the process shown in FIG.

[0105] According to the control system 1 of the embodiment, the control device 100 can calculate the estimated time required to process a two-dimensional code on a workpiece by using the number of processing cells or the processing path.

[0106] Furthermore, according to the control system 1 of the embodiment, the control device 100 calculates an estimated time required to process a two-dimensional code into a processing object. The estimated time can be used for various purposes, such as comparing the processing times of multiple two-dimensional codes. The estimated time can be used to determine which two-dimensional code is suitable for processing, or which processing route is suitable for processing. For example, a two-dimensional code with a short processing time and a processing route with a short processing time are suitable for processing.

[0107] Furthermore, according to the control system 1 of the embodiment, the control device 100 calculates the estimated time required to process multiple two-dimensional codes that have different appearances but store the same data onto an object to be processed. This allows the control device 100 of the embodiment to compare the processing times for multiple two-dimensional codes.

[0108] Furthermore, according to the control system 1 of the embodiment, the control device 100 compares the processing times of multiple two-dimensional codes to determine which two-dimensional code to process on the workpiece. This allows the control device 100 of the embodiment to determine a two-dimensional code that is suitable for processing. Furthermore, the control device 100 of the embodiment can determine a two-dimensional code that can be processed in a short time.

[0109] Furthermore, according to the control system 1 of the embodiment, the control device 100 determines which two-dimensional code to process on the workpiece using a penalty score that indicates the readability of the two-dimensional code. This allows the control device 100 of the embodiment to prevent a two-dimensional code that is difficult to read from being processed on the workpiece.

[0110] Furthermore, according to the control system 1 of the embodiment, the control device 100 displays the processing time for each two-dimensional code on the display device 170. This allows the user to select which two-dimensional code to process on the workpiece.

[0111] Furthermore, according to the control system 1 of the embodiment, the control device 100 calculates an estimated time required for processing a two-dimensional code on a workpiece using a processing path for the processing. By using the estimated time calculated in this manner, the control device 100 can more accurately compare the estimated times.

[0112] Furthermore, according to the control system 1 of the embodiment, the control device 100 calculates an estimated time required to process a two-dimensional code into a workpiece for each of a plurality of different processing paths. Then, the control device 100 compares the estimated time for each processing path to determine which processing path to use to process the two-dimensional code into the workpiece. This allows the control device 100 of the embodiment to determine a processing path suitable for processing. Furthermore, the control device 100 of the embodiment can determine a processing path that allows processing in a short time.

[0113] Furthermore, according to the control system 1 of the embodiment, the control device 100 displays the processing time for each processing path on the display device 170. This allows the user to select which processing path to use to process the two-dimensional code on the object to be processed.

[0114] The above embodiment can be modified as follows. In the above embodiment, the processor 110 of the control device 100 generates the two-dimensional code in step ST12. However, the two-dimensional code may be generated by a device other than the control device 100. In this case, the processor 110 acquires the two-dimensional code from the device.

[0115] In the above embodiment, the processor 110 of the control device 100 calculates the number of processing cells, penalty score, and processing time for each of multiple two-dimensional codes 400 that have the same original data but different appearances. However, the number of two-dimensional codes 400 may be one. In this case, the processor 110 calculates the number of processing cells, penalty score, and processing time for one two-dimensional code 400.

[0116] In the above embodiment, the processor 110 of the control device 100 calculates the machining time for each of the different multiple routes R. However, there may be only one route R. In this case, the processor 110 calculates the machining time for one route R. Alternatively, the processor 110 does not need to calculate the machining time. In this case, the processor 110 uses the number of machining cells to determine which combination to use to machine the two-dimensional code 400 into the workpiece 300.

[0117] In the above embodiment, the processor 110 of the control device 100 combines multiple two-dimensional codes with the same original data but different appearances with multiple different routes R, and calculates the processing time for each of the multiple combinations. However, the processor 110 may also calculate the processing time for only one combination. In this case, however, only one processing time is calculated. Therefore, the processor 110 cannot compare processing times. Processing times can be compared when there are two or more combinations. There are two or more combinations when either there are multiple two-dimensional codes with the same original data but different appearances, or there are multiple different routes R.

[0118] When either the case where there are multiple two-dimensional codes with the same original data but different appearances, or the case where there are multiple different routes R, processor 110 performs the processing of step ST17 and functions as an example of a calculation unit that calculates the estimated time for each of multiple combinations of one two-dimensional code or multiple two-dimensional codes with different appearances that store the same data, and one processing route or multiple different processing routes for processing the two-dimensional code.

[0119] Furthermore, when either the case where there are multiple two-dimensional codes with the same original data but different appearances, or the case where there are multiple different routes R, the processor 110 performs processing of step ST20, thereby comparing the estimated time for each of the multiple combinations, and functions as an example of a decision unit that decides which of the multiple combinations to use to process the two-dimensional code into the object to be processed.

[0120] The processor 110 may calculate the machining time using the number of machining cells. (Processing time) = (Number of processing cells) x (Predetermined coefficient) or (Processing time) = (Number of processed cells) x (Cell spacing w) x (Predetermined coefficient) The processing time is calculated by

[0121] From the above, the processor 110 functions as an example of a calculation unit that calculates the estimated time required to process a two-dimensional code into an object to be processed by using the number of cells to be processed, by calculating the processing time using the number of processing cells.

[0122] The processor 110 may also use the number of processing cells as the processing time. This is because the cell spacing w and the predetermined coefficient generally do not change even if the parameters and algorithms for generating the two-dimensional code change. In this case, the number of processing cells is an example of an estimated time required to process the two-dimensional code into the workpiece.

[0123] The control device 100 may use the total area of ​​the processing cells instead of the number of processing cells. The processor 110 functions as an example of a calculation unit that calculates the estimated time required to process a two-dimensional code into an object to be processed using the area of ​​the cell where the processing is performed, by calculating the processing time using the area of ​​the processing cell.

[0124] From the above, processor 110 functions as an example of a calculation unit that calculates the estimated time required to process a two-dimensional code into a workpiece using at least one of the number of cells to be processed, the area of ​​the cells to be processed, and the processing path for processing the two-dimensional code into the workpiece, by performing the processing of step ST17, calculating the processing time using the number of processing cells, or calculating the processing time using the area of ​​the processing cells.

[0125] In the above embodiment, the shape of the cells is rectangular (including square). However, the shape of the cells does not have to be rectangular. For example, the shape of the cells is a dot. In this case, since the cells are not connected to each other, it is considered that the processing time is mainly determined by the number of processing cells.

[0126] The two-dimensional code may be a reversed code (black and white inversion), a reversed code (left and right inversion), or a rotated code.

[0127] The processor 110 may implement some or all of the processes implemented by the programs in the above embodiments by a hardware circuit configuration.

[0128] The program for implementing the processes of the embodiments may be transferred, for example, in a state stored in the device. However, the device may also be transferred without the program stored therein. The program may then be transferred separately and written to the device. In this case, the program may be transferred by, for example, recording it on a removable storage medium or by downloading it via a network such as the Internet or a local area network (LAN).

[0129] Although the embodiments of the present invention have been described above, they are merely examples and are not intended to limit the scope of the present invention. The embodiments of the present invention can be implemented in various forms without departing from the spirit of the present invention. [Explanation of symbols]

[0130] 1. Control System 100 control device 110 processors 120 ROM 130 RAM 140 Auxiliary storage 150 Control Interface 160 input devices 170 Display Devices 180 Bus 200 Industrial Machinery 300 Processing Objects 400 QR Code

Claims

1. a calculation unit that calculates an estimated time required to process the two-dimensional code into the object using at least one of the number of cells to be processed, the area of ​​the cells to be processed, and a processing path for processing the two-dimensional code into the object; The calculation unit calculates the estimated time for a plurality of two-dimensional codes that have different appearances but store the same data.

2. A processing time estimation device as described in claim 1, further comprising a decision unit that determines which of the multiple two-dimensional codes to process into the object to be processed by comparing the estimated time for each of the multiple two-dimensional codes.

3. The processing time estimation device described in Claim 2, wherein the determination unit further uses the readability of each of the multiple two-dimensional codes to determine which of the multiple two-dimensional codes to process onto the object to be processed.

4. A display control unit that displays the estimated time for each of the plurality of two-dimensional codes on a display unit; The processing time estimation device according to claim 1 , further comprising: a determination unit that determines, based on an operation input, which of the plurality of two-dimensional codes to process on the workpiece.

5. A processing time estimation device as described in Claim 1, wherein the calculation unit calculates the estimated time using the processing path.

6. The calculation unit calculates the estimated time for each of the different multiple processing paths, The processing time estimation device according to claim 5, further comprising a determination unit that determines which of the plurality of processing paths to use to process the two-dimensional code on the object by comparing the estimated time for each of the plurality of processing paths.

7. The calculation unit calculates the estimated time for each of the different multiple processing paths, a display control unit that displays the estimated time for each of the plurality of processing paths on a display unit; The machining time estimation device according to claim 5 , further comprising: a determination unit that determines, based on an operation input, which of the plurality of machining paths to use to machine the two-dimensional code onto the workpiece.

8. The calculation unit calculates the estimated time for each of a plurality of combinations of one of the two-dimensional codes or a plurality of the two-dimensional codes that store the same data but have different appearances, and one processing path or a plurality of different processing paths for processing the two-dimensional code; The processing time estimation device according to claim 1, further comprising a determination unit that determines which of the plurality of combinations to use to process the two-dimensional code on the workpiece by comparing the estimated time for each of the plurality of combinations.

9. a calculation unit that calculates an estimated time required to process the two-dimensional code into the object using at least one of the number of cells to be processed, the area of ​​the cells to be processed, and a processing path for processing the two-dimensional code; a control unit that controls an industrial machine so as to process the two-dimensional code on the workpiece, The calculation unit calculates the estimated time for a plurality of the two-dimensional codes that have different appearances but store the same data.

10. The processor, A program that functions as a calculation unit that calculates the estimated time required to process a two-dimensional code into an object using at least one of the number of cells to be processed, the area of ​​the cells to be processed, and the processing path for processing the two-dimensional code, and calculates the estimated time for multiple two-dimensional codes that have different appearances but store the same data.

Images