Milling tool path generation method and system based on machining guide line offset

The method transforms tool path generation into a discrete path point access sequence using a simplified mesh model and machining guide lines, improving efficiency and reducing redundant cutting through reinforcement learning and multi-layer value simulation.

CN119087904AActive Publication Date: 2024-12-06HUAZHONG UNIV OF SCI & TECH +1
View PDF 3 Cites 0 Cited by

Patent Information

Application Number
CN202411159857.8
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-08-22
Publication Date
2024-12-06
Estimated Expiration
2044-08-22

AI Technical Summary

Technical Problem

Existing tool path generation methods for two-dimensional cavity milling tasks result in excessive redundant cutting, low machining efficiency, and complex calculations, particularly for complex parts.

Method used

A method and system that utilize a simplified mesh model to transform the tool path generation problem into a discrete path point access sequence, generating machining guide lines through reinforcement learning and multi-layer value simulation, and offsetting these lines to create an efficient tool path.

Benefits of technology

The method reduces redundant cutting and improves machining efficiency by generating a simplified mesh model that addresses the technical problem of complex calculations and redundant cutting, resulting in a simplified mesh model that addresses the technical problem of complex calculations and redundant cutting, enhancing the efficiency of tool path generation.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119087904A_ABST
    Figure CN119087904A_ABST
Patent Text Reader

Abstract

The invention belongs to the related technical field of numerical control machining, and discloses a milling tool path generation method and system based on machining guide line offset, and the method comprises the steps: S1, obtaining a simplified grid model of a to-be-machined part; s2, determining a to-be-processed area on the simplified grid model, and converting a tool path generation problem of the to-be-processed area into a tool path point access sequence problem; s3, solving a tool path point access sequence problem of the to-be-processed area, and generating a processing guide line; and S4, the machining guide line is subjected to offset, extension, cutting and connection treatment, an offset line is obtained, and the offset line serves as a moving line in the tool path of the to-be-machined part to generate the tool path. According to the method, the machining guide line is generated based on the optimal access sequence of the discrete path points, redundant cutting of the tool machining moving route generated based on the machining guide line is small, and the machining efficiency is high; and the generation efficiency of the tool path is relatively high.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention belongs to the technical field related to numerical control machining, and more specifically, relates to a method and system for generating a milling tool path based on machining guide line offset. Background Art

[0002] CNC technology and CNC machine tools are the foundation of the industrial revolution in the manufacturing industry. Most of the mechanical parts that are widely needed in actual engineering are 2.5D parts. At the same time, the processing of most complex parts can be completed by performing 2.5D rough machining on the blank and then 3D-5D finishing. Therefore, 2D cavity milling is the most commonly used type of CNC milling in the processing of ordinary parts. The tool path for complex cavity milling usually has different generation schemes. During the processing, different tool path generation schemes will affect the processing time and processing cost of the part. Therefore, in order to reduce processing costs and improve processing efficiency, it is necessary to design an efficient tool path generation scheme for the features to be processed of the part, especially the complex cavity milling features.

[0003] At present, for two-dimensional cavity milling tasks, common tool path generation methods include zigzag cutting mode and offset circular cutting mode. If these methods are used directly, the generated tool path has a large amount of redundant cutting, and the processing efficiency is low. In addition, for complex cavity milling pins, the existing tool path generation methods still have the problems of complex calculations and low path generation efficiency. In the actual manufacturing process, it is necessary to design the tool path according to the characteristics of the parts to be processed. Therefore, a more efficient tool path generation method is needed to make up for the shortcomings of the traditional method in terms of processing efficiency. Summary of the invention

[0004] In response to the above defects or improvement needs of the prior art, the present invention provides a method and system for generating a milling tool path based on machining guide line offset, which is used to solve the problem that for two-dimensional cavity milling tasks, the tool path generated by the existing tool path generation method has a large amount of redundant cutting, low machining efficiency, and the tool path generation method is complex in calculation and has low path generation efficiency. The method and system utilize a simplified mesh model of the part to be machined and design the tool path according to the characteristics of the part to be machined, with less redundant cutting and higher machining efficiency. At the same time, machining guide lines are generated based on the simplified mesh model, so that the path generation has lower calculation complexity and higher efficiency of tool path generation.

[0005] To achieve the above object, according to one aspect of the present invention, a method for generating a milling tool path based on machining guide line offset is provided, comprising:

[0006] S1, obtaining a simplified mesh model of a part to be processed, wherein the mesh side length of the simplified mesh model is greater than the cutting width of the tool;

[0007] S2, determining a region to be processed on the simplified grid model, taking a grid center point of the simplified grid model as a tool path point, and converting a tool path generation problem of the region to be processed into a tool path point access sequence problem;

[0008] S3, solving the problem of access sequence of tool path points in the area to be processed, obtaining the optimal access sequence of tool path points in the area to be processed, and generating a processing guide line;

[0009] S4, offset, extend, cut and connect the processing guide line to obtain an offset line, and use the offset line as a moving line in the tool path of the part to be processed to generate a tool path.

[0010] According to another aspect of the present invention, there is provided a milling tool path generation system based on machining guide line offset, comprising:

[0011] A mesh building module, used to obtain a simplified mesh model of the part to be processed, wherein the mesh side length of the simplified mesh model is greater than the cutting width of the tool;

[0012] A path point determination module is used to determine the area to be processed on the simplified grid model, take the grid center point of the simplified grid model as the tool path point, and transform the tool path generation problem of the area to be processed into a tool path point access sequence problem;

[0013] A guide line generation module is used to solve the problem of the access sequence of the tool path points in the area to be processed, obtain the optimal access sequence of the tool path points in the area to be processed, and generate a processing guide line;

[0014] The path generation module is used to offset, extend, cut and connect the processing guide line, obtain the offset line, and use the offset line as the moving line in the tool path of the part to be processed to generate the tool path.

[0015] In general, compared with the prior art, the above technical solutions conceived by the present invention provide a method and system for generating a milling tool path based on machining guide line offset:

[0016] 1. It is proposed to transform the tool path generation problem into the problem of solving the access order of discrete path points by establishing a simplified grid model, and use the optimal access order of discrete path points as the processing guide line, so that the processing guide line has fewer repeated path point access processes, and the tool processing movement route generated based on the processing guide line has less redundant cutting and higher processing efficiency;

