Workpiece drilling action optimization method and system based on matrix operation

Abstract

The invention relates to the technical field of workpiece drilling, in particular to a workpiece drilling action optimization method and system based on matrix operation, and the method comprises the steps that hole position data and drill bit data are obtained, and a hole and drill matching table is generated, each row in the hole and drill matching table reflects all drill bits which can drill out of any hole site when the hole site is machined; and generating a data table of machine head actions based on the current machine head position and the hole and drill matching table. According to the method, the final solutions obtained by simplifying the 0-1 matrix through the set simplification rule are all the optimal solutions of the action set, only the bit AND operation, the bit OR operation and the bit XOR operation of the binary data exist in the whole matrix simplification calculation process, the 0-1 matrix can be simplified at a high speed, and therefore the minimum action combination number is obtained, and the calculation efficiency is improved. Therefore, the optimal drilling action is found, the overall machining efficiency is improved, and the method is suitable for solving the problem of large-scale drilling action set simplification and optimization.

Description

Technical Field

[0001] The present invention relates to the technical field of workpiece drilling, and more specifically, to a workpiece drilling action optimization method and system based on matrix operation. Background Art

[0002] As people's living standards continue to improve, the requirements for living environment and furniture are also increasing. Many developers' newly built residential buildings are delivered as finely decorated houses, and almost all of them use customized furniture with unified standards. Therefore, the customized panel furniture industry has flourished. Panel furniture is generally assembled with workpieces of different sizes. For the sake of beauty and durability, these workpieces usually need to undergo several drilling processes.

[0003] In the related art, for example, the Chinese patent application document with publication number CN112836854B discloses a method for optimizing the path of multi-hole machining of workpieces based on a greedy algorithm. The present invention specifically solves the problem of planning the path of multi-hole machining of metal workpieces with irregular hole arrangement. It is simple and easy to implement. It optimizes the machining path based on the greedy algorithm, shortens the machining time, and improves the machining efficiency. By optimizing the grouping parameters, the algorithm is further optimized, and the optimal path is finally found.

[0004] When using the greedy algorithm to optimize the drilling action, the action with the largest number of covered holes is always preferred. However, the action with the largest number of covered holes may not be optimal, resulting in a higher time consumption during the drilling process and reduced drilling efficiency. Summary of the invention

[0005] The present invention provides a method and system for optimizing workpiece drilling actions based on matrix operations, aiming to solve the problem in the related art that when using a greedy algorithm to optimize the drilling action, the action with the largest number of covered hole positions is always preferentially selected, but the action with the largest number of covered hole positions may not be optimal, resulting in a high time consumption in the drilling process and reduced drilling efficiency.

[0006] In a first aspect, the present invention provides a method for optimizing a workpiece drilling action based on matrix operations, comprising: obtaining hole position data and drill bit data, generating a hole and drill matching table, wherein each row in the hole and drill matching table reflects all drill bits that can drill out any hole position when processing the hole position; generating a data table of machine head actions based on a current machine head position and the hole and drill matching table, wherein each row in the data table of machine head actions reflects all hole positions and corresponding drill bits that can be processed simultaneously by the current machine head; based on the data table of machine head actions, constructing a 0-1 matrix corresponding to hole positions and machine head actions, and setting simplification rules to simplify the 0-1 matrix, wherein the simplification rules include:

[0007] In the formula, Cols[h] represents the h-th column in the 0-1 matrix, Cols[j] represents the j-th column in the 0-1 matrix, Rows[i] represents the i-th row in the 0-1 matrix, and Rows[m] represents the m-th row in the 0-1 matrix. The locked Cols[h] represents that the h-th column in the 0-1 matrix is ​​simplified and deleted; the locked Rows[m] represents that the m-th row in the 0-1 matrix is ​​simplified and deleted; and the workpiece is drilled according to the simplified 0-1 matrix.

[0008] The effect is that the 0-1 matrix is ​​simplified by the set simplification rules. Only three operations of binary data, bitwise AND, bitwise OR, and bitwise XOR, can simplify the 0-1 matrix at a faster speed.

[0009] Preferably, a 0-1 matrix is ​​constructed in which the hole positions and machine head actions correspond to each other, including: for the 0-1 matrix, each column is determined to be a machine head action and each row is a hole position, wherein, in response to the element in the i-th row and j-th column of the 0-1 matrix being 1, it means that the j-th machine head action covers the i-th hole position, and i and j are both any positive integers.

