Method and device for realizing tool path planning processing for glass four-tool-bit cutting machine, processor and computer readable storage medium thereof
By importing metadata and tool parameters into the glass four-head cutting machine, planning the tool path and allocating tools, the problems of high efficiency and accuracy in the existing technology are solved, and the coordinated processing of multiple tool heads is realized, and the processing efficiency is improved. Expanded scope of application.
Patent Information
- Application Number
- CN202411341991.X
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-09-25
- Publication Date
- 2025-01-03
AI Technical Summary
The prior art is difficult to achieve high accuracy and high efficiency tool path planning in glass four-head cutting machines, especially when processing multiple similar workpieces, the processing efficiency is low and the scope of application is limited.
By importing metadata, entering tool parameters, planning tool paths, and outputting tool path files, using the CNC system to load and analyze the processing files generated by CAM, the specific steps include sorting the graphics by Y axis, filtering out graphics with consistent Y coordinates, and finding Similar graphics, the grouping graphics are grouped and assigned tools, the tool vacancy distance is calculated, and the shortest tool combination is used for machining.
It realizes high-precision and high-efficiency tool path planning, makes full use of the mechanical characteristics of multiple tool heads, improves processing efficiency, and expands the scope of application.
Smart Images

Figure CN119247876A_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the field of numerical control machining systems, in particular to the field of CAD / CAM, and specifically refers to a method, device, processor and computer-readable storage medium thereof for realizing tool path planning processing for a four-knife glass cutting machine. Background Art
[0002] The four glass cutting heads share the Y axis on a beam, while the X axis can move independently. When multiple workpieces have the same shape, the X coordinates have a certain spacing, and the Y coordinates are consistent, multiple cutting heads can be used for simultaneous processing. When processing multiple similar workpieces in the X direction, by planning the tool path, multiple tools can be used to process the workpieces in coordination, thereby improving processing efficiency. Summary of the invention
[0003] The purpose of the present invention is to overcome the shortcomings of the above-mentioned prior art and provide a method, device, processor and computer-readable storage medium for realizing tool path planning processing for a four-blade glass cutting machine, which has high precision, high processing efficiency and a wide range of applications.
[0004] In order to achieve the above-mentioned purpose, the method, device, processor and computer-readable storage medium for implementing tool path planning processing for a glass four-blade cutting machine of the present invention are as follows:
[0005] The method for realizing tool path planning processing for a glass four-blade cutting machine is mainly characterized in that the method comprises the following steps:
[0006] (1) Import metadata;
[0007] (2) Input tool parameters;
[0008] (3) Planning tool paths;
[0009] (4) Output tool path file;
[0010] (5) The CNC system loads and analyzes the machining files generated by CAM and performs machining.
[0011] Preferably, the step (3) specifically comprises the following steps:
[0012] (3.1) Sort the input graphics by Y axis and select graphics with consistent Y coordinates;
[0013] (3.2) Find similar graphics;
[0014] (3.3) Group similar graphics;
[0015] (3.4) Assign tools to grouped graphics.
[0016] Preferably, the step (3.3) specifically comprises the following steps:
[0017] Group similar graphics and determine whether the spacing between graphics in the group is greater than or equal to the minimum spacing of the tool head. If so, proceed to step (3.4); otherwise, continue to group similar graphics.
[0018] Preferably, the step (3.4) specifically comprises the following steps:
[0019] (3.4.1) Filter the combinations that do not meet the minimum spacing between the tools;
[0020] (3.4.2) Filter combinations with insufficient tool travel;
[0021] (3.4.3) Calculate the tool's idle travel distance;
[0022] (3.4.4) Calculate the tool idle travel distance, obtain the tool combination with the shortest tool idle travel distance, and assign tools to the grouped graphics.
[0023] Preferably, the calculation of the tool idle travel distance in the step (3.4.4) is specifically as follows:
[0024] The tool idle travel distance is calculated according to the following formula:
[0025] Tool idle movement distance = the distance the machining tool moves from the current position to the starting point of the graphic + the distance the non-machining tool moves from the current position to the avoidance position.
[0026] The device for realizing tool path planning processing for a glass four-blade cutting machine has the following main features: the device comprises:
[0027] a processor configured to execute computer executable instructions;
[0028] The memory stores one or more computer executable instructions. When the computer executable instructions are executed by the processor, the steps of the above-mentioned method for realizing tool path planning processing for a four-blade glass cutting machine are implemented.
[0029] The processor for implementing tool path planning processing for a four-blade glass cutting machine has the main feature that the processor is configured to execute computer executable instructions. When the computer executable instructions are executed by the processor, the various steps of the above-mentioned method for implementing tool path planning processing for a four-blade glass cutting machine are implemented.
[0030] The computer-readable storage medium has the main feature of storing a computer program thereon, and the computer program can be executed by a processor to implement the various steps of the above-mentioned method for realizing tool path planning processing for a four-blade glass cutting machine.
[0031] The method, device, processor and computer-readable storage medium of the present invention are used to implement tool path planning processing for a four-blade glass cutting machine. By implementing a multi-blade tool path planning strategy, the mechanical characteristics of the multi-blade are fully utilized, the processing efficiency is more efficient, and the application range is wide. BRIEF DESCRIPTION OF THE DRAWINGS
[0032] Figure 1 The present invention is a flow chart of a method for implementing tool path planning processing for a four-knife-head glass cutting machine. DETAILED DESCRIPTION
[0033] In order to more clearly describe the technical content of the present invention, further description is given below in conjunction with specific embodiments.
[0034] The method for implementing tool path planning processing for a glass four-blade cutting machine of the present invention comprises the following steps:
[0035] (1) Import metadata;
[0036] (2) Input tool parameters;
[0037] (3) Planning tool paths;
[0038] (4) Output tool path file;
[0039] (5) The CNC system loads and analyzes the machining files generated by CAM and performs machining.
[0040] As a preferred embodiment of the present invention, the step (3) specifically comprises the following steps:
[0041] (3.1) Sort the input graphics by Y axis and select graphics with consistent Y coordinates;
[0042] (3.2) Find similar graphics;
[0043] (3.3) Group similar graphics;
[0044] (3.4) Assign tools to grouped graphics.
[0045] As a preferred embodiment of the present invention, the step (3.3) specifically includes the following steps:
[0046] Group similar graphics and determine whether the spacing between graphics in the group is greater than or equal to the minimum spacing of the tool head. If so, proceed to step (3.4); otherwise, continue to group similar graphics.
[0047] As a preferred embodiment of the present invention, the step (3.4) specifically includes the following steps:
[0048] (3.4.1) Filter the combinations that do not meet the minimum spacing between the tools;
[0049] (3.4.2) Filter combinations with insufficient tool travel;
[0050] (3.4.3) Calculate the tool's idle travel distance;
[0051] (3.4.4) Calculate the tool idle travel distance, obtain the tool combination with the shortest tool idle travel distance, and assign tools to the grouped graphics.
[0052] As a preferred embodiment of the present invention, the calculation of the tool idle travel distance in the step (3.4.4) is specifically as follows:
[0053] The tool idle travel distance is calculated according to the following formula:
[0054] Tool idle movement distance = the distance the machining tool moves from the current position to the starting point of the graphic + the distance the non-machining tool moves from the current position to the avoidance position.
[0055] The device for implementing tool path planning processing for a glass four-blade cutting machine of the present invention comprises:
[0056] a processor configured to execute computer executable instructions;
[0057] The memory stores one or more computer executable instructions. When the computer executable instructions are executed by the processor, the steps of the above-mentioned method for realizing tool path planning processing for a four-blade glass cutting machine are implemented.
[0058] The processor of the present invention is used to implement tool path planning processing for a four-blade glass cutting machine, wherein the processor is configured to execute computer executable instructions. When the computer executable instructions are executed by the processor, the various steps of the above-mentioned method for implementing tool path planning processing for a four-blade glass cutting machine are implemented.
[0059] The computer-readable storage medium of the present invention stores a computer program thereon, and the computer program can be executed by a processor to implement the various steps of the above-mentioned method for implementing tool path planning processing for a four-blade glass cutting machine.
[0060] In a specific embodiment of the present invention, a tool path planning strategy for a CAM software of a glass four-blade cutting machine is proposed, which inputs any graphic element, searches for similar graphics, plans a multi-blade collaborative processing path, and improves processing efficiency.
[0061] The overall process of the present invention is as follows:
[0062] Import DXF files or draw primitives. CAM software will plan the actual tool path based on the primitive information and meet certain physical conditions. The overall steps are as follows:
[0063] 1. Import metadata;
[0064] 2. Input tool parameters, such as the minimum spacing of the tool head;
[0065] 3. Plan tool path;
[0066] 4. Output tool path file;
[0067] 5. The CNC system loads and analyzes the processing files generated by CAM for processing.
[0068] like Figure 1 As shown in the figure, the specific process of planning strategy is as follows:
[0069] 1. Sort the input graphics by Y axis:
[0070] Through this step, the graphics with consistent Y coordinates can be screened out.
[0071] 2. Find similar graphics:
[0072] Input two figures with the same Y coordinates, translate the figure on the right to the position of the figure on the left, and the two figures completely overlap, which means they are similar figures.
[0073] 3. Grouping of similar graphics:
[0074] The graphics in a group can be processed at the same time, so when grouping, try to make the number of groups reach 4. Grouping conditions: The spacing between graphics in a group must be greater than or equal to the minimum spacing between tool heads.
[0075] Take three similar figures as an example, from left to right they are Element 1, Element 2, Element 3, and the minimum tool spacing is 100:
[0076] The spacing between primitive 1 and primitive 2 is 90, and the spacing between primitive 2 and primitive 3 is 90. At this time, the spacing between primitive 1 and primitive 2 is too small, and the spacing between primitive 2 and primitive 3 is too small, and they cannot be processed at the same time.
[0077] The distance between element 1 and element 3 is 180, which can be processed by tool 1 and tool 3. Therefore, element 1 and element 3 are grouped together, and element 2 is grouped together.
[0078] 4. Assign tools to grouped graphics:
[0079] There may be multiple tool combinations when allocating tools. You need to select the combination with the shortest tool idle movement distance. The process is as follows:
[0080] 1. Filter the combinations that do not meet the minimum spacing between the tools;
[0081] 2. Filter combinations with insufficient tool travel;
[0082] 3. Calculate the tool's idle travel distance;
[0083] 4. Choose the tool combination with the shortest moving distance.
[0084] The tools involved in processing are called processing tools, and the tools not involved in processing are called non-processing tools.
[0085] Tool idle movement distance = the distance the machining tool moves from the current position to the starting point of the graphic + the distance the non-machining tool moves from the current position to the avoidance position.
[0086] The spacing between the four glass cutting heads is dynamic and can move freely in the X direction as long as it does not touch other cutting heads or exceed the upper and lower limits of the cutting head travel.
[0087] Among the four glass cutting heads, determining the processing cutting head requires multiple steps:
[0088] 1. Determine whether the graphic spacing meets the requirements for multi-tool processing;
[0089] 2. Determine whether the cutter head stroke is sufficient;
[0090] 3. It is necessary to screen the best tool combination (the distance the tool moves from the current position to the starting point of processing).
[0091] The specific implementation scheme of this embodiment can refer to the relevant description in the above embodiment, which will not be repeated here.
[0092] It can be understood that the same or similar parts of the above embodiments can be referenced to each other, and the contents not described in detail in some embodiments can refer to the same or similar contents in other embodiments.
[0093] It should be noted that, in the description of the present invention, the terms "first", "second", etc. are only used for descriptive purposes and cannot be understood as indicating or implying relative importance. In addition, in the description of the present invention, unless otherwise specified, the meaning of "plurality" refers to at least two.
[0094] Any process or method description in a flowchart or otherwise described herein may be understood to represent a module, segment or portion of code that includes one or more executable instructions for implementing the steps of a specific logical function or process, and the scope of the preferred embodiments of the present invention includes alternative implementations in which functions may not be performed in the order shown or discussed, including performing functions in a substantially simultaneous manner or in the reverse order depending on the functions involved, which should be understood by those skilled in the art to which the embodiments of the present invention belong.
[0095] It should be understood that the various parts of the present invention can be implemented by hardware, software, firmware or a combination thereof. In the above-mentioned embodiments, a plurality of steps or methods can be implemented by software or firmware stored in a memory and executed by a suitable instruction execution device. For example, if implemented by hardware, as in another embodiment, it can be implemented by any one of the following technologies known in the art or their combination: a discrete logic circuit having a logic gate circuit for implementing a logic function for a data signal, a dedicated integrated circuit having a suitable combination of logic gate circuits, a programmable gate array (PGA), a field programmable gate array (FPGA), etc.
[0096] A person skilled in the art may understand that all or part of the steps in the method for implementing the above-mentioned embodiment may be completed by instructing related hardware through a program, and the corresponding program may be stored in a computer-readable storage medium, which, when executed, includes one of the steps of the method embodiment or a combination thereof.
[0097] In addition, each functional unit in each embodiment of the present invention may be integrated into a processing module, or each unit may exist physically separately, or two or more units may be integrated into one module. The above-mentioned integrated module may be implemented in the form of hardware or in the form of a software functional module. If the integrated module is implemented in the form of a software functional module and sold or used as an independent product, it may also be stored in a computer-readable storage medium.
[0098] The storage medium mentioned above can be a read-only memory, a magnetic disk or an optical disk, etc.
[0099] In the description of this specification, the description with reference to the terms "one embodiment", "some embodiments", "examples", "specific examples", or "some examples" means that the specific features, structures, materials or characteristics described in conjunction with the embodiment or example are included in at least one embodiment or example of the present invention. In this specification, the schematic representation of the above terms does not necessarily refer to the same embodiment or example. Moreover, the specific features, structures, materials or characteristics described may be combined in any one or more embodiments or examples in a suitable manner.
[0100] The method, device, processor and computer-readable storage medium of the present invention are used to implement tool path planning processing for a four-blade glass cutting machine. By implementing a multi-blade tool path planning strategy, the mechanical characteristics of the multi-blade are fully utilized, the processing efficiency is more efficient, and the application range is wide.
[0101] In this specification, the present invention has been described with reference to specific embodiments thereof. However, it is apparent that various modifications and variations may be made without departing from the spirit and scope of the present invention. Therefore, the specification and drawings should be regarded as illustrative rather than restrictive.
Claims
1. A method for implementing tool path planning for a glass four-head cutting machine, characterized in that: The method comprises the following steps: (1) Import metadata; (2) Input tool parameters; (3) Planning tool paths; (4) Output tool path file; (5) The CNC system loads and analyzes the machining files generated by CAM and performs machining.
2. The method for implementing tool path planning for a glass four-head cutting machine according to claim 1, characterized in that: The step (3) specifically comprises the following steps: (3.1) Sort the input graphics by Y axis and select graphics with consistent Y coordinates; (3.2) Find similar graphics; (3.3) Group similar graphics; (3.4) Assign tools to grouped graphics.
3. The method for implementing tool path planning for a glass four-head cutting machine according to claim 2, characterized in that: The step (3.3) specifically comprises the following steps: Group similar graphics and determine whether the spacing between graphics in the group is greater than or equal to the minimum spacing of the tool head. If so, proceed to step (3.4); otherwise, continue to group similar graphics.
4. The method for implementing tool path planning for a glass four-head cutting machine according to claim 2, characterized in that: The step (3.4) specifically comprises the following steps: (3.4.1) Filter the combinations that do not meet the minimum spacing between the tools; (3.4.2) Filter combinations with insufficient tool travel; (3.4.3) Calculate the tool's idle travel distance; (3.4.4) Calculate the tool idle travel distance, obtain the tool combination with the shortest tool idle travel distance, and assign tools to the grouped graphics.
5. The method for implementing tool path planning for a glass four-head cutting machine according to claim 4, characterized in that: The calculation of the tool idle travel distance in the step (3.4.4) is specifically as follows: The tool idle travel distance is calculated according to the following formula: Tool idle movement distance = the distance the machining tool moves from the current position to the starting point of the graphic + the distance the non-machining tool moves from the current position to the avoidance position.
6. A device for implementing tool path planning for a glass four-head cutting machine, characterized in that: The device comprises: a processor configured to execute computer executable instructions; A memory storing one or more computer executable instructions, wherein when the computer executable instructions are executed by the processor, each step of the method for implementing tool path planning processing for a glass four-blade cutting machine as described in any one of claims 1 to 5 is implemented.
7. A processor for implementing tool path planning for a glass four-head cutting machine, characterized in that: The processor is configured to execute computer executable instructions. When the computer executable instructions are executed by the processor, the various steps of the method for implementing tool path planning processing for a four-blade glass cutting machine described in any one of claims 1 to 5 are implemented.
8. A computer-readable storage medium, characterized in that: A computer program is stored thereon, and the computer program can be executed by a processor to implement the various steps of the method for implementing tool path planning processing for a glass four-blade cutting machine as described in any one of claims 1 to 5.
