WO2024004041A1

WO2024004041A1 - Formation time estimation device, control device, and program

Info

Publication number: WO2024004041A1
Application number: PCT/JP2022/025793
Authority: WO
Inventors: 東錫金
Original assignee: ファナック株式会社
Priority date: 2022-06-28
Filing date: 2022-06-28
Publication date: 2024-01-04

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

Machining time estimation device, control device and program

The present invention relates to a machining time estimating device, a control device, and a program.

2. Description of the Related Art Devices that process a two-dimensional code into a workpiece are known.
Furthermore, two-dimensional codes have different appearances even if they record the same data if they have different parameters.

Patent No. 6752398

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 with the same two-dimensional code, the ease of processing may differ depending on the processing path. In order to determine which two-dimensional code to use and which processing path to use, it is useful to estimate the time it takes to process the two-dimensional code.

The problem to be solved by the embodiments of the present invention is to provide a processing time estimating device, a control device, and a program that can calculate the estimated time required for processing a two-dimensional code.

The processing time estimating device of the embodiment calculates the estimated time required to process a two-dimensional code into a workpiece based on the number of cells to be processed, the area of the cells to be processed, and the two-dimensional code to the workpiece. a calculation unit that calculates using at least one of the machining paths for machining.

The present invention can calculate the estimated time required to process a two-dimensional code.

FIG. 1 is a block diagram illustrating an example of a control system according to an embodiment and a main configuration of components included in the control system. 2 is a flowchart showing an example of processing by the processor in FIG. 1. 2 is a flowchart showing an example of processing by the processor in FIG. 1. FIG. 2 is a plan view showing an example of a workpiece on which a two-dimensional code has been cut. FIG. 5 is a sectional view taken along line 3A-A of the workpiece shown in FIG. 4. FIG. 3 is a diagram showing an example of two-dimensional codes generated using different mask patterns. FIG. 3 is a diagram showing an example of two-dimensional codes generated using different mask patterns. FIG. 3 is a diagram showing an example of two-dimensional codes generated using different mask patterns. FIG. 3 is a diagram showing an example of two-dimensional codes generated using different mask patterns. FIG. 3 is a diagram showing an example of two-dimensional codes generated using different mask patterns. FIG. 3 is a diagram showing an example of two-dimensional codes generated using different mask patterns. FIG. 3 is a diagram showing an example of two-dimensional codes generated using different mask patterns. The figure which shows an example of a route. The figure which shows an example of a route. The figure which shows an example of a route. The figure which shows an example of a route. The figure which shows an example of the list screen displayed on the display device in FIG.

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

The control device 100 is a device that controls industrial machinery 200 and the like. The control device 100 controls the industrial machine 200 using a method such as NC (numerical control), CNC (computerized numerical control), or PLC (programmable logic controller). The control device 100 controls the industrial machine 200 and the like to process a two-dimensional code onto the surface of a workpiece. The two-dimensional code is, for example, a QR code (registered trademark), DataMatrix, PDF417, or other two-dimensional code. The processing method includes cutting, grinding, electric discharge machining, stamping, or printing. The material of the workpiece is not limited. The object to be processed is, for example, metal, resin, glass, wood, rubber, or paper. The control device 100 includes, for example, a processor 110, a ROM (read-only memory) 120, a RAM (random-access memory) 130, an auxiliary storage device 140, a control interface 150, an input device 160, and a display device 170. A bus 180 or the like connects these parts.
Note that the control device 100 is an example of a machining time estimating device.

The processor 110 is a central part of a computer that performs processing such as calculations and control necessary for the operation of the control device 100, and performs various calculations and processing. The processor 110 is, for example, a CPU (central processing unit), MPU (micro processing unit), SoC (system on a chip), DSP (digital signal processor), GPU (graphics processing unit), ASIC (application specific integrated circuit), These include a PLD (programmable logic device) or an FPGA (field-programmable gate array). Alternatively, processor 110 is a combination of more than one of these. Further, the processor 110 may be a combination of these and a hardware accelerator. The processor 110 controls each part 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. Furthermore, the processor 110 executes processing to be described later based on the program. Note that part or all of the program may be incorporated into the circuit of the processor 110.

ROM 120 and RAM 130 are main storage devices of a computer with processor 110 at its core.
The ROM 120 is a nonvolatile 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 to perform 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 temporarily used by the processor 110 to perform various processes. RAM 130 is typically volatile memory.

The auxiliary storage device 140 is an auxiliary storage device of a computer with the processor 110 at its core. 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. Further, the auxiliary storage device 140 stores data used by the processor 110 to perform various types of processing, data generated by processing in the processor 110, various setting values, and the like.

The control interface 150 is an interface for the control device 100 to communicate with the industrial machine 200 and the like. Control device 100 controls industrial machine 200 and the like via control interface 150.

The input device 160 accepts operations by the operator of the control device 100. Input device 160 is, for example, a keyboard, keypad, touch pad, mouse, or controller. Moreover, the input device 160 may be a device for voice input.

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

