Three-coordinate measuring machine global detection trajectory planning method based on improved ant colony algorithm

By improving the heuristic function, pheromone dynamic update and roulette strategy of the ant colony algorithm, the global inspection trajectory planning of the coordinate measuring machine is optimized, the problem of poor global trajectory planning quality is solved, and more efficient trajectory planning and lower collision risk are achieved.

CN120740626AActive Publication Date: 2025-10-03JIANGSU JITRI HUST INTELLIGENT EQUIP TECH CO LTD

Patent Information

Application Number
CN202510867971.4
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2025-06-26
Publication Date
2025-10-03
Estimated Expiration
2045-06-26

AI Technical Summary

Technical Problem

The quality of global trajectory planning results of coordinate measuring machines in the existing technology is poor, especially on complex workpieces, where there is a high probability of collision and frequent corrections are required.

Method used

An improved ant colony algorithm is adopted to optimize the global detection trajectory planning of the ant colony algorithm by improving the heuristic function, pheromone dynamic update mechanism and roulette strategy. The collision avoidance cost, number of angle changes and path smoothness are comprehensively considered to improve the algorithm's adaptability and global optimization ability.

Benefits of technology

The quality of global trajectory planning is improved, the trajectory length is reduced, the adaptability and search efficiency of the algorithm on complex workpieces are enhanced, and the collision risk is reduced.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN120740626A_ABST
    Figure CN120740626A_ABST
Patent Text Reader

Abstract

The invention relates to a three-coordinate measuring machine global detection trajectory planning method based on an improved ant colony algorithm. The method comprises the following steps: constructing a distance adjacent matrix; initializing related parameters of the improved ant colony algorithm and initial iteration positions of ants; next nodes are selected in sequence based on the state transition probability until the ant traverses all the nodes, and a complete detection path is obtained; updating pheromones among nodes according to the quality of the detection path; calculating node fitness according to the quality of the detection path, and calculating a node selection probability based on the node fitness; selecting an initial node of the next iteration of the ant colony by using a roulette strategy based on the node selection probability; on the basis of the updated pheromone and the initial node of the next iteration of the ant colony, the ant colony iteration search detection path process is carried out again; and selecting the path with the shortest detection path length in the iteration process as a global optimal detection track. According to the invention, the global detection trajectory planning effect of the three-coordinate measuring machine is improved.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the technical field of digital detection of three-coordinate measuring machines, in particular to a global detection trajectory planning method of a three-coordinate measuring machine based on an improved ant colony algorithm. Background Art

[0002] In CMM (Coordinate Measuring Machine) measurement, the inspection trajectory refers to the complete path planned by the probe to measure all sampling points. When the part being measured is complex and involves numerous inspection items, relying solely on the measurement technician's experience can be difficult to ensure the optimal probe measurement path. Therefore, to improve equipment utilization and work efficiency, effective calculation and analysis of the inspection trajectory and planning the optimal CMM inspection trajectory are key steps in CMM inspection planning.

[0003] The inspection trajectory planning of a three-dimensional coordinate measuring machine usually adopts a hierarchical planning strategy, which decomposes the planning task into two levels: local trajectory planning and global trajectory planning. Local trajectory planning focuses on planning the shortest measurement path for sampling points within the feature to be measured. Because the risk of probe collision is low when measuring within a single feature and there is no need to change the probe angle, performing local path planning first can effectively simplify the complexity of the inspection path planning problem and reduce the probability of collision. After the local trajectory planning is completed, the global planning stage uses the geometric features to be measured as the planning object. On the basis of ignoring the details of the internal path, it determines the optimal measurement order for all the features to be measured, thereby planning the shortest measurement path at the level of the geometric features to be measured.

