A²OP: an A* Algorithm OPtimizer with the Heuristic Function for PCB Automatic Routing

The A* algorithm has been widely employed in Printed Circuit Board (PCB) routing planning. As the routing complexity grows, there are two critical problems with the common A* algorithm: too large searching space and unacceptable routing results. To address these issues, this paper proposes an A* Algorithm-based OPtimizer strategy for PCB automatic routing(A(2)OP). The proposed A(2)OP strategy introduces two key factors to enhance the heuristic function of the A* algorithm: the parent node and dynamic weights. In such way, the initial experiments validate that a faster and more favorable routing planning can be achieved.