The bus 180 includes a control bus, an address bus, a data bus, etc., and transmits signals sent and received by each part of the control device 100.

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 another machine tool.

Hereinafter, the operation of the control system 1 according to the embodiment will be explained based on FIGS. 2, 3, etc. Note that the contents of the processing in the following operation description are merely examples, and various processing that can obtain similar results can be used as appropriate. 2 and 3 are flowcharts showing an example of processing by the processor 110 of the control device 100. The processor 110 executes the processes shown in FIGS. 2 and 3 based on a program stored in, for example, the ROM 120 or the auxiliary storage device 140.

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 the two-dimensional code into a workpiece. Processor 110 obtains processing parameters according to operation input to input device 160, for example. Processor 110 obtains processing parameters according to information input from other devices, for example. The machining parameters include, for example, machining depth d, machining speed F1, rapid feed speed F0, and cell interval w. Note that the processing parameters may differ depending on the processing method.

Each processing parameter will be explained using FIGS. 4 and 5.
FIG. 4 is a plan view showing an example of a workpiece 300 on which a two-dimensional code 400 (400-0) has been cut. Note that in FIG. 4, a part of the workpiece 300 is omitted. Moreover, the two-dimensional code 400 shown in FIG. 4 is a QR code. Further, FIG. 4 shows a part of the route R (R1). Path R indicates a movement path of the position of the processing tool with respect to the workpiece 300. The industrial machine 200 processes cells in order along the route R.
FIG. 5 is a cross-sectional view taken along line AA of the workpiece 300 shown in FIG. In addition, in FIG. 5, the boundaries between cells are shown with dotted lines to make them easier to understand.

The processing depth d is the depth at which the two-dimensional code 400 is processed into the workpiece 300. The unit of the machining depth d is, for example, millimeter (mm). If the processing method is cutting, the processing depth is the depth at which the workpiece 300 is cut.

The rapid feed speed F0 is, for example, a relative speed while moving at least one of the processing tool and the workpiece 300 in order to align the relative positions of the processing tool and the workpiece 300 with the next processing 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 feed rate F0 is the feed rate at which the processing tool moves. When the processing tool is fixed, the rapid feed speed F0 is the moving speed of the workpiece 300. The unit of the fast forward 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 broken line as a rapid traverse path. The path is a movement path of the position of the processing tool with respect to the workpiece 300.

Note that the fast forwarding speed F0 may be different in the horizontal direction and the depth direction. In this case, the fast forward speed F0 in the horizontal direction is defined as the fast forward speed F0H. Further, the rapid forwarding speed F0 in the depth direction is defined as the fast forwarding speed F0V.

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 processing tool is fixed, the processing speed F1 is the moving speed of the workpiece 300. It can also be said that this is the speed at which the two-dimensional code 400 is processed on the workpiece 300. When the processing method is cutting, the processing speed is the cutting speed. The unit of the processing speed F1 is, for example, millimeters per minute (mm/min). In FIG. 5, the path along which the machining tool moves at the machining speed F1 is shown as a machining path by a chain line. The path is a movement path of the position of the processing tool with respect to the workpiece 300.

Note that 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 set to the machining speed F1H. Further, the machining speed F1 in the depth direction is defined as the machining speed F1V. Note that the horizontal direction is a direction parallel to the processing surface. The depth direction is a direction perpendicular to the machined surface.

The cell interval w is the length of the interval between two adjacent cells (modules) of the two-dimensional code 400. If there is no gap between the two cells, the cell interval w is equal to the length of one side of the cell. Note that the cell interval w may be different in the horizontal direction and the vertical direction of the two-dimensional code 400, such as when the shape of the cell is not a square but a rectangle. In this case, the cell interval w in the left-right direction is defined as the cell interval wx. Further, the cell interval w in the vertical direction is defined as the cell interval wy. In the two-dimensional code 400 shown in FIG. 4, the cell interval wx and the cell interval wy are equal.

In step ST12, the processor 110 acquires data to be subjected to two-dimensional encoding (hereinafter referred to as "original data"). The processor 110 acquires original data according to an operation input to the input device 160, for example. Processor 110 obtains original data according to information input from other devices, for example.

Then, the processor 110 generates a two-dimensional code using the original data. The processor 110 generates a plurality of two-dimensional codes that have the same original data but different appearances. A plurality of two-dimensional codes having the same original data but different appearances are a plurality of two-dimensional codes storing the same data but having different appearances. The processor 110 generates a plurality of two-dimensional codes that have the same original data but different appearances by, for example, varying at least one of the parameters and algorithms for generating the two-dimensional codes. The parameters include, for example, a mask pattern, error correction level, and mode. As an example, eight types of two-dimensional codes 400-0 to 400-7 generated using eight mask patterns from mask pattern 0 to mask pattern 7 are shown in FIGS. 4 and 6 to 12. Each of FIGS. 6 to 12 is a diagram showing an example of a two-dimensional code 400 generated using different mask patterns. The two-dimensional codes 400-0 to 400-7 shown in FIGS. 4 and 6 to 12 have an error correction level of L, a version of 3, and an original data of "DEMOPART1-2022.03.28-12:00". :00-MACHINE01-NUM00024" is the QR code generated. Note that the version indicates the size (number of cells) of the QR code. The version 3 QR code has a total of 841 cells (29 cells vertically x 29 cells horizontally).

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

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