[0010] Preferably, obtaining hole position data further includes: generating a hole position table according to the hole position data, wherein the information contained in each hole position in the hole position table is the position coordinates of the hole position, and the working surface of the workpiece where the hole is located, the hole position type, the hole diameter and the hole depth.

[0011] Preferably, obtaining drill bit data further includes: generating a drill bit table according to the drill bit data, wherein the information included in each drill bit in the drill bit table is a drill package number, a relative coordinate of the drill bit on the drill package, a drilling type and a drill bit working surface.

[0012] Preferably, the method comprises: in response to more than one drill bit being installed on a drill kit, determining whether the drill bits on the current drill kit can drill simultaneously.

[0013] Preferably, judging whether the drill bits on the current drill package can drill simultaneously includes: in response to the number of drill bits on the current drill package being less than or equal to the maximum number of drill bits on the current drill package that can be drilled simultaneously, drilling can be carried out simultaneously; in response to the number of drill bits on the current drill package being greater than the maximum number of drill bits on the current drill package that can be drilled simultaneously, the current machine head action is split.

[0014] Preferably, obtaining a simplified 0-1 matrix also includes: determining whether all hole positions are covered in the simplified 0-1 matrix; in response to not covering the hole positions in the simplified 0-1 matrix, simplifying the 0-1 matrix again using the simplification rule until all hole positions are covered in the simplified 0-1 matrix.

[0015] The effect is that the simplified 0-1 matrix can be checked to avoid the problem of missing holes.

[0016] Preferably, setting simplification rules also includes: in response to the situation that only the nth column in the i-th row in the 0-1 matrix is ​​1, locking the i-th row and the nth column; in response to the head action U covering all the remaining hole positions, locking the column of the head action U; in response to the 0-1 matrix not satisfying the above four simplification rules, using a greedy algorithm to simplify the 0-1 matrix.

[0017] The effect is that the 0-1 matrix can be further simplified by using the above simplification rules, and the punching action can be further optimized.

[0018] Preferably, the 0-1 matrix is ​​simplified using a greedy algorithm, including: in response to the qth column in the 0-1 matrix containing the largest number of 1s, locking the qth column and the row corresponding to the 1 appearing in the qth column.

[0019] The effect is that if any of the above four rules cannot be found in the current 0-1 matrix, the 0-1 matrix can be simplified using a greedy algorithm, ensuring that the action after the 0-1 matrix is ​​simplified is the optimal solution of the action set.

[0020] In a second aspect of the present invention, a workpiece drilling motion optimization system based on matrix operations is also provided, comprising a processor and a memory, wherein the memory stores a computer program, and the processor executes the computer program to implement any of the above-mentioned workpiece drilling motion optimization methods based on matrix operations.

[0021] Beneficial effect: The final solutions obtained by simplifying the 0-1 matrix according to the set simplification rules are all optimal solutions for the action set, and there are only three operations of binary data, namely bitwise AND, bitwise OR, and bitwise XOR in the entire matrix simplification calculation process. The 0-1 matrix can be simplified at a faster speed to obtain the minimum number of action combinations, and then find the optimal drilling action, which improves the overall processing efficiency and is suitable for processing large-scale drilling action set simplification optimization problems. BRIEF DESCRIPTION OF THE DRAWINGS

[0022] The following detailed description is read with reference to the accompanying drawings, which illustrate several embodiments of the present invention in an exemplary and non-limiting manner, and in which like or corresponding reference numerals represent like or corresponding parts, wherein:

[0023] Figure 1 is a flow chart schematically illustrating a simplified 0-1 matrix according to an embodiment of the present invention;

[0024] Figure 2 FIG. 1 is a schematic diagram schematically showing a system structure according to an embodiment of the present invention.

[0025] Reference numerals

[0026] 1. Processor; 2. Communication bus; 3. Memory; 4. Communication interface. DETAILED DESCRIPTION

[0027] The following will be combined with the drawings in the embodiments of the present invention to clearly and completely describe the technical solutions in the embodiments of the present invention. Obviously, the described embodiments are part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative work are within the scope of protection of the present invention.

[0028] The specific embodiments of the present invention are described in detail below with reference to the accompanying drawings.

