Dispensing Path Planning Research In Surface Mount Technology

The PCB industry is a global industry,and the global PCB ma rket is expected to reach $66 billion in 2019.PCB is an important part of the electronics industry.The surface mount process is an important process in PCB production.The dispensing process is mainly realized by the dispenser in the high-end manufacturing industry.The dispensing path in the process has a great impact on the production efficiency.At present,the dispensing path planning algorithm in the surface mount process has the disadvantages of long solution time and easy to fall into the local optimal solution.In order to solve these problems,this paper proposes an improved ant colony algorithm and applies it to the three-axis dispenser platform to carry out the experimental research on the dispensing path optimization.Aiming at the path optimization in dispensing,a k-means adaptive information volatilizer dynamic adjustment ant colony algorithm is proposed.This topic constructs a problem model of dispensing path optimization,builds a three-axis dispensing experiment platform,realizes the pos itioning of the PCB board in production through the Mark circle detection algorithm,and completes the coordinate transformation of the dispensing position.By analyzing the ant colony algorithm used in the route planning,the main problem of solving the large-scale TSP problem for the ant colony algorithm is that the solution time is longer and the local optimal solution is easy to fall into.The improvement direction of the algorithm is proposed.In solving the time optimization,using the idea of divide and conquer,the k-means clustering algorithm is used to group the data,and then the path optimization is solved for the sub-problems,and the inter-class connections of the sub-problems are obtained to obtain the final optimization path.In the improvement of the solution quality,this paper proposes to dynamically adjust the information volatilization rate of the ant colony algorithm,and use this algorithm in solving the sub-problems after grouping to achieve the purpose of jumping out the local optimal solution.In the algorithm test,the ant colony algorithm and the improved algorithm proposed in this paper are tested by the internationally accepted TSPlib data set.In the experimental verification,the effectiveness of the improved algorithm in optimizing the dispensing path is verified on the three-axis dispensing platform,and compared with the original X-direction,Y-direction path optimization algorithm and the solution of the ant colony algorithm.The experimental results show that compared with t he original algorithm and ant colony algorithm,the improved algorithm proposed in this paper has significantly improved the solution time and path length optimization,which can effectively improve the efficiency of the dispensing process in the surface m ount process and improve the PCB industry production efficiency.