Piano: A Multi-Constraint Pin Assignment-Aware Floorplanner

• URL: http://arxiv.org/abs/2508.13161v1
• Date: Sun, 20 Jul 2025 10:44:54 GMT
• Title: Piano: A Multi-Constraint Pin Assignment-Aware Floorplanner
• Abstract summary: Piano is a floorplanning framework that simultaneously optimize module placement and pin assignment under multiple constraints.<n>Results show Piano achieves an average 6.81% reduction in HPWL, a 13.39% decrease in feedthrough wirelength, and a 16.36% reduction in the number of feedthrough modules.
• Score: 32.58046584473385
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: Floorplanning is a critical step in VLSI physical design, increasingly complicated by modern constraints such as fixed-outline requirements, whitespace removal, and the presence of pre-placed modules. In addition, the assignment of pins on module boundaries significantly impacts the performance of subsequent stages, including detailed placement and routing. However, traditional floorplanners often overlook pin assignment with modern constraints during the floorplanning stage. In this work, we introduce Piano, a floorplanning framework that simultaneously optimizes module placement and pin assignment under multiple constraints. Specifically, we construct a graph based on the geometric relationships among modules and their netlist connections, then iteratively search for shortest paths to determine pin assignments. This graph-based method also enables accurate evaluation of feedthrough and unplaced pins, thereby guiding overall layout quality. To further improve the design, we adopt a whitespace removal strategy and employ three local optimizers to enhance layout metrics under multi-constraint scenarios. Experimental results on widely used benchmark circuits demonstrate that Piano achieves an average 6.81% reduction in HPWL, a 13.39% decrease in feedthrough wirelength, a 16.36% reduction in the number of feedthrough modules, and a 21.21% drop in unplaced pins, while maintaining zero whitespace.

Related papers

• LePlanner: An Iterative Amortized Controller For World Models [0.0]
  We propose LePlanner, an amortized iterative controller that learns to construct and refine latent action sequences through a frozen world-model predictor.<n>LePlanner is trained with an arrival-and-hold objective that encourages the controller to reach the goal at the earliest feasible horizon and remain there.<n>It achieves success rates of 98% on PushT, 100% on Reacher, 100% on TwoRooms, and 92% on the OGBench Cube task.
  arXiv  Detail & Related papers  (2026-09-12T10:01:21Z)
• PlanningBench: Generating Scalable and Verifiable Planning Data for Evaluating and Training Large Language Models [52.48858778580074]
  Planning is a fundamental capability for large language models (LLMs)<n>PlanningBench is a framework for generating scalable, diverse, verifiable planning data for both evaluation and training.
  arXiv  Detail & Related papers  (2026-05-20T08:10:15Z)
• Generative Floor Plan Design with LLMs via Reinforcement Learning with Verifiable Rewards [16.41930427892441]
  An AI system for professional floor plan design must precisely control room dimensions and areas while respecting the desired connectivity between rooms.<n>Existing generative approaches focus primarily on respecting the requested connectivity between rooms, but do not support generating floor plans that respect numerical constraints.<n>We introduce a text-based floor plan generation approach that fine-tunes a large language model (LLM) on real plans and then applies reinforcement learning with verifiable rewards.<n>Our results demonstrate that LLMs can effectively handle constraints in this setting, suggesting broader applications for text-based generative modeling.
  arXiv  Detail & Related papers  (2026-05-13T21:06:12Z)
• Mosaic: An Extensible Framework for Composing Rule-Based and Learned Motion Planners [5.399177691034965]
  Rule-based planners offer predictable and explainable behavior; learned planners exhibit strong adaptability but suffer from reduced transparency and occasional safety violations.<n>We introduce Mosaic, a framework for structured decision-making that integrates both paradigms through arbitration graphs.<n>In experimental evaluation, Mosaic achieves 95.48 CLS-NR and 93.98 CLS-R on the Val14 closed-loop benchmark, setting a new state of the art, while reducing at-fault collisions by 30% compared to either planner in isolation.
  arXiv  Detail & Related papers  (2026-04-15T13:23:47Z)