In step ST14, the processor 110 counts the number of processed cells of the acquired code. The number of processing cells is the number of processing cells. A processing cell is a cell that performs processing. For example, when the processing method is cutting, the processing cell is a cell that performs cutting. A non-processed cell is a cell that is not processed.

The number of processed cells of each two-dimensional code 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

In step ST15, the 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 the method described in JIS X0510, for example. This calculation method is to sum up the points conceded as follows. Therefore, in this case, the lower the penalty score, the easier it is to read. Note that dark cells = processed cells, and bright cells = unprocessed cells.
- Check for blocks with 5 or more consecutive cells of the same color in both the vertical and horizontal directions. 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 is lost for each block in which cells of the same color are lined up 2 times vertically and 2 times horizontally.
・If a bright pattern with a width of 4 or more exists before or after a pattern with a ratio of 1:1:3:1:1 (dark:bright:dark:bright:dark), 40 points will be lost.
- 10 points are lost for every 5% increase or decrease in the proportion of dark cells in the total.

The penalty score obtained by calculating the number of processed cells of each two-dimensional code 400 shown in FIGS. 4 and 6 to 12 using the above method is as follows.
Two-dimensional code 400-0:1245
2D code 400-1:1581
Two-dimensional code 400-2:1463
2D code 400-3:1165
2D code 400-4:1318
2D code 400-5:1439
Two-dimensional code 400-6:1497
2D code 400-7:1396

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

As examples of the route R, routes R1 to R5 are shown in FIGS. 4 and 13 to 16. Each of FIGS. 13 to 16 is a diagram showing an example of the route R. Note that a part of the route R is shown in FIGS. 13 to 16.
The routes R1 to R13 will be explained below. However, routes R6 to R13 are not shown.

Let the number of horizontal cells be N and the number of vertical cells be M. Further, the i-th cell is written as cell (i). The i-th cell indicates which cell the route R passes through. Further, the position of the cell is expressed as the x-th column and y-th row, or (x, y). For example, the upper left cell is the cell in the first column and first row, and is (1, 1). The upper right cell is the cell in the Nth column and first row, and is (N, 1). The lower left cell is the cell in the first column and Mth row, and is (1, M). The lower right cell is the cell in the Nth column and Mth row, and is (N, M).

Routes R1 to R4 are meandering routes.
The route R1 is a route with the cell (1, 1) as the cell (1). For example, the route R1 is obtained by repeating the following operations (11) to (14) until passing through all cells.
(11) Proceed to the Nth column cell in the direction of increasing column number.
(12) Advance one line in the direction of increasing line number.
(13) Proceed to the cell in the first column in the direction of decreasing column number.
(14) Advance one line in the direction of increasing line number.

Note that when the position (x, y) of cell (i) on route R1 is expressed by a mathematical formula, it can be expressed, for example, by the following formula.
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 a floor function. mod is a remainder operator. ^ indicates an index.

Route R2 is a route with cell (N, 1) as cell (1). By repeating the following operations (21) to (24) until passing through all cells, route R2 is obtained.
(21) Proceed to the cell in the first column in the direction of decreasing column number.
(22) Advance one line in the direction of increasing line number.
(23) Proceed to the Nth column cell in the direction of increasing column number.
(24) Advance one line in the direction of increasing line number.

Route R3 is a route with cell (1, M) as cell (1). For example, route R3 is obtained by repeating the following operations (31) to (34) until passing through all cells.
(31) Proceed to the cell in the first row in the direction of decreasing row number.
(32) Advance one column in the direction of increasing column number.
(33) Proceed to the Mth row cell in the direction of increasing row number.
(34) Advance one column in the direction of increasing column number.

Route R4 is a route with cell (1, 1) as cell (1). For example, route R4 is obtained by repeating the following operations (41) to (44) until passing through all cells.
(41) Proceed to the Mth row cell in the direction of increasing row number.
(42) Advance one column in the direction of increasing column number.
(43) Proceed to the cell in the first row in the direction of decreasing row number.
(44) Advance one column in the direction of increasing column number.

Routes R5 to R12 will be explained. Route R5 to route R12 are spiral routes that proceed from the inside to the outside.
The route R5 is a route in which the cell (X1, Y1) is the cell (1). X1=(1+N)÷2, Y1=(1+M)÷2. However, if (1+N)÷2 is not an integer, it is rounded down to an integer. Furthermore, if (1+M)÷2 is not an integer, round it up to the integer. For example, by repeating the following operations (51) to (54) until passing through all cells, route R5 is obtained. Note that the initial value of p is 1.
(51) Advance p columns in the direction of increasing column number.
(52) Advance p lines in the direction of decreasing line number. Then, the value of p is increased by 1.
(53) Advance p columns in the direction of decreasing column number.
(54) Advance p columns in the direction of increasing row number. Then, the value of p is increased by 1.

