A workpiece drilling motion optimization method and system based on matrix operation

Abstract

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 operations, which obtains hole position data and drill bit data, generates 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; and generates a data table of the head action based on the current head position and the hole and drill matching table. The present invention simplifies a 0-1 matrix by using a set simplification rule to obtain the final solution, which is the optimal solution for the action set. In addition, the entire matrix simplification calculation process only involves three operations: bitwise AND, bitwise OR, and bitwise XOR of binary data. The 0-1 matrix can be simplified at a relatively fast speed, thereby obtaining the minimum number of action combinations, and then finding the optimal drilling action, thereby improving overall processing efficiency. The present invention is suitable for processing large-scale drilling action set simplification optimization problems.

Description

Technical Field

[0001] The present invention relates to the technical field of workpiece drilling, and more particularly to a method and system for optimizing workpiece drilling motion based on matrix operations. Background Art

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

[0003] Related technologies, such as Chinese patent application publication number CN112836854B, disclose a method for optimizing multi-hole machining paths based on a greedy algorithm. This method specifically addresses the problem of multi-hole machining path planning for metal workpieces with irregular hole arrangements. This method is simple and easy to implement, optimizing the machining path based on a greedy algorithm, shortening machining time and improving efficiency. By optimizing grouping parameters and further optimizing the algorithm, the optimal path is ultimately 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 longer drilling time 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 related technologies that when using a greedy algorithm to optimize drilling actions, the action with the largest number of covered hole positions is always prioritized. However, the action with the largest number of covered hole positions may not be optimal, resulting in a high time consumption during the drilling process and reduced drilling efficiency.

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

[0007] 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. Locking Cols[h] indicates that the h-th column in the 0-1 matrix is ​​simplified and deleted; locking Rows[m] indicates that the m-th row in the 0-1 matrix is ​​simplified and deleted; and drilling is performed on the workpiece according to the simplified 0-1 matrix.

[0008] The effect is that the 0-1 matrix is ​​simplified by the set simplification rules. Only the 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 the 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 based on 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 based on the drill bit data, wherein the information included in each drill bit in the drill bit table is the drill package number, the relative coordinates of the drill bit on the drill package, the drilling type and the drill bit working surface.

[0012] Preferably, the method includes: 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 allowed to drill 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 allowed to drill simultaneously, the current machine head action is split.

[0014] Preferably, obtaining the simplified 0-1 matrix further includes: determining 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, 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 situation that the machine head action U covers all the remaining hole positions, locking the column of the machine head action U; in response to the situation that the 0-1 matrix does not meet 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 no one of the above four rules is 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, the present invention also provides a workpiece drilling motion optimization system based on matrix operations, 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 effects: The final solutions obtained by simplifying the 0-1 matrix using the set simplification rules are all optimal solutions for the action set. In the entire matrix simplification calculation process, only three operations of binary data, bitwise AND, bitwise OR, and bitwise XOR, are involved. The 0-1 matrix can be simplified at a relatively fast speed, thereby obtaining the minimum number of action combinations and then finding the optimal drilling action, thereby improving the overall processing efficiency. The method is suitable for handling 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 by way of example and not limitation, and in which like or corresponding reference numerals designate 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 clearly and completely describe the technical solutions in the embodiments of the present invention in conjunction with the accompanying drawings. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of them. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative work shall fall within the scope of protection of the present invention.

[0028] The specific embodiments of the present invention will be 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 location data must be obtained. Specifically, obtaining hole location data involves reading the location coordinates of all holes, the workpiece working surface where the holes are located, the hole type, the hole diameter, and the hole depth from an external machining file. Hole types are categorized as blind holes and through holes. This information is then used to generate a hole location table, as shown below.