[0004] The traditional global detection trajectory planning method first plans a preliminary trajectory based on the straight-line distance of the feature, and then performs a unified collision avoidance on the trajectory to obtain the final detection trajectory. Due to the diversity of the probe contact angle and the influence of the complex geometric features of the part, the probability of collision in the global detection trajectory is relatively high. Therefore, the preliminary trajectory planned by this method requires frequent trajectory correction and probe angle adjustment to avoid collision, which offsets the efficiency improvement brought by path planning. Zhou Kaijun et al. proposed a global trajectory planning method based on feature grouping and genetic algorithm in their paper "Measurement Path Planning Method of Coordinate Measuring Machine Based on Genetic Algorithm [J]. China Mechanical Engineering, 2016, 27(12).". This method constructs a fitness function based on factors such as the detection working plane, the number of probe angle changes and the total trajectory length as optimization targets, and uses matrix crossover genetic algorithm to perform feature grouping optimization and sequence planning genetic algorithm to perform micro-sorting of the detection trajectories within the group, thus realizing the planning of the global detection trajectory. This method takes into account the influence of the probe contact posture on the detection trajectory and effectively optimizes the trajectory planning results through the grouping pre-processing strategy. However, this method does not consider the impact of collision avoidance on the trajectory during the iterative optimization of the trajectory planning algorithm, resulting in the need for secondary obstacle avoidance corrections to the trajectory results obtained by the algorithm, limiting the algorithm's planning effectiveness. In his paper, "Research and Implementation of an Inspection Path Planning System for Coordinate Measuring Machines [D]. Wuhan University of Technology, 2020," Wang Gang proposed an inspection path planning method based on obstacle avoidance paths. This method first uses obstacle avoidance rules to determine the collision-free path between every two sampling points within a feature. A genetic algorithm is then used to solve the local shortest path. The obstacle avoidance rules are then used to calculate the collision-free path between every two connected endpoints. Finally, a greedy algorithm is used to solve the obstacle avoidance time matrix for the connected endpoints to determine the global detection trajectory of the feature. Experimental verification shows that this method effectively optimizes the algorithm's planning effectiveness. However, since this method uses a greedy algorithm to solve the global trajectory, it has certain limitations in multi-feature planning applications. Summary of the Invention

[0005] To this end, the technical problem addressed by this invention is to overcome the poor quality of global trajectory planning results in existing technologies and provide a method for global inspection trajectory planning for coordinate measuring machines (CMMs) based on an improved ant colony algorithm (ACA). This method improves the ACA by employing three aspects: a multi-factor heuristic function, a dynamic pheromone update mechanism, and a roulette-wheel initial point selection strategy. This method then applies the ACA to planning the global optimal inspection trajectory between the features to be measured, improving the performance of CMM global inspection trajectory planning.

[0006] To solve the above technical problems, the present invention provides a global detection trajectory planning method for a coordinate measuring machine based on an improved ant colony algorithm, comprising the following steps: Acquire the geometric features to be measured of the workpiece and use them as nodes, and construct a distance adjacency matrix based on the nodes, wherein the distance adjacency matrix is ​​used to define the trajectory distance between each of the nodes; Initialize the relevant parameters of the improved ant colony algorithm and the initial iteration position of the ants, and evenly place the number of ants on each node as the starting node; Performing an ant colony iterative search for a detection path, including: obtaining an improved heuristic value based on relevant parameters and the distance adjacency matrix, obtaining a state transition probability based on the improved heuristic value, each ant starting from the initial node and sequentially selecting a next node based on the state transition probability until the ants have traversed all nodes to obtain a complete detection path; updating pheromones between nodes according to the quality of the detection path; calculating node fitness according to the quality of the detection path, and calculating node selection probability based on the node fitness; and selecting an initial node for the next iteration of the ant colony using a roulette wheel strategy based on the node selection probability; Based on the updated pheromone and the initial node of the next iteration of the ant colony, the ant colony iterative search and detection path process is repeated; In response to the current number of iterations reaching a preset maximum number of iterations, the detection path with the shortest length in the iteration process is selected as the global optimal detection trajectory.

[0007] In one embodiment of the present invention, constructing a distance adjacency matrix based on the nodes includes: According to the distance from the end point of the local trajectory of the current geometric feature to be measured to the starting point of the local trajectory of the next geometric feature to be measured, the trajectory distance between any two nodes is obtained, the trajectory distance between any two nodes is used as an element, and a distance adjacency matrix is ​​generated.

[0008] In one embodiment of the present invention, the calculation formula of the state transition probability is: , in, is the state transition probability, For nodes i and j The pheromone value between For nodes i and j Improved heuristic value between is the communication heuristic factor, is the expectation heuristic factor, is the set of nodes that have not been visited. is the number of iterations.