[0029] S101: Acquire hole position data and drill bit data.

[0030] In one embodiment, before drilling a workpiece, hole position data needs to be obtained. Specifically, obtaining hole position data includes: reading the position coordinates of all holes, the working surface of the workpiece where the holes are located, the hole type, the hole diameter and the hole depth from an external processing file. The hole types are divided into blind holes and through holes, and then a hole position table is generated based on the above information. The hole position table is as follows.

[0031] Hole table Hole 1 Hole 2 …… Hole Position N

[0032] In the above-mentioned hole position table, each hole position is stored with a hole position number, such as hole position 1 and hole position 2. Each hole position also includes the working surface where the hole position is located, the coordinates on the workpiece, the hole diameter, the hole depth, the hole type, the blind hole that does not drill through the workpiece and the through hole that needs to be drilled through the workpiece and other information.

[0033] The acquisition of drill data includes: reading drill data from the equipment table, the drill data includes the drill package number, the relative coordinates of the drill on the drill package, the drilling type, the drill working surface, the maximum drilling depth and the travel coordinate limit of the drill, and then generating a drill table based on the above information. It should be noted that the hole type is divided into blind holes and through holes, but blind hole drills cannot process through holes and through hole drills cannot process blind holes. In this embodiment, the drill table is as follows.

[0034] Drill table Drill 1 Drill bit N …… Drill bit N

[0035] In the above drill bit table, each drill bit stores the drill bit number, the gantry number, the drill package number, the offset coordinates XY relative to the base drill bit of the drill package, the radius, the maximum drilling depth, the drill bit type and other information.

[0036] S102: Generate a data table of machine head movements.

[0037] In one embodiment, for any hole position, an association table of all drill bits that match the hole position and the drill bits is established to obtain a hole and drill matching table. For example, there is a hole position 1 on the workpiece, and then all drill bits that can drill hole position 1 are counted, and the drill bits that can drill hole position 1 are counted as drill bit 11, drill bit 12, and drill bit 13, then the drill bits that match hole position 1 are drill bit 11, drill bit 12, and drill bit 13, and all hole positions are traversed to obtain the drill bits that match each hole position and generate a hole and drill matching table, wherein each row in the hole and drill matching table reflects all the drill bits that can drill the hole position when processing any hole position, and the hole and drill matching table is shown as follows.

[0038]

[0039] It should be noted that what is stored in the hole and drill matching table are all object pointers, for example: hole 1 represents a data pointer pointing to hole position 1 in the hole position table, drill 11 represents a data pointer pointing to the first matching drill bit of hole 1 in the drill bit table, and drill 12 points to the second drill bit. It can be seen from the hole and drill matching table that hole 1 can be matched with three different drill bits, drill 11, drill 12, and drill 13 for processing, hole 2 can be matched with two different drill bits, drill 21 and drill 22 for processing, and hole 3 can be matched with four different drill bits, drill 31, drill 32, drill 33, and drill 34 for processing.

[0040] In one embodiment, based on the current machine head position and the hole and drill matching table, all the hole positions and corresponding drill bits that can be processed by the current machine head position are obtained. Specifically, when drilling hole 1 with drill 11, the coordinates of the reference drill (the reference drill is usually the drill with the smallest number on the drill pack) on the drill pack where drill 11 is located are used to represent the machine head position. If the drill 21 of the current drill pack can be used to process hole 2 and the drill 33 can be used to process hole 3 at the same time at the current machine head coordinate position, we use a machine head action to represent a processing action of the current drill pack, and the machine head action is [machine head 1 (X coordinate / Y coordinate / Z coordinate / gantry number), (drill 11 / hole 1), (drill 21 / hole 2), (drill 33 / hole 3)], thereby generating a data table of machine head actions, and the data table of machine head actions is as follows:

[0041]

[0042] It should be noted that the first row of the data table of machine head actions indicates that machine head 1 can use 3 drill bits to process 3 corresponding holes at the same time, the second row indicates that machine head 2 can use 1 drill bit to process 1 corresponding hole, and the third row indicates that machine head 3 can use 2 drill bits to process 2 corresponding holes.

