Study On The Channelized Auto-routing Method Of Multi-pipeline Based On A* Algorithm

In the production of the electronic manufacturing equipment, there are a lot of design problem about various pipelines routing of cables and tubes (referred to as "pipeline auto-routing"). To realize pipeline auto-routing benefit to improve the efficiency and reduce the cost of pipeline routing, and there is an important significance to improve the electronic manufacturing equipment design quality and shorten manufacturing cycle. Therefore, target to the electronic manufacturing equipment, this paper studied on the method of pipeline auto-routing.First, this paper analyzed the space characteristics of the pipeline routing of electronic manufacturing equipment, and established the discrete routing space model by using the method of making the routing space as grids. And set three levels weight for grids because there is some different feasibility when a pipeline is laid on some different positions. And the weight will be changed when equipments are laid on the routing space, so this paper introduced the coordinate transformation method to find the coordinates of equipment occupied position and the connection ports, and then modified the space feasibility weights.Then, this paper analyzed the general pipeline routing constraints, and summarized pipeline routing rules of the electronic manufacturing equipment, and established the mathematical expressions about varieties of points and lines on pipeline routing, based on above established the single-pipeline routing constraint model. Based on this, and according to the characteristic of forming channels when multi-pipeline routing, established the multi-pipeline routing constraint model.Furthermore, this paper analyzed advantages of the A* algorithm and the shortcomings when using in multi-pipeline routing, then improved the A* algorithm based on shortcomings: introduced the space feasibility factor, the channel weight factor and the pipeline bending evaluation item into the A* algorithm evaluation function, and gave some methods to deal with the constraints of the connection points, the pipeline port outspreaded length and the pipeline rigid, and on the data structure using the minimum binary heap to improve the path-finding speed.Finally, this paper summarized the realizing steps of multi-pipeline routing, and abased on it designed an example. This example tested the pipeline routing results according to the different constraint for four groups, and by comparing the four results verified that this paper's method is scientific and practical.