Graph-Based Reinforcement Learning Approach for Multi-Power-Domain PCB PDN Shape and Stackup Synthesis

Efficient power plane and stackup optimization is critical for Printed Circuit Board (PCB) Power Delivery Networks (PDNs), particularly in multi-power-domain designs with stringent DC Resistance (DCR) specifications. This work presents a novel reinforcement learning-based framework that assigns stackup layers for each power domain and iteratively refines power plane shapes to meet design constraints while ensuring non-overlapping layouts. The approach leverages Minimum Spanning Trees (MSTs) for initializing power plane shapes. It dynamically refines them using the A* (A-Star) algorithm with weighted pathfinding, ensuring optimal connectivity and compliance with DCR requirements. Tested extensively on multi-power-domain scenarios, the algorithm demonstrates robust performance and scalability, offering an unprecedented solution to power plane and stackup optimization challenges in PCB PDN design.

Institutions

Publication Details

Published
2025-08-18
DOI
https://doi.org/10.1109/emcsipi52291.2025.11169915
Citations
1
Primary Topic
Geochemistry and Geologic Mapping
Type
article
Field-Weighted Citation Impact
2.48
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Graph-Based Reinforcement Learning Approach for Multi-Power-Domain PCB PDN Shape and Stackup Synthesis

1 citations
Geochemistry and Geologic Mapping
2.48
article

Graph-Based Reinforcement Learning Approach for Multi-Power-Domain PCB PDN Shape and Stackup Synthesis

article en
1 citations

Abstract

Efficient power plane and stackup optimization is critical for Printed Circuit Board (PCB) Power Delivery Networks (PDNs), particularly in multi-power-domain designs with stringent DC Resistance (DCR) specifications. This work presents a novel reinforcement learning-based framework that assigns stackup layers for each power domain and iteratively refines power plane shapes to meet design constraints while ensuring non-overlapping layouts. The approach leverages Minimum Spanning Trees (MSTs) for initializing power plane shapes. It dynamically refines them using the A* (A-Star) algorithm with weighted pathfinding, ensuring optimal connectivity and compliance with DCR requirements. Tested extensively on multi-power-domain scenarios, the algorithm demonstrates robust performance and scalability, offering an unprecedented solution to power plane and stackup optimization challenges in PCB PDN design.

Google (United States) (US), Missouri University of Science and Technology (US)
Openalex Percentile: Top 6%
Geochemistry and Geologic Mapping
2.48
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.