The route R6 is a route in which the cell (X1, Y1) is the cell (1). X1=(1+N)÷2, Y1=(1+M)÷2. However, if (1+N)÷2 is not an integer, it is rounded down to an integer. Furthermore, if (1+M)÷2 is not an integer, round it up to the integer. For example, by repeating the following operations (61) to (64) until passing through all cells, route R6 is obtained. Note that the initial value of p is 1.
(61) Advance p lines in the direction of decreasing line number.
(62) Advance p columns in the direction of increasing column number. Then, the value of p is increased by 1.
(63) Advance p lines in the direction of increasing line number.
(64) Advance p columns in the direction of decreasing column number. Then, the value of p is increased by 1.

The route R7 is a route in which the cell (X1, Y1) is the cell (1). X1=(1+N)÷2, Y1=(1+M)÷2. However, if (1+N)÷2 is not an integer, round it up to the next integer. Furthermore, if (1+M)÷2 is not an integer, round it up to the integer. For example, by repeating the following operations (71) to (74) until passing through all cells, route R7 is obtained. Note that the initial value of p is 1.
(71) Advance p lines in the direction of decreasing line number.
(72) Advance p columns in the direction of decreasing column number. Then, the value of p is increased by 1.
(73) Advance p lines in the direction of increasing line number.
(74) Advance p columns in the direction of increasing column number. Then, the value of p is increased by 1.

The route R8 is a route in which the cell (X1, Y1) is the cell (1). X1=(1+N)÷2, Y1=(1+M)÷2. However, if (1+N)÷2 is not an integer, round it up to the next integer. Furthermore, if (1+M)÷2 is not an integer, round it up to the integer. For example, the route R7 is obtained by repeating the following operations (81) to (84) until passing through all cells. Note that the initial value of p is 1.
(81) Advance p columns in the direction of decreasing column number.
(82) Advance p lines in the direction of decreasing line number. Then, the value of p is increased by 1.
(83) Advance p columns in the direction of increasing column number.
(84) Advance p columns in the direction of increasing row number. Then, the value of p is increased by 1.

The route R9 is a route in which the cell (X1, Y1) is the cell (1). X1=(1+N)÷2, Y1=(1+M)÷2. However, if (1+N)÷2 is not an integer, round it up to the next integer. Furthermore, if (1+M)÷2 is not an integer, it is rounded down to an integer. For example, by repeating the following operations (91) to (94) until passing through all cells, route R9 is obtained. Note that the initial value of p is 1.
(91) Advance p columns in the direction of decreasing column number.
(92) Advance p lines in the direction of increasing line number. Then, the value of p is increased by 1.
(93) Advance p columns in the direction of increasing column number.
(94) Advance p columns in the direction of decreasing row number. Then, the value of p is increased by 1.

The route R10 is a route in which the cell (X1, Y1) is the cell (1). X1=(1+N)÷2, Y1=(1+M)÷2. However, if (1+N)÷2 is not an integer, round it up to the next integer. Furthermore, if (1+M)÷2 is not an integer, it is rounded down to an integer. For example, the route R10 is obtained by repeating the following operations (101) to (104) until passing through all cells. Note that the initial value of p is 1.
(101) Advance p lines in the direction of increasing line number.
(102) Advance p columns in the direction of decreasing column number. Then, the value of p is increased by 1.
(103) Advance p lines in the direction of decreasing line number.
(104) Advance p columns in the direction of increasing column number. Then, the value of p is increased by 1.

The route R11 is a route in which the cell (X1, Y1) is the cell (1). X1=(1+N)÷2, Y1=(1+M)÷2. However, if (1+N)÷2 is not an integer, it is rounded down to an integer. Furthermore, if (1+M)÷2 is not an integer, it is rounded down to an integer. For example, the route R11 is obtained by repeating the following operations (111) to (114) until passing through all cells. Note that the initial value of p is 1.
(111) Advance p lines in the direction of increasing line number.
(112) Advance p columns in the direction of increasing column number. Then, the value of p is increased by 1.
(113) Advance p lines in the direction of decreasing line number.
(114) Advance p columns in the direction of decreasing column number. Then, the value of p is increased by 1.

The route R12 is a route in which the cell (X1, Y1) is the cell (1). X1=(1+N)÷2, Y1=(1+M)÷2. However, if (1+N)÷2 is not an integer, it is rounded down to an integer. Furthermore, if (1+M)÷2 is not an integer, it is rounded down to an integer. For example, the route R11 is obtained by repeating the following operations (121) to (124) until passing through all cells. Note that the initial value of p is 1.
(121) Advance p columns in the direction of increasing column number.
(122) Advance p lines in the direction of increasing line number. Then, the value of p is increased by 1.
(123) Advance p columns in the direction of decreasing column number.
(124) Advance p columns in the direction of decreasing row number. Then, the value of p is increased by 1.

