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

Quanbao Guo and Keni Qiu
Capital Normal University


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 unsatisfactory wiring results. To address these issues, this paper proposes an A* Algorithm-based OPtimizer strategy for PCB automatic routing, named A2OP. The proposed A2OP strategy introduces two key factors to the heuristic function of the A* algorithm: the parent node and dynamic weights. In such way, a faster and more favorable routing planning can be achieved. Our preliminary experimental results can validate the efficacy of the A2OP in PCB design.