[0017] 2. It is proposed to calculate and generate the machining guide line first, and then obtain the offset line through the offset, extension, cutting and connection of the machining guide line. The offset line expands the machining range on the basis of the machining guide line, and can achieve effective cutting of the area to be processed. At the same time, the machining guide line is generated based on the simplified mesh model. Since the mesh side length of the simplified mesh model is large and the number of mesh center points is small, the calculation process of generating the machining guide line is relatively simple. This method has low computational complexity and high efficiency of tool path generation.

[0018] 3. Combined with the reinforcement learning method to solve and generate machining guide lines, the machining guide lines can be generated autonomously according to the characteristics of the parts to be processed, and the final tool path is generated based on the machining guide line offset. The path generation process can reduce manual dependence and improve the degree of intelligence while ensuring the processing quality;

[0019] 4. An improved version of the Monte Carlo method, namely the multi-layer value simulation algorithm, is used to solve the tool path generation problem. This method can quickly and accurately calculate the value of a state, thereby guiding the intelligent agent to complete the reinforcement learning task; compared with the Monte Carlo algorithm and the temporal difference algorithm, this method avoids the instability caused by random sampling; compared with the dynamic programming algorithm, this method reduces the calculation of the value of states that will not appear in the processing process; and this method does not store a large amount of state value, does not require a large amount of memory space and complex search operations on the environment. BRIEF DESCRIPTION OF THE DRAWINGS

[0020] Figure 1 It is a flow chart of a method for generating a milling tool path based on machining guide line offset provided by the present invention;

[0021] Figure 2 It is the overall flow chart of the method of the present invention;

[0022] Figure 3 It is a schematic diagram of a grid conversion process during the implementation of the present invention;

[0023] Figure 4 It is a schematic diagram of a small-scale grid model generated by merging grids during the implementation of the present invention;

[0024] Figure 5 It is a schematic diagram of generating a processing guide line during the implementation of the present invention;

[0025] Figure 6 It is a schematic diagram of processing guide line offset, connection and cutting during the implementation of the present invention;

[0026] Figure 7 It is a schematic diagram of extending the tool path during the implementation of the present invention;

[0027] Figure 8It is a schematic diagram of tool path connection during the implementation of the present invention;

[0028] Fig. 9 It is a schematic diagram of numerical control machining program generation during the implementation of the present invention;

[0029] Fig.10 It is a simulation case diagram during the implementation of the present invention;

[0030] Fig.11 It is a diagram of simulation experiment results during the implementation of the present invention. DETAILED DESCRIPTION

[0031] In order to make the purpose, technical solutions and advantages of the present invention more clearly understood, the present invention is further described in detail below in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are only used to explain the present invention and are not intended to limit the present invention. In addition, the technical features involved in the various embodiments of the present invention described below can be combined with each other as long as they do not conflict with each other.

[0032] See also Figure 1 , this embodiment 1 provides a method for generating a milling tool path based on machining guide line offset, the method comprising:

[0033] S1, obtaining a simplified mesh model of a part to be processed, wherein the mesh side length of the simplified mesh model is greater than the cutting width of the tool;

[0034] S2, determining a region to be processed on the simplified grid model, taking a grid center point of the simplified grid model as a tool path point, and converting a tool path generation problem of the region to be processed into a tool path point access sequence problem;

[0035] S3, solving the problem of access sequence of tool path points in the area to be processed, obtaining the optimal access sequence of tool path points in the area to be processed, and generating a processing guide line;

[0036] S4, offset, extend, cut and connect the processing guide line to obtain an offset line, and use the offset line as a moving line in the tool path of the part to be processed to generate a tool path.

[0037] This embodiment establishes a simplified mesh model of the part to be processed. Since the mesh side length of the simplified mesh model is relatively large and greater than the cutting width, the mesh center points of the simplified mesh model are relatively few. After the simplified mesh model is established, the corresponding area to be processed on the simplified mesh model is determined according to the characteristics of the part to be processed. Therefore, the tool path generation problem of the area to be processed is the discrete path point access order problem of the mesh center points corresponding to the area to be processed. There are usually multiple existing algorithms to solve the discrete node access order problem. By solving the problem, the optimal access order of the tool path points corresponding to the area to be processed is obtained, and the optimal access order can be the processing guide line.

[0038] The machining guide line is not the final tool movement route, but it can guide the tool movement route. Based on the machining guide line, the offset line can be obtained through offset, extension, cutting and connection processing. The offset line is located on the side of the machining guide line and is consistent with the direction trend of the machining guide line. The offset line obtained through the machining guide line offset, extension, cutting and connection processing can more comprehensively cover the area to be processed, and finally achieve effective milling of the area to be processed.

[0039] Figure 2 The overall flow chart of an embodiment of the present invention is shown. This embodiment first divides the three-dimensional part into several layers by layered milling, and discretizes each layer into a square grid plane, that is, obtains the initial grid model, that is, the part to be processed is represented by the initial grid model; then, through a convolution-like operation, the features of adjacent grids in the grid plane are merged into one feature, and a small-scale grid model of the target part, that is, a simplified grid model, is obtained, thereby converting the machining guide line generation problem into a reinforcement learning task on a small-scale grid plane; then, according to the process requirements of the CNC milling process, an MDP model of the part machining guide line generation task is established based on the small-scale grid model; then, the multi-layer value simulation method is used to simulate the process of the part machining guide line generation task. The reinforcement learning task is solved by the method to obtain the decision sequence of the intelligent agent, thereby obtaining the processing guide line of the part; then the generated processing guide line is mapped to the initial mesh model of the target part, and the processing guide line is offset to both sides of it by segmented offset to remove the material on both sides of the processing guide line, and the curve generated by the offset is extended and trimmed to obtain a smooth and connected equidistant offset curve to generate the moving line in the tool path; finally, the optimal traversal sequence of the tool between different moving lines is solved, and the connecting line between the tool feed points is generated to minimize the non-cutting moving distance between the tool feed points, thereby obtaining the final milling tool path. For example, the problem of the tool lift and feed sequence can be abstracted as a TSP problem and solved by a dynamic programming algorithm.

[0040] The entire implementation process is as follows:

[0041] 1. Divide the three-dimensional part into several layers by layered milling, and discretize each layer into a square grid plane to obtain the initial grid model of the part. Through a convolution-like operation, merge the features of adjacent grids in the grid plane into one feature to obtain a small-scale grid model of the target part, i.e., a simplified grid model. The process of grid conversion is as follows: Figure 3 As shown in the figure, for a given part milling task, it is first necessary to distinguish between the area to be processed and the non-processing area, determine the part contour according to the machining allowance Δ and the tool radius R, and divide the part contour into an outer contour and an inner contour. The closed area between them is the area to be processed, and the area outside is the non-processing area.

