TWI362575B - - Google Patents

Description

1362575 IX. Description of the invention: [Technical field to which the invention belongs], 丨 small π, occupancy in the two unloading cutting path regulation refers to an innovative designer based on the global optimization method. [Prior Art] Press 'With the CAD/CAM technology

旳Continuous development, in response to the product aesthetics disk (4) the demand for free-form surface modeling is increasingly used, such as aerospace =, automotive, shipbuilding parts and consumer electronics and other product structures. Taking the aerospace and cold-bead air-conditioning production and the turbine blades of the industry as an example, the development capability crane is regarded as one of the important indicators of industrial technology standards. The line countries have invested a lot of research resources in this field. The development of thirsty wheel blades is a highly-divisional industry. 'External geometry design involves cutting-edge fluid mechanics, and its manufacturing work, by the professional processing plant negative stomach' requires specialized computer-aided manufacturing and cutting experience, usually using five-axis values Control processing technology.

The curved shape of the turbine blade is highly complex. Due to the three-axis numerical processing: the movement range in the space is limited, it is impossible to completely manufacture the five-axis milling with more rotation and tilting degrees than the one-axis machining, because it has more The tool movement is still flexible, so it is more suitable for the complex geometry of the "JL, Yi *t knife ancient - r \ .," force can be divided into end milling and side milling two types, on the straight surface ( In terms of time and cost of machining, side milling has more advantages. However, its tool path planning and cutting error control are more difficult and lack the aid of automatic calculation methods. 5 1362575 and! ; Bai Bing five-axis side sharp road control planning method 'must 弁 ─ ─ ─ ─ ─ ─ ─ ─ ─ ─ ─ ─ ─ ─ ─ ─ ─ ─ ─ ─ ─ ─ ─ ─ ─ ─ ─ ─ ─ ─ ─ ─ ─ ─ ─ ─ ─ ─ ─ ─ ─ ─ Discrete points, if the two curves are connected to the corresponding points, the tool axis can be determined. If the number is the same, then the special movement # 4 f 1 τ line, if the number of turns is different, can be matched with the type (such as Tangent to fan) to generate n strokes such as fixed knife and ^; 1 The whole road 35, other gauge axes, etc., for the normal vector of the surface of the curved surface, the tool is determined according to the local curve. The motion mode is unique and fixed, and cannot be flexibly changed. When adjusting the motion mode, these planning methods There is no positional path; the cutting error can only change the knives on the knives, and the error is improved by a very small amplitude. However, the actual two-two 仅 can only reduce the linear error of the numerical processing (a p atlonerror). It is not a way to improve the planning of tools. “In view of the problems in the above-mentioned conventional cutting methods,” he said, “The innovative design of the use of the nature is in need of consideration and direction.” In view of the fact that the inventor has been engaged in the manufacture and development of related products for many years, and has made detailed design and careful evaluation for the above objectives, the present invention has practicality. SUMMARY OF THE INVENTION The main object of the present invention is to provide a method for path cutting path planning based on a global optimization method, and the problem to be solved is to develop a method for minimizing cutting error and error control. The mechanism is more accurate and the innovative surface cutting and defensive path planning method is considered as the goal. 6 ^^575 , 100. Breakthrough; i丨6~ The problem solved by the invention # && ^ 1 u- Politics 1 1 The temple point is that the method of planning the surface cutting process includes: two independent curves in the design; the heart cutting will be performed: := = space = line: the mathematical programming problem of the correspondence; the best use of the complex: 'To obtain the final surface cutting process: Rare: wide" makes the present invention compared with the prior art, can be proposed -: the new surface cutting path planning side - the overall cutting error is minimized, since the test! It is possible to adjust the tool path combination that meets different requirements by adjusting the range and different error definitions according to the error #, 'machining tool path' set by the ruler I]. Supporting extremely flexible surface cutting processing, this error control mechanism. Method 'and accurate [Embodiment]

As shown in Fig. 13, it is only for the purpose of explanation that the curved surface machining path and the king domain of the present invention are used for the purpose of illustration, and the invention is based on the invention. Structural limitations. Path planning problem of surface i five-axis side milling, the general axis 换 replaces the independent curve Μ correspondence ^ 4 into two design surfaces i in space... The steps are as follows: Set the tool to contact at each position = vertical curve, false 'and the two ends of the line represent the two boundaries: the: 3, 14 - point 坶踝 13, 14 the best correspondence, the month 'J error is the smallest. In this way, the tool motion planning for each 变为 变为 变为 变为 变为 、 、 、 、 、 、 ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' minimize. Explain by legend (such as the first and second figures of the household, thousands, ^ ',), the planning of the processing path 10, 11 can be seen in the "dimension - the moment of the car 12" to find the beginning of the starting point and stop at The machining path of the end point 'which minimizes the overall cutting error, the horizontal axis of the figure represents the parameter of one of the boundary curves 13 (four), and the vertical axis is the parameter value U2 of the other - boundary curve 14. After converting the planning problem into a search problem corresponding to the curve, it can be solved by using the optimized mathematical model (such as dynamic programming, & algorithm and particle group algorithm). In addition, based on the difference in the cutting error requirements of the planner, the optimized mathematical model can adopt a discrete or continuous mathematical representation. If the discrete representation is used, the two boundary curves 13, 14 will be converted into discrete points 15 form, and The establishment of its correspondence is limited to only the discrete points 15. From the matrix diagram on the right side of Fig. 2(a), the horizontal axis and the vertical axis represent the parameter values of the two boundary curves 13, 14 respectively. When the curve correspondence is established by the discrete point π, only three possible paths are available. Direction (horizontal, longitudinal and diagonal), compared to the continuous optimization mathematical model (as shown in Figure 2(b)), the feasible path is not limited to these three directions (horizontal, The search for the correspondence between the longitudinal and diagonal lines, that is, the boundary curves 13, 14 can be performed anywhere on the curve. By transforming the path planning problem of five-axis side milling into a search problem of the correspondence between curves and using the optimized mathematical model to solve the problem, one can improve the flexibility, efficiency and impulsiveness of the road-spinning plan. The ruler has a better error control mechanism: the different tool motion modes are automatically considered by the person, and the second process selects the better π bucket and the β partial surface geometry and shape to reduce the overall cutting error. The present invention is a breakthrough in the present invention. There is a pole, the advantage of the needle is to provide a high degree of flexibility in the path planning with different optimization target functions, and according to the corresponding to the wood path, dragging the 'automatically generate a good tool path and calculation method:: For the design surface of the Γ, the optimized tool path will be different with the difference in error accuracy requirements. The present invention proposes two different algorithms for optimizing the surface side milling path ‘ respectively, which are dynamic programming with discrete points and dynamic programming network diagrams. Where = d (Dyr brain c Prog Cong mg; Dp) is a mathematical method used to deal with multi-stage (five) gamma decision-making problems, which breaks down a huge problem into a series of related small problems. It is processed, and the dynamic gauge has no mathematical model. The present invention is deterministic (fine (four) Gu (10) dynamic programming, using this method to produce the best side milling path; and two different methods provide the same parameters for the user to choose, the parameters have discrete points Number, can extend across the point, the boundary curve extends the ratio and limits the straight line crossing value. (As shown in Table )) Table 1 Parameter Description 1362575