[0043] It should be noted that although a drill kit may be equipped with more than a dozen or even dozens of drill bits, and the extension and retraction of these drill bits are all pneumatically controlled, due to the limitation of the rated power of the air compressor, the processing process will have a rigid limit on the maximum number of simultaneous drillings on the drill kit. In this embodiment, the maximum number can be set according to the specific actual situation, for example, the maximum number is 12, 15 or 16. In this embodiment, preferably, the maximum number is 12. At this time, if the number of holes that need to be processed simultaneously at a machine head coordinate position exceeds the maximum number of simultaneous drillings allowed by the current drill kit, then the current machine head action needs to be split into several parts to ensure that the number of simultaneous drillings for each individual action is ≤ the maximum number of simultaneous drillings allowed by the current drill kit.

[0044] In one embodiment, when multiple drill packages are configured on a gantry, it is necessary to group and merge the head data with the same gantry coordinates and in compliance with the drill package safety spacing. For example, in a single-gantry dual-head machine, when the x-coordinates of head 1 and head 3 in the head action data table are the same, and the difference between the y-coordinate of head 1 and the y-coordinate of head 3 is ≥ the drill package safety spacing, we call the action of head 1 and head 3 matched. However, if head 1 and head 3 are matched at the same time, head 1 is also matched with head 5, but head 3 and head 5 cannot coexist, and only one of the two can be selected, but in the selection process, it is not certain whether to select the combination of head 1 and head 3 or the combination of head 1 and head 5. Therefore, we need to create a matching action file for each head action. Specifically, an action matching record [machine 1, machine 11, machine 12] is generated first. The three fields in the action matching record are all object pointers, pointing to the corresponding head data objects in the data table of the head action. For example: machine 1 points to head 1, machine 11 points to head 3, and machine 12 points to head 5 data objects. Finally, a matching action table of the head action is generated. The matching action table of the head action is shown below.

[0045]

[0046] In the matching action table of the above-mentioned machine head actions, the machine head 1 action has 2 matching machine head actions, the machine head 2 action has 4 matching machine head actions, and the machine head 3 action has 3 matching actions. When simplifying the action set with the smallest number in the subsequent steps, the actions in the matching action table of the machine head actions are processed as follows: [machine 1, machine 11] is regarded as a double-machine head action, and [machine 1, machine 12] is regarded as a double-machine head action.

[0047] S103: Based on the data table of the machine head movement, a 0-1 matrix corresponding to the hole positions and the machine head movements is constructed.

[0048] In one embodiment, when a single drill package exists, a 0-1 matrix corresponding to the hole positions and the machine head actions can be constructed based on the data table of the machine head actions. In another embodiment, when multiple drill packages exist, a 0-1 matrix corresponding to the hole positions and the machine head actions can also be constructed based on the matching action table of the machine head actions.

[0049] In one embodiment, a 0-1 matrix is ​​constructed in which the hole positions and the machine head actions correspond to each other. For the 0-1 matrix, each column is determined to be a machine head action and each row is a hole position. If the element in the i-th row and j-th column of the 0-1 matrix is ​​1, it means that the j-th machine head action covers the i-th hole position; if the element in the i-th row and j-th column of the 0-1 matrix is ​​0, it means that the j-th machine head action does not cover the i-th hole position, and i and j are any positive integers. The 0-1 matrix is ​​as shown below.

[0050] Action 1 Action 2 Action 3 Action 4 …… Action N Hole 1 1 0 1 0 …… 1 Hole 2 0 1 1 0 …… 0 Hole 3 1 0 0 1 …… 0 …… …… …… …… …… …… …… Hole position M 0 1 0 0 …… 1

[0051] In one embodiment, after obtaining the 0-1 matrix, two two-dimensional arrays Rows and Cols are used to store the contents of the 0-1 matrix, wherein the row array Rows indicates which actions cover each hole position, and the column array Cols indicates which hole positions are covered by each action.

[0052] In one embodiment, the one-dimensional capacity length of the Rows array = the total number of hole positions, and the two-dimensional capacity length = the total number of actions / 64, and the result is rounded up, that is, for a hole position, every 64 actions are stored and represented by a 64-bit integer. If the current hole position does not appear in the 64 actions, it is represented by 0. If the current hole position appears in all 64 actions, it is represented by the hexadecimal number 0xffffffffffffffff. For example, when there are 1000 action combinations, 16 64-bit integers are needed to represent the appearance of a hole position in all actions, and the two-dimensional capacity length of the Rows array is 16.

