Multi-hole machining programming-free path planning method suitable for machining software

Abstract

The invention provides a multi-hole machining programming-free path planning method suitable for machining software, which is characterized in that a shortest distance tool path planning strategy in mainstream strategies is optimized, before path planning is carried out, all hole sites are subjected to region division, a plurality of secondary machining regions are divided according to information of to-be-machined holes in a total machining region range, and the secondary machining regions are subjected to path planning according to the information of the to-be-machined holes in the total machining region range; when the hole machining path planning is implemented, the next to-be-machined hole closest to the current hole can be found only by performing coordinate comparison, calculation and judgment on the to-be-machined hole in the adjacent secondary machining area and the current hole; by adopting the algorithm logic to calculate and judge the path planning of multi-hole processing, the number of hole sites to be processed by the system can be reduced, so that the rapid and automatic planning of the processing path is realized, compared with a traditional planning method, the method has the advantages that the efficiency of processing the calculated amount is effectively and greatly improved, the waiting time consumed by calculation is remarkably shortened, and the working efficiency is improved. The processing efficiency is improved, and the user experience is improved.

Description

Technical Field

[0001] This invention relates to the field of hole machining programming technology, specifically a multi-hole machining path planning method without programming applicable to machining software. Background Technology

[0002] Hole machining generally refers to the process of forming hole features on a workpiece by cutting or punching with a machining tool. It can also be a process of forming hole features on a workpiece by melting with a laser tool. Multi-hole machining usually refers to the processing scale of thousands or tens of thousands of holes. Hole machining is very common in the manufacturing industry and is one of the mature production processes in the machining field.

[0003] Existing multi-hole machining is typically performed using machine tools. Compared to traditional manual drilling, machine tool machining offers advantages such as high efficiency, high precision, rapid tool changing, and the ability to machine multiple holes simultaneously in a single setup. Therefore, using machine tools for multi-hole machining is currently the mainstream method. However, multi-hole machining using machine tools requires programming the hole positions on the workpiece to determine the machining sequence of each hole and form a machining path. The algorithm for determining the machining sequence of multi-hole machining usually employs an automatic path planning strategy (mainstream strategies include shortest distance, X-direction priority, or Y-direction priority). When using the shortest distance strategy, after each single-hole machining operation, the distance between that hole and the remaining unmachined holes is calculated. If the total number of holes exceeds tens of thousands, the total computational load can reach hundreds of millions, causing the machine tool system to spend a significant amount of time on toolpath planning for multi-hole machining. According to actual measurements, existing CNC equipment may consume more than ten seconds in the calculation time when processing path planning for more than ten thousand holes. This long waiting time causes machining delays and wasted time, resulting in a poor user experience. Summary of the Invention

[0004] To address the aforementioned problem that existing CNC equipment consumes a long time in path planning calculations when processing over 10,000 holes, resulting in processing delays and waste, the technical solution adopted by this invention is as follows: A method for programming-free path planning of multi-hole machining in machining software, applicable to hole machining path planning in machining software, the method includes the following steps: S1, Area Statistics: Statistics on the holes to be processed within the total processing area of ​​the workpiece; S2. Area division: Divide the total processing area into several secondary processing areas. Determine the number of secondary processing areas to be divided based on the area of ​​the total processing area or the total number of holes to be processed. S3. Area Information Organization: Based on each sub-processing area, organize the information of holes to be processed within the corresponding range of each sub-processing area, and assign the coordinates of the holes to be processed within the corresponding sub-processing area to the list of objects to be processed in the corresponding sub-processing area. S4. Find the starting hole: Determine the hole coordinates of all holes to be processed in the list of objects to be processed, and take the hole with the smallest coordinate value as the current hole to start processing. S5. Machining the current hole: Perform machining of the current hole; S6. Check hole machining: Determine whether all hole machining is complete. If so, end the machining process. S7. Determine the first neighboring hole: Determine the coordinates of all holes to be processed within the secondary processing area where the current hole is located, and take the hole to be processed closest to the current hole as the first neighboring hole; S8. Determine the adjacent area: Determine whether there is an adjacent secondary processing area. If not, take the first adjacent hole as the current hole and re-execute steps S5 to S8. Determine whether there is a hole to be processed in the adjacent secondary processing area. If not, take the first adjacent hole as the current hole and re-execute steps S5 to S8. S9. Determine the second neighboring hole: Determine the coordinates of all holes to be processed within the adjacent secondary processing area, and take the hole to be processed closest to the current hole as the second neighboring hole; S10. Determine the actual adjacent hole: Determine the first adjacent hole and the second adjacent hole, take the hole to be processed that is closest to the current hole as the actual adjacent hole, take the actual adjacent hole as the current hole, and re-execute steps S5 to S10. S11, End of processing.