[0042] Then, according to the part size and cutting width, an empty grid area, i.e., the initial grid model, is constructed, where the side length of each sub-square grid is equal to the cutting width, and the cutting width is equal to the tool diameter. Next, the part features are mapped to the empty grid area, and the grids contained in the area to be processed are the grids to be processed, and the grids outside are non-processing grids. Tool path points are constructed based on the grids to be processed to obtain the grid model of the part. Next, the features of adjacent grids in the initial grid model of the part are merged, for example Figure 3 The two pictures in the middle and lower parts and Figure 4 As shown, four adjacent grids are merged into one grid. When all grids in the four adjacent grids are cutting points, the merged grid is a cutting point, otherwise the merged grid is a non-cutting point. That is, when the four adjacent grids are all contained in the area to be processed, the merged grid is the grid to be cut, and the center point of the grid is the tool path point.

[0043] By reducing the size of the initial mesh model by merging mesh features, the amount of computation required for the path access order problem can be greatly reduced. The small-scale mesh model obtained after merging, i.e., the simplified mesh model, retains most of the features of the target part, but its accuracy in representing the part is low. The path generated by solving the small-scale mesh model can reflect the approximate movement direction of the tool to a certain extent, and can be used as a machining guide line in the tool path generation process.

[0044] That is, S1 specifically includes: obtaining an initial mesh model of the part to be processed, wherein the mesh side length of the initial mesh model is equal to the cutting width of the tool; and merging a plurality of meshes in the initial mesh model into a group to obtain the simplified mesh model.

[0045] And S1 specifically includes: dividing the to-be-processed part into a plurality of to-be-processed layers by layered milling; obtaining the simplified mesh model of any of the to-be-processed layers;

[0046] Correspondingly, S2 specifically includes: determining the contour line of any of the layers to be processed according to the preset processing allowance and the tool radius, and determining the area to be processed of any of the layers to be processed based on the contour line; taking the center point of the grid of the simplified grid model contained in the area to be processed as the tool path point, and converting the tool path generation problem of any of the layers to be processed into a tool path point access sequence problem on the grid plane.

[0047] exist Figure 3 In the illustrated embodiment, the part contour is divided into an outer contour and an inner contour, and the enclosed area between them is the area to be processed. The outer contour is formed by the outer boundary of the part being retracted inward, and the amount of retraction is the sum of the machining allowance Δ and the tool radius R; the inner contour is formed by the inner boundary of the part being expanded outward, and the amount of expansion is the sum of the machining allowance Δ and the tool radius R. In other embodiments, the part contour may also include only the inner contour or the outer contour, which is not specifically limited.

[0048] 2. In this embodiment, S3 specifically includes: S31, converting the tool path point access sequence problem of the area to be processed into a reinforcement learning task, and establishing a Markov decision process model (MDP model) of the reinforcement learning task, wherein the intelligent agent in the MDP model is the tool, and the environment is the state of the grid center point in the simplified grid model. The state space of the tool in the environment and the corresponding action space are defined, and an immediate reward function for the tool action is set. After the tool performs an action in the action space corresponding to the state space, the environment and the state space change and a corresponding immediate reward value can be obtained according to the immediate reward function; S32, solving the MDP model based on the immediate reward value of the tool action to generate the processing guide line.

[0049] Specifically, according to the technological requirements of CNC milling process, an MDP model of part machining guide line generation task is established based on a small-scale mesh model, namely a simplified mesh model.

[0050] The MDP model mainly consists of the following parts:

[0051] (1) Agent and environment. The tool used to process a given part corresponds to the agent of the MDP model, and the part features and processing area represented by the plane grid in the simplified grid model correspond to the environment of the MDP model. That is, in this embodiment, the environment is the state of the grid center points of the part area and the area to be processed in the simplified grid model. Since there is only one element in the environment, namely the discrete tool path point, a feature matrix M can be created to represent the current state of the environment. The elements in the feature matrix correspond to the grid center points in the environment, and different numerical values ​​represent different states of the grid center points in the environment. For example, 0 represents a cut path point, that is, an area where cutting has been completed, 1 represents an uncut path point, that is, an area where cutting has not been completed, and -1 represents a non-processing path point, that is, an area that cannot be cut. The values ​​of the elements in the feature matrix are continuously updated as the agent interacts with the environment.

[0052] (2) State space and action space. The state of the tool not only includes information such as the position and direction of movement of the tool, but also includes the state information of the surrounding environment. The state space S of the tool in the environment is defined as:

[0053] S=[d,s0,s1,s2,s3,s4,s5,s6,s7,x,y];

[0054] In the formula, d represents the current moving direction of the tool, ranging from 0 to 7, where 0 to 7 represent the eight adjacent directions of a clockwise rotation from the top; s 0~7 Represents the environmental state information in eight adjacent directions around the discrete tool path point where the tool is located, s 0~7 The environmental state information of the eight adjacent directions of the discrete tool path point where the tool is located is rotated clockwise from the top; x and y represent the horizontal and vertical coordinates of the discrete tool path point where the tool is located. The action space A of the tool is defined as:

[0055] A=[0,1,2,3,4,5,6,7,8];

[0056] In the formula, 0 to 7 represent the movement from the current tool path point to the adjacent tool path points in 8 directions; 8 represents the tool lifting and feeding action. In order to reduce the number of tool lifting and feeding, the tool is restricted to lift and feed only when there are no adjacent uncut path points in the 8 directions of the current tool path point, and select an uncut path point and a direction with uncut path points for feeding. At the same time, in order to reduce the search space of the intelligent agent, the action space of some special states should be processed. For example, when the tool is located at the boundary path point of the area to be processed, some actions will cause the tool to overcut and cause the part processing to fail. Therefore, the inoperable actions are excluded in the action space of these states to obtain its operable action space.

[0057] (3) Instant reward function. The agent's instant reward function R(s,a) consists of three types of reward functions: the reward function for feed direction change, the reward function for tool lift and feed, and the reward function for tool movement. It is the sum of the three reward functions and is used to ensure the smoothness and continuity of the machining guide line and reduce the redundant path of the machining guide line. The reward function for feed direction change and tool movement is designed to generate a tool path that meets the geometric process requirements and ensure the smoothness and continuity of the tool path. The reward function for tool lift and feed is designed to reduce the tool's idle stroke, shorten the total length of the tool path, and improve machining efficiency. When the agent is in any state, the instant reward value that can be obtained by all actions in its movable action space can be calculated through the instant reward function. Although the instant reward value does not directly determine the agent's decision, it can reflect the instant benefit of a certain action to a certain extent and has a certain guiding role in the agent's decision.