[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. The information included in 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, whether the blind hole does not drill through the workpiece and the through hole needs to be drilled through the workpiece, etc.

[0033] Drill bit data acquisition involves reading drill bit data from the device table. This data includes the drill package number, the relative coordinates of the drill bit on the package, the hole type, the drill working surface, the maximum drilling depth, and the drill bit's travel coordinate limit. A drill bit table is then generated based on this information. It should be noted that hole types are classified as 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 bit table is shown below.

[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 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 the machine head movement.

[0037] In one embodiment, for any hole position, an association table is established for all drill bits that match that hole position, resulting in a hole-drill matching table. For example, if there is hole position 1 on a workpiece, all drill bits that can drill hole position 1 are counted. The drill bits that can drill hole position 1 are drill 11, drill 12, and drill 13. Therefore, the drill bits that match hole position 1 are drill 11, drill 12, and drill 13. All hole positions are traversed to obtain the drill bits that match each hole position, generating a hole-drill matching table. Each row in the hole-drill matching table reflects all drill bits that can drill that hole position when machining that hole position. The hole-drill matching table is shown below.

[0038]

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

[0040] In one embodiment, based on the current machine head position and the hole-drill matching table, all the hole positions and corresponding drill bits that can be processed at the current machine head position are obtained. Specifically, when drilling hole 1 with drill 11, the coordinates of the reference drill on the drill pack where drill 11 is located (the reference drill is usually the drill with the smallest number on the drill pack) are used to represent the machine head position. If the current machine head coordinate position is such that drill 21 of the current drill pack can be used to process hole 2 and drill 33 can be used to process hole 3 at the same time, we use a machine head action to represent the processing action of the current drill pack. 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. 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 will have a rigid limit on the maximum number of simultaneous drill bits 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, the preferred 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 drill bits 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 drill bits for each individual action is ≤ the maximum number of simultaneous drill bits allowed by the current drill kit.

[0044] In one embodiment, when multiple drill bags 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 bag safety spacing. For example, in a single-gantry dual-head machine, when the x-coordinates of head 1 and head 3 are the same in the head action data table, and the difference between the y-coordinates of head 1 and head 3 is ≥ the drill bag safety spacing, we say that head 1 and head 3 are 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 first generated. The three fields in the action matching record are all object pointers, pointing to the corresponding machine head data objects in the machine head action data table. For example: machine 1 points to machine head 1, machine 11 points to machine head 3, and machine 12 points to machine head 5 data objects. Finally, a matching action table of the machine head action is generated. The matching action table of the machine 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 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 movement is constructed.

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

[0049] In one embodiment, a 0-1 matrix is ​​constructed in which the hole positions and the machine head movements correspond to each other. For the 0-1 matrix, each column is determined to be a machine head movement and each row is determined to be 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 movement 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 movement does not cover the i-th hole position, and i and j are both any positive integers. The 0-1 matrix is ​​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 these 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 hole positions / 64, with the result rounded up. That is, for an action, each 64 hole positions are stored and represented by a 64-bit integer. If none of the 64 hole positions appear in the current action, they are represented by 0. If all 64 hole positions appear in the current action, they are represented by the hexadecimal number 0xffffffffffffffff. For example, if there are 1000 hole positions to be processed, 16 64-bit integers are needed to represent the occurrence of all hole positions in an action, and the two-dimensional capacity length of the Cols array is 16. Therefore, for each hole position, an array containing 16 uint64_t elements is required to store the occurrence of that hole position in 1000 actions.

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

[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 of the 0-1 matrix meets the first preset condition, then lock the hth column. Meeting the first preset condition means that if all 1s in the hth column of the 0-1 matrix appear in the jth column, then lock the hth column. In other words, if all the holes covered by action Q appear in action W, that is, action W includes all the holes in action Q, then action Q is eliminated from the optimal solution, and action W is retained. This rule is expressed in the 0-1 matrix as if all 1s in column Q appear in column W.

[0058] In one embodiment, rule one can also be expressed using a formula: Cols[h] AND Cols[j] XOR Cols[h] = 0, locking Cols[h]. This formula means that if the bitwise AND of column h and column j, followed by the XOR of column h, is 0, it means that all 1s in column h appear in column j. Therefore, column h is locked and column j is retained. Locking Cols[h] means that the actions in column h are simplified and deleted, and are 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 table above, the hole positions covered by action Q are hole positions 1 and hole positions 3, and the hole positions covered by action W are hole positions 1, hole positions 2, and hole positions 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 meets the second preset condition, then the i-th row is locked, wherein meeting 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 from 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 using a formula: Rows[i] AND Rows[m] XOR Rows[i] = 0, lock Rows[m]. This formula means that when the bitwise AND of row i and row m, followed by the XOR of row i, is 0, it means that all 1s in row i appear in row m. In this case, row m is locked, and row i is retained. Locking Rows[m] means that the hole positions in row m are simplified and deleted, and are ignored in subsequent calculations, while row i is retained for subsequent calculations.

[0064] For example, the following table shows.

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

[0066] As shown in the table above, action 1 covers hole positions X and Y, action 2 covers both hole positions X and Z, and action 3 covers hole positions X, Y, and Z. In this case, delete hole position X from all actions, that is, delete the row for hole position X in the 0-1 matrix. Once the final solution is obtained, add hole position X to all actions that include hole position Y or hole position Z.

[0067] Rule 3: If only column n is set to 1 in row i of the 0-1 matrix, then row i and column n are locked. In other words, if a hole position R only appears in action T and no other action includes it, then action T is selected as a member of the final solution. Column T is deleted from the 0-1 matrix, and all hole positions covered by action T can be deleted. This means that all rows corresponding to 1s in column T are deleted from the 0-1 matrix before the next simplification step is performed. This rule is expressed in the 0-1 matrix as if only column O is set to 1 in row i, and all 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 represented in the matrix by all 1s in column U.

[0069] Rule 5: If no action that meets the above four rules is found in the current 0-1 matrix, a greedy algorithm is used 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 the rows corresponding to all 1s in the column to simplify the remaining actions in the matrix.

[0070] The 0-1 matrix is ​​simplified using the above five rules. Locked rows and columns are ignored during the execution of the above five rules. After each cycle obtains an optimal action solution, the hole positions in the final action solution will not appear in the subsequent action solutions. The above steps are repeated to obtain a simplified 0-1 matrix. After obtaining the simplified 0-1 matrix, it is necessary to determine whether the current simplified 0-1 matrix covers all 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 hole positions, the workpiece is punched using the current simplified 0-1 matrix.

[0071] In general, the final solutions obtained through simplification using the above simplification rules are all optimal solutions to the action set. In addition, the entire matrix simplification calculation process only involves three operations: bitwise AND, bitwise OR, and bitwise XOR of binary data. This can simplify the 0-1 matrix at a relatively fast speed, thereby obtaining the minimum number of action combinations and then finding the optimal drilling action, thereby improving the overall processing efficiency and being suitable for handling 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, and 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 operation according to the first aspect of the present invention is implemented.

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

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

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

[0076] The technical features of the above-mentioned embodiments can be combined arbitrarily. In order to make the description concise, not all possible combinations of the technical features in the above-mentioned 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-described embodiments merely illustrate several implementations of the present invention, and while the descriptions are relatively specific and detailed, they should not be construed as limiting the scope of the patent application. It should be noted that a person skilled in the art would be able to make numerous variations and improvements without departing from the spirit of the present invention, and all such variations and improvements fall within the scope of protection of the present invention.

Claims

1. A method for optimizing workpiece drilling motion based on matrix operation, characterized in that: include: Obtain hole location 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 location when machining the hole location; Based on the current machine head position and the hole and drill matching table, a data table of machine head movements is generated, wherein each row in the data table of machine head movements 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 movement, a 0-1 matrix corresponding to the hole positions and the machine head movement is constructed, and a simplification rule is set to simplify the 0-1 matrix, wherein the simplification rule includes: constructing a 0-1 matrix corresponding to the hole positions 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; ； Where, represents the hth column in the 0-1 matrix, represents the jth column in the 0-1 matrix, represents the i-th row in the 0-1 matrix, Indicates the mth row in the 0-1 matrix, locked Indicates that the hth column in the 0-1 matrix is ​​simplified and deleted; locked Indicates that the mth 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 motion optimization method based on matrix operation according to claim 1, characterized in that: Obtaining hole position data also includes: A hole table is generated based on the hole data. The information of each hole in the hole table includes the position coordinates of the hole, the working surface of the workpiece where the hole is located, the hole type, the hole diameter and the hole depth.

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

4. The workpiece drilling motion optimization method based on matrix operation according to claim 1, 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.

5. The workpiece drilling motion optimization method based on matrix operation according to claim 4 is characterized in that: Determine whether the drill bits on the current drill kit can drill simultaneously, 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 currently under the drill package being greater than the maximum number of drill bits currently allowed to be drilled simultaneously under the drill package, the current machine head action is split.

6. The workpiece drilling motion optimization method based on matrix operation according to claim 1, 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 any hole positions, the 0-1 matrix is ​​simplified again using the simplification rule until all hole positions are covered in the simplified 0-1 matrix.

7. The workpiece drilling motion 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 column 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.

8. The workpiece drilling motion optimization method based on matrix operation according to claim 7, 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.

9. A workpiece drilling motion optimization system based on matrix operation, characterized in that: The method comprises a processor and a memory, wherein 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 to 8.

Images