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

Institutions

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
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Reinforcement Learning Based PCB Routing Using Dueling Double Deep Q Network

Xiaoyu Liang, Xiao Yu-xing, Zhi Long Zhang, Qiaoyuan Xiang
2 citations
Cellular Automata and Applications
0.72
article

Reinforcement Learning Based PCB Routing Using Dueling Double Deep Q Network

Xiaoyu Liang, Xiao Yu-xing, Zhi Long Zhang, Qiaoyuan Xiang
article en
2 citations

Abstract

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.

Wuhan University of Technology (CN)
Openalex Percentile: Top 24%
Cellular Automata and Applications
0.72
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Reinforcement Learning Based PCB Routing Using Dueling Double Deep Q Network — Xiaoyu Liang, Xiao Yu-xing, et al. · (2024) | TGRS Research Map | TGRS