[0058] In order to accurately represent the impact of different feed direction changes on machining efficiency in the instant reward function, the reward function of feed direction change is obtained in the following way: a machining experiment is conducted to measure the time cost of feed direction change caused by different feed direction angle changes at different feed speeds, and the measurement results are shown in Table 1; a binary polynomial is fitted to the experimental data to obtain the relationship between the time cost of feed direction change and the feed direction angle change and feed speed; based on this relationship, the reward function of feed direction change is obtained. The time cost of feed direction change is the difference between the machining time when the feed direction changes and the machining time when the feed direction remains unchanged.

[0059] The processing experiment can be specifically as follows: at any feed speed, multiple groups of processing experiments with different feed direction angle changes are carried out and compared with the comparison experiment with the feed direction angle unchanged; wherein, the total length of the processing paths in the multiple groups of processing experiments and the comparison experiment is the same, and the feed direction in any group of processing experiments with the feed direction angle change can be changed at least once according to the same angle, so that the difference between the processing time measured by the processing experiment of any group of processing experiments with the feed direction angle change and the processing time measured by the comparison experiment, divided by the number of angle changes, is the time cost when the feed direction change is the angle change in the experiment at the given feed speed of the experiment.

[0060] According to the experimental data of the time cost caused by different feed speeds under the same feed direction angle change, it can be seen that when the angle of the feed direction change is constant, the time cost and the feed speed are approximately in a linear function relationship. According to the experimental data of the time cost caused by different feed direction angle changes under the same feed speed, it can be seen that when the feed speed is constant, the time cost of the feed direction change and the angle of the feed direction change are approximately in a quadratic function relationship. Therefore, the following formula can be used to fit the time cost f(v,ω), where v represents the feed speed and ω represents the feed direction angle change.

[0061] f(v,ω)=p 00 +p 10 v+p 01 ω+p 11 vω+p 02 ω 2 ;

[0062] According to the experimental data fitting results, the coefficients in the formula are:

[0063] p 00 =-3.684(-6.326,-1.041);

[0064] p 10 =0.002091(0.0008873,0.003295);

[0065] p 01 =-0.08314(-0.1272,-0.03907);

[0066] p 11 =9.615e -5 (8.48e -5 ,0.0001075);

[0067] p 02 =0.00063(0.0004209,0.0008391);

[0068] Table 1 Experimental data of time cost (ms) at different feed speeds (mm / min) and feed direction change angles (°)

[0069]

[0070]

[0071] The reward function R1(s,a) for changing the feed direction gives the agent, i.e. the tool, a certain penalty (negative reward value) according to the angle of the feed direction change, limiting the number and angle of the tool feed direction change, and is defined as follows:

[0072] R1(s,a)=-0.1*f(v,ω);

[0073] Assuming that during the milling process, the feed rate of the tool is constant at 2000 mm / min, then R1(s,a) can be defined as follows:

[0074]

[0075] Wherein, Angle(s,a) is the angle between the current feed direction and the next feed direction, and its value range is [0°,180°].

[0076] The reward function R2(s,a) of the tool lifting and feeding action gives the tool a negative reward value according to the tool lifting and feeding to limit the number of times the tool lifts and feeds, that is, gives the tool lifting and feeding a larger negative reward value, which is defined as follows:

[0077]

[0078] The reward function R3(s,a) of tool movement is: when the tool performs effective cutting, a positive reward value is given to the tool to guide the tool to continuously perform effective cutting; when the tool movement produces an empty stroke, a negative reward value is given to the tool to reduce the empty stroke of the tool. The definition is as follows:

[0079]

[0080] The agent's final immediate reward function is composed of the above three types of reward functions, defined as follows:

[0081] R(s,a)=R1(s,a)+R2(s,a)+R3(s,a).

[0082] (4) State transition probability and termination state. Since the present embodiment does not consider the influence of machine tool errors, the state transition probability is always 1, that is, given a certain state and action, the immediate reward, next state and whether to terminate the environment given by the environment are determined. A path completion reward value can also be set. When the agent has traversed all tool path points, that is, when all element values ​​in the feature matrix M are less than or equal to 0, it means that the milling task of the given part is completed, the interaction process should be ended, and a larger reward value, such as 10, should be given to the agent. The maximum number of decisions of the agent can also be set to avoid meaningless exploration by the agent. For example, the maximum number of decisions can be twice the number of all tool path points in the environment. When the number of decisions of the agent is greater than twice the number of all tool path points in the environment, if the agent has not traversed all tool path points at this time, this round of exploration should be ended in advance to prevent the agent from falling into an infinite loop during the interaction with the environment.

[0083] 3. In this embodiment, S32 specifically includes: using a multi-layer value simulation algorithm to solve the MDP model of the reinforcement learning task, obtaining the decision sequence of the intelligent agent, and thus obtaining the processing guide line, such as Figure 5 As shown in the figure. Due to the setting of the immediate reward function, the agent is prompted to give priority to actions with fewer turns, less redundant cutting, and less tool lifting; at the same time, when there are no tool path points to be cut among the 8 adjacent tool path points of the agent, the agent will perform a tool lifting action and find a tool path point that has not been cut as the new tool position. The above two points make it possible for the agent to perform effective cutting in most cases in the strategy determined by the immediate reward, and to provide a path that traverses all tool path points.

[0084] Specifically, when the tool is in any state, the state value of the state is calculated according to the sum of the instant reward values ​​of all actions on the tool path formed from the state as the starting point; t At the beginning, the strategy of determining the action with the immediate reward value is simulated, and the state value V(s t )for:

[0085]

[0086] Among them, V(s t ) indicates state s t The state value of Indicates state s t The tool path based on which the state value is calculated is the tool path determined by the instant reward value simulation, that is, the strategy of determining the action by the instant reward value is simulated. t is the instantaneous reward value obtained by the agent's interaction with the environment at time t, γ is the reward discount factor, and π i Represents a strategy for determining actions based on immediate reward values:

[0087]

[0088] Among them, R(s t ,a t ) indicates state s t Next, perform action a t The instant reward value that can be obtained.

[0089] However, this path only determines the action strategy based on the immediate reward value (π i ) is not an excellent tool path, and its machining efficiency may be relatively low, but the strategy of determining the action based on the immediate reward value (π i ) The value of the state generated by the simulation can reflect the optimal strategy π to a certain extent * The status value.