[0009] In one embodiment of the present invention, the calculation formula of the improved heuristic value is: , in, To improve the heuristic value; is the weight factor of the distance between nodes, and its value range is [0-4]; Representation node i arrive j The straight-line distance between Representation node i arrive j The distance between the two vehicles increased due to collision avoidance; is the weight factor of the probe angle transformation, and its value range is [0-4]; Representation node i arrive j The number of probe angle changes required; It is a fixed value, indicating the extra track distance due to the change of probe angle; is the weight factor of path smoothness, ranging from [0-4]; Indicates that the node i arrive j The number of inflection points on the path.

[0010] In one embodiment of the present invention, updating the inter-node pheromone according to the quality of the detection path includes: Update pheromones using the following formula: , in, For nodes i arrive j pheromone increment; ρ is the dynamic volatility coefficient of pheromone, and the calculation formula is: , in, t is the current iteration number; After each iteration ρ The reduction value; is the initial maximum value of the pheromone volatility coefficient.

[0011] In one embodiment of the present invention, updating the inter-node pheromone according to the quality of the detection path further includes: Increase the optimal path pheromone increment for the historical optimal detection path , deduct the worst path pheromone deduction amount from the worst historical detection path , and limit the pheromone concentration to [ , ] within the scope; and are the maximum and minimum pheromone concentrations, respectively.

[0012] In one embodiment of the present invention, calculating the node fitness according to the quality of the detection path includes: The node fitness is calculated using the following formula: , in, is the node fitness; Node i is the trajectory length of the starting point, δ is the decay rate, t is the number of iterations.

[0013] In one embodiment of the present invention, calculating the node selection probability based on the node fitness includes: The node selection probability is calculated using the following formula: ,

[0014] in, n is the total number of nodes, i is the number of the starting node of the iteration, is the node fitness.

[0015] In one embodiment of the present invention, based on the node selection probability, a roulette wheel strategy is used to select the initial node of the next iteration of the ant colony, including: Map node selection probabilities to interval, generate random numbers , the initial node for the next iteration is selected by the following formula: , in, i is the number of the starting node of the iteration, k For the selection probability interval in the roulette selection strategy, the qualified k This is the starting node of the next iteration that is finally determined i , is the probability of the starting node being selected, which is obtained according to the fitness of the node.

[0016] The above technical solution of the present invention has the following advantages over the prior art: Compared with the traditional ant colony algorithm technology, the global inspection trajectory planning method of the three-dimensional coordinate measuring machine based on the improved ant colony algorithm described in the present invention comprehensively considers factors such as collision avoidance cost, number of angle changes and path smoothness in the improved heuristic value between nodes, reconstructs the heuristic function of the ant colony algorithm, enhances the algorithm's adaptability to complex workpiece features, improves the algorithm's global optimization capability, and has the advantages of excellent trajectory planning quality and adaptability to complex workpieces.

[0017] The present invention improves the global search capability and convergence efficiency of the algorithm through dynamic adjustment of volatility coefficient, pheromone reward and punishment mechanism and pheromone concentration limitation in the pheromone dynamic update mechanism.

[0018] The present invention selects the initial node for the next iteration based on the roulette wheel strategy and optimizes the initial node selection through probability. This probability-based random selection mechanism not only ensures the positive feedback effect of high-quality starting points being selected with high frequency, but also maintains the diversity of the search through randomness, thereby accelerating the speed at which the ant colony converges to the high-quality starting point. BRIEF DESCRIPTION OF THE DRAWINGS

[0019] In order to make the contents of the present invention more clearly understood, the present invention is further described in detail below based on specific embodiments of the present invention in conjunction with the accompanying drawings.

[0020] Figure 1 This is a flowchart of the improved ant colony algorithm of the present invention.

[0021] Figure 2 Define a graph for detecting distances between elements.

[0022] Figure 3 It is the CAD model of the workpiece to be tested.

[0023] Figure 4 This is the trajectory planning result of the traditional ant colony algorithm.

[0024] Figure 5 This is the trajectory planning result of Wang Gang's algorithm.