[0053] In one embodiment, the one-dimensional capacity length of the Cols array = the total number of actions, and the two-dimensional capacity length = the total number of holes / 64, and the result is rounded up, that is, for one action, we use a 64-bit integer to store and represent each 64 holes. If none of the 64 holes appear in the current action, they are represented by 0. If all 64 holes appear in the current action, they are represented by the hexadecimal number 0xffffffffffffffff. For example, when there are 1000 holes to be processed, 16 64-bit integers are needed to represent the appearance of all holes in one action, and the two-dimensional capacity length of the Cols array is 16. Therefore, for each hole, we need an array containing 16 uint64_t elements to store the appearance of the hole in 1000 actions.

[0054] Step S104: obtaining a simplified 0-1 matrix, and using the simplified 0-1 matrix to perform hole punching on the workpiece.

[0055] In one embodiment, a simplification rule is set, and the 0-1 matrix is ​​simplified using the simplification rule to obtain a simplified 0-1 matrix.

[0056] In one embodiment, the simplified rules are set, including:

[0057] Rule 1: If the hth column in the 0-1 matrix meets the first preset condition, the hth column is locked, where meeting the first preset condition means that when all the 1s in the hth column in the 0-1 matrix appear in the jth column, the hth column is locked. In other words, when all the holes covered by action Q appear in action W, that is, action W contains all the holes of action Q, action Q is removed from the optimal solution and action W column is retained; this rule is expressed in the 0-1 matrix as all the 1s in the Qth column appear in the Wth column.

[0058] In one embodiment, rule 1 can also be expressed by a formula: Cols[h]AND Cols[j]XOR Cols[h]=0, Cols[h] is locked. The meaning of the formula is: when the result of bitwise AND of the hth column and the jth column and XOR of the hth column is 0, it means that all 1s in the hth column appear in the jth column, so the hth column is locked and the jth column is retained. Locking Cols[h] means that the action of the hth column is simplified and deleted and is ignored in subsequent calculations.

[0059] For example, the following table shows:

[0060] Action Q Action W Hole 1 1 1 Hole 2 0 1 Hole 3 1 1 Hole 4 0 0

[0061] As shown in the above table, the hole positions covered by action Q are hole position 1 and hole position 3, and the hole positions covered by action W are hole position 1, hole position 2 and hole position 3. It can be seen that action W includes all the hole positions of action Q. At this time, the action Q column is locked and deleted, and the action W column is retained.

[0062] Rule 2: If the i-th row in the 0-1 matrix satisfies the second preset condition, the i-th row is locked, wherein satisfying the second preset condition means that all 1s in the i-th row in the 0-1 matrix appear in the m-th row, then the m-th row is locked and the i-th row is retained. In other words, if all actions that cover hole position X also cover hole position Y, we can delete hole position Y in all actions, that is, delete row Y in the 0-1 matrix. It should be noted that after obtaining the final solution, hole position Y is added to all actions that appear in hole position X, so that the hole position set is complete. It should be noted that all actions that cover hole position Y do not necessarily cover hole position X. The expression of this rule in the 0-1 matrix is ​​that all 1s in row X appear in row Y, but it is not required that all 1s in row Y appear in row X.

[0063] In one embodiment, rule 2 can also be expressed by a formula: Rows[i]AND Rows[m]XOR Rows[i]=0, lock Rows[m]. The meaning of the formula is: when the result of bitwise AND of the i-th row and the m-th row and XOR of the i-th row is 0, it means that all 1s in the i-th row appear in the m-th row, then the m-th row is locked and the i-th row is retained. Locking Rows[m] means that the hole positions in the m-th row are simplified and deleted, and are ignored in subsequent calculations, while the i-th row is retained for subsequent calculations.

[0064] Exemplary ones are shown in the following table.

[0065] Action 1 Action 2 Action 3 Hole X 1 1 1 Hole position Y 1 0 1 Hole Z 0 1 1

[0066] According to the table above, action 1 covers hole position X and hole position Y, action 2 covers hole position X and hole position Z, and action 3 covers hole position X, hole position Y, and hole position Z. At this time, delete hole position X from all actions, that is, delete the row of hole position X in the 0-1 matrix. Then, after obtaining the final solution, add hole position X to all actions that appear in hole position Y or hole position Z.