[0090] In order to obtain the optimal strategy π * The state value is determined by using a multi-layer value simulation algorithm. The action value of the tool performing any action in the current state is defined as the sum of the immediate reward value of the action and the state value of the next layer of sub-states corresponding to the execution of the action from the current state; the first layer of sub-states of the current state is the state set after executing one actionable action from the current state. In this algorithm, when determining the action of a state, a greedy strategy is used to select the action with the largest action value in the next layer of sub-states:

[0091]

[0092] Among them, π g represents a strategy of selecting the action with the largest action value according to the greedy algorithm, Q(s t ,a t ) indicates state s t Next, perform action a t Calculate the action value of each actionable action, which is all actions in the actionable action space of the current state, and then use the greedy algorithm to select the action with the highest action value. For example, action 5 is an actionable action in the current state, that is, the state after action 5 is a state in the first layer of sub-states of the current state. It is necessary to calculate the state value of the state after action 5, and then calculate the immediate reward value of action 5, and then obtain the action value of action 5. The current state selects the next action according to the action value of each actionable action.

[0093] There are two ways to calculate the state value V(s) of the first layer sub-state: t+1 ), the first is the strategy to determine the action based on the immediate reward value (π i ) is simulated, that is, starting from the first layer of sub-states, the action strategy with the largest immediate reward value is selected for each step to obtain the simulation path; then the sum of the immediate reward values ​​of all actions is calculated based on the simulated path. The state value determination strategy of this sub-state is the strategy for determining the action according to the immediate reward value (π i ). Starting from the first layer of sub-states, the action strategy is determined according to the immediate reward value (π i ) to simulate and guide the agent to complete the environmental task, thereby obtaining the state value of the first-level sub-state, as shown in the following formula:

[0094]

[0095] The state value V(s) of the first layer sub-state t+1 ) The strategy for determining actions based on immediate rewards (π i ) is used for simulation, which is the multi-layer value simulation algorithm when m=1.

[0096] The second solution is to follow the greedy strategy again (π g ) selects the action with the largest action value in turn and guides the agent to simulate until the agent completes the environment task, thereby obtaining the state value of the first-level sub-state, as shown in the following formula:

[0097]

[0098] In the second scheme, it is necessary to calculate the state value V(s) of the next layer of sub-states in any state when starting the path simulation from the first layer of sub-states. t+2 ), the next layer of sub-states is the state corresponding to the execution of one step of action in any state. Similar to the first layer of sub-states, two different strategies can also be used to calculate the state value of the next layer of sub-states of any state in the first layer of sub-state path simulation. The first strategy is to use the immediate reward value to determine the action strategy (π i ), that is, the strategy of selecting the maximum immediate reward value to determine the action (π i ) is used to simulate the path to calculate the state value of the next layer of sub-states of any state in the first layer of sub-state path simulation, and then simulate according to the state value of the next layer of sub-states, so as to obtain the state value of the first layer of sub-states. When determining the state value of the next layer of sub-states of any state in the first layer of sub-state path simulation, the tool path is determined by simulating the immediate reward value from the sub-state, and then the tool path is obtained based on the simulated path calculation, that is, the state value determination strategy of the next layer of sub-states of any state in the first layer of sub-state path simulation is the strategy of determining the action according to the immediate reward value (π i ). This scheme is also the multi-layer value simulation algorithm when m=2.

[0099] The second strategy is to use the greedy strategy again (π g ) selects the action with the largest action value, but this requires calculating the state value of the next layer of sub-states of any state in the next layer of sub-state path simulation corresponding to any state in the first layer of sub-state path simulation.

[0100] The above is the main process of the multi-layer value simulation algorithm. Multi-layer refers to starting from a certain layer of sub-state and using the immediate reward value to determine the action strategy (π i ) simulates the path to calculate the value. That is, the m-layer value simulation algorithm is:

[0101] When m=0, the action with the largest immediate reward value is selected from the starting state to form the tool path, that is, in the current state, the action with the largest immediate reward value is directly executed;

[0102] When m=1, the action with the largest action value in the current state is selected in sequence from the starting state to form a tool path, wherein the action value of the action in the current state is calculated based on the state value of the first-level sub-state of the current state, and the tool path based on which the state value of the first-level sub-state of the current state is calculated is the tool path determined by simulation using the immediate reward value;

[0103] When m=n (n>1), the actions with the largest action value in the current state are selected in sequence from the starting state to form a tool path, wherein the action value of the action in the current state is calculated based on the state value of the first-level sub-state of the current state, and the tool path used for calculating the state value of the first-level sub-state of the current state is the tool path determined by solving the n-1-level value simulation algorithm, and any action in the tool path corresponding to the state value of the first-level sub-state of the current state is selected based on the action value, and the tool path used for calculating the state value of the next-level sub-state on which any action is based is the tool path determined by solving the n-2-level value simulation algorithm, and this process is repeated recursively until the tool path used for calculating the state value of the sub-state is the tool path determined by solving the 0-level value simulation algorithm, that is, the tool path determined by simulation using the immediate reward value.

[0104] Specifically, let m=2. At this time, the two-layer value simulation algorithm is as follows:

[0105] From the starting state, the actions with the largest action value in the current state are selected in sequence to form a tool path, wherein the tool path based on which the state value of the first-level sub-state of the current state is calculated is the tool path determined by solving the 1-level value simulation algorithm, and any action in the tool path corresponding to the state value of the first-level sub-state of the current state is selected based on the action value, and the tool path based on which the state value of the next-level sub-state on which any action is selected is the tool path determined by solving the 0-level value simulation algorithm, that is, the tool path determined by simulation using the immediate reward value.

[0106] Optionally, considering the calculation accuracy and calculation efficiency, m=2 is set, that is, a two-layer value simulation algorithm is used to solve the MDP model to obtain the decision sequence of the intelligent agent, thereby generating the processing guide line. The pseudo code of the multi-layer value simulation algorithm with m=2 is shown in the following table. In order to obtain accurate state value during simulation, future reward value must be taken seriously, so the reward discount factor γ is set to 1.0.

[0107]

[0108]

[0109] The milling tool path generation method based on machining guide line offset proposed in this embodiment, through combination with reinforcement learning, deeply considers the factors affecting the machining efficiency in the machining process when generating machining guide lines. The tool can choose a reasonable movement direction based on the current state of the milling workpiece and the movement state of the tool, so the generated machining guide line has fewer redundant paths. The tool path generated based on the machining guide line offset has less redundant cutting and higher machining efficiency. The multi-layer value simulation method is used to calculate the machining guide lines of the parts to be processed. When using the multi-layer value simulation method, a small-scale grid model, that is, a simplified grid model, is used. The number of grids is small, so the calculation amount is small and the calculation efficiency is high.