————————================================================================================================= The control point of the boundary curve should produce four vector extension ratios to the four vectors. > As a new boundary curve, the length of the straight line is 〇

If floating positive % 1 ----- Parameter discrete points (10)P, and his p2) can cross the number of points (PS, and PS〇 boundary curve extension ratio (ER, ER2) limit · Straight line crossing value ( Cs) To perform side milling of this surface 1 , it must be composed of curves 13 and 14 . If the points are discretely taken, and the discrete points are divided into two boundary curves 13 and 14, the present invention is mainly applied to equal parameters. Point: Distance: Two kinds of points on the boundary curve that can be crossed at one time: :::: The number is represented by the same "" number. Generally speaking, for the value of the side milling plan and f, the tool must travel to the boundary Curves 13, n enter the lamp cutting 'Therefore, in order to allow the tool to pass through each discrete point 15, the present invention proposes parameters such as tool path planning. As shown in Fig. 3 (4), the number of points can be =0, so the same - The discrete points on the strip boundary curves 13, 14 will be connected by a straight line 16 'also means that the tool path will pass through each of the discrete points 15; and the third figure t (8) can span the number of points = 2, so the same boundary curve 10丄 362575 .13, 14 discrete points up to two consecutive discrete points will not have a straight line 16 phase. Even two: represents the tool path can It is not necessary to pass each discrete point 15, because the total error amount is minimized by each discrete point 15. Generally, when planning the tool path, the boundary curve of the original design surface is directly taken up, and the tool is planned accordingly. The path reduces the amount of error. In the present invention, the boundary curves 13, 14 are extended along the corresponding control point vector, and then the extended boundary curves 13, 14 are discretely taken, and then the tool path is planned. As shown in Fig. 4. 'The original boundary curve control points of object A in the figure are ρι, Lu P2, P3, P4 four points; the original boundary curve control point of object B is p5 ' P6, P7, p8 four points. P1 and p5 form V1 vector, p2 and p6 The v2 vector 兕7 constitutes V3 inward, and P4 and P8 constitute a material vector. The new boundary curve control point P1 of the object a is obtained by multiplying P1 along the -VI vector by the extension ratio L=05, and the fourth is multiplied by P2 along the -V2 vector. The upper extension ratio L=〇5 is obtained, and Ρ3φρ3 is obtained by multiplying the _V3 vector by the extension ratio L=0.5, which is obtained by multiplying the extension ratio L=0.5 along the _V4 vector, and the object b new boundary curve control point decay By the decay along the VI, the extension ratio is L=〇. 5 P6 is obtained by multiplying P6 along the V2 vector by the extension ratio L=0.5, P7 is obtained by P7 multiplying the V3 vector by the extension ratio 1=〇5 to obtain 'P8. P8 is multiplied by the V4 vector and the extension ratio L=〇 5. Acquired. Its mathematics ^ is not... (4) tender) Xffi

Pr is the new control point of the boundary curve of the object A, ργ is the new control point of the boundary curve of the object B, Pi is the original control point of the A boundary curve, and pj is the original control point of the boundary curve of the object B, which is 0 $ i $ N and 〇$ j SN , ERlER2 1362575 100. 8· 17

The last parameter of the boundary between the west line of the object and the boundary of the object is the limit of the straight line crossing value (CS). The length of the straight line is limited by the length of the cutting edge. Therefore, the path of the tool must be matched. The tool length is planned 'because when the tool crosses the surface very large, it will exceed the cutting edge length of the tool edge, resulting in processing failure. As shown in Fig. 5, under the given limit of the straight line crossing value, the discrete point 19 corresponding to the boundary curve 18 corresponding to the boundary curve ^ is searched for. First, add and subtract the 丨 variable to make a reasonable range (i-CS~i+cs), and then find the corresponding discrete point 19' according to the 2 reasonable range on the boundary curve 18 (4). If DP^ is reasonably discrete One of the points. The present invention mainly utilizes dynamic programming for tool path optimization. Before entering the dynamic programming algorithm, the 'most basic step must construct a network diagram of human dynamic programming', which is composed of nodes and paths. #图图6 No, in order to establish a dynamic programming network program diagram with discrete points as the stage, the reconstruction steps are as follows: Chu A discrete point on a boundary curve is used as

In this method, it is one of the stages of dynamic planning, so it needs to

, a 〇 , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , 12~ The present invention defines a node, which is a point, which further includes 〃 '-, the 第 point of the i-th lub in the J-th stage, and no node after eight W*. The original section goes to 6 』, the knife is the original node and έΒ..4 疋 is ONu, this μμ = ’ line and the imaginary node is defined as ^ contains a virtual straight line. In addition, the point contains only one out of the boundary curve, and π means that the discrete point is at a boundary: from m and η, the discrete point can be expressed as DPa,n. The present invention only, ''the ηth point, so the discrete point is regarded as the dynamically-punched pb; and, the selected-side boundary curve U-boundary (4) is called non- The target line is represented by FDP.n as a discrete point on the line of sight. f first jin said the target song person β 1 ± 攸FI. Search for discrete points connected to the non-target curve to form stage s. All the nodes in the node, and then continue from FDPm to FDPn, n search for the point in each phase, that is, complete an element, node in the dynamic planning network diagram. The explanations are as follows: As shown in Figures 7 and 8, the three parameters are taken on the boundary curve 2〇 and the boundary curve 21 respectively, given the parameters (NDP1, NDP2, PSi, ρ&, 贶, service, cs )=(3 ,3' 1,0, 0, 0, 2) under 'From discrete point 22 ( FDPi, .) to search for a reasonable discrete point on the non-target curve, and then obtain a reasonable set of corresponding discrete points (Df> ;2. DP2,i,DP2.2}, and discrete point 22 (FDPw) is arranged in this stage