[0025] Figure 6 This is the planning result of the algorithm of the present invention. DETAILED DESCRIPTION

[0026] The present invention will be further described below with reference to the accompanying drawings and specific embodiments so that those skilled in the art can better understand the present invention and implement it. However, the embodiments are not intended to limit the present invention.

[0027] Example 1 Reference Figure 1 As shown in FIG, a global detection trajectory planning method for a three-coordinate measuring machine based on an improved ant colony algorithm includes the following steps: Step S1: obtaining the geometric features to be measured of the workpiece and using them as nodes, and constructing a distance adjacency matrix based on the nodes, wherein the distance adjacency matrix is ​​used to define the trajectory distance between each of the nodes.

[0028] Figure 3The information of the geometric features to be measured of the workpiece is shown in Table 1. According to the distance from the end point of the local trajectory of the current geometric feature to be measured to the starting point of the local trajectory of the next geometric feature to be measured, the trajectory distance between any two nodes is obtained, and the trajectory distance between any two nodes is used as an element to generate a distance adjacency matrix.

[0029] It should be noted that when using the improved ant colony algorithm to plan the global trajectory, the geometric features to be measured are all nodes in the algorithm. Since geometric features are not points without area, the distance between nodes needs to be defined. The distance from feature 1 to feature 2 is defined as the length of the trajectory from the end point of the local trajectory in feature 1 to the starting point of the local feature in feature 2, such as Figure 2 in 、 、 and According to the above definition, the distance between each feature to be measured in the workpiece is calculated, and the distance adjacency matrix of the nodes in the ant colony algorithm is constructed.

[0030] In Table 1, the probe angle "A×B×" represents the probe rotation angle around the A-axis (X-axis) and the probe rotation angle around the B-axis (Y-axis).

[0031] Table 1: Geometric feature information of the workpiece to be measured

[0032] Step S2: Initialize the relevant parameters of the improved ant colony algorithm and the initial iteration position of the ants.

[0033] Step S201: The relevant parameters of the improved ant colony algorithm are specifically set as shown in Table 2 and Table 3.

[0034] Table 2: Related parameters of improved ant colony algorithm

[0035] Table 3: Related parameters of improved ant colony algorithm 2

[0036] Among them, the relevant parameters include the number of nodes n 、Number of ants m , Communication Heuristic Factor α , Expectation Heuristic Factor β , pheromone constant Q , the weight factor of the distance between nodes , weight factor of probe angle transformation , weight factor of path smoothness , The extra track distance due to the change of the probe angle , the reduction value of pheromone volatility coefficient after each iteration , the initial maximum value of the pheromone volatility coefficient 、 , optimal path pheromone increment , Worst path pheromone deduction , attenuation rate δ , maximum number of iterations , pheromone extreme value and and other related parameters.

[0037] Step S202: 44 ants are evenly placed on 22 nodes as the starting nodes for algorithm iteration. Then, the algorithm iteration begins in step S3.

[0038] Step S3: Ant colony iterative search for detection paths. Based on the algorithm parameters initialized in step S2 and the distance adjacency matrix of the geometric features to be measured, the improved ant colony algorithm is used to iteratively search for the global detection path. The specific process is as follows: Each ant starts from the initial node and selects the next node based on the state transition probability until the ant has traversed all nodes and built a complete detection path. The calculation formula for the state transition probability is: , in, is the state transition probability, For nodes i and j The pheromone value between For nodes i and j Improved heuristic value between is the communication heuristic factor, is the expectation heuristic factor, is the set of spatial nodes that have not been visited in the problem space, which can be used as the target point set for the next move. is the number of iterations.

[0039] Specifically, the improved heuristic value between nodes Taking into account the distance, probe angle transformation and path smoothness, the calculation formula is: , in, To improve the heuristic value; is the weight factor of the distance between nodes, and its value range is [0-4]; Representation node i arrive j The straight-line distance between Representation node i arrive j The distance between the two vehicles increased due to collision avoidance; is the weight factor of the probe angle transformation, and its value range is [0-4]; Representation node i arrive j The number of probe angle changes required; It is a fixed value, indicating the extra track distance due to the change of probe angle; is the weight factor of path smoothness, ranging from [0-4]; Indicates that the node i arrive j The number of inflection points on the path.