[0110] In other embodiments, other methods may also be used to solve the problem of accessing the tool path points in the area to be processed in order to generate processing guide lines, such as using genetic algorithms, ant colony algorithms, etc. Using genetic algorithms, ant colony algorithms, etc. to solve the problem of accessing discrete path points is a common application of the algorithm, and the specific calculation process will not be repeated here.

[0111] 4. In this embodiment, S4 specifically includes: mapping the processing guide line to the initial grid model, offsetting, extending, cutting and connecting the processing guide line at least once, so that the offset line and the processing guide line cover all grids of the area to be processed corresponding to the initial grid model. That is, the processing guide line is placed in the initial grid model according to the path point coordinates, and the center point of the grid contained in the area to be processed in the initial grid model is the tool path point corresponding to the initial grid model. By setting the offset spacing of the processing guide line and the number of offset processing, the processing guide line and the offset line can finally pass through all tool path points corresponding to the initial grid model, that is, cover all grids of the area to be processed corresponding to the initial grid model. At the same time, due to the setting of the grid side length of the initial grid model, when the tool passes through all tool path points corresponding to the initial grid model, the complete effective milling of the area to be processed can be completed.

[0112] Optionally, the mesh side length of the simplified mesh model is N times the tool cutting width, where N is an integer greater than or equal to 2. Thus, by performing at least one offset, extension, clipping and connection processing on the processing guide line, the processing guide line and the deflection line circuit can cover all the meshes of the to-be-processed area corresponding to the initial mesh model, thereby being able to complete the fully effective milling of the processing area. Perform at least one offset, extension, clipping and connection processing on the processing guide line, that is, first perform an offset, extension, clipping and connection processing on the processing guide line once to obtain the offset circuit corresponding to the processing guide line, then perform an offset, extension, clipping and connection processing on the offset circuit corresponding to the processing guide line again to obtain the offset circuit again, and so on.

[0113] Furthermore, obtaining the bias line in S4 specifically includes: using a segmented offset method to equidistantly offset the processing guide line to both sides, forming bias line segments on both sides; connecting the bias line segments on either side at the disconnected parts, cutting them at the intersecting parts, and extending them at the end points, and then connecting the end points of the bias line segments on both sides to obtain the continuous bias line.

[0114] Taking the simplified mesh model with a mesh side length of twice the tool cutting width, that is, merging four adjacent meshes in the initial mesh model into a group to form a simplified mesh model as an example, the generated machining guide line is mapped to the initial mesh model, and the machining guide line is offset to both sides of it by equidistant offset using the segmented offset method to remove the material on both sides of the machining guide line. Figure 6 As shown, Figure 6 The first figure is the machining guide line mapped to the initial mesh model, and the second figure is a schematic diagram of the offset line segment formed by the machining guide line offset to both sides. When performing equal-distance offset at the corner of the machining guide line, the curves will be separated and intersected. Therefore, the separated curves in the line segment generated by the equal-distance offset are connected in the form of broken line segments, and the intersecting curves are cut to obtain a smooth connected equal-distance offset curve, as shown in the figure. Figure 6 As shown in the third figure. The equidistant offset line generated by machining guide line offset will have uncut grids at the start and end points of the machining guide line, such as Figure 7 As shown. Therefore, the start and end points of the generated equidistant offset line are extended to ensure that all machining grids are cut by the tool. At the same time, the end point of the first offset line is connected to the end point of the second offset line, and the two generated offset lines are connected into a tool path. The two paths generated by the same continuous tool path offset can be connected because the end points of the two paths generated by the same continuous tool path offset are very close. After being connected, it is equivalent to starting from the start point of one offset line and returning to the start point of another offset line.

[0115] Figure 6 and Figure 7 In the illustrated embodiment, the grid side length of the simplified grid model may be an even multiple of the tool cutting width. When the grid side length of the simplified grid model is an even multiple of the tool cutting width, since the grid center point of the simplified grid model is located on the grid edge of the initial grid model, the machining guide line does not pass through the grid center point of the initial grid model. Therefore, the machining guide line may be offset processed at least once so that the offset line passes through all tool path points of the initial grid model. At the same time, the machining guide line is deleted, and the offset line passing through the grid center point of the initial grid model is used as the moving line in the tool path.

[0116] In other embodiments, the grid side length of the simplified grid model may also be an odd multiple of the tool cutting width. When the grid side length of the simplified grid model is an odd multiple of the tool cutting width, since the grid center point of the simplified grid model coincides with the grid center point of the initial grid model, the processing guide line passes through the grid center point of the initial grid model. Therefore, the processing guide line can be offset so that the offset line and the processing guide line pass through all tool path points of the initial grid model. At this time, the processing guide line and the offset line passing through the grid center point of the initial grid model can be used as the moving line in the tool path at the same time.

[0117] It can be seen that no matter whether the grid side length of the simplified grid model is an even multiple or an odd multiple of the cutting width, the offset spacing of the processing guide line and the number of offset processing times can be adjusted to achieve the offset line and / or processing guide line covering the center points of all grids in the area to be processed corresponding to the initial grid model, that is, a complete and effective tool path can be generated based on the processing guide line through the offset method. Therefore, this embodiment does not limit the specific setting of the side length of the simplified grid model.

[0118] Furthermore, in the reinforcement learning environment, the non-cutting area is represented as a discrete grid, and the discrete grid cannot accurately represent the boundary of the workpiece. Therefore, an additional tool path is generated using the boundary line of the workpiece to process the boundary area of ​​the workpiece. That is, generating the tool path in S4 also includes: using the contour line as the moving line in the tool path of the part to be processed to generate the tool path. The tool can process the boundary of the part to be processed along the contour line. The contour line may include an inner contour and / or an outer contour, which is set according to the characteristics of the part to be processed and is not specifically limited.

[0119] 5. In this embodiment, generating a tool path in S4 also includes: establishing a set of tool entry points on multiple moving routes based on the moving route in the tool path of the part to be processed; solving and obtaining the optimal traversal order of the tool entry point set with the purpose of minimizing the total moving distance of the traversal of the tool entry point set as the processing order of the tool between multiple moving routes, and then obtaining the final tool path. For example, the optimal traversal order of the tool can be solved by a dynamic programming algorithm to generate a connection line between the tool entry points. The purpose of the tool path connection is to determine the optimal traversal order of the tool so that the non-cutting moving distance of the tool between the entry points is minimized.

