Reinforcement Learning Based PCB Routing Using Dueling Double Deep Q Network
With the development of technology, the circuits on printed circuit boards(PCB) become more and more complex. Traditional PCB routing methods often rely on experiences and heuristic rules, which are inefficient and difficult to guarantee the global optimal solution in complex design. This paper introduces a multi-agent reinforcement learning algorithm based on local observation, which is designed to optimize the auto routing process of PCB by dueling double deep Q network(D3QN). This method combines the advantages of deep reinforcement learning and double Q learning, and can learn and optimize strategies more effectively in high-dimensional state space. The experimental results show that the routing method in this paper shows high adaptability and flexibility in dealing with routing tasks, which not only improves the routing efficiency, but also improves the routing rate.
Authors
- Xiaoyu Liang (ORCID: https://orcid.org/0000-0002-5134-7501)
- Xiao Yu-xing (ORCID: https://orcid.org/0000-0002-1993-9638)
- Zhi Long Zhang (ORCID: https://orcid.org/0000-0003-3594-6739)
- Qiaoyuan Xiang
Institutions
- Wuhan University of Technology (CN)
Publication Details
- Published
- 2024-10-25
- DOI
- https://doi.org/10.1109/icicm63644.2024.10814351
- Citations
- 2
- Primary Topic
- Cellular Automata and Applications
- Type
- article
- Field-Weighted Citation Impact
- 0.72