[0005] As described above, the multi-hole machining path planning method for machining software without programming further includes step S5, machining the current hole, by changing the hole information of the current hole from the hole to be machined to the machined hole.

[0006] The above-described method for multi-hole machining without programming path planning applicable to machining software includes hole information such as hole coordinates, hole diameter, hole depth, and hole type, where the hole coordinates are the position coordinates of the hole's center.

[0007] As described above, the method for programming-free path planning of multi-hole machining in machining software further includes the following steps after S3 and the area information organization: S301. Classification of holes to be processed: The information on holes to be processed can be classified into Class 1 holes to be processed, Class 2 holes to be processed, ..., Class N holes to be processed according to the holes to be processed by different processing tools.

[0008] The above-described method for programming-free path planning of multi-hole machining in machining software further includes, after step S301 (classification of holes to be machined): S302, Grouping of holes to be processed: Based on the steps of S301, classifying holes to be processed, several categories of holes to be processed are obtained. The list of objects to be processed is correspondingly divided into the first category of holes to be processed, the second category of holes to be processed, ..., the Nth category of holes to be processed.

[0009] As described above, the method for programming-free path planning of multi-hole machining in machining software further includes, after step S302 (grouping the holes to be machined), the following: S303, Determine the hole machining tool: According to the steps of S302, grouping the holes to be machined, use the first type of machining tool, the second type of machining tool, ..., the Nth type of machining tool to machine the first type of hole to be machined, the second type of hole to be machined, ..., the Nth type of hole to be machined respectively.

[0010] The above-described method for programming-free path planning in multi-hole machining software, wherein step S2, region division, further includes: The total processing area is divided into several secondary processing areas based on the principle that the number of holes to be processed in each secondary processing area is less than or equal to 50. Alternatively, the total processing area can be divided into several secondary processing areas according to the principle that the number of holes to be processed in each secondary processing area is less than or equal to 30; Alternatively, the total processing area can be divided into several secondary processing areas, with each secondary processing area having no more than 20 holes to be processed.

[0011] As described above, the multi-hole machining path planning method for machining software without programming further includes, after step S7 and determining the first adjacent hole: S701. Determine the first neighboring hole with the same distance: If two or more holes to be processed are determined to be the same distance from the current hole in the secondary processing area where the current hole is located, these holes to be processed that are the same distance from the current hole are taken as the first temporary group, and the previous processing hole of the current hole is taken as the first temporary reference. Determine the hole to be processed that is farthest from the first temporary reference in the first temporary group as the first neighboring hole. If all the holes to be processed in the first temporary group are at the same distance from the first temporary reference, then the previous hole processed by the first temporary reference is used as the first temporary reference for recalculation, and so on. If the current hole has no previous processed hole, then the hole with the smallest coordinate value among all holes to be processed in the first temporary group is designated as the first neighboring hole.

[0012] As described above, the method for programming-free path planning of multi-hole machining applicable to machining software further includes, after step S9 and determining the second adjacent hole: S901. Determine the second neighboring holes with the same distance: If two or more holes to be processed are determined to be at the same distance from the current hole within the adjacent secondary processing area, these holes to be processed at the same distance from the current hole are taken as the second temporary group, and the previous processing hole of the current hole is taken as the second temporary reference. The hole to be processed that is farthest from the second temporary reference in the second temporary group is determined as the second neighboring hole. If all the holes to be processed in the second temporary group are at the same distance from the second temporary reference, then the previous hole processed by the second temporary reference is used as the second temporary reference for recalculation, and so on. If the current hole has no previous processed hole, then all holes to be processed in the second temporary group will be the second neighboring hole with the smallest coordinate value.

[0013] The above-described method for programming-free path planning in multi-hole machining software, after step S10 (determining actual adjacent holes), further includes: S1001. Determine the actual neighboring holes with the same distance: If the first neighboring hole and the second neighboring hole are the same distance from the current hole, take the previous processed hole of the current hole as the third temporary reference, and determine the hole to be processed that is farthest from the third temporary reference among the first neighboring hole and the second neighboring hole as the actual neighboring hole. If the first adjacent hole and the second adjacent hole are at the same distance from the third temporary reference, then the previous machined hole of the third temporary reference is used as the third temporary reference for recalculation, and so on. If the current hole has no previous processed hole, then the hole to be processed with the smallest coordinate value among the first neighboring hole and the second neighboring hole is the actual neighboring hole.