[0120] Furthermore, in order to simplify the problem of solving the optimal traversal order of the tool between different moving routes, the side length of the simplified mesh model can be set to 2 times the cutting width. Mtimes, M is an integer greater than or equal to 1. At this time, the machining guide line does not constitute a moving line in the tool path. The moving line in the tool path of the part to be machined is composed of at least one offset line generated by the offset and multiple lines in the inner and outer contours of the part to be machined. These tool moving lines are not directly connected, so it is necessary to use jump lines to connect the lift points and feed points of the unconnected tool moving lines to form a complete milling tool path. The inner and outer contours of the target part are closed curves, so their feed points and lift points will coincide. Although the lift points and feed points of the offset line generated by the machining guide line offset do not coincide, they are close to each other, such as Figure 8 As shown in (a) in the figure, they are considered to be the same point.

[0121] On this basis, a set of tool entry points on multiple moving routes is established. The set of tool entry points is specifically composed of multiple starting points corresponding to multiple moving routes. The tool path connection problem can be described as: in a series of discrete entry points (node1, node2, ..., node n ) to determine the traversal order of the tool Make the non-cutting moving distance of the tool between these entry points as short as possible. Figure 8 In the embodiment shown in (b), there are four feed points: node1, node2, node3 and node4. The distances between these points can be obtained by calculating the Euclidean distance. Assume that there is a starting point S, and the distances between it and all feed points are 0. The purpose of tool path connection is to determine the optimal traversal order of the tool so that the non-cutting movement distance between the feed points is minimized.

[0122] This problem can actually be transformed into solving the shortest loop that traverses each feed point once and returns to the starting point S. This is a typical TSP problem. The reward function designed when solving the machining guide line restricts the tool lifting and feeding behavior, reducing the number of tool lifting and feeding times. Therefore, the number of nodes in this TSP problem is small, and the optimal traversal order of the tool can be found using the dynamic programming algorithm. Finally, the tool path consists of three parts: the moving line generated based on the machining guide line offset, the inner and outer contours of the part, and the tool path connecting lines. The obtained tool path and its connecting lines are converted into machining G code to generate a CNC machining program, such as Fig. 9 shown.

[0123] 6. Beneficial effects of this embodiment: To verify the effectiveness of the milling tool path generation method based on machining guide line offset proposed in this embodiment, the following example is used: Fig.10The cavity workpiece shown in the figure is subjected to simulation experiments, and the simulation experiment parameters are shown in Table 2. First, the part is layered by layered milling, and each layer is converted into a mesh model; then, the mesh model of each layer is used to generate machining guide lines, and the generated machining guide lines are offset to generate tool paths; finally, the tool paths generated by each layer are post-processed to obtain the NC machining program of the part.

[0124] The tool paths generated by the method proposed in this embodiment are compared with the tool paths generated by the three commonly used cutting modes (reciprocating, following parts, and following periphery) in NX to prove the effectiveness and advancement of the method proposed in this embodiment. The tool paths generated by the four methods are simulated in the cutting simulation software CIMCO Edit 8.02.23. The cutting results are shown in Figure 2. Fig.11 As shown, Fig.11 Among them, (a) represents the tool path generation method for complex cavity milling based on machining guide line offset, (b) represents the NX reciprocating cutting mode, (c) represents the NX follow-part cutting mode, and (d) represents the NX follow-peripheral cutting mode. It can be observed that the tool paths generated by the four methods can all complete the milling of the target parts. The cutting simulation software CIMCO Edit 8.02.23 was used to count the machining time, cutting time, trajectory length and cutting distance of the tool paths generated by different methods. The statistical results are shown in Table 3, where the improvement ratio is calculated based on the machining time. It can be seen that, while keeping the cutting conditions such as part model, machining allowance, feed speed, cutting width, tool diameter, etc. consistent, the tool path generated by the tool path generation method for complex cavity milling based on machining guide line offset proposed in this embodiment has a shorter cutting distance and trajectory length, less redundant cutting, and higher machining efficiency.

[0125] Table 2 Simulation experiment parameters

[0126]

[0127] Table 3 Simulation results

[0128]

[0129] Furthermore, the second embodiment of the present invention provides a milling tool path generation system based on machining guide line offset, the system is used to implement any of the methods described above, the system can be understood by reference to the above methods, the system includes: a grid establishment module, used to obtain a simplified grid model of the part to be processed, the grid side length of the simplified grid model is greater than the cutting width of the tool; a path point determination module, used to determine the area to be processed on the simplified grid model, using the grid center point of the simplified grid model as the tool path point, and converting the tool path generation problem of the area to be processed into a tool path point access sequence problem; a guide line generation module, used to solve the tool path point access sequence problem of the area to be processed, obtain the optimal access sequence of the tool path points of the area to be processed, and generate machining guide lines; a path generation module, used to offset, extend, cut and connect the machining guide lines, obtain offset lines, and use the offset lines as the moving lines in the tool path of the part to be processed to generate a tool path.

[0130] It will be easily understood by those skilled in the art that the above description is only a preferred embodiment of the present invention and is not intended to limit the present invention. Any modifications, equivalent substitutions and improvements made within the spirit and principles of the present invention should be included in the protection scope of the present invention.

Claims

1. A method for generating a milling tool path based on machining guide line offset, characterized in that: include: S1, obtaining a simplified mesh model of a part to be processed, wherein the mesh side length of the simplified mesh model is greater than the cutting width of the tool; S2, determining a region to be processed on the simplified grid model, taking a grid center point of the simplified grid model as a tool path point, and converting a tool path generation problem of the region to be processed into a tool path point access sequence problem; S3, solving the problem of access sequence of tool path points in the area to be processed, obtaining the optimal access sequence of tool path points in the area to be processed, and generating a processing guide line; S4, offset, extend, cut and connect the processing guide line to obtain an offset line, and use the offset line as a moving line in the tool path of the part to be processed to generate a tool path.

2. The method for generating a milling tool path based on machining guide line offset according to claim 1, characterized in that: S1 specifically includes: Dividing the to-be-processed part into a plurality of to-be-processed layers by means of layered milling; Obtaining the simplified mesh model of any layer to be processed; Accordingly, S2 specifically includes: Determine a contour line of any of the layers to be processed according to a preset processing allowance and a tool radius, and determine a processing area of ​​any of the layers to be processed based on the contour line; The center point of the grid of the simplified grid model contained in the area to be processed is used as a tool path point, and the tool path generation problem of any layer to be processed is converted into a tool path point access sequence problem on the grid plane.

