Laser cutting path optimization method and control system based on improved ACO-DP
By introducing inflection point factors and attenuation parameters into the ACO algorithm, combined with dynamic programming optimization, taking into account part nesting relationships and cutting start and end points selection, the problem of slow convergence speed and local optimization of laser cutting path optimization in the existing technology is solved, significantly Reduce the lag distance of the laser head and improve processing efficiency.
Patent Information
- Application Number
- CN202410902250.8
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-07-06
- Publication Date
- 2024-11-08
AI Technical Summary
The existing laser cutting path optimization method based on the ACO ant colony algorithm has problems such as slow convergence speed, easy to fall into local optimal solutions, and inappropriate selection of part nesting relationships and cutting start and end points, resulting in large gaps in laser heads, which affects Processing efficiency.
A laser cutting path optimization method based on improved ACO-DP is proposed. By introducing inflection point factors and attenuation parameters in the ACO algorithm, and combining dynamic programming to optimize the path information, considering the part contour nesting relationship and cutting start and end point selection, Establish a mathematical model of generalized travel dealer problems to optimize paths.
The convergence speed and accuracy of the algorithm are improved, the length of the lag path of the laser head is reduced, and the accuracy and processing efficiency of the laser cutting path are improved.
Smart Images

Figure CN118915609A_ABST
Abstract
Description
Technical Field
[0001] The invention relates to a laser cutting path optimization method and a control system based on improved ACO-DP, belonging to the technical field of laser cutting. Background Art
[0002] Laser cutting has many advantages such as fast cutting speed, high precision, strong adaptability, etc., and is widely used in the automated processing industry. Laser cutting is developing in the direction of automation, intelligence and integration. However, the overall technical level is still far behind that of developed countries abroad. Due to the blockade of foreign technology, most domestic laser cutting machines still use a dedicated, closed control system architecture with poor versatility and compatibility, which seriously affects the development of the manufacturing industry. In addition, the laser head takes a lot of time to move between cutting contours, and its moving distance must be minimized. Therefore, the reasonable optimization of the laser cutting path is the key to improving processing efficiency.
[0003] At present, the research methods of domestic and foreign scholars on laser cutting path optimization are mainly focused on intelligent algorithms. For example, Wang Na et al. proposed an optimization method for the bidirectional ACO (ant colony) algorithm, designed the guidance information of the forward and reverse search ant colonies, and reduced the empty travel distance of the laser cutting path. Based on the meme algorithm, Hajad et al. combined the GA (genetic) algorithm with the adaptive large neighborhood search, and modeled and solved the cutting path problem according to the GTSP (generalized traveling salesman problem). Li Wenbiao et al. obtained the parameters of the laser cutting path based on the principle of machine vision, and used the improved ACO algorithm to solve it in order to obtain the optimal zoom laser cutting path, reducing the optimization time and empty travel distance. Liu Shanhe et al. combined the GA algorithm with the ACO algorithm to solve the path optimization problem of the laser cutting machine.
[0004] However, in the prior art, there are many problems in the laser cutting path optimization method based on the ACO ant colony algorithm, such as the slow convergence speed of the path optimization algorithm and the easy fall into the local optimal solution, which leads to a large empty movement distance of the laser head; the nesting relationship of parts is not considered in the solution of laser cutting; the parts do not select the appropriate cutting start and end points in the solution of laser cutting; the closedness and scalability of the laser cutting machine control system are poor. These problems affect the accuracy of laser cutting path optimization. Summary of the invention
[0005] In response to the problems existing in the prior art, this application proposes a laser cutting path optimization method and control system based on improved ACO-DP, which takes determining the nesting relationship of parts as a prerequisite, clarifies the selection method of the cutting start and end points, regards the laser cutting path optimization problem as GTSP, and establishes a mathematical model. Inflection point factors and attenuation parameters are introduced into the basic ACO algorithm for solution, and at the same time, the DP algorithm is integrated for secondary optimization of the path information, thereby improving the calculation accuracy and efficiency of the algorithm.
[0006] In order to solve the above technical problems, the technical solution adopted by the present invention is a laser cutting path optimization method based on improved ACO-DP, comprising the following steps:
[0007] 1) Accurately determine the nesting relationship of the contour before processing, and process in layers from the inside to the outside;
[0008] 2) Each cutting start and end point on the part contour is regarded as a city point, the cutting start and end points on each part are regarded as a city set, and the laser cutting path optimization problem is regarded as a generalized traveling salesman problem;
[0009] 3) Establishing a mathematical model of the laser cutting path and establishing a constraint expression of the mathematical model of the laser cutting path;
[0010] 4) Determine the basic selection principle of the points to be cut, and combine the processing sequence and position of the part contour to clarify the selection of the starting and ending points of the cutting, and establish a path information optimization algorithm based on the ACO algorithm between the starting and ending points of the cutting;
[0011] The path information optimization algorithm based on the ACO algorithm is iterated and the path information of the algorithm iteration result is generated;
[0012] 5) Introduce the DP algorithm to perform secondary optimization on the path information of the algorithm iteration results, and establish the dynamic programming state transfer equation;
[0013] 6) A doubly linked list structure is established in the background program to generate an optimized processing path, wherein the doubly linked list structure contains the starting and ending coordinates of the primitive, the primitive type and the index position in the primitive array. At the same time, forward and backward pointers are set in the structure to link the previous and next structures.
[0014] In the above-mentioned laser cutting path optimization method based on improved ACO-DP, in step 2), it is assumed that a two-dimensional part layout diagram is known, where the part set is J = {J1, J2, ···, J n}, the set of contours that make up the parts is L i ={L i0 ,L i1 ,···,L im}, where L i0 is the parent ring of part i, and the contours of all parts to be cut are closed primitives, and the starting point and end point of the cutting are the same point.
[0015] Optimized, the above laser cutting path optimization method based on improved ACO-DP,
[0016] The laser cutting path optimization problem is considered as a generalized traveling salesman problem, which includes:
[0017] Let the machine origin be O, then the length D of the laser cutting path is:
[0018]
[0019] H0, H i , H n The calculation formulas are as follows:
[0020]
[0021] H n =h(Q n0k ,O)(4);
[0022] Where H0 represents the sum of the idle distances of the laser head from the machine origin O to the first part to be completely cut; H i H represents the sum of the empty row distances of the i+1th part subring that is completely cut from the cutting starting point on the parent ring of the i-th part; i Indicates the distance from the cutting start point on the parent ring of the last part to the machine tool origin O.
[0023] Optimized, in the above laser cutting path optimization method based on improved ACO-DP, in step 3), when establishing the mathematical model,
[0024] Assume that Jn has n parts and the set of points to be cut is L ij = {Q ij1 ,Q ij2 ,···,Q ijk}, where Q ijk The coordinates of (X ijk , Y ijk );
[0025] Two ring sets are specified, namely the cut ring set L Y and the adjacent ring set L if ;
[0026] If the ring j of a part i has been processed, it can be expressed as L ij ∈L Y ;
[0027] If a part ζ can be connected to part i through the cutting point and no other parts pass through it, then move it to the adjacent set L of part i if middle.
[0028] Optimized, the above laser cutting path optimization method based on improved ACO-DP,
[0029] In step 3), the mathematical model is established as:
[0030] obj·f=minD (5)
[0031] Constraint expression:
[0032]
[0033] In the formula, Indicates the cutting point Q ijk To the cutting point Q abc The probability of selection; Represents the empty set.
[0034] Optimized, the above laser cutting path optimization method based on improved ACO-DP,
[0035] In step 4), the basic principle for selecting the points to be cut is to use the nearest neighbor rule combined with the processing sequence and position of the part contour;
[0036] The selection of cutting points is expressed as:
[0037]
[0038] Where, f(O,N) is the distance from the last contour processing point O to point N on the contour; f(O,L i ) is point N to the next contour L i Geometric center distance; f(O,L p ) is the point O to the contour L p Geometric center distance; f(L p ,L i ) is the contour L p and contour L i The distance of the geometric center point;
[0039] When the weighted distance S from point N on the contour to the cutting starting point of the previous contour and the geometric center of the contour to be processed is the smallest, the position is optimal.
[0040] Optimized, the above laser cutting path optimization method based on improved ACO-DP,
[0041] In step 4), when establishing the path information optimization algorithm based on the ACO algorithm between the cutting starting points, the pheromone update method of the number of turns is integrated into the ACO algorithm, the number of turns of each ant in the iteration process is recorded, the pheromone increment is corrected, and the number of turns and the path length are balanced;
[0042] In step 4), in the path information optimization algorithm based on the ACO algorithm, an attenuation parameter is introduced based on the value of β, and the final value of β can be expressed as follows:
[0043]
[0044] In the formula, iter is the number of iterations; iter max is the maximum number of iterations; β0 and β1 are constants, and β0<β1.
[0045] Optimized, the above laser cutting path optimization method based on improved ACO-DP, in step 4), in the path information optimization algorithm based on the ACO algorithm, when m ants complete one iteration, the pheromone on each path is updated;
[0046] The pheromone update on each path is to merge the pheromone of the turning number and update it, and record the turning number of each ant in the iteration process;
[0047] Increase in pheromone Make corrections to balance the number of turns and path length, and the pheromone increment The correction formula is:
[0048]
[0049] Where ψ is the path length influencing parameter; ω is the inflection point factor; G k is the number of turning points in the path found by ant k.
[0050] Optimized, the above laser cutting path optimization method based on improved ACO-DP,
[0051] In step 5), assuming that the laser head starts from the machine tool origin O, the shortest path problem between the cutting starting points on each contour of the part is decomposed. After comprehensively considering the position relationship of the part contour and the order of the cutting start and end points, the dynamic programming state transfer equation is established as follows:
[0052]
[0053] In the formula, d(i,J) represents the shortest path starting from the cutting starting point i, passing through the cutting starting points on each contour in J (part set) once, and finally returning to point i;
[0054] When J is an empty set, the shortest path represents the distance from point i back to the machine tool origin O;
[0055] When J is not an empty set, it means the shortest path from point i through each ring in J-{k} to the starting point once and finally back to point i. ik Indicates the distance between the selected i point and k point.
[0056] A control system for a laser cutting path optimization method based on an improved ACO-DP includes an interaction layer, a control layer and an execution layer. The interaction layer transmits data with the execution layer through the control layer. The control layer is characterized in that the control layer optimizes the execution path of the control layer using the laser cutting path optimization method based on the improved ACO-DP as described above.
[0057] The beneficial effects of this application are:
[0058] In view of the shortcomings of the prior art, this application proposes a laser cutting path optimization method that improves the ACO and DP algorithms, introduces inflection point factors and attenuation parameters into the basic ACO, and combines the DP algorithm to perform secondary optimization on the path information, so as to improve the convergence speed and accuracy of the algorithm.
[0059] The technical solution of the present application takes into account the nested relationship of the contours of parts, follows the cutting principle of "inside first, outside later", optimizes and sorts the contours of the same layer, and determines the processing order of the parts.
[0060] The technical solution of the present application combines the processing sequence and position of the part contour and proposes a method for selecting the starting and ending points of the part cutting. The processing sequence and position of the part are considered on the basis of the nearest neighbor rule to reduce the idle movement path length of the laser head.
[0061] The technical solution of the present application uses an attenuation parameter in the algorithm to limit the number of attenuations, ensuring that the value of β varies within a valid range and enhancing the randomness of the solution; in the later stage of the algorithm, the value of β is larger, which enhances the convergence speed of the algorithm and is conducive to finding the global optimal solution.
[0062] The technical solution of the present application introduces an inflection point factor ω in the update of the pheromone concentration of the basic ACO algorithm, which can correct the pheromone increment, further improve the algorithm accuracy, reduce the number of cities in the path, and facilitate the algorithm to search for the optimal path. BRIEF DESCRIPTION OF THE DRAWINGS
[0063] Figure 1 It is the geometric relationship diagram of the part outline;
[0064] Figure 2 This is a diagram of the application form filling process;
[0065] Figure 3 This is the algorithm flow chart of this application;
[0066] Figure 4 It is a schematic diagram of the path optimization result of the basic ACO algorithm in the prior art;
[0067] Figure 5 This is a schematic diagram of the path optimization results of the improved algorithm of this application;
[0068] Figure 6This is the overall framework diagram of the control system of this application. DETAILED DESCRIPTION
[0069] The technical features of the present invention are further described below in conjunction with specific embodiments.
[0070] The specific steps of the laser cutting path optimization method based on improved ACO-DP of the present application are as follows:
[0071] 1) Accurately determine the nesting relationship of the contour before processing, and process in layers from the inside to the outside;
[0072] 2) Each cutting start and end point on the part contour is regarded as a city point, the cutting start and end points on each part are regarded as a city set, and the laser cutting path optimization problem is regarded as a generalized traveling salesman problem;
[0073] 3) Establishing a mathematical model of the laser cutting path and establishing a constraint expression of the mathematical model of the laser cutting path;
[0074] 4) Determine the basic selection principle of the points to be cut, and combine the processing sequence and position of the part contour to clarify the selection of the starting and ending points of the cutting, and establish a path information optimization algorithm based on the ACO algorithm between the starting and ending points of the cutting;
[0075] The path information optimization algorithm based on the ACO algorithm is iterated and the path information of the algorithm iteration result is generated;
[0076] 5) The DP algorithm is introduced to perform secondary optimization on the path information of the algorithm iteration results, and the dynamic programming state transfer equation is established.
[0077] The technical solution of the present application is further described below in conjunction with specific implementation methods.
[0078] The contour of the part to be processed is a closed loop, and the part has multiple contours composed of basic elements such as line segments, circles and arcs. For the description of multiple contours: the coordinates of the two end points are usually used to describe the line segments, the center, radius and coordinates are used to describe the circles, and the center, radius and the coordinates of the two end points of the arc are used to describe the arcs. For a part with m contours, the numbers are defined from 0 to (m-1) from the outside to the inside, and the outermost contour is defined as the parent ring, that is, ring 0; the remaining contours are defined as child rings, that is, ring 1 to ring m-1.
[0079] For the convenience of description, the storage information of the points to be cut of the contour is usually represented by a two-dimensional array, and the connection points between the basic elements, the 1 / 2 points of the line segments, the half points of the arcs and the 1 / 4 points of the circles are used as the basic selection principles. In the subsequent cutting, one point of the points to be cut on each contour is selected as the starting and ending points of the cutting of the contour.
[0080] like Figure 1As shown in the figure, it contains a layout diagram of 4 parts, where the points to be cut are Q1~Q 38 There is usually a nested relationship between the contours of the parts after layout, that is, the large contour contains the small contour. Ring 1, Ring 2, and Ring 3 of Part 1 are all nested inside Ring 0, Ring 1 of Part 3 is nested inside Ring 0, and Ring 1 of Part 4 is nested inside Ring 0. Part 2 has no nesting relationship. In actual processing, the cutting principle of "first inside and then outside" must be followed, that is, the child ring has been cut before the parent ring is cut, otherwise the child ring will lose the accuracy of cutting positioning, resulting in the inability to fix the part.
[0081] Therefore, before processing, the nesting relationship of the contours should be accurately judged, and the contours of the same layer should be processed from the inside to the outside. The contours of the same layer should be optimized and sorted, and the processing order of the rings should be determined to ensure the processing accuracy.
[0082] Assume that a two-dimensional parts layout diagram is known, where the parts set is J = {J1, J2, ···, J n}, the set of contours that make up the parts is L i ={L i0 ,L i1 ,···,L im}, where L i0 is the parent ring of part i. So far, each cutting start and end point on the part contour is regarded as a city point, and the cutting start and end points on each part are regarded as a city set. The laser cutting path optimization problem can be regarded as a generalized traveling salesman problem. Let the machine tool origin be O, then the length D of the laser cutting path is as follows:
[0083]
[0084] H0, H i , H n The calculation formulas are as follows:
[0085]
[0086] H n =h(Q n0k ,O) (4)
[0087] Where H0 represents the sum of the idle distances of the laser head from the machine origin O to the first part to be completely cut; H i H represents the sum of the distances from the cutting start and end points on the parent ring of the i-th part to the empty line where the i+1-th part sub-ring is completely cut; i Indicates the distance from the cutting start and end points on the parent ring of the last part to the machine tool origin O.
[0088] During the processing, the laser head should not pass through the cut parts when moving in the air, so as to prevent the laser head from lifting frequently and causing "cutting away". The processing path should be selected close to the parts as much as possible to avoid cross-region processing; at the same time, the influence of cutting heat effect should be considered to avoid deformation of the parts.
[0089] Based on this, in this embodiment, it is assumed that J n There are n parts in total, and the set of points to be cut is L ij = {Q ij1 ,Q ij2 ,···,Q ijk}, where Q ijk The coordinates of (X ijk , Y ijk ).
[0090] In order to facilitate the mathematical expression of constraints, two ring sets are specified: the cut ring set L Y and the adjacent ring set L if .
[0091] If the ring j of a part i has been processed, it can be expressed as L ij ∈L Y ; If a part ζ can connect part i through the starting and ending points of the cutting, and no other parts pass through, it can be moved to the adjacent set L of part i if middle.
[0092] Therefore, according to equations (1) to (4), a mathematical model is established. The specific formula is as follows:
[0093] obj·f=minD (5)
[0094] Constraint expression:
[0095]
[0096] In the formula, Indicates the cutting point Q ijk To the cutting point Q ijk The probability of selection; Represents the empty set.
[0097] For parts that have been arranged, the selection of the starting and ending points of cutting is the key to affecting the laser cutting path, and also directly affects the processing efficiency of the plate. From the above, we can know the basic principle of selecting the points to be cut, which usually adopts the nearest neighbor rule, but this method has limitations for the selected points. It only considers the nearest neighbor points as the starting and ending points to be selected, and does not consider the processing order and position of the part contour. It often ignores other points that may be more optimized, resulting in an increase in the empty path and reduced cutting efficiency.
[0098] Therefore, on this basis, combined with the processing sequence and position of the part contour, the selection of the cutting start and end points is clarified. The specific formula is as follows:
[0099]
[0100] Where, f(O,N) is the distance from the last contour processing point O to point N on the contour; f(O,L i ) is point N to the next contour L i Geometric center distance; f(O,L p ) is the point O to the contour L p Geometric center distance; f(L p ,L i ) is the contour L p and contour L i The distance from the geometric center point.
[0101] When the weighted distance S from point N on the contour to the cutting start and end points of the previous contour and the geometric center of the contour to be processed is the smallest, the position is optimal.
[0102] After the mathematical model was established, the ACO algorithm was used to solve the algorithm. Assuming that the shortest path of laser processing is regarded as the food source, the origin of the machine tool is regarded as the starting point of the ant colony, and the shortest path found by the ants during foraging is the shortest path of the laser processed parts. In the basic ACO algorithm, assuming that the ant scale is m, at time t, the probability of ant k choosing from city i to city j is It can be expressed as follows:
[0103]
[0104] Where allowed is the set of cities that ant k can choose; τ ij (t) is the pheromone concentration from city i to city j at time t; α is the pheromone inspiration factor; β is the inspiration factor of the inspiration information; η ij (t) is the inspiration information from city i to city j at time t; d ij is the Euclidean distance between city i and city j.
[0105] All ants need to update the pheromone concentration on the path every time they traverse. The specific formulas are shown in formulas (4-12) to (4-14):
[0106] τ ij (t+1)=(1-γ)τ ij (t)+γΔτ ij (t) (14)
[0107] τ ij (t+1)=(1-γ)τ ij (t)+γΔτij (t) (15)
[0108]
[0109] Where, γ is the pheromone volatility coefficient, γ∈(0,1); Δτ ij (t) is the pheromone increment of m ants between city i and city j; is the pheromone increment left between city i and city j after each traversal by ant k; Q is the total amount of pheromone, which is usually a constant; C k is the total length of the path traversed by ant k this time.
[0110] In the basic ACO algorithm, the value of α fluctuates around 1, and the value of β is relatively wide. If the value of β is large, the algorithm is prone to fall into the local optimum, resulting in a "deadlock" phenomenon; if the value of β is small, the algorithm is not easy to converge. To avoid the above problems, the attenuation parameter is introduced based on the value of β, and the final value of β can be expressed as follows:
[0111]
[0112] In the formula, iter is the number of iterations; iter max is the maximum number of iterations; β0 and β1 are constants, and β0<β1. In the early stage of the algorithm, the value of β is small, which can ensure the diversity of the solution in the early stage of the search; in the middle stage of the algorithm, the attenuation parameter is used to limit the number of attenuations, which can ensure that the value of β changes within the effective range and enhance the randomness of the solution; in the later stage of the algorithm, the value of β is large, which enhances the convergence speed of the algorithm and is conducive to finding the global optimal solution.
[0113] When m ants complete an iteration, the pheromones on each path need to be updated. The basic ACO algorithm only considers the path length for pheromone update, but does not consider the number of turns made by the ants during the traversal process, which affects the algorithm's iteration efficiency. Therefore, a pheromone update method that integrates the number of turns is proposed. The pheromone increment is calculated by recording the number of turns made by each ant during the iteration. Make corrections to balance the number of turns and path length, so the pheromone increment The correction formula is as follows:
[0114]
[0115] Where ψ is the path length influencing parameter; ω is the inflection point factor; G k is the number of turning points in the path found by ant k.
[0116] The above equations (12) and (13) show that by introducing the attenuation parameter and applying it to P ijIn order to ensure the validity of the solution at different stages, the algorithm can avoid falling into the problem of local optimality in the solution process. At the same time, the inflection point factor ω is introduced in the update of pheromone concentration to correct the pheromone increment, further improving the accuracy of the algorithm, reducing the number of cities in the path, and making it easier for the algorithm to search for the optimal path.
[0117] The DP algorithm is mainly used to solve the optimization problem of multi-stage decision-making. It divides the original multi-stage problem into multiple single-stage sub-problems, and each stage in the decision-making process corresponds to a sub-problem. Assuming that the laser head starts from the machine tool origin O, the shortest path problem between the cutting start and end points on each contour of the part is decomposed. After comprehensively considering the position relationship of the part contour and the order of the cutting start and end points, the dynamic programming state transfer equation is established. The formula is as follows:
[0118]
[0119] In the formula, d(i, J) represents the shortest path starting from the cutting start and end point i, passing through the cutting start and end points on each contour in J (part set) once, and finally returning to point i; when J is an empty set, the shortest path represents the distance from point i to the machine tool origin O; when J is not an empty set, it represents the shortest path starting from point i, passing through the cutting points on each ring in J-{k} once, and finally returning to point i, H ik Indicates the distance between the selected i point and k point.
[0120] Suppose the distance between the cutting starting points is stored in the two-dimensional array h[n][n], and the 1, 2, ..., n subsets are stored in the array V[2 n ], which is convenient for subsequent secondary optimization of the path. The specific filling process is as follows Figure 2 shown.
[0121] A doubly linked list structure is established in the background program to generate an optimized processing path, wherein the doubly linked list structure contains the starting and ending coordinates of the primitive, the primitive type and the index position in the primitive array. At the same time, forward and backward pointers are set in the structure to link the previous and next structures. The definition of the doubly linked list structure is expressed as follows;
[0122] Struct DoublyLinkListStruct
[0123] {
[0124] Struct DoublyLinkListStruct*previous;
[0125] float x1;
[0126] float y1;
[0127] int type;
[0128] int num;
[0129] float x2;
[0130] float y2;
[0131] Struct DoublyLinkListStruct*next;
[0132] }
[0133] In the above definition, previous means it is used to link the previous structure; x1 and y1 represent the starting coordinates of the current primitive; x2 and y2 represent the ending coordinates of the primitive; type represents the primitive type; num represents the index position of the primitive array; and next means it is used to link the next structure.
[0134] During the whole process of generating the processing path, all graphic elements are traversed to make the starting position of the next graphic element coincide with the ending position of the previous graphic element. The processing path of the laser processing machine is generated according to this logic. Considering that the shape of the graphic element can be divided into two categories: closed graphic element and non-closed graphic element, the closed graphic element itself can generate a processing trajectory without additional processing. For non-closed graphic elements, the corresponding overlapping graphic elements are usually found based on the starting and ending coordinates of the graphic element. The following four situations can be processed:
[0135] (1) If the starting point coincides with the starting point of another primitive, the primitive information to be processed is reversed and inserted forward;
[0136] (2) If the end point coincides with the end point of another primitive, the primitive information to be processed is reversed and inserted later;
[0137] (3) If the starting point coincides with the end point of another primitive, no adjustment is required and the primitive is inserted directly;
[0138] (4) If the end point coincides with the starting point of another primitive, no adjustment is required and the primitive is directly inserted;
[0139] If there is no such situation, the primitive is regarded as one of the first and last elements of the current path. First, the next primitive information is stored in the next structure, and the inward pointer is set to null, so as to redivide the previous processing path. Secondly, the system continues to search until all unclosed primitives are merged into the current linked list. For closed primitives, the data is directly included in the linked list, and the forward pointer of the structure is set to null. When all primitives are loaded for processing, their backward pointers are also set to null, marking the completion of the entire processing path. It is worth noting that in the process of drawing and processing primitives, due to the inaccurate size of the primitives or the excessive length of the joint segments, it may cause inaccurate overlap at the intersection of curves or misalignment at the connection. For this reason, before generating the processing path, it is necessary to make an accurate judgment on the distance between the endpoints of the drawn primitives. By setting a minimum distance threshold dmin, for example, setting dmin to 0.05mm, if the distance d between the endpoints at the intersection of the line segments is ≤ dmin, it is considered that there is no gap between the two line segments, achieving a smooth transition and ensuring that the two graphic elements are included in the same processing path, thereby achieving a gap-free connection of the curves at the processing joints.
[0140] After the above improvements, the basic ACO algorithm can effectively solve the problems of slow convergence and easy to fall into the local optimal solution. At the same time, the DP algorithm is integrated to perform secondary optimization on all path information, which can effectively improve the calculation accuracy. The specific process of the algorithm is as follows Figure 3 shown.
[0141] The laser processing path optimization problem is transformed into a generalized traveling salesman model with constraints. The processing start and end points on the contour of each part are selected, and the basic ACO algorithm and the improved ACO and DP algorithms proposed in this paper are used to perform laser processing path optimization experiments. The processing path optimization results of the basic ACO algorithm are shown in Figure 2. Figure 4 As shown in the figure, the machining path optimization results of the improved ACO and DP algorithms are as follows Figure 5 As shown, the yellow dotted line represents the idle path trajectory of the laser head, and the serial number at each part contour represents the selection order of the processing start and end points.
[0142] The processing sequence of the part contours meets the principle of "inside first, outside later", ensuring the processing accuracy; the optimal path calculated by the improved ACO and DP algorithms has been significantly improved in path length compared with the basic ACO algorithm, and the convergence speed is significantly faster than the basic ACO algorithm; the improved algorithm obtained the optimal solution in the 76th iteration, with the shortest empty displacement distance of 5781.9mm, while the basic ACO algorithm obtained the optimal solution in the 107th iteration, with the shortest empty displacement distance of 6102.3mm. That is, the improved ACO and DP algorithms in this paper not only converge faster, but also have obvious advantages in algorithm accuracy. The experimental results show that the improved algorithm reduces the empty displacement distance by 5.2% and the number of iterations by 32.1% compared with the basic ACO algorithm, improving the defects of long laser processing path optimization time and large empty displacement distance, improving laser processing efficiency, and having certain application value.
[0143] The control system of the present invention realizes the motion control and logic control of the laser cutting path generated by the optimization algorithm. The overall block diagram of the control system is as follows: Figure 6 As shown in the figure, it can be divided into interaction layer, control layer and execution layer. PC, as the upper computer, belongs to the interaction layer; BAC632E motion controller, as the lower computer, belongs to the control layer. The human-computer interaction interface of the control system mainly includes graphical interface, laser processing parameter interface and processing information display, etc. PC uses TCP / IP protocol to realize data transmission between the control layer and the control layer. The control layer is the core of the entire laser processing machine control system. Its main function is to drive the actuator in the form of motion control and logic control to realize the laser cutting path. The main modules of the control layer include automatic programming module, motion control module, height adjustment module and laser module. The automatic programming module is the key to the automation and intelligence of the control system. This module includes the analysis of the workpiece DXF file, the generation and optimization of the cutting path data using the above path optimization algorithm, and the automatic generation of the workpiece processing program file using the above path data; the height adjustment module is to ensure the stable distance between the laser and the workpiece surface to achieve high-quality cutting; the main function of the laser module is to control the real-time power, laser mode and monitoring function of the laser; the motion control module is the core of the control system to achieve multi-axis motion of the machine tool. The motion controller issues multi-axis interpolation motion instructions based on the relevant parameters set in the interaction layer, and transmits them to the servo system in the form of data frames through the EtherCAT bus, driving the actuator to complete the cutting motion control and realize the cutting path optimized by the algorithm. Among them, the IO module is responsible for the input and output of switch quantity, such as the input and output of switch quantity signals issued by the return to zero switch, proximity switch, emergency stop and other operations.
[0144] The hardware platform of the whole system mainly includes industrial computers, display screens, BAC632E motion controllers, Panasonic A6B servo drives and matching servo motors, height controllers, IO expansion modules, analog modules, laser modules, etc. The upper PC industrial computer and BAC632E motion controller are connected through a network cable. BAC632E is the master station of the control system. The servo drives and servo motors, height controllers, IO expansion modules, analog modules, etc. constitute the slave stations of the control system based on the EtherCAT bus.
[0145] The cutting path optimization algorithm is implemented in the cutting control system, and its processing flow is as follows. First, the DXF file of the part to be cut is imported into the layout software, and the layout is automatically arranged to achieve the maximum utilization rate of the plate. Secondly, the layout-completed file is solved using the laser cutting path optimization algorithm of the present invention to obtain the optimal solution for the cutting path. The data of the cutting path is stored using a bidirectional linked list structure. The bidirectional linked list stores the starting and ending coordinates of the primitives to generate the cutting path. Next, the cutting program is automatically generated in the automatic programming module based on the cutting path data information, and finally the program is executed, and the laser cutting after path optimization is realized using the control system.
[0146] Of course, the above description is not a limitation of the present invention, and the present invention is not limited to the above examples. Any changes, modifications, additions or substitutions made by ordinary technicians in this technical field within the essential scope of the present invention should fall within the protection scope of the present invention.
Claims
1. A laser cutting path optimization method based on improved ACO-DP, characterized in that: The following steps are involved: 1) Accurately determine the nesting relationship of the contour before processing, and process in layers from the inside to the outside; 2) Each cutting start and end point on the part contour is regarded as a city point, the cutting start and end points on each part are regarded as a city set, and the laser cutting path optimization problem is regarded as a generalized traveling salesman problem; 3) Establishing a mathematical model of the laser cutting path and establishing a constraint expression of the mathematical model of the laser cutting path; 4) Determine the basic selection principle of the points to be cut, and combine the processing sequence and position of the part contour to clarify the selection of the starting and ending points of the cutting, and establish a path information optimization algorithm based on the ACO algorithm between the starting and ending points of the cutting; The path information optimization algorithm based on the ACO algorithm is iterated and the path information of the algorithm iteration result is generated; 5) The DP algorithm is introduced to perform secondary optimization on the path information of the algorithm iteration results, and the dynamic programming state transfer equation is established.
2. The laser cutting path optimization method based on improved ACO-DP according to claim 1, characterized in that: In step 2), it is assumed that a two-dimensional parts layout diagram is known, where the parts set is J = {J1, J2, ···, J n }, the set of contours that make up the parts is L i ={L i0 ,L i1 ,···,L im }, where L i0 is the parent ring of part i, and the contours of all parts to be cut are closed primitives, and the starting point and end point of the cutting are the same point.
3. The laser cutting path optimization method based on improved ACO-DP according to claim 1, characterized in that: The laser cutting path optimization problem is considered as a generalized traveling salesman problem, which includes: Let the machine origin be O, then the length D of the laser cutting path is: H0, H i , H n The calculation formulas are as follows: H n =h(Q n0k ,O)(4); In the formula, H0 represents the sum of the idle distances of the laser head from the machine tool origin O to the first part to be completely cut; H i H represents the sum of the empty row distances of the i+1th part subring that is completely cut from the cutting starting point on the parent ring of the i-th part; i Indicates the distance from the cutting start point on the parent ring of the last part to the machine tool origin O.
4. The laser cutting path optimization method based on improved ACO-DP according to claim 3 is characterized in that: In step 3), when establishing the mathematical model, Assume that Jn has n parts and the set of points to be cut is L ij = {Q ij1 ,Q ij2 ,···,Q ijk }, where Q ijk The coordinates of (X ijk , Y ijk ); Two ring sets are specified, namely the cut ring set L Y and the adjacent ring set L if ; If the ring j of a part i has been processed, it can be expressed as L ij ∈L Y ; If a part ζ can be connected to part i through the cutting point and no other parts pass through it, then move it to the adjacent set L of part i if middle.
5. The laser cutting path optimization method based on improved ACO-DP according to claim 1, characterized in that: In step 3), the mathematical model is established as: obj·f=minD (5) Constraint expression: In the formula, Indicates the cutting point Q ijk To the cutting point Q abc The probability of selection; Represents the empty set.
6. The laser cutting path optimization method based on improved ACO-DP according to claim 1, characterized in that: In step 4), the basic principle for selecting the points to be cut is to use the nearest neighbor rule combined with the processing sequence and position of the part contour; The selection of cutting points is expressed as: Where, f(O,N) is the distance from the last contour processing point O to point N on the contour; f(O,L i ) is point N to the next contour L i Geometric center distance; f(O,L p ) is the point O to the contour L p Geometric center distance; f(L p ,L i ) is the contour L p and contour L i The distance between the geometric center points; When the weighted distance S from point N on the contour to the cutting starting point of the previous contour and the geometric center of the contour to be processed is the smallest, the position is optimal.
7. The laser cutting path optimization method based on improved ACO-DP according to claim 1, characterized in that: In step 4), when establishing the path information optimization algorithm based on the ACO algorithm between the cutting starting points, the pheromone update method of the number of turns is integrated into the ACO algorithm, the number of turns of each ant in the iteration process is recorded, the pheromone increment is corrected, and the number of turns and the path length are balanced; In step 4), in the path information optimization algorithm based on the ACO algorithm, an attenuation parameter is introduced based on the value of β, and the final value of β can be expressed as follows: In the formula, iter is the number of iterations; iter max is the maximum number of iterations; β0 and β1 are constants, and β0<β1.
8. The laser cutting path optimization method based on improved ACO-DP according to claim 7, characterized in that: In step 4), in the path information optimization algorithm based on the ACO algorithm, when m ants complete one iteration, the pheromones on each path are updated; The pheromone update on each path is to merge the pheromone of the turning number and update it, and record the turning number of each ant in the iteration process; Increase in pheromone Make corrections to balance the number of turns and path length, and the pheromone increment The correction formula is: Where ψ is the path length influencing parameter; ω is the inflection point factor; G k is the number of turning points in the path found by ant k.
9. The laser cutting path optimization method based on improved ACO-DP according to claim 6, characterized in that: In step 5), assuming that the laser head starts from the machine tool origin O, the shortest path problem between the cutting starting points on each contour of the part is decomposed. After comprehensively considering the position relationship of the part contour and the order of the cutting start and end points, the dynamic programming state transfer equation is established as follows: In the formula, d(i,J) represents the shortest path starting from the cutting starting point i, passing through the cutting starting points on each contour in J (part set) once, and finally returning to point i; When J is an empty set, the shortest path represents the distance from point i back to the machine tool origin O; When J is not an empty set, it means the shortest path from point i through each ring in J-{k} to the starting point once and finally back to point i. ik Indicates the distance between the selected i point and k point.
10. A control system for a laser cutting path optimization method based on an improved ACO-DP, comprising an interaction layer, a control layer and an execution layer, wherein the interaction layer transmits data with the execution layer through the control layer, and is characterized in that: The control layer optimizes the execution path of the control layer using the laser cutting path optimization method based on the improved ACO-DP as described in any one of claims 1 to 9.
Citation Information
Cited By
Laser cutting machine track searching path planning optimization method and system
CN120065917A
Ultra-precision laser cutting path optimization method and system
CN120502887A
Automatic cutting method for log square timber
CN120735141A
Method for automated cutting of logs
CN120735141B
Self-adaptive closed-loop control system for technological parameters of whole sheet metal working process
CN122613750A