[0014] The beneficial effects of this invention are as follows: This invention provides a non-programming path planning method for multi-hole machining in machining software. It optimizes the shortest distance toolpath planning strategy in mainstream methods. Before path planning, all hole positions are divided into regions. Based on the hole information within the total machining area, several secondary machining regions are defined. When implementing hole machining path planning, it is only necessary to compare, calculate, and determine the coordinates of the holes to be machined in the secondary machining region where the current hole is located with the current hole, or compare, calculate, and determine the coordinates of the holes to be machined in the adjacent secondary machining regions with the current hole. This allows the method to find the next closest... For holes to be processed, this algorithm logic can significantly reduce the number of holes that the CNC equipment needs to process by calculating and judging the multi-hole processing path planning. This enables rapid and automatic planning of the processing path, greatly improving the efficiency of path planning generation. Moreover, the number of holes to be calculated is controlled within a few secondary processing areas near the current hole. Hole information outside the adjacent range is no longer included in the calculation and judgment scope. Compared with traditional multi-hole processing path planning methods, this method effectively improves the efficiency of handling the amount of calculation, significantly reduces the waiting time lost in calculation, improves processing efficiency, and enhances the user experience. Attached Figure Description

[0015] Figure 1 This is a schematic diagram illustrating the steps of a non-programming path planning method for multi-hole machining according to the present invention.

[0016] Figure 2 Example 1 is a schematic diagram of the toolpath for a non-programming path planning method for multi-hole machining according to the present invention.

[0017] Figure 3 Example 2 is a schematic diagram of the toolpath for a non-programming path planning method for multi-hole machining according to the present invention.

[0018] Figure 4 for Figure 3 A magnified view of A.

[0019] Figure 5 for Figure 3 A magnified view of B. Detailed Implementation

[0020] The embodiments of the present invention will now be described in detail with reference to the accompanying drawings. The described embodiments are merely some, not all, of the embodiments of the present invention. All other embodiments obtained by those skilled in the art based on the embodiments of the present invention without inventive effort are within the scope of protection of the present invention.

[0021] It should be noted that all directional indications (such as up, down, left, right, front, back, etc.) in the embodiments of the present invention are only used to explain the relative positional relationship and movement of each component in a certain specific posture (as shown in the figure). If the specific posture changes, the directional indication will also change accordingly.

[0022] Furthermore, the use of terms such as "first" and "second" in this invention is for descriptive purposes only and should not be construed as indicating or implying their relative importance or implicitly specifying the number of technical features indicated. Therefore, a feature defined with "first" or "second" may explicitly or implicitly include at least one of that feature. Additionally, the technical solutions of the various embodiments can be combined with each other, but only on the basis of being achievable by those skilled in the art. When the combination of technical solutions is contradictory or impossible to implement, such a combination of technical solutions should be considered non-existent and not within the scope of protection claimed by this invention.

[0023] Example 1 Figure 1 A method for programming-free path planning of multi-hole machining in machining software is shown. This method is applied to hole machining path planning in machining software and includes the following steps: S1, Area Statistics: Statistics on the holes to be processed within the total processing area of ​​the workpiece; S2. Area division: Divide the total processing area into several secondary processing areas. Determine the number of secondary processing areas to be divided based on the area of ​​the total processing area or the total number of holes to be processed. S3. Area Information Organization: Based on the division of each secondary processing area, organize the information of the holes to be processed within the corresponding range of each secondary processing area, and assign the coordinates of the holes to be processed within the corresponding secondary processing area to the list of objects to be processed in the corresponding secondary processing area. S4. Find the starting hole: Determine the hole coordinates of all holes to be processed in the list of objects to be processed, and take the hole with the smallest coordinate value as the current hole to start processing. S5. Machining the current hole: Perform machining of the current hole; S6. Check hole machining: Determine whether all hole machining is complete. If so, end the machining process. S7. Determine the first neighboring hole: Determine the coordinates of all holes to be processed within the secondary processing area where the current hole is located, and take the hole to be processed closest to the current hole as the first neighboring hole; S8. Determine the adjacent area: Determine whether there is an adjacent secondary processing area. If not, take the first adjacent hole as the current hole and re-execute steps S5 to S8. Determine whether there is a hole to be processed in the adjacent secondary processing area. If not, take the first adjacent hole as the current hole and re-execute steps S5 to S8. S9. Determine the second neighboring hole: Determine the coordinates of all holes to be processed within the adjacent secondary processing area, and take the hole to be processed closest to the current hole as the second neighboring hole; S10. Determine the actual adjacent hole: Determine the first adjacent hole and the second adjacent hole, take the hole to be processed that is closest to the current hole as the actual adjacent hole, take the actual adjacent hole as the current hole, and re-execute steps S5 to S10. S11, End of processing.

[0024] Specifically, in this embodiment, the step of S1, the area statistics, is used to count the total processing area of ​​the workpiece and the information of the holes to be processed within the total processing area. The total processing area refers to the side surface of the workpiece that needs to be processed with multiple holes. During processing, the workpiece will be processed with multiple holes in the total processing area according to the drawing position to meet the manufacturing requirements. Therefore, it is necessary to count the information of the holes to be processed (such as quantity statistics, position information statistics, hole type information statistics, hole processing information statistics, etc.) of the position of the hole to be processed on the workpiece before processing. The information statistics of the holes to be processed is only to collect information and not to perform calculation and processing. Therefore, this step generally takes less time.