[0067] Rule 3: If only the nth column is 1 in the i-th row of the 0-1 matrix, lock the i-th row and the nth column. That is, if a hole position R only appears in action T, and no other action contains the hole position R, then action T is selected as a member of the final solution, and the Tth column is deleted in the 0-1 matrix, and all the holes covered by action T can be deleted, that is, delete all the rows corresponding to 1 in the T column in the 0-1 matrix, and then proceed to the next simplification. This rule is expressed in the 0-1 matrix as only the Oth column in the I-th row is 1, and the other columns are 0.

[0068] Rule 4: When action U covers all remaining holes, action U is selected as the last member of the final solution, and the iteration ends. This rule is expressed in the matrix as all 1s in the Uth column.

[0069] Rule 5: If you cannot find any of the above four rules in the current 0-1 matrix, use the greedy algorithm to prioritize the action that covers the most holes as a member of the final solution, that is, select the column with the most 1s, then delete the column, and delete the rows corresponding to all 1s in the column to simplify the remaining actions in the matrix.

[0070] The 0-1 matrix is ​​simplified through the above five rules, and the locked rows and columns are ignored during the execution of the above five rules. After each cycle obtains an optimal action solution, the hole position in the final action solution will not appear in the subsequent action solution. The above steps are repeated to obtain a simplified 0-1 matrix. After obtaining the simplified 0-1 matrix, it is also necessary to determine whether the current simplified 0-1 matrix covers all the hole positions. If not, the 0-1 matrix is ​​simplified again using the above five rules. If the current simplified 0-1 matrix covers all the hole positions, the workpiece is punched using the current simplified 0-1 matrix.

[0071] In general, the final solutions obtained by simplifying through the above simplification rules are all optimal solutions for the action set, and there are only three operations of binary data, bitwise AND, bitwise OR, and bitwise XOR, in the entire matrix simplification calculation process. The 0-1 matrix can be simplified at a faster speed to obtain the minimum number of action combinations, and then find the optimal drilling action, which improves the overall processing efficiency and is suitable for processing large-scale drilling action set simplification optimization problems.

[0072] The present invention also provides a workpiece drilling action optimization system based on matrix operation. Figure 2 As shown, the system includes a processor 1 and a memory 3, wherein the memory 3 stores computer program instructions. When the computer program instructions are executed by the processor 1, a workpiece drilling action optimization method based on matrix operations according to the first aspect of the present invention is implemented.

[0073] The system also includes other components well known to those skilled in the art, such as a communication bus 2 and a communication interface 3, whose configuration and functions are known in the art and thus will not be described in detail here.

[0074] In the present invention, the aforementioned memory 3 may be any tangible medium containing or storing a program, which may be used by or in combination with an instruction execution system, apparatus or device. For example, a computer-readable storage medium may be any appropriate magnetic storage medium or magneto-optical storage medium, such as a resistive random access memory RRAM (Resistive Random Access Memory), a dynamic random access memory DRAM (Dynamic Random Access Memory), a static random access memory SRAM (Static Random-Access Memory), an enhanced dynamic random access memory EDRAM (Enhanced Dynamic Random Access Memory), a high-bandwidth memory HBM (High-Bandwidth Memory), a hybrid memory cube HMC (Hybrid Memory Cube), etc., or any other medium that can be used to store the required information and can be accessed by an application, a module, or both. Any such computer storage medium may be part of a device or accessible or connectable to a device. Any application or module described in the present invention may be implemented using computer-readable / executable instructions that may be stored or otherwise maintained by such a computer-readable medium.

[0075] In the description of this specification, "plurality" or "several" means at least two, such as two, three or more, etc., unless otherwise clearly and specifically defined.

[0076] The technical features of the above-described embodiments may be arbitrarily combined. To make the description concise, not all possible combinations of the technical features in the above-described embodiments are described. However, as long as there is no contradiction in the combination of these technical features, they should be considered to be within the scope of this specification.

[0077] The above-mentioned embodiments only express several implementation methods of the present invention, and the description is relatively specific and detailed, but it cannot be understood as limiting the scope of the patent application. It should be pointed out that for ordinary technicians in this field, several modifications and improvements can be made without departing from the concept of the present invention, which all belong to the protection scope of the present invention.