Further, the route R may be a route obtained by following any of the routes R5 to R12 in the reverse order. A route R13 will be described as an example of such a route R. The route R13 is a spiral route going from the outside to the inside.
The route R13 is a route in which the cell (1, 1) is the cell (1). For example, after performing the following operation (130), the route R13 is obtained by repeating the operations (131) to (134) until passing through all cells. Note that the initial value of q is 1.
(130) Proceed to the Nth column cell in the direction of increasing column number.
(131) Advance (Mq) lines in the direction of increasing line number.
(132) Move forward (N-q) columns in the direction of decreasing column number. Then, the value of q is increased by 1.
(133) Advance (Mq) lines in the direction of decreasing line number.
(134) Move forward (N-q) columns in the direction of increasing column number. Then, the value of q is increased by 1.

For example, there are four types of spiral paths R that proceed from the outside to the inside: the starting positions are (1, 1), (N, 1), (1, M), and (N, M), and the rotation direction is clockwise. There are two types: and counterclockwise. Therefore, there are eight types of spiral paths R that proceed from the outside to the inside.

Further, the route R is not limited to the route R shown above, and may be any route. The routes R shown above pass through all cells without duplication. However, route R may be a route that passes through the same cell multiple times. Further, none of the routes R shown above proceed diagonally. However, the route R may include a portion that goes diagonally.

In step ST17, the processor 110 executes the processing time calculation process shown in FIG. 3. The machining time calculation process is a process for calculating machining time. The processing time is an estimate of the time it takes to process the acquired code along the acquisition path. Note that the acquisition code and the acquisition route are collectively referred to as an "acquisition combination." Further, the processing time is an example of the estimated time required to process the two-dimensional code into the workpiece.

In step ST31 of FIG. 3, the processor 110 of the control device 100 allocates the variable i and the variable T to the RAM 130 or the like. Then, the processor 110 sets the value of the variable i to 1. Furthermore, the processor 110 sets the value of the variable T to 0. The variable T is a variable used to repeat steps ST32 to ST39 and integrate the processing time for each cell. Further, the variable T at the time when the process shown in FIG. 3 ends indicates the processing time of the acquired code.

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

In step ST33, the processor 110 determines whether each of cell (i) and cell (i+1) is a processed cell or an unprocessed cell. Of the two-dimensional code 400 shown in FIG. 4 and the like, cells filled in black are processed cells. The white cells are unprocessed cells.

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

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

Note that in laser machining or the like, there is no need to move the machining tool away from the workpiece 300. Therefore, in this case, the time T2 may be determined by the following formula.
T2=w÷F0H (5)

When the cell (i+1) is a non-processed cell and the cell (i) is a processed cell, the processor 110 proceeds to step ST36 in step ST33.
In step ST36, the processor 110 adds time T3 to variable T. Time T3 is the time required to proceed with processing from cell (i) to cell (i+1) when cell (i+1) is an unprocessed cell and cell (i) is a processed cell. In this case, the industrial machine 200 moves the processing tool in the horizontal direction by the cell interval w at a rapid traverse speed F0H. After that, the industrial machine 200 performs processing in the depth direction by a depth d. Therefore, time T3 can be expressed by the following formula.
T3=w÷F0H+d÷F1V (6)

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

Note that time T1 to time T4 are calculated assuming that the cell width and the processing width are equal. The machining width is, for example, the width of the tip of the machining tool. However, at the stage of actual processing, the cell width and the processing width do not necessarily have to be equal.

After processing any one of steps ST34 to ST37, the processor 110 proceeds to step ST38.
In step ST38, the 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.

In step ST39, the processor 110 increases the value of the variable i by 1. After processing in step ST39, processor 110 returns to step ST32.
The processor 110 integrates the processing time for each cell into the variable T by repeating steps ST32 to ST39 in this way.

Further, if the cell (i+1) is the last cell, the processor 110 determines Yes in step ST38 and ends the machining time calculation process shown in FIG. 3.
Note that the processor 110 stores the value of the variable T at the end of the machining time calculation process in the RAM 130 or the auxiliary storage device 140 so that it can be recognized as the machining time of the obtained combination.

As described above, by performing the processing in step ST17, the processor 110 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. It functions as an example of a calculation unit that performs calculations.

As an example, for each combination of the two-dimensional codes 400-0 to 400-7 shown in FIGS. 4 and 6 to 12 and the route R1, the number of executions of steps ST34 to ST37 in FIG. The processing time is as follows. In addition, each processing parameter was as follows.
Depth d=1.0 [mm]
Cell spacing w=wx=wy=2.0 [mm]
Rapid traverse speed F0=F0V=F0H=10000.0 [mm/min]
Machining speed F1=F1V=F1H=1000.0 [mm/min]

・Two-dimensional code 400-0
ST34: 217 times ST35: 218 times ST36: 218 times ST37: 197 times Machining time: 46.824 seconds

・Two-dimensional code 400-1
ST34: 246 times ST35: 191 times ST36: 191 times ST37: 212 times Machining time: 49.254 seconds

・Two-dimensional code 400-2
ST34: 214 times ST35: 211 times ST36: 210 times ST37: 205 times Machining time: 47.058 seconds

・Two-dimensional code 400-3
ST34: 213 times ST35: 215 times ST36: 214 times ST37: 198 times Machining time: 47.214 seconds