[0025] The S2 step, region division, is used to divide the total processing area into several smaller secondary processing areas. These secondary processing areas are key to distinguishing whether they are ultimately included in the calculation. Based on the total number of holes to be processed in the total processing area, the number of secondary processing areas to be divided can be determined. The number of holes to be processed in a single secondary processing area is limited, and the number of areas can be determined by limiting the number of holes. For example, if the total number of holes to be processed in the total processing area is 10,000, and the number of holes to be processed in a single secondary processing area is limited to less than 50, then the total processing area can be divided into more than 200 secondary processing areas, considering the actual number of holes during processing. The distribution of the number of holes may be irregular. Therefore, it is preferable to form independent secondary processing areas or secondary processing groups from several holes whose number is close to the limit and whose distance is close. This is beneficial for the decision-making of hole location grouping and zoning. In addition, taking the total processing area of ​​30㎡ as an example, the area of ​​a single secondary processing area can also be limited to 0.2㎡. Then the total processing area can be divided into more than 150 secondary processing areas. Based on the number of holes to be processed within each secondary processing area with a processing area of ​​0.2㎡, the holes to be processed within that secondary processing area are counted. These holes to be processed within the range of a single secondary processing area form independent secondary processing areas or secondary processing groups, which is beneficial for the decision-making of hole location grouping and zoning.

[0026] The step S3, organizing the area information, involves assigning the coordinate values ​​of the holes to be processed to the corresponding list of objects to be processed in the secondary processing area based on the organized hole information. For example, the hole information of secondary processing area a is assigned to the list of objects to be processed in secondary processing area a, while the hole information of secondary processing area b is assigned to the list of objects to be processed in secondary processing area b. During processing, calculations are performed based on the list of objects to be processed in the corresponding secondary processing area, which facilitates the retrieval of hole information, reduces the amount of calculation required for path planning, and improves calculation efficiency.

[0027] The step S4, finding the starting hole, involves identifying the hole with the smallest coordinate value from the list of all objects to be processed, and using it as the starting hole for processing. Since the hole with the smallest coordinate value only needs to be sorted by direct coordinate value comparison, and there is no situation where two holes have the smallest coordinate values ​​at the same time, this step has high processing efficiency and short processing time, which helps to reduce the overall calculation time. Furthermore, the hole with the smallest coordinate value is generally close to the processing origin or the calculation origin, which is also more beneficial for the sequential calculation of subsequent holes to be processed.

[0028] The step S5, processing the current hole, involves actually processing a single hole to be processed. The form of single-hole processing is subject to the actual processing, and any processing method such as drilling, milling, tapping, punching, or laser cutting can be used. This embodiment does not impose any restrictions.

[0029] The step S6, checking the hole processing, determines whether to continue or terminate the local program loop based on whether all holes have been processed. If the processing is completed, the program loop will be exited and the processing will end. If the processing is not completed, the remaining steps will continue to be executed.

[0030] The step S7, determining the first adjacent hole, is based on the current hole having been processed. It employs a strategy to find the next hole to be processed, specifically using the shortest distance hole processing path planning strategy. This involves using all holes within the secondary processing area where the current hole is located as the judgment range, determining the coordinates of these holes, and calculating the closest hole to the current hole (based on the straight-line distance on its coordinates). This closest hole is designated as the first adjacent hole. Since the total processing area has been divided into several smaller secondary processing areas, the CNC system becomes more efficient in processing hole information within smaller areas. Compared to the traditional method of calculating information for all holes within the total processing area, this step significantly reduces the overall calculation time of the CNC equipment and improves processing efficiency.

[0031] The step S8, determining the adjacent area, is used to determine whether there is an adjacent secondary processing area. If there is an adjacent secondary processing area, it can be further determined whether there is a hole to be processed within the range of the adjacent secondary processing area. If there is no adjacent secondary processing area, or no hole to be processed within the range of the adjacent secondary processing area, then the first adjacent hole is used as the current hole and processing is performed. This step can help to further extend the determination of whether there is a hole that is closer to the adjacent secondary processing area, so as to improve the path planning across areas.

[0032] The step S9, determining the second neighboring hole, is based on the premise that there are holes to be processed in adjacent secondary processing areas. It further takes all holes to be processed within the adjacent secondary processing areas as the determination range, determines the hole coordinates of these holes to be processed, and calculates the hole to be processed closest to the current hole (determining the straight-line distance on its hole coordinates). This hole to be processed is taken as the second neighboring hole. Since the total processing area has been divided into several smaller secondary processing areas, the CNC equipment system becomes more efficient in processing the calculation of hole information in small areas. This step significantly improves cross-regional path planning, so that hole processing is not limited to a single secondary processing area, optimizing the rationality of the processing path.

