Advancing Routing-Awareness in Analog ICs Floorplanning
- URL: http://arxiv.org/abs/2510.15387v1
- Date: Fri, 17 Oct 2025 07:39:24 GMT
- Title: Advancing Routing-Awareness in Analog ICs Floorplanning
- Authors: Davide Basso, Luca Bortolussi, Mirjana Videnovic-Misic, Husni Habal,
- Abstract summary: We develop an automatic floorplanning engine based on reinforcement learning and relational graph convolutional neural network.<n>A combination of increased grid resolution and precise pin information integration, along with a dynamic routing resource estimation technique, allows balancing routing and area efficiency.
- Score: 3.2957112871590772
- License: http://creativecommons.org/licenses/by-nc-nd/4.0/
- Abstract: The adoption of machine learning-based techniques for analog integrated circuit layout, unlike its digital counterpart, has been limited by the stringent requirements imposed by electric and problem-specific constraints, along with the interdependence of floorplanning and routing steps. In this work, we address a prevalent concern among layout engineers regarding the need for readily available routing-aware floorplanning solutions. To this extent, we develop an automatic floorplanning engine based on reinforcement learning and relational graph convolutional neural network specifically tailored to condition the floorplan generation towards more routable outcomes. A combination of increased grid resolution and precise pin information integration, along with a dynamic routing resource estimation technique, allows balancing routing and area efficiency, eventually meeting industrial standards. When analyzing the place and route effectiveness in a simulated environment, the proposed approach achieves a 13.8% reduction in dead space, a 40.6% reduction in wirelength and a 73.4% increase in routing success when compared to past learning-based state-of-the-art techniques.
Related papers
- Alpamayo-R1: Bridging Reasoning and Action Prediction for Generalizable Autonomous Driving in the Long Tail [85.47497935739936]
Alpamayo-R1 (AR1) is a vision-language-action model that integrates Chain of Causation reasoning with trajectory planning.<n>We show AR1 achieves 12% improvement in planning accuracy on challenging cases compared to a trajectory-only baseline.<n>We plan to release AR1 models and a subset of the CoC in a future update.
arXiv Detail & Related papers (2025-10-30T01:25:34Z) - Enhancing Reinforcement Learning for the Floorplanning of Analog ICs with Beam Search [0.32985979395737786]
This paper presents a hybrid method that combines reinforcement learning (RL) with a beam (BS) strategy.<n>The BS algorithm enhances the agent's inference process, allowing for the generation of flexible floorplans.<n> Experimental results show approx. 5-85% improvement in area, dead space and half-perimeter wire length compared to a standard RL application.
arXiv Detail & Related papers (2025-05-08T08:50:32Z) - JPDS-NN: Reinforcement Learning-Based Dynamic Task Allocation for Agricultural Vehicle Routing Optimization [3.559425487157277]
The Entrance Dependent Vehicle Routing Problem (EDVRP) is a variant of the Vehicle Problem (VRP) where the scale of cities influences routing outcomes.<n>We propose a Joint Probability Distribution Sampling Neural Network (JPDS-NN) to effectively solve the EDVRP.<n>We show that JPDS-NN reduces travel distances by 48.4-65.4%, lowers fuel consumption by 14.0-17.6%, and computes two orders of magnitude faster than baseline methods.
arXiv Detail & Related papers (2025-03-04T07:50:32Z) - AI-in-the-Loop Sensing and Communication Joint Design for Edge Intelligence [65.29835430845893]
We propose a framework that enhances edge intelligence through AI-in-the-loop joint sensing and communication.<n>A key contribution of our work is establishing an explicit relationship between validation loss and the system's tunable parameters.<n>We show that our framework reduces communication energy consumption by up to 77 percent and sensing costs measured by the number of samples by up to 52 percent.
arXiv Detail & Related papers (2025-02-14T14:56:58Z) - Learning for Cross-Layer Resource Allocation in MEC-Aided Cell-Free Networks [71.30914500714262]
Cross-layer resource allocation over mobile edge computing (MEC)-aided cell-free networks can sufficiently exploit the transmitting and computing resources to promote the data rate.<n>Joint subcarrier allocation and beamforming optimization are investigated for the MEC-aided cell-free network from the perspective of deep learning.
arXiv Detail & Related papers (2024-12-21T10:18:55Z) - SCoTT: Strategic Chain-of-Thought Tasking for Wireless-Aware Robot Navigation in Digital Twins [78.53885607559958]
We propose SCoTT, a wireless-aware path planning framework.<n>We show that SCoTT achieves path gains within 2% of DP-WA* while consistently generating shorter trajectories.<n>We also show the practical viability of our approach by deploying SCoTT as a ROS node within Gazebo simulations.
arXiv Detail & Related papers (2024-11-27T10:45:49Z) - Effective Analog ICs Floorplanning with Relational Graph Neural Networks and Reinforcement Learning [0.3749861135832073]
This paper presents a novel automatic floorplanning algorithm based on reinforcement learning.
It is augmented by a relational graph convolutional neural network model for encoding circuit features and positional constraints.
Our approach surpassed established floorplanning techniques in terms of speed, area and half-perimeter wire length.
arXiv Detail & Related papers (2024-11-20T12:11:12Z) - Residual Chain Prediction for Autonomous Driving Path Planning [5.139918355140954]
Residual Chain Loss dynamically adjusts the loss calculation process to enhance the temporal dependency and accuracy of predicted path points.
Our findings highlight the potential of Residual Chain Loss to revolutionize planning component of autonomous driving systems.
arXiv Detail & Related papers (2024-04-08T11:43:40Z) - Auto-Train-Once: Controller Network Guided Automatic Network Pruning from Scratch [72.26822499434446]
Auto-Train-Once (ATO) is an innovative network pruning algorithm designed to automatically reduce the computational and storage costs of DNNs.
We provide a comprehensive convergence analysis as well as extensive experiments, and the results show that our approach achieves state-of-the-art performance across various model architectures.
arXiv Detail & Related papers (2024-03-21T02:33:37Z) - Optimal Solving of Constrained Path-Planning Problems with Graph
Convolutional Networks and Optimized Tree Search [12.457788665461312]
We propose a hybrid solving planner that combines machine learning models and an optimal solver.
We conduct experiments on realistic scenarios and show that GCN support enables substantial speedup and smoother scaling to harder problems.
arXiv Detail & Related papers (2021-08-02T16:53:21Z) - On Topology Optimization and Routing in Integrated Access and Backhaul
Networks: A Genetic Algorithm-based Approach [70.85399600288737]
We study the problem of topology optimization and routing in IAB networks.
We develop efficient genetic algorithm-based schemes for both IAB node placement and non-IAB backhaul link distribution.
We discuss the main challenges for enabling mesh-based IAB networks.
arXiv Detail & Related papers (2021-02-14T21:52:05Z) - Path Design and Resource Management for NOMA enhanced Indoor Intelligent
Robots [58.980293789967575]
A communication enabled indoor intelligent robots (IRs) service framework is proposed.
Lego modeling method is proposed, which can deterministically describe the indoor layout and channel state.
The investigated radio map is invoked as a virtual environment to train the reinforcement learning agent.
arXiv Detail & Related papers (2020-11-23T21:45:01Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.