・Two-dimensional code 400-4
ST34: 242 times ST35: 199 times ST36: 198 times ST37: 201 times Machining time: 49.290 seconds

・Two-dimensional code 400-5
ST34: 217 times ST35: 200 times ST36: 199 times ST37: 224 times Machining time: 46.656 seconds

・Two-dimensional code 400-6
ST34: 255 times ST35: 201 times ST36: 200 times ST37: 184 times Machining time: 50.826 seconds

・Two-dimensional code 400-7
ST34: 217 times ST35: 199 times ST36: 198 times ST37: 226 times Machining time: 46.590 seconds

Furthermore, Table 1 shows the processing times for each of 32 combinations of the two-dimensional codes 400-0 to 400-7 and the routes R1 to R4 shown in FIGS. 4 and 6 to 12.

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 an unobtained route R, 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 unobtained state. That is, the processor 110 sets all routes R to a state in which they have not been acquired yet.
As described above, the processor 110 calculates the processing time for each combination of the acquisition code and each route R by repeating steps ST16 to ST18.

In step ST19, the processor 110 determines whether all the two-dimensional codes 400 generated in step ST12 have been acquired. If there is an unobtained two-dimensional code 400, the processor 110 makes a negative determination in step ST19 and returns to step ST13. On the other hand, if all the two-dimensional codes 400 have been acquired, the processor 110 determines Yes in step ST19 and returns to step ST14.
As described above, the processor 110 calculates the number of processing cells, penalty score, and processing time for each combination of each two-dimensional code 400 and each route R by repeating steps ST12 to ST19.

In step ST20, the processor 110 determines which combination is used to process the two-dimensional code 400 into the workpiece 300. That is, the processor 110 determines which two-dimensional code 400 out of the two-dimensional codes 400 generated in step ST12 is to be processed using which route R. As examples of how to determine combinations, (A1) to (A) are shown below.

(A1) A method of determining using the number of processing cells.
The processor 110 compares the number of processed cells of each two-dimensional code 400 and determines that the two-dimensional code 400 with the smallest number of processed cells is to be processed into the workpiece 300. Then, the processor 110 determines to process the two-dimensional code 400 into the workpiece 300 using the combination with the shortest processing time among the combinations of the two-dimensional code 400 and the route R.

Note that the processor 110 may determine the two-dimensional code 400 to be processed on the workpiece 300, taking into consideration the penalty score. For example, the processor 110 excludes the two-dimensional codes 400 whose penalty scores are equal to or greater than a predetermined threshold, and determines the two-dimensional codes 400 to be processed into the workpiece 300 from among the two-dimensional codes 400 other than the excluded two-dimensional codes.

For example, the processor 110 ranks each two-dimensional code 400 using a penalty score, and determines the two-dimensional code 400 to be processed into the workpiece 300 from among the two-dimensional codes 400 whose ranking is a predetermined ranking or higher.

For example, the processor 110 calculates a decision score using a predetermined function using the number of processed cells and the penalty score. Then, the two-dimensional code 400 with the best determination score may be determined as the two-dimensional code 400 to be processed into the workpiece 300.

(A2) A method of determining using the machining time of each combination.
The processor 110 compares the machining time of each combination and determines to process the two-dimensional code 400 onto the workpiece 300 using the combination with the shortest machining time.

Note that the processor 110 may also take into consideration the penalty score to determine the combination to be used for processing. For example, the processor 110 excludes combinations that include the two-dimensional code 400 whose penalty score is greater than or equal to a predetermined threshold, and determines a combination to be used for processing from among the combinations other than the excluded combinations.

For example, the processor 110 ranks each two-dimensional code 400 using a penalty score, and determines a combination to be used for processing from among the combinations including two-dimensional codes 400 whose ranks are higher than a predetermined rank.

For example, the processor 110 calculates a decision score using a predetermined function using the processing time and the penalty score. Then, the combination used for processing with the best determination score may be determined.

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

FIG. 17 is a diagram showing an example of the list screen SC1 displayed on the display device 170.
The list screen SC1 is a screen that displays a list of information about each combination. Further, the list screen SC1 is a screen for the user to instruct the control device 100 as to which combination to use. The list screen SC1 includes, for example, an area AR1 and a determination button B1.

Area AR1 is an area that displays a list of combinations.
In the area AR1 of FIG. 17, there are four types of routes R, routes R1 to R4. Further, in area AR1 in FIG. 17, each combination is sorted and lined up in order of processing time. However, the display order of the combinations of areas AR1 is not limited to the order of processing time. Furthermore, in area AR1 in FIG. 17, for each combination, which two-dimensional code 400, which route R, processing time, and ranking of penalty score are displayed. However, the area AR1 may also display information regarding combinations other than the processing time and penalty score ranking. The information includes, for example, a penalty score, a parameter used to generate the two-dimensional code 400, an algorithm used to generate the two-dimensional code 400, and the like.