[0033] The step of S10, determining the actual neighboring hole, is based on the fact that the first neighboring hole and the second neighboring hole have already been determined. It is the final decision on the two neighboring holes to be processed. Between the first neighboring hole and the second neighboring hole, the hole to be processed that is closest to the current hole is preferred as the actual neighboring hole. This actual neighboring hole is used as the current hole for hole processing, and the existence of a neighboring hole is re-determined. This step implements the shortest distance hole processing path planning strategy. When the second neighboring hole in the adjacent secondary processing area is closer to the current hole, the second neighboring hole can be flexibly selected as the current hole for hole processing, which simplifies the calculation process and optimizes the rationality of the processing path.

[0034] Figure 2 The toolpath trajectory of this method applied to actual multi-hole machining path planning is shown. In this method, the hole spacing a in the X direction is greater than the hole spacing b in the Y direction. When planning the path, the number of holes to be processed within the total machining area is counted first. The secondary machining areas are divided according to the area or the total number of holes to be processed. The hole information to be processed obtained from each secondary machining area is assigned to the corresponding list of objects to be processed in the secondary machining area. In the list of objects to be processed, the hole with the smallest coordinate value is selected as the current hole to start machining and is then processed. After the initial hole is machined, when determining the next hole to be machined, the secondary machining area where the current hole is located and / or the secondary machining area adjacent to the current hole are used as the set range for determining the next hole to be machined. From the holes to be machined within these ranges, the hole to be machined closest to the current hole is determined as the actual neighboring hole, and the neighboring hole is used as the current hole for hole machining. The determination steps are repeated until all holes are machined, and then the machining ends.

[0035] The path planning strategy for multi-hole machining using this method only requires comparing, calculating, and judging the coordinates of the holes to be machined in the secondary machining area where the current hole is located with the current hole, or comparing, calculating, and judging the coordinates of the holes to be machined in the adjacent secondary machining areas with the current hole. This allows the next nearest hole to be machined to be found. Using this method for calculation and judgment in multi-hole machining path planning can significantly reduce the number of holes that the CNC equipment needs to process. The number of holes to be calculated is controlled within a few secondary machining areas close to the current hole. Hole information outside the adjacent range is no longer included in the calculation and judgment scope. Compared with traditional multi-hole machining path planning methods, this method effectively and significantly improves the efficiency of handling the amount of calculation, significantly reduces the waiting time lost in calculation, improves processing efficiency, and improves the user experience.

[0036] Furthermore, in some embodiments, step S5, processing the current hole, further includes: changing the hole information of the current hole from a hole to be processed to a hole that has already been processed, so as to avoid repeatedly retrieving holes that have already been processed.

[0037] Furthermore, in some embodiments, the hole information to be processed includes hole coordinates, hole diameter, hole depth, and hole type. The hole coordinates are the coordinate information of the position of the hole center relative to the coordinate axis, wherein the coordinate information includes X coordinate value and Y coordinate value.

[0038] Furthermore, in some embodiments, the step S2, region division, further includes: dividing the total processing area into several secondary processing areas according to the number of holes to be processed in each secondary processing area being less than or equal to 50; or dividing the total processing area into several secondary processing areas according to the number of holes to be processed in each secondary processing area being less than or equal to 30; or dividing the total processing area into several secondary processing areas according to the number of holes to be processed in each secondary processing area being less than or equal to 20. This method of dividing the secondary processing area for multi-hole machining further controls the number of holes to be processed within a single secondary processing area, thereby controlling the amount of computation and time required for subsequent processing and improving computational and processing efficiency.

[0039] Example 2 Based on Embodiment 1, this embodiment further includes the following step after S3, the process of organizing area information: S301, classification of holes to be processed: The information on holes to be processed can be classified into Class 1 holes, Class 2 holes, ..., Class N holes according to the type of cutting tool used. The type of holes to be processed is determined by the actual cutting tool used. For example, different drill bits are used for holes to be processed by different cutting tools, and different milling cutters are used for holes to be processed by different cutting tools. This method distinguishes the type of hole to be processed, which is beneficial to be able to process the same type of hole structure in a single tool clamping during the hole processing process, reducing the accuracy impact caused by repeated tool clamping and improving the processing efficiency of a single tool clamping.

[0040] Furthermore, in some embodiments, after step S301, classifying the holes to be processed, the method further includes: S302, grouping the holes to be processed: Based on step S301, several categories of holes to be processed are obtained after classification. The list of objects to be processed is correspondingly divided into the first group of holes to be processed, the second group of holes to be processed, ..., the Nth group of holes to be processed. After classifying the holes to be processed according to different processing tools, the classified holes to be processed are respectively assigned to the list of objects to be processed in the corresponding secondary processing area, forming groups of holes to be processed for different processing tools, so as to facilitate subsequent processing calls and calculations.

