Speaker:Youbiao He

PCB routing Using Polygon-based Dynamic Partitioning and MCTS

Routing plays a pivotal role in the design of printed circuit boards (PCBs). Existing automated routers typically tackle the routing problem by dividing it into two separate phases: escape routing and area routing. However, this approach often leads to suboptimal solutions or even the absence of solutions when transitioning from escape routing to area routing. In our work, we propose a novel pad-focused, net-by-net, two-stage PCB routing approach comprising of a Monte Carlo tree search (MCTS)-based

global routing stage, followed by an A*-based detailed routing stage. To bridge the gap between the global and detailed routing stages, we introduce a polygon-based dynamic routable region partitioning mechanism, ensuring that a detailed routing solution exists when a global routing solution is present. Our approach outperforms state-of-the-art routers in terms of the success rate and total wirelength on the test set.

Committee: Forrest Bao (major professor), Samik Basu, Jin Tian, Wensheng Zhang and Mai Zheng

Campus Location: 235 Atanasoff Hall

Join on Zoom: https://iastate.zoom.us/j/96604497735