Further, each combination displayed in the area AR1 can be selected by a user's operation.
The determination button 1 is a button operated by the user when instructing the control device 100 to process the two-dimensional code 400 onto the workpiece 300 using the combination selected in the area AR1. When decision button 1 is operated, processor 110 decides to process two-dimensional code 400 into workpiece 300 using the combination selected in area AR1.

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

Further, the processor 110 functions as an example of a display control unit that displays the estimated time of each of the plurality of machining routes on the display unit by displaying the list screen SC1.

Further, by performing the process in step ST20 using (A1) or (A2), etc., the processor 110 compares the estimated time of each of the plurality of two-dimensional codes, thereby determining which one of the plurality of two-dimensional codes. It functions as an example of a determining unit that determines whether to process the object into a workpiece.

Further, by performing the process in step ST20 using (A1) or (A2), etc., the processor 110 compares the estimated time of each of the plurality of machining paths, thereby determining which of the plurality of machining paths to use. It functions as an example of a determining unit that determines whether to process the dimensional code into a workpiece.

In addition, the processor 110 performs the process of step ST20 using (A3) or the like, thereby controlling the determining unit that determines which of the plurality of two-dimensional codes is to be processed into the workpiece based on the operation input. Serves as an example.

Furthermore, by performing the process in step ST20 using (A3) or the like, the processor 110 determines which of the plurality of machining paths should be used to process the two-dimensional code into the workpiece based on the operation input. It functions as an example of a determining unit that makes a decision.

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 path R included in the combination.

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

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

After the process of step ST21, the processor 110 ends the process shown in FIG. 2.

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

Furthermore, according to the control system 1 of the embodiment, the control device 100 calculates the estimated time required to process the two-dimensional code into the workpiece. 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 machining, or to determine which machining path is suitable for machining. Note that, for example, a two-dimensional code with a short processing time and a processing route with a short processing time are suitable for processing.

Furthermore, according to the control system 1 of the embodiment, the control device 100 calculates the estimated time required to process a plurality of two-dimensional codes that store the same data and have different appearances into a workpiece. Thereby, the control device 100 of the embodiment can compare the processing times of a plurality of two-dimensional codes.

Furthermore, according to the control system 1 of the embodiment, the control device 100 determines which two-dimensional code to process into the workpiece by comparing the processing times of a plurality of two-dimensional codes. Thereby, the control device 100 of the embodiment can determine a two-dimensional code 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.

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 indicating the readability of the two-dimensional code. Thereby, the control device 100 of the embodiment can prevent a two-dimensional code that is difficult to read from being processed into the workpiece.

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

According to the control system 1 of the embodiment, the control device 100 uses a processing path for processing a two-dimensional code into a workpiece to calculate the estimated time required for the processing. By using the estimated times calculated in this way, the control device 100 can more accurately compare the estimated times.

Furthermore, according to the control system 1 of the embodiment, the control device 100 calculates the estimated time required to process the two-dimensional code into the workpiece for each of the plurality of different processing paths. Then, the control device 100 determines which machining route should be used to process the two-dimensional code onto the workpiece by comparing the estimated time for each machining route. Thereby, the control device 100 of the embodiment can determine a machining path suitable for machining. Further, the control device 100 of the embodiment can determine a machining path that can be machined in a short time.

Furthermore, according to the control system 1 of the embodiment, the control device 100 displays the machining time of each machining path on the display device 170. This allows the user to select which machining path to use to process the two-dimensional code into the workpiece.

The above embodiment can also be modified as follows.
In the above embodiment, the processor 110 of the control device 100 generated the two-dimensional code in step ST12. However, a device other than the control device 100 may generate the two-dimensional code. In this case, the processor 110 obtains a two-dimensional code from the device or the like.

In the above embodiment, the processor 110 of the control device 100 determines the number of processing cells, penalty score, and processing time for each of the plurality of 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 determines the number of processing cells, penalty score, and processing time for one two-dimensional code 400.

In the above embodiment, the processor 110 of the control device 100 calculates the machining time for each of the plurality of different 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, processor 110 may not calculate the machining time. In this case, the processor 110 uses the number of processing cells to determine which combination to use to process the two-dimensional code 400 into the workpiece 300.

In the above embodiment, the processor 110 of the control device 100 combines a plurality of two-dimensional codes with the same original data but different appearances and a plurality of different routes R, and calculates the processing time for each of the plurality of combinations. However, the processor 110 may calculate the machining time for only one combination. However, in this case, the calculated machining time is one. Therefore, processor 110 cannot compare machining times. When there are two or more combinations, comparison of machining times becomes possible. If either the case where there are a plurality of two-dimensional codes with the same original data but different appearances or the case where there are a plurality of different routes R are satisfied, there will be two or more combinations.

If either of the following conditions is satisfied: a plurality of two-dimensional codes having the same original data but different appearances, or a plurality of different routes R, the processor 110 performs the process of step ST17 to create one two-dimensional code. Calculate the estimated time for each of multiple combinations of codes or multiple 2D codes with different appearances that store the same data and one processing route or multiple different processing routes for processing the 2D codes. This functions as an example of a calculation unit that performs calculations.