[0041] Furthermore, in some embodiments, after step S302, grouping the holes to be processed, the method further includes: S303, determining the hole processing tool: according to step S302, grouping the holes to be processed, a first type of processing tool, a second type of processing tool, ..., a Nth type of processing tool are used to process the first type of hole to be processed, the second type of hole to be processed, ..., the Nth type of hole to be processed, respectively. According to the grouping of holes to be processed by different processing tools, the corresponding processing tools are matched to form dedicated tools for specific purposes, and tool position compensation is calculated according to the corresponding processing tools.

[0042] Example 3 Based on Embodiment 1, this embodiment further includes the following step after S7, determining the first adjacent hole: S701, determining the first adjacent hole with the same distance: If two or more holes to be processed are determined to be at the same distance from the current hole in the secondary processing area where the current hole is located, these holes to be processed at the same distance from the current hole are taken as the first temporary group, and the previous processing hole of the current hole is taken as the first temporary reference. The hole to be processed that is farthest from the first temporary reference in the first temporary group is determined as the first adjacent hole; If all holes to be processed in the first temporary group are at the same distance from the first temporary reference, the previous processing hole of the first temporary reference is taken as the first temporary reference and the calculation is repeated, and so on; If the current hole does not have a previous processing hole, the hole to be processed with the smallest coordinate value in the first temporary group is taken as the first adjacent hole.

[0043] Specifically, in this embodiment, since in actual multi-hole processing, when calculating the hole spacing, there may be more than two holes to be processed that are at the same distance from the current hole, further judgment is needed among these holes to be processed. Figure 3 The following example illustrates the application of this method to toolpath planning in a real multi-hole machining process. In this case, the hole spacing *a* in the X direction is greater than the hole spacing *b* in the Y direction. When calculating the path from the third hole to the fourth hole, the next holes G1 and G2, which are at the same distance as the current hole E, appear. At this point, the hole spacing between the current hole E and the previous hole G3 is used as the first temporary reference D1 to calculate the spacing between the holes G1 and G2. However, since the spacing between the first temporary reference D1 (i.e., the machined hole G3) and the holes G1 and G2 is also the same, the previous hole G4 (i.e., the machined hole G3) is used as the new first temporary reference D1 to recalculate the spacing between the holes G1 and G2. This process continues until the hole with the shortest distance to the first temporary reference D1 is found. Figure 4 For example, if the hole to be processed G1 is closer to the first temporary reference D1 (i.e., the hole to be processed G4) than the hole to be processed G2, then the hole to be processed G1 will be the current hole for processing. This method can solve the problem of the same distance when calculating the shortest distance. Moreover, when this method is applied to the subsequent multi-hole processing path planning, the position of the hole to be processed is more in line with the optimization idea of ​​reducing toolpaths and reducing forward turning angles, thus improving processing efficiency. In addition, if the current hole E does not have a previous processed hole, that is, the current hole does not have a previously processed hole (i.e., the current hole is the starting processed hole), then all the holes to be processed in the first temporary group will have the hole to be processed with the smallest coordinate value as the first neighboring hole.

[0044] Further, in some embodiments, after step S9, determining the second adjacent hole, the method further includes: S901, determining the second adjacent hole with the same distance: if in the adjacent secondary processing area, it is determined that two or more holes to be processed are at the same distance from the current hole, these holes to be processed at the same distance from the current hole are taken as the second temporary group, and the previous processing hole of the current hole is taken as the second temporary reference. The hole to be processed that is farthest from the second temporary reference in the second temporary group is determined as the second adjacent hole; if all holes to be processed in the second temporary group are at the same distance from the second temporary reference, the previous processing hole of the second temporary reference is taken as the second temporary reference and the calculation is repeated, and so on; if the current hole does not have a previous processing hole, the hole to be processed with the smallest coordinate value in the second temporary group is taken as the second adjacent hole. In actual multi-hole machining, when calculating the hole spacing, there may be more than two holes to be machined that are at the same distance as the current hole. Therefore, further judgment is needed among these holes to be machined. This method can solve the problem of the same distance when calculating the shortest distance. Moreover, when this method is applied to the subsequent multi-hole machining path planning, the position of the hole to be machined is more in line with the optimization idea of ​​reducing toolpaths and reducing forward turning angles, thus improving machining efficiency. In addition, if the current hole E has no previous machined hole, that is, if the current hole is not a previously machined hole (i.e., the current hole is the starting machined hole), then all the holes to be machined in the second temporary group are selected with the smallest coordinate value as the second neighboring hole.