Claims

1. A method for optimizing workpiece drilling motion based on matrix operation, characterized in that: include: Acquire hole position data and drill bit data, and generate a hole and drill matching table, wherein each row in the hole and drill matching table reflects all drill bits that can drill any hole position when processing the hole position; Based on the current machine head position and the hole and drill matching table, a data table of machine head actions is generated, wherein each row in the data table of machine head actions reflects all hole positions and corresponding drill bits that can be processed simultaneously by the current machine head; Based on the data table of the machine head action, a 0-1 matrix corresponding to the hole position and the machine head action is constructed, and a simplification rule is set to simplify the 0-1 matrix, wherein the simplification rule includes: Wherein, Cols[h] represents the h-th column in the 0-1 matrix, Cols[j] represents the j-th column in the 0-1 matrix, Rows[i] represents the i-th row in the 0-1 matrix, and Rows[m] represents the m-th row in the 0-1 matrix. The locked Cols[h] represents that the h-th column in the 0-1 matrix is ​​simplified and deleted; the locked Rows[m] represents that the m-th row in the 0-1 matrix is ​​simplified and deleted; The workpiece is drilled according to the simplified 0-1 matrix.

2. The workpiece drilling action optimization method based on matrix operation according to claim 1 is characterized in that: Construct a 0-1 matrix corresponding to the hole position and the machine head movement, including: For the 0-1 matrix, each column is determined to be a machine head action and each row is determined to be a hole position, wherein, in response to the element of the i-th row and j-th column in the 0-1 matrix being 1, it means that the j-th machine head action covers the i-th hole position, and i and j are any positive integers.

3. The workpiece drilling action optimization method based on matrix operation according to claim 1 is characterized in that: Obtaining hole position data also includes: A hole position table is generated according to the hole position data, wherein the information of each hole position in the hole position table includes the position coordinates of the hole position, the working surface of the workpiece where the hole is located, the hole position type, the hole diameter and the hole depth.

4. The workpiece drilling action optimization method based on matrix operation according to claim 1 is characterized in that: Get drill data, also includes: A drill table is generated according to the drill data, wherein the information of each drill in the drill table includes the drill package number, the relative coordinates of the drill on the drill package, the drilling type and the drill working surface.

5. The workpiece drilling action optimization method based on matrix operation according to claim 1 is characterized in that: include: In response to more than one drill bit being installed on a drill kit, it is determined whether the drill bits on the current drill kit can drill simultaneously.

6. The workpiece drilling action optimization method based on matrix operation according to claim 5 is characterized in that: Determine whether the drill bits on the current drill package can drill at the same time, including: In response to the number of drill bits in the current drill package being less than or equal to the maximum number of drill bits allowed to be drilled simultaneously in the current drill package, drilling can be performed simultaneously; In response to the number of drill bits in the current drill package being greater than the maximum number of drill bits allowed to be drilled simultaneously in the current drill package, the current machine head action is split.

7. The workpiece drilling action optimization method based on matrix operation according to claim 1 is characterized in that: The simplified 0-1 matrix also includes: Determine whether all hole positions are covered in the simplified 0-1 matrix; In response to the fact that the simplified 0-1 matrix does not cover the hole positions, the 0-1 matrix is ​​simplified again using the simplification rule until the simplified 0-1 matrix covers all the hole positions.

8. The workpiece drilling action optimization method based on matrix operation according to claim 1, characterized in that: Setting simplified rules also includes: In response to the i-th row and only the n-th column in the 0-1 matrix being 1, locking the i-th row and the n-th column; In response to the machine head action U covering all the remaining holes, the machine head action U is locked. In response to the 0-1 matrix not satisfying the above four simplification rules, a greedy algorithm is used to simplify the 0-1 matrix.

9. The workpiece drilling action optimization method based on matrix operation according to claim 8, characterized in that: The 0-1 matrix is ​​simplified using a greedy algorithm, including: In response to the qth column in the 0-1 matrix containing the largest number of 1s, the qth column and the row corresponding to the 1 appearing in the qth column are locked.

10. A workpiece drilling action optimization system based on matrix operation, characterized in that: It comprises a processor and a memory, the memory stores a computer program, and the processor executes the computer program to implement the workpiece drilling action optimization method based on matrix operation as described in any one of claims 1-9.

Images