Furthermore, if either of the following conditions is satisfied: there are multiple two-dimensional codes with the same original data but different appearances, or there are multiple two-dimensional codes with different appearances, the processor 110 performs the process of step ST20 to By comparing the estimated times of the respective combinations, it functions as an example of a determining unit that determines which of the plurality of combinations should be used to process the two-dimensional code into the workpiece.

The processor 110 may calculate the processing time using the number of processing cells. The processor 110, for example,
(Processing time) = (Number of processing cells) x (predetermined coefficient)
Or (processing time) = (number of processed cells) x (cell spacing w) x (predetermined coefficient)
Calculate the machining time by

From the above, the processor 110 calculates the estimated time required to process the two-dimensional code into the workpiece by calculating the processing time using the number of cells to be processed. It serves as an example of the section.

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

The control device 100 may use the total area of the processing cells instead of the number of processing cells.
The processor 110 calculates the processing time using the area of the processing cell, thereby calculating the estimated time required to process the two-dimensional code into the workpiece using the area of the cell to be processed. Serves as an example.

From the above, the processor 110 can convert the two-dimensional code to the workpiece by performing the process in step ST17, by calculating the machining time using the number of machining cells, or by calculating the machining time by using the area of the machining cells. a calculation unit that calculates the estimated time required to process the two-dimensional code 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; It serves as an example.

In the above embodiments, the shape of the cell is rectangular (including square). However, the shape of the cell does not have to be rectangular. For example, the shape of the cell is a dot. In this case, since the cells are not connected, it is thought that the processing time is mainly determined by the number of processing cells.

The two-dimensional code may be inverted (black and white). The two-dimensional code may be reversed (left and right). The two-dimensional code may be rotated.

The processor 110 may implement part or all of the processing implemented by the program in the above embodiments using a circuit hardware configuration.

The program that implements the processing of the embodiment is transferred, for example, while being stored in the device. However, the device may be transferred without the program stored therein. Then, the program may be separately transferred and written into the device. Transfer of the program at this time can be realized, for example, by recording it on a removable storage medium or by downloading it via a network such as the Internet or a LAN (local area network).

Although the embodiments of the present invention have been described above, they are shown as examples and do not limit the scope of the present invention. Embodiments of the present invention can be implemented in various ways without departing from the gist of the present invention.

1 Control System 100 Control Device 110 Processor 120 ROM
130 RAM
140 Auxiliary storage device 150 Control interface 160 Input device 170 Display device 180 Bus 200 Industrial machine 300 Workpiece 400 Two-dimensional code

Claims

The estimated time required to process the two-dimensional code into the workpiece is estimated based on at least 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. A machining time estimating device including a calculation unit that calculates using any of the above.
The processing time estimating device according to claim 1, wherein the calculation unit calculates the estimated time of a plurality of the two-dimensional codes that store the same data and have different appearances.
3. The method according to claim 2, further comprising a determining unit that determines which of the plurality of two-dimensional codes is to be processed into the workpiece by comparing the estimated time of each of the plurality of two-dimensional codes. machining time estimation device.
The determining unit further uses readability of each of the plurality of two-dimensional codes to determine which of the plurality of two-dimensional codes is to be processed on the workpiece. Machining time estimation device.
a display control unit that displays the estimated time of each of the plurality of two-dimensional codes on a display unit;
The machining time estimating device according to claim 2, further comprising a determining unit that determines which of the plurality of two-dimensional codes is to be machined on the workpiece based on an operation input.
The machining time estimating device according to claim 1, wherein the calculation unit calculates the estimated time using the machining path.
The calculation unit calculates the estimated time for each of the plurality of different processing paths,
Claim further comprising: a determining unit that determines which of the plurality of processing paths should be used to process the two-dimensional code into the workpiece by comparing the estimated time of each of the plurality of processing paths. 6. The processing time estimating device according to 6.
The calculation unit calculates the estimated time for each of the plurality of different processing paths,
a display control unit that displays the estimated time of each of the plurality of machining paths on a display unit;
The machining time estimating device according to claim 6, further comprising a determining unit that determines which of the plurality of machining paths should be used to process the two-dimensional code into the workpiece based on an operation input. .
The calculation unit combines one two-dimensional code or a plurality of two-dimensional codes storing the same data and having different appearances, and one processing path or a plurality of different processing paths for processing the two-dimensional code. Calculating the estimated time for each of the plurality of combinations,
Claim further comprising: a determining unit that determines which of the plurality of combinations is used to process the two-dimensional code into the workpiece by comparing the estimated times of each of the plurality of combinations. 1. The processing time estimating device according to 1.
The estimated time required to process a two-dimensional code into a workpiece is estimated using at least one of the number of cells to be processed, the area of cells to be processed, and the processing path for processing the two-dimensional code. A calculation unit that calculates;
A control device comprising: a control unit that controls an industrial machine to process the two-dimensional code on the workpiece.
processor,
The estimated time required to process a two-dimensional code into a workpiece is estimated using at least one of the number of cells to be processed, the area of cells to be processed, and the processing path for processing the two-dimensional code. A program that functions as a calculation unit that performs calculations.