Unet-Astar: A Deep Learning-Based Fast Routing Algorithm for Unified PCB Routing

被引:0
|
作者
Yin, Shiyuan [1 ]
Jin, Min [1 ]
Chen, Gang [1 ]
Gong, Guoliang [1 ]
Mao, Wenyu [1 ]
Lu, Huaxiang [1 ,2 ,3 ,4 ]
机构
[1] Chinese Acad Sci, Inst Semicond, High Speed Circuit & Neural Network Lab, Beijing 100083, Peoples R China
[2] Semicond Neural Network Intelligent Percept & Comp, Beijing 100083, Peoples R China
[3] Univ Chinese Acad Sci, Coll Microelect, Beijing 100049, Peoples R China
[4] Univ Chinese Acad Sci, Mat & Optoelect Res Ctr, Beijing 100049, Peoples R China
基金
中国国家自然科学基金;
关键词
Routing; Solid modeling; Layout; Task analysis; Prediction algorithms; Machine learning algorithms; Physical design; Printed circuits; Machine learning; printed circuit board; routing; machine learning; ESCAPE; DESIGN;
D O I
10.1109/ACCESS.2023.3323589
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In recent years, there has been extensive research on the routing problem of printed circuit boards (PCBs). Due to the increasing number of pins, high pin density, and unique physical constraints, manual PCB routing has become a time-consuming task to achieve design convergence. Previous work decomposed the problem into escape routing and area routing, focusing on these problems separately. However, there was always a gap between these two problems, requiring significant human effort for iterative algorithm adjustments. Furthermore, previous area routing work mainly focused on routing between ball grid array (BGA) packages in escape routing. However, in practice, many components are not in the form of BGA packages, such as passive devices, decoupling capacitors, and through-hole pin arrays. Therefore, it is necessary to study a unified routing approach. The current unified routing approach adopts the A* algorithm, but there is still room for improvement in routing speed. This paper proposes a new algorithm called Unet-Astar, which accelerates the routing efficiency by employing deep learning algorithms in a simulated environment. Additionally, a Deeper Unet is proposed for generating recommended regions for the routing algorithm. The new network structure can provide more contextual information, thereby improving routing efficiency. Experimental results demonstrate the effectiveness and efficiency of the proposed algorithm. Specifically, for all given test cases, our router achieves approximately a 70% improvement in runtime speed compared to the old router. Another major contribution of this work is the development of a routing problem set generator, which can generate parameterized routing problem sets with different sizes and constraints. This enables the evaluation of different routing algorithms and the generation of training datasets for future data-driven routing methods. All the code has been open-sourced and can be found at https://github.com/Firesuiry/Unet-Astar-For-PCB-Routing.
引用
收藏
页码:113712 / 113725
页数:14
相关论文
共 50 条
  • [1] Multi-Agent Deep Reinforcement Learning-Based Algorithm For Fast Generalization On Routing Problems
    Barbahan, Ibraheem
    Baikalov, Vladimir
    Vyatkin, Valeriy
    Filchenkov, Andrey
    10TH INTERNATIONAL YOUNG SCIENTISTS CONFERENCE IN COMPUTATIONAL SCIENCE (YSC2021), 2021, 193 : 228 - 238
  • [2] Deep Reinforcement Learning-Based Collaborative Routing Algorithm for Clustered MANETs
    Li, Zexu
    Li, Yong
    Wang, Wenbo
    CHINA COMMUNICATIONS, 2023, 20 (03) : 185 - 200
  • [3] Deep Reinforcement Learning-Based Collaborative Routing Algorithm for Clustered MANETs
    Zexu Li
    Yong Li
    Wenbo Wang
    China Communications, 2023, 20 (03) : 185 - 200
  • [4] A Deep Reinforcement Learning-based Routing Algorithm for Unknown Erroneous Cells in DMFBs
    Kawakami, Tomohisa
    Shiro, Chiharu
    Nishikawa, Hiroki
    Kong, Xiangbo
    Tomiyama, Hiroyuki
    Yamashita, Shigeru
    2023 21ST IEEE INTERREGIONAL NEWCAS CONFERENCE, NEWCAS, 2023,
  • [5] Deep Reinforcement Learning-Based Routing Optimization Algorithm for Edge Data Center
    Zhao, Jixin
    Zhang, Shukui
    Zhang, Yang
    Zhang, Li
    Long, Hao
    26TH IEEE SYMPOSIUM ON COMPUTERS AND COMMUNICATIONS (IEEE ISCC 2021), 2021,
  • [6] Research on Cluster Routing Protocol Based on Genetic Algorithm and Astar Algorithm
    Shao, Wenqian
    Jia, Songhao
    Yang, Cai
    Shangguan, Tonghang
    Informatica (Slovenia), 2024, 48 (14): : 219 - 232
  • [7] A deep learning-based constrained intelligent routing method
    Rao, Zheheng
    Xu, Yanyan
    Pan, Shaoming
    PEER-TO-PEER NETWORKING AND APPLICATIONS, 2021, 14 (04) : 2224 - 2235
  • [8] A deep learning-based constrained intelligent routing method
    Zheheng Rao
    Yanyan Xu
    Shaoming Pan
    Peer-to-Peer Networking and Applications, 2021, 14 : 2224 - 2235
  • [9] RL-Routing: An SDN Routing Algorithm Based on Deep Reinforcement Learning
    Chen, Yi-Ren
    Rezapour, Amir
    Tzeng, Wen-Guey
    Tsai, Shi-Chun
    IEEE TRANSACTIONS ON NETWORK SCIENCE AND ENGINEERING, 2020, 7 (04): : 3185 - 3199
  • [10] A Deep Reinforcement Learning-Based Geographic Packet Routing Optimization
    Bai, Yijie
    Zhang, Xia
    Yu, Daojie
    Li, Shengxiang
    Wang, Yu
    Lei, Shuntian
    Tian, Zhoutai
    IEEE ACCESS, 2022, 10 : 108785 - 108796