[0045] Further, in some embodiments, after step S10, determining the actual neighboring hole, the method further includes: S1001, determining the actual neighboring holes at the same distance: if the first neighboring hole and the second neighboring hole are at the same distance from the current hole, the previous processed hole of the current hole is used as the third temporary reference, and the hole to be processed that is farthest from the third temporary reference among the first neighboring holes and the second neighboring holes is determined to be the actual neighboring hole; if the first neighboring hole and the second neighboring hole are at the same distance from the third temporary reference, the previous processed hole of the third temporary reference is used as the third temporary reference for recalculation, and so on; if the current hole does not have a previous processed hole, the hole to be processed with the smallest coordinate value among the first neighboring holes and the second neighboring holes is determined to be the actual neighboring hole.

[0046] Specifically, in this embodiment, since in actual multi-hole processing, when calculating the hole spacing, there may be more than two holes to be processed that are at the same distance from the current hole, further judgment is needed among these holes to be processed. Figure 3The following example illustrates the application of this method to toolpath planning in a real multi-hole machining process. In this case, the hole spacing *a* in the X-direction is greater than the hole spacing *b* in the Y-direction. When calculating the path from the fifteenth hole to the sixteenth hole, the next holes G11 and G12, which are at the same distance as the current hole E, appear. These are the first and second adjacent holes across regions. In this case, the previous machining hole G13 of the current hole E is used as the third temporary reference D3 to calculate the hole spacing with holes G11 and G12. However, the hole spacing between the third temporary reference D3 (i.e., machining hole G13) and holes G11 and G12 is also the same. Therefore, the previous machining hole G14 of this third temporary reference D3 (i.e., machining hole G13) is used as the new third temporary reference D3 to recalculate the hole spacing with holes G11 and G12. This process continues until the hole with the shortest distance to the third temporary reference D3 is found. Figure 5 For example, if the hole to be processed G11 is closer to the third temporary reference D3 (i.e., the hole to be processed G14) than the hole to be processed G12, then the hole to be processed G11 is the current hole for hole processing. This method can solve the problem of the same distance when calculating the shortest distance. Moreover, when this method is applied to the subsequent multi-hole processing path planning, the position of the hole to be processed is more in line with the optimization idea of ​​reducing toolpaths and reducing forward turning angles, thus improving processing efficiency. In addition, if the current hole E does not have a previous processed hole, that is, the current hole is not a previously processed hole (i.e., the current hole is the starting processed hole), then the hole to be processed with the smallest coordinate value among the first adjacent hole and the second adjacent hole is the actual adjacent hole.

[0047] The above examples are merely illustrative of the technical content of the present invention to facilitate easier understanding by the reader, but do not imply that the implementation of the present invention is limited to these examples. Any technical extensions or re-creations made based on the present invention are protected by the present invention. The scope of protection of the present invention is defined by the claims.

Claims

1. A method for programming-free path planning of multi-hole machining in machining software, applicable to hole machining path planning in machining software, characterized in that, The method includes the following steps: S1, Area Statistics: Statistics on the holes to be processed within the total processing area of ​​the workpiece; S2. Area division: Divide the total processing area into several secondary processing areas. Determine the number of secondary processing areas to be divided based on the area of ​​the total processing area or the total number of holes to be processed. S3. Area Information Organization: Based on the division of each secondary processing area, organize the information of the holes to be processed within the corresponding range of each secondary processing area, and assign the coordinates of the holes to be processed within the corresponding secondary processing area to the list of objects to be processed in the corresponding secondary processing area. S4. Find the starting hole: Determine the hole coordinates of all holes to be processed in the list of objects to be processed, and take the hole with the smallest coordinate value as the current hole to start processing. S5. Machining the current hole: Perform machining of the current hole; S6. Check hole machining: Determine whether all hole machining is complete. If so, end the machining process. S7. Determine the first neighboring hole: Determine the coordinates of all holes to be processed within the secondary processing area where the current hole is located, and take the hole to be processed closest to the current hole as the first neighboring hole; S8. Determine the adjacent area: Determine whether there is an adjacent secondary processing area. If not, take the first adjacent hole as the current hole and re-execute steps S5 to S8. Determine whether there is a hole to be processed in the adjacent secondary processing area. If not, take the first adjacent hole as the current hole and re-execute steps S5 to S8. S9. Determine the second neighboring hole: Determine the coordinates of all holes to be processed within the adjacent secondary processing area, and take the hole to be processed closest to the current hole as the second neighboring hole; S10. Determine the actual adjacent hole: Determine the first adjacent hole and the second adjacent hole, take the hole to be processed that is closest to the current hole as the actual adjacent hole, take the actual adjacent hole as the current hole, and re-execute steps S5 to S10. S11, End of processing.