The combinations are { ( DP2, 〇 ) , ( DP" ), ( DPnDPu ), ( D P2, i, DP2.2 ) , ( DP2 , . , DP 2 , 1, DP 2 , 2 ) }. In this combination number, the discrete point 22 (FDPu.) is the starting point of the ruled line 23 and the corresponding point in the combination number is the end point of the ruled line 23. Therefore, the five combined numbers represent five original nodes ON〇, 〇, ONd. 1 ' 〇N〇, 2, ONm, ONm appear in phase S. in. The original node ONu contains one or more straight lines represented by Ra b (a represents FDP〇>, the value of η in n; b represents the value of η in MV"). Complete discrete points 2 2575

I I V V J 22 ( fdp丨, 〇) is the same as the program r # n 斤, then the same procedure #~别~^-底-----' scatter 24 (FDPu) and discrete point 25 (FDPu). In this way, all the original nodes αι in the dynamic plan network diagram can be completed.个 个 个 个 个 个 个 个 个 个 个 个 个 个 个 个 个 个 个 个 个 个 个 个 个 个 个 个 个 个 个 个 个 个 个 个 个 个 个 个 个 个 个 个 个 个 个 个As shown in Fig. 8, there are six f-start nodes I, ·, 0Nl.2, 0Ni 3, 0Ni 4, and 0N15 in the & stage, and each of the original nodes.◦, 〇Nu, 〇Νι 2 〇Νι 3, 〇N! 4, (10) 5 The last straight line is R°'. , ‘and 跖, it has a corresponding nothing in the stage & (Therefore, 'the establishment of the virtual node must be in accordance with the last-segment line in the original node in the previous stage. There is a corresponding virtual two point in the next stage. If the number of points can be 2, the original node is In the end: the straight lines have corresponding virtual nodes in the next stage. As for the next stage, the virtual nodes will copy the same virtual nodes in the next stage.) When constructing the dynamic planning network diagram The original node (10) & After nxr '7 # & in the case of DNi'j, the starting node 30 will be added, and the library will be added to the library "&"; point 31. The starting node 30 and the terminating node 31 represent 〇, 面2, respectively. The starting straight line and the ending straight line, and the corresponding curved virtual no node is different from other virtual nodes, '' _ Ma this virtual benefit St main does not have any straight line with the target curve Above - ', ', table, except R.,. (4) Phase as a starting point Table 2 symbol description symbol description ~~~~" ~~~~~~~-----^ S, dynamic Plan the i-th order of the network diagram ^ ^ ~ ~ ~ ~ ~ ---

14

Discrete points on the target boundary curve

The node will form the nth point line on the mth boundary curve of the node rule rule virtual node from DP-, a and DPn.b (m off η) ____ Before applying the dynamic programming algorithm, it must also decide the adjacent two stages. relationship. In the node, a straight line is recorded as the end point. In the present invention, the end points of the straight line are all sorted by the serial number, so that the adjacent two stages can be judged according to the two rules. 1: The parameter can be used to determine whether two nodes are related by the number of points (PS). If comparing the serial number of the last straight line in the node in the previous stage with the serial number of the first straight line in the current stage, compare the difference between the two numbers and the value of the cross-point, if it is greater than the cross-point The value (PS), then the two nodes will not be related, that is, there will be no feasible path between the two nodes for connection; if the two orders, the difference is less than or equal to the value of the crossing point (ps), it means the two points Have a feasible path for the connection. 2. Avoid staggering the straight lines. Comparing the last straight line in the node in the previous stage with the intersection of the first straight line in the node in the current stage, the two nodes will not be related, that is, there will be no connection between the two nodes. There is a feasible path for the connection as shown in Figure 9, which shows the connection of the feasible path between the two stages 15 1362575

Step2 Step3 shows as βραι1. · ^ Discrete point profit symbol table According to the target boundary curve, the double β k is the original node. Add the starting node and the terminating node and construct the virtual node of each original node according to the given parameters. The zero-node node is judged from the s": rule 2 in the two adjacent stages to determine whether there is a connection. Dynamically plan the network map from Stepl to Step4. After completing the dynamic planning of the network map ^ ^ - , , yL makes it possible to customize the value according to different criteria. From the starting node to the terminating node, each path represents a set of tool paths. Then, the specified range is the stage ± Φ - B m ^. The dynamic planning network diagram is used, and the main encounter is to use the dynamic programming to perform the tool ^ ^ It is better, but it is based on the algorithm of the range h ^. For example, the first step of the 1U map is not to create a dynamic planning program diagram. The steps are as follows: When the boundary curve ratio is extended, it is convenient to take points on the extended curve; if the extended boundary 'T is suitable for the green haha, the discrete boundary is taken only on the boundary curve of the original design surface. This method uses the scope as the stage of dynamic planning. The main purpose is to allow the user to directly specify the extent to which the tool must pass, so that the user can more intuitively plan the tool path. Dynamic programming network diagram is established according to the user's settable β βΒ Α j挟垮 points and the limit of the straight line crossing value. In other words, the dynamic programming network

Step4

Step2

Step3 Requires 16 1362575 The size of the road map is controlled according to the parameter limits given by the user. The biggest difference between this method and dynamic programming with discrete points is that each phase has only the original node and no virtual nodes appear. The original node contains only one straight line. As shown in the nth figure, ten parameters are taken under the boundary curve 35 and the boundary curve 36, respectively, given parameters (NDPi, NDp2, p S', PS% ER!' ERZ> CSMlO' 1〇' 1,1 , 0, 〇, u, and select two phase ranges 37, 38 basis, one for DPi.3 and Dp", the other for p" and 敝6.

According to the lower bound of the given parameters (PSfI and ρ§2=ι), taking DP, 3 and DPu as an example, the upper boundary of DPu; m\3 is dp2.4, and the boundary and the lower boundary form region R1. The other upper bound is DPi.8 and the lower bound is DPi 6; P2.5 'based on the corresponding upper and lower bounds Ri according to the parameter (Cs=i) from the lower boundary connected discrete points, the result is one, sail, 3 }, However, since dl is lower than the circumference, it is reasonable to find the DPu and DPlM in a reasonable order, and the number of nodes representing the stage appears in all the nodes of the stage So, the number of all the nodes in the segment S1, and so on. The original node. If DPi.2 and Dp22 are selected as CS=1), the upper bound of the phase range 37, 38 and the upper boundary of the DPu are determined as DPu from the DPu search boundary curve, and the lower bound is the lower bound and DP2, 2, according to the corresponding last Taking DDu and DP2.6 as an example, the upper boundary of DPu DP2.6 is DP2, 7 is lower bound and D is forming region R2 β. The first step is to compare the discrete points on the search boundary curve 36 of the region DPi.2. { DP2, 丨, DP2, 2 lower bound DPz, 2, so do not include a reasonable point for {DP2, 2, DP" } two points, then discrete points. Finally all combinations will stage S. Medium, as in the 12th As shown in the figure, the same procedure is completed in the area r2 (the first step is to complete the dynamic planning network diagram phase range basis, and according to the parameters (reasonable and connectable discrete points, the result is 17 1362575, so the stage of the range is one The group corresponds to discrete points { Dp2l, Dp22, DP23 nodes have three, respectively R2, i, r2, 2 ' &

Which of the two adjacent stages is connected. The node can judge according to the two rules to determine whether the two nodes are ": for the number of points (PS). If the previous stage is compared to the L in the node and the straight line in the node in the current stage is d, >PS, then this Kca)-( ..^ sa 2 will be irrelevant, that is, the two connections are 7 Right [(ca)-(db)] spS, it means that the two nodes have a path for the connection. Avoid the streak of the straight lines. If the comparison is before - the corpse white & Straight line 盥 盥 & & 丨 丨 丨 丨 丨 丨 丨 丨 丨 丨 丨 丨 丨 丨 丨 丨 丨 丨 丨 丨 丨 丨 丨 丨 丨 丨 丨 丨 丨 丨 丨 丨 丨 直 直 直 直 直 直 直 直 直 直 直Then start to construct this network diagram according to the following steps: Stepl · Discrete the points on the boundary curve and mark the discrete points with symbols such as Ι)·Ρπι, η 0 Rule 2: Selected range basis To establish the upper and lower bounds S), look for all feasible straight lines. Step 3 · Add start and end nodes.

And according to the parameters (C

Step4: From the starting node to the terminating node, according to rules 1 and 2, the dynamic planning is completed from St1 to SteP4. Whether the nodes in the adjacent two phases are connected are connected. Network map. The 18 points of the present invention provide an accurate error control mechanism: The white surface cutting path planning method reduces the cutting error by the trial and error method by changing the tool path generation method. The present invention defines the target function of the fundamental surface overall error. 'With the rigorous mathematical optimization method to solve, through the optimization calculation to produce a feasible solution, it is possible to accurately control the error value corresponding to the tool path and improve the machining accuracy of the five-axis side milling. 2. Path planning with South Elasticity: The right target function is defined as reducing the “overcutting error”, and the corresponding tool path is the result of minimizing the overcutting error. This method has south elasticity in path planning. If the user wants to limit the "overcutting error value" to a certain range, then the corresponding target function can be defined to be optimally solved, and it is judged whether the setting range is feasible by the calculation result, and the error range or the replacement is adjusted accordingly. The invention can meet different error control requirements, so that the user can have more choices and planning degrees of freedom in path planning. 3. Integrate different tool motion modes: The present invention does not use the single-tool motion mode to generate the path... It is automatically determined by the optimization calculation according to the surface geometry. This integration is combined with different tool movements to achieve the most objective:: target Take full advantage of the freedom of processing of the five cars. Difference 4. Optimization of Mathematical Methodology: 19 136-2575 The optimal mathematical programming model has been developed for a long time. So when the abstraction of the tool motion problem becomes the optimal mathematical problem, it can be applied to the development. Solving different methodologies is not limited to a single algorithm. q ^ Shares δ are expressly invented, and although they are explained by specific terms, they cannot be used to limit the scope of the patent; those who are familiar with the technical field can

Changes and modifications, such as the change of God's and the principles, and the revision of the book, shall include: the purpose of the release, and the scope of this. The scope of the patent application mentioned later

20 1362575 Revision #Change page i [Simple description]

Figure 1: Schematic diagram of the search for the best correspondence between the curves of the present invention. Figure 2: Discrete and continuous representation of the invention. Figure 3: Schematic diagram (a) and (b) of the cross-points of the present invention. Figure 4: Schematic diagram of the extension of the boundary curve of the present invention. Fig. 5 is a schematic view showing the restriction of the ruled line of the present invention. Figure 6: Flow chart 1 of the dynamic programming of the present invention. Figure 7: Figure 1 of the parametric design surface of the present invention. Figure 8 is a schematic view of a node of each state in the curved surface of the present invention. Figure 9: A feasible path diagram between the two phases of the present invention. Figure 10: Flow chart 2 of the dynamic programming of the present invention. Figure 11: Figure 1 of the parametric design surface of the present invention. Figure 12: Schematic diagram 2 of the nodes of each state in the curved surface of the present invention. Table 1: Description of the parameters of the invention. Table 2: Description of the symbols of the present invention.

[Main component symbol description]

Object A

Object B Region R 1 Region R 2 Curve 1 , 2 Boundary Curves 13, 14, 17, 18, 20, 21, 3 5, 3 6 21 1362575 Machining Path Two-Dimensional Matrix Discrete Point Straight Line Start Node End Node Stage Range 1 〇, 1 1 — 12 15 , 19 , 22 , 24 , 25 1 6 , 2 3 3 0 3 1 3 7 , 3 8

22 v

Claims (1)

1362575 _· 8. 1 work——————————— __—·, patent application scope: A global optimization-based method, including: a curved surface machining path planning method to design two sides of the surface The line is the two independent curves in the space; the mathematical programming of the relationship between the surface cutting and the curve of the tenth curve will be performed, and the tool movement problem will be converted and the curve will be used to optimize the mathematical model of the gentleman. Obtaining the final curved surface according to the surface of the coating of the patent application scope of the Japanese Patent Application No. 1 ... The surface-finishing processing method according to the global optimization method, wherein the surface cutting is added to the five-axis side milling In the machining mode, the five axes have five degrees of freedom, namely two translational free 沿 in the X direction, the γ direction and the ^ direction, and two rotational degrees of freedom of the rotation angle and the inclination angle. According to the method of the patent application scope, the method for planning a surface cutting path based on the global optimization method, wherein the correspondence between the curves refers to the correspondence between any two independent curves in the space, which may be continuous Or discrete counterparts. According to the scope of the patent application, the globally optimized method based on the surface cutting plus; path planning method, wherein the optimized mathematical model can be selected by dynamic programming, gene > shell method, particle swarm calculus Law is one of the optimization methods. 23 1362575 5. The method of path machining path planning based on the global optimization method according to claim 1 of the patent application scope, wherein the optimized mathematical mode may adopt a discrete or continuous mathematical representation. twenty four