3. The method for generating a milling tool path based on machining guide line offset according to claim 2, characterized in that: S3 specifically includes: S31, converting the tool path point access sequence problem of the area to be processed into a reinforcement learning task, establishing a Markov decision process model (MDP model) of the reinforcement learning task, wherein the intelligent agent in the MDP model is the tool, the environment is the state of the grid center point in the simplified grid model, defining the state space of the tool in the environment and the corresponding action space, setting an immediate reward function for the tool action, after the tool performs an action according to the action space corresponding to the state space, the environment and the state space change and can obtain a corresponding immediate reward value according to the immediate reward function; S32, solving the MDP model based on the instant reward value of the tool action to generate the processing guide line; Among them, the state space S of the tool in the environment is defined in S31 as: S=[d,s0,s1,s2,s3,s4,s5,s6,s7,x,y]; Where d represents the current movement direction of the tool; s 0~7 Represents the environmental state information in eight adjacent directions around the discrete tool path point where the tool is located; x and y represent the horizontal coordinate and vertical coordinate of the discrete tool path point where the tool is located, respectively; The action space A of the tool is: A=[0,1,2,3,4,5,6,7,8]; Where 0 to 7 represent the movement from the current tool path point to the adjacent tool path points in 8 directions, and 8 represents the tool lifting and feeding action.

4. The method for generating a milling tool path based on machining guide line offset according to claim 3, characterized in that: The instantaneous reward function of the tool action is specifically the sum of the reward function for changing the feed direction, the reward function for lifting the tool and the reward function for tool movement; Among them, the reward function for changing the feed direction gives the tool a negative reward value according to the angle of the feed direction change, so as to limit the number and angle of the tool feed direction change; the reward function for lifting the tool for feeding gives the tool a negative reward value according to the tool lifting for feeding, so as to limit the number of times the tool is lifted for feeding; the reward function for tool movement is: when the tool performs effective cutting, a positive reward value is given to the tool, and when the tool movement produces empty stroke, a negative reward value is given to the tool, so as to reduce the empty stroke of the tool.

5. The method for generating a milling tool path based on machining guide line offset according to claim 3, characterized in that: S32 specifically includes: solving the MDP model using a multi-layer value simulation algorithm to obtain a decision sequence of the intelligent agent, thereby generating the processing guide line; Specifically, it is defined that when the tool is in any state, the state value of any state is calculated according to the sum of the immediate reward values ​​of all actions on the tool path formed from any state as the starting point; the action value of the tool performing any action in the current state is the sum of the immediate reward value of any action and the state value of the next layer of sub-state corresponding to the execution of any action from the current state; the first layer of sub-state of the current state is the state set after executing one feasible action from the current state; The m-layer value simulation algorithm is: When m = 0, the actions with the largest immediate reward value are selected from the starting state to form the tool path; When m=1, the action with the largest action value in the current state is selected in sequence from the starting state to form a tool path, wherein the action value of the action in the current state is calculated based on the state value of the first-level sub-state of the current state, and the tool path based on which the state value of the first-level sub-state of the current state is calculated is the tool path determined by simulation using the immediate reward value; When m=n (n>1), the actions with the largest action value in the current state are selected in sequence from the starting state to form a tool path, wherein the action value of the action in the current state is calculated based on the state value of the first-level sub-state of the current state, and the tool path used for calculating the state value of the first-level sub-state of the current state is the tool path determined by solving the n-1-level value simulation algorithm, and any action in the tool path corresponding to the state value of the first-level sub-state of the current state is selected based on the action value, and the tool path used for calculating the state value of the next-level sub-state on which any action is based is the tool path determined by solving the n-2-level value simulation algorithm, and this process is repeated recursively until the tool path used for calculating the state value of the sub-state is the tool path determined by solving the 0-level value simulation algorithm, that is, the tool path determined by simulation using the immediate reward value.

6. The method for generating a milling tool path based on machining guide line offset according to claim 1, characterized in that: S1 specifically includes: Acquire an initial mesh model of the part to be processed, wherein the mesh side length of the initial mesh model is equal to the cutting width of the tool; Merging a plurality of meshes in the initial mesh model into a group to obtain the simplified mesh model; Accordingly, S4 specifically includes: The processing guide line is mapped to the initial grid model, and the processing guide line is offset, extended, cut and connected at least once, so that the offset line and the processing guide line cover all grids of the to-be-processed area corresponding to the initial grid model.

7. The method for generating a milling tool path based on machining guide line offset according to claim 1, characterized in that: Obtaining the bias circuit in S4 specifically includes: The processing guide line is equidistantly offset to both sides by using a segmented offset method, so as to form offset line segments on both sides respectively; The bias line segments on either side are connected at the disconnected parts, cut at the intersecting parts, and extended at the end parts, and then the end points of the bias line segments on both sides are connected to obtain the continuous bias line.

8. The method for generating a milling tool path based on machining guide line offset according to claim 2, characterized in that: Tool path generation in S4 also includes: The contour line is also used as a moving line in a tool path of the part to be processed to generate a tool path.

9. The method for generating a milling tool path based on machining guide line offset according to claim 8, characterized in that: Tool path generation in S4 also includes: Based on the moving lines in the tool path of the part to be processed, establishing a set of tool entry points on multiple moving lines; With the goal of minimizing the total moving distance of the traversal feed point set, the optimal traversal sequence of the feed point set is solved as the processing sequence of the tool between multiple moving routes, and then the final tool path is obtained.

10. A milling tool path generation system based on machining guide line offset, characterized in that: include: A mesh building module, used to obtain a simplified mesh model of the part to be processed, wherein the mesh side length of the simplified mesh model is greater than the cutting width of the tool; A path point determination module is used to determine the area to be processed on the simplified grid model, take the grid center point of the simplified grid model as the tool path point, and transform the tool path generation problem of the area to be processed into a tool path point access sequence problem; A guide line generation module is used to solve the problem of the access sequence of the tool path points in the area to be processed, obtain the optimal access sequence of the tool path points in the area to be processed, and generate a processing guide line; The path generation module is used to offset, extend, cut and connect the processing guide line, obtain the offset line, and use the offset line as the moving line in the tool path of the part to be processed to generate the tool path.

Citation Information

Patent Citations

  • Milling tool path optimization method for low carbon

    CN109240202A

  • Machining track optimization method based on parameterized milling force and stability constraints

    CN111008442A

  • Cambered surface polishing control method based on polishing disc

    CN116061068A