• Connectivity-Aware Representations for Constrained Motion Planning via Multi-Scale Contrastive Learning [6.0393663164774125]
  The objective of constrained motion planning is to connect start and goal configurations while satisfying task-specific constraints.<n>This paper addresses these challenges by learning a connectivity-aware representation for selecting start and goal configurations prior to planning.
  arXiv  Detail & Related papers  (2026-03-26T10:44:21Z)
• Where Bits Matter in World Model Planning: A Paired Mixed-Bit Study for Efficient Spatial Reasoning [0.0]
  We run a mixed-bit evaluation across uniform, mixed, asymmetric, and layerwise variants under two planner budgets.<n>We observe a consistent three-regime pattern: 8-bit and 6-bit settings remain close to FP16, 3-bit settings collapse, and 4-bit settings are allocation-sensitive.
  arXiv  Detail & Related papers  (2026-02-12T12:32:51Z)
• TodoEvolve: Learning to Architect Agent Planning Systems [68.48983335970901]
  TodoEvolve is a meta-planning paradigm that autonomously synthesizes and dynamically revises task-specific planning.<n>PlanFactory provides a common interface for heterogeneous planning patterns.<n>TodoEvolve consistently surpasses carefully engineered planning modules while maintaining economical API costs and runtime overhead.
  arXiv  Detail & Related papers  (2026-02-08T06:37:01Z)
• RulePlanner: All-in-One Reinforcement Learner for Unifying Design Rules in 3D Floorplanning [49.812879456944984]
  Floorplanning determines the coordinate and shape of each module in Integrated Circuits.<n>Current methods are only capable of handling specific and limited design rules.<n>We propose an all-in-one deep reinforcement learning-based approach to tackle these challenges.
  arXiv  Detail & Related papers  (2026-01-30T02:41:48Z)
• One Step Beyond: Feedthrough & Placement-Aware Rectilinear Floorplanner [35.39679825578791]
  Floorplanning determines the shapes and locations of modules on a chip canvas.<n>Current floorplanning approaches fail to integrate with subsequent physical design stages.<n>We propose Flora, a three-stage feedthrough and placement aware rectilinear floorplanner.
  arXiv  Detail & Related papers  (2025-07-20T11:00:18Z)
• PLAN-TUNING: Post-Training Language Models to Learn Step-by-Step Planning for Complex Problem Solving [66.42260489147617]
  We introduce PLAN-TUNING, a framework that distills synthetic task decompositions from large-scale language models.<n>Plan-TUNING fine-tunes smaller models via supervised and reinforcement-learning objectives to improve complex reasoning.<n>Our analysis demonstrates how planning trajectories improves complex reasoning capabilities.
  arXiv  Detail & Related papers  (2025-07-10T07:30:44Z)
• 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)
• FloorSet -- a VLSI Floorplanning Dataset with Design Constraints of Real-World SoCs [10.277800264277452]
  Floorplanning for systems-on-a-chip (SoCs) and its sub-systems is a crucial and non-trivial step of the physical design flow. We present FloorSet -- two comprehensive datasets of synthetic fixed-outline floorplan layouts. FloorSet is intended to spur fundamental research on large-scale constrained optimization problems.
  arXiv  Detail & Related papers  (2024-05-09T00:37:56Z)
• Plan, Eliminate, and Track -- Language Models are Good Teachers for Embodied Agents [99.17668730578586]
  Pre-trained large language models (LLMs) capture procedural knowledge about the world. Plan, Eliminate, and Track (PET) framework translates a task description into a list of high-level sub-tasks. PET framework leads to a significant 15% improvement over SOTA for generalization to human goal specifications.
  arXiv  Detail & Related papers  (2023-05-03T20:11:22Z)
• Differentiable Spatial Planning using Transformers [87.90709874369192]
  We propose Spatial Planning Transformers (SPT), which given an obstacle map learns to generate actions by planning over long-range spatial dependencies. In the setting where the ground truth map is not known to the agent, we leverage pre-trained SPTs in an end-to-end framework. SPTs outperform prior state-of-the-art differentiable planners across all the setups for both manipulation and navigation tasks.
  arXiv  Detail & Related papers  (2021-12-02T06:48:16Z)

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.