[0040] After all ants have traversed all nodes and constructed a complete detection path, the process determines whether the current number of iterations has reached the preset maximum number of iterations. If so, the process proceeds to step S5; otherwise, the process proceeds to step S4 to update the pheromone and select the initial node for the next iteration.

[0041] Step S4: Update the pheromone according to the path quality and select the initial node for the next iteration based on the roulette strategy.

[0042] Based on the detection path generated in step S3, the pheromone matrix is ​​updated according to the path quality, and the initial node for the next iteration is selected through the roulette strategy. The specific steps are as follows: Step S401: Update global pheromone. Update inter-node pheromone according to path quality. The formula is: , in, For nodes i To Node j The pheromone increment is the sum of pheromones left by the ants passing through this path in this iteration. ρ Dynamic adjustment, the calculation formula is: , in, t is the current iteration number, After each iteration ρ The reduction value, is the initial maximum value of the pheromone volatility coefficient. When the initial maximum value drops to After that, it no longer decreases. is the minimum value of the pheromone volatility coefficient.

[0043] In addition, a reward and punishment mechanism based on path quality is set when updating pheromones, and the optimal path pheromone increment is increased for the historical optimal detection path. , deduct the worst path pheromone deduction amount from the worst historical detection path , and limit the pheromone concentration to [ , ] within the scope; and They are the maximum and minimum pheromone concentrations, respectively. By limiting the extreme value of pheromone concentration, we can prevent excessive or insufficient pheromone between nodes.

[0044] It should be noted that during the iteration process of the ant colony algorithm, when the historical optimal path is found, pheromone rewards are applied to each edge of the path, and the pheromone increment of the historical optimal detection path is increased. , increasing the probability of subsequent ants choosing this path, thus forming a positive incentive. On the contrary, for the worst path in history, by deducting the pheromone deduction amount of the worst detection path in history, Punishment is performed to reduce its negative impact on subsequent searches, thereby improving the pheromone update process.

[0045] At the same time, the maximum and minimum pheromone concentrations are set for each path. When , it is cut off to prevent the path from being over-selected by ants due to pheromone oversaturation; if it is lower than , it is raised to to avoid the path being completely abandoned due to pheromone deficiency.

[0046] Step S402: Select the initial node for the next iteration of the ant colony. Calculate the node fitness based on the path quality: , in, is the node fitness, Node i is the path length from the starting point, δ is the attenuation rate, t is the number of iterations. The node selection probability is: , Map node selection probabilities to interval, generate random numbers , select the initial node for the next iteration by the formula: , in, i is the number of the starting node of the iteration, k For the selection probability interval in the roulette selection strategy, the qualified k This is the starting node of the next iteration that is finally determined i , is the probability of the starting node being selected, which is obtained according to the fitness of the node.

[0047] After completing pheromone update and initial node selection, return to step S3.

[0048] Step S5: Output the algorithm planning result and select the detection path with the shortest length in the iterative process as the global optimal detection trajectory.

[0049] In order to verify the effectiveness of the global planning algorithm proposed in this paper on improving the overall quality of the trajectory, the improved ant colony planning algorithm in this paper is compared with the traditional ant colony planning algorithm and the global detection trajectory planning algorithm proposed by Wang Gang in his paper "Research and Implementation of Detection Path Planning System for Coordinate Measuring Machines [D]. Wuhan University of Technology, 2020." Three groups of comparative experiments are designed. Figure 3 The global detection trajectory planning of the workpiece to be tested is performed, and the collision avoidance method and sampling strategy are kept the same as the local trajectory. Three groups of comparative experiments are carried out using the above three planning methods (traditional ant colony algorithm, Wang Gang algorithm, and the algorithm of the present invention) to plan the detection trajectory. The trajectory planning results are shown in Figure 2. Figure 4 、 Figure 5 and Figure 6 The detailed information of the detection trajectory planning results is shown in Table 4.

[0050] Table 4: Detailed information on detection trajectory planning results