2. The method for programming-free path planning of multi-hole machining applicable to machining software as described in claim 1, characterized in that, The step S5, processing the current hole, further includes: changing the hole information of the current hole from a hole to be processed to a hole that has already been processed.

3. The method for programming-free path planning of multi-hole machining in machining software as described in claim 1, characterized in that, The information about the hole to be processed includes the hole coordinates, hole diameter, hole depth, and hole type, and the hole coordinates are the position coordinates of the center of the hole.

4. The method for programming-free path planning of multi-hole machining in machining software as described in claim 3, characterized in that, Following step S3, which involves organizing regional information, the following is also included: S301. Classification of holes to be processed: The information on holes to be processed can be classified into Class 1 holes to be processed, Class 2 holes to be processed, ..., Class N holes to be processed according to the holes to be processed by different processing tools.

5. The multi-hole machining path planning method without programming, applicable to machining software, as described in claim 4, is characterized in that... Following step S301, which involves classifying the holes to be processed, the following is also included: S302, Grouping of holes to be processed: Based on the steps of S301, classifying holes to be processed, several categories of holes to be processed are obtained. The list of objects to be processed is correspondingly divided into the first category of holes to be processed, the second category of holes to be processed, ..., the Nth category of holes to be processed.

6. The method for programming-free path planning of multi-hole machining in machining software as described in claim 5, characterized in that, Following step S302, which involves grouping the holes to be processed, the following is also included: S303, Determine the hole machining tool: According to the steps of S302, grouping the holes to be machined, use the first type of machining tool, the second type of machining tool, ..., the Nth type of machining tool to machine the first type of hole to be machined, the second type of hole to be machined, ..., the Nth type of hole to be machined respectively.

7. The method for programming-free path planning of multi-hole machining applicable to machining software as described in claim 1, characterized in that, The steps of S2 and region division also include: The total processing area is divided into several secondary processing areas based on the principle that the number of holes to be processed in each secondary processing area is less than or equal to 50. Alternatively, the total processing area can be divided into several secondary processing areas according to the principle that the number of holes to be processed in each secondary processing area is less than or equal to 30; Alternatively, the total processing area can be divided into several secondary processing areas, with each secondary processing area having no more than 20 holes to be processed.

8. A method for programming-free path planning of multi-hole machining in machining software as described in any one of claims 1-7, characterized in that, Following step S7, which involves determining the first adjacent hole, the following is also included: S701. Determine the first neighboring hole with the same distance: If two or more holes to be processed are determined to be the same distance from the current hole in the secondary processing area where the current hole is located, these holes to be processed that are the same distance from the current hole are taken as the first temporary group, and the previous processing hole of the current hole is taken as the first temporary reference. Determine the hole to be processed that is farthest from the first temporary reference in the first temporary group as the first neighboring hole. If all the holes to be processed in the first temporary group are at the same distance from the first temporary reference, then the previous hole processed by the first temporary reference is used as the first temporary reference for recalculation, and so on. If the current hole has no previous processed hole, then the hole with the smallest coordinate value among all holes to be processed in the first temporary group is designated as the first neighboring hole.

9. A method for programming-free path planning of multi-hole machining in machining software as described in any one of claims 1-7, characterized in that, Following step S9, which involves determining the second adjacent hole, the following is also included: S901. Determine the second neighboring holes with the same distance: If two or more holes to be processed are determined to be at the same distance from the current hole within the adjacent secondary processing area, these holes to be processed at the same distance from the current hole are taken as the second temporary group, and the previous processing hole of the current hole is taken as the second temporary reference. The hole to be processed that is farthest from the second temporary reference in the second temporary group is determined as the second neighboring hole. If all the holes to be processed in the second temporary group are at the same distance from the second temporary reference, then the previous hole processed by the second temporary reference is used as the second temporary reference for recalculation, and so on. If the current hole has no previous processed hole, then all holes to be processed in the second temporary group will be the second neighboring hole with the smallest coordinate value.

10. A method for programming-free path planning of multi-hole machining in machining software as described in any one of claims 1-7, characterized in that, Following step S10, which involves determining the actual adjacent holes, the following further steps are also included: S1001. Determine the actual neighboring holes with the same distance: If the first neighboring hole and the second neighboring hole are the same distance from the current hole, take the previous processed hole of the current hole as the third temporary reference, and determine the hole to be processed that is farthest from the third temporary reference among the first neighboring hole and the second neighboring hole as the actual neighboring hole. If the first adjacent hole and the second adjacent hole are at the same distance from the third temporary reference, then the previous machined hole of the third temporary reference is used as the third temporary reference for recalculation, and so on. If the current hole has no previous machined hole, then the hole to be machined with the smallest coordinate value among the first neighboring hole and the second neighboring hole is the actual neighboring hole.

Images