mlsanityData to 7 Oct 2026

Fast ML-driven Analog Circuit Layout using Reinforcement Learning and Steiner Trees

arXiv 2405.16951 ↗First posted 27 May 2024cs.LGcited by 5

Not on the map. Why?

Abstract (arXiv)

This paper presents an artificial intelligence driven methodology to reduce the bottleneck often encountered in the analog ICs layout phase. We frame the floorplanning problem as a Markov Decision Process and leverage reinforcement learning for automatic placement generation under established topological constraints. Consequently, we introduce Steiner tree-based methods for the global routing step and generate guiding paths to be used to connect every circuit block. Finally, by integrating these solutions into a procedural generation framework, we present a unified pipeline that bridges the divide between circuit design and verification steps. Experimental results demonstrate the efficacy in generating complete layouts, eventually reducing runtimes to 1.5% compared to manual efforts.

Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 4 of its 17 references that are in the map. First posted on arXiv 27 May 2024.

Builds on

4 of 17 references.

References · 4

  1. 2017Proximal Policy Optimization Algorithmscited by 14,441
  2. 2020Reinforcement Learning for Combinatorial Optimization: A Surveycited by 235
  3. 2019A Deep Reinforcement Learning Approach for Global Routingcited by 20
  4. 2019Reinforcement Learning Driven Heuristic Optimizationcited by 12

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 1; 2025: 1; 2026: 3.

5 papers.