[0051] It can be concluded from the test results that since the traditional ant colony planning algorithm adopts a planning strategy of planning first and then correcting, the trajectory obtained by the algorithm needs to be corrected twice after the probe angle transformation and collision avoidance, resulting in a low quality of the trajectory results planned by the algorithm. Wang Gang's planning algorithm plans the global trajectory based on the solution of the feature obstacle avoidance time matrix, and the quality of the planned trajectory has been greatly improved compared with the traditional ant colony planning algorithm. However, due to the lack of a global perspective, the greedy algorithm has a relatively limited ability to obtain the global optimal solution when dealing with trajectory planning problems with a large number of features. The present invention enhances the ability of the algorithm to obtain the global optimal solution in the three-coordinate detection trajectory planning problem by improving the heuristic function, information update method and ant colony iteration initial point determination method of the traditional ant colony algorithm. The results in Table 4 show that in this comparative test, the trajectory length planned by the algorithm of the present invention is 23% lower than that of the traditional ant colony algorithm and 7% lower than that of Wang Gang's planning algorithm, verifying the effectiveness of the global planning algorithm proposed in the present invention.

[0052] Those skilled in the art will appreciate that embodiments of the present invention may be provided as methods, systems, or computer program products. Thus, the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, the present invention may take the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to magnetic disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code.

[0053] The present invention is described with reference to flowcharts and / or block diagrams of methods, devices (systems), and computer program products according to embodiments of the present invention. It should be understood that each process and / or block in the flowcharts and / or block diagrams, as well as combinations of processes and / or blocks in the flowcharts and / or block diagrams, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing device to produce a machine, so that the instructions executed by the processor of the computer or other programmable data processing device generate instructions for implementing the processes in the flowcharts and / or block diagrams. Figure 1 a process or multiple processes and / or boxes Figure 1 A device that provides the functions specified in a block or multiple blocks.

[0054] These computer program instructions may also be stored in a computer readable memory that can direct a computer or other programmable data processing device to work in a specific manner, so that the instructions stored in the computer readable memory produce an article of manufacture comprising an instruction device, which implements the process Figure 1 a process or multiple processes and / or boxes Figure 1 The function specified in one or more boxes.

[0055] These computer program instructions can also be loaded onto a computer or other programmable data processing device so that a series of operational steps are executed on the computer or other programmable device to produce a computer-implemented process, thereby providing the instructions executed on the computer or other programmable device for implementing the process. Figure 1 a process or multiple processes and / or boxes Figure 1 A step that specifies a function in one or more boxes.

[0056] Finally, it should be noted that the above specific implementation methods are only used to illustrate the technical solutions of the present invention and are not limiting. Although the present invention has been described in detail with reference to examples, those skilled in the art should understand that the technical solutions of the present invention can be modified or replaced by equivalents without departing from the spirit and scope of the technical solutions of the present invention, which should all be included in the scope of the claims of the present invention.

Claims

1. A global detection trajectory planning method for a three-coordinate measuring machine based on an improved ant colony algorithm is characterized by: The steps include: Acquire the geometric features to be measured of the workpiece and use them as nodes, and construct a distance adjacency matrix based on the nodes, wherein the distance adjacency matrix is ​​used to define the trajectory distance between each of the nodes; Initialize the relevant parameters of the improved ant colony algorithm and the initial iteration position of the ants, and evenly place the number of ants on each node as the starting node; Performing an ant colony iterative search for a detection path, including: obtaining an improved heuristic value based on relevant parameters and the distance adjacency matrix, obtaining a state transition probability based on the improved heuristic value, each ant starting from the initial node and sequentially selecting a next node based on the state transition probability until the ants have traversed all nodes to obtain a complete detection path; updating pheromones between nodes according to the quality of the detection path; calculating node fitness according to the quality of the detection path, and calculating node selection probability based on the node fitness; and selecting an initial node for the next iteration of the ant colony using a roulette wheel strategy based on the node selection probability; Based on the updated pheromone and the initial node of the next iteration of the ant colony, the ant colony iterative search and detection path process is repeated; In response to the current number of iterations reaching a preset maximum number of iterations, the detection path with the shortest length in the iteration process is selected as the global optimal detection trajectory.

2. The global detection trajectory planning method for a three-coordinate measuring machine based on an improved ant colony algorithm according to claim 1 is characterized in that: Constructing a distance adjacency matrix based on the nodes, including: According to the distance from the end point of the local trajectory of the current geometric feature to be measured to the starting point of the local trajectory of the next geometric feature to be measured, the trajectory distance between any two nodes is obtained, the trajectory distance between any two nodes is used as an element, and a distance adjacency matrix is ​​generated.

3. The global detection trajectory planning method for a three-coordinate measuring machine based on an improved ant colony algorithm according to claim 1 is characterized in that: The calculation formula of the state transition probability is: , in, is the state transition probability, For nodes i and j The pheromone value between For nodes i and j Improved heuristic value between is the communication heuristic factor, is the expectation heuristic factor, is the set of nodes that have not been visited. is the number of iterations.

4. The global detection trajectory planning method for a three-coordinate measuring machine based on an improved ant colony algorithm according to claim 1 is characterized in that: The calculation formula of the improved heuristic value is: , in, To improve the heuristic value; is the weight factor of the distance between nodes, and its value range is [0-4]; Representation node i arrive j The straight-line distance between Representation node i arrive j The distance between the two vehicles increased due to collision avoidance; is the weight factor of the probe angle transformation, and its value range is [0-4]; Representation node i arrive j The number of probe angle changes required; It is a fixed value, indicating the extra track distance due to the change of probe angle; is the weight factor of path smoothness, ranging from [0-4]; Indicates that the node i arrive j The number of inflection points on the path.

5. The global detection trajectory planning method for a three-coordinate measuring machine based on an improved ant colony algorithm according to claim 1 is characterized in that: Based on the quality of the detection path, updating the pheromone between nodes includes: Update pheromones using the following formula: , in, For nodes i arrive j pheromone increment; ρ is the dynamic volatility coefficient of pheromone, and the calculation formula is: , in, t is the current iteration number; After each iteration ρ The reduction value; is the initial maximum value of the pheromone volatility coefficient.

6. The global detection trajectory planning method for a three-coordinate measuring machine based on an improved ant colony algorithm according to claim 1, characterized in that: Updating the pheromone between nodes according to the quality of the detection path also includes: Increase the optimal path pheromone increment for the historical optimal detection path , deduct the worst path pheromone deduction amount from the worst historical detection path , and limit the pheromone concentration to [ , ] within the scope; and are the maximum and minimum pheromone concentrations, respectively.

7. The global detection trajectory planning method for a three-coordinate measuring machine based on an improved ant colony algorithm according to claim 1 is characterized in that: Calculating node fitness according to the quality of the detection path includes: The node fitness is calculated using the following formula: , in, is the node fitness; Node i is the trajectory length of the starting point, δ is the decay rate, t is the number of iterations.

8. The global detection trajectory planning method for a three-coordinate measuring machine based on an improved ant colony algorithm according to claim 1, characterized in that: Calculating a node selection probability based on the node fitness includes: The node selection probability is calculated using the following formula: , in, n is the total number of nodes, i is the number of the starting node of the iteration, is the node fitness.

9. The global detection trajectory planning method for a three-coordinate measuring machine based on an improved ant colony algorithm according to claim 1, characterized in that: Based on the node selection probability, the roulette wheel strategy is used to select the initial node of the next iteration of the ant colony, including: Map node selection probabilities to interval, generate random numbers , the initial node for the next iteration is selected by the following formula: , in, i is the number of the starting node of the iteration, k For the selection probability interval in the roulette selection strategy, the qualified k This is the starting node of the next iteration that is finally determined i , is the probability of the starting node being selected, which is obtained according to the fitness of the node.

Citation Information

Patent Citations

  • Application method of adaptive ant colony algorithm (AACO) in mobile robot path planning

    CN108241375A

  • Obstacle avoidance route generation method and device, unmanned equipment and storage medium

    CN112229414A

  • Path planning method based on multi-objective optimization smoothing ant colony algorithm

    CN115033004A

  • 3D printer contour path planning method based on improved ant colony algorithm

    CN115933518A

Cited By

  • Ocean platform pipeline wiring method and system based on ant colony optimization algorithm, and medium

    CN121351323A