RAPlace: Macro Placement with Reinforcement Learning
As integrated circuits continue to scale up, placement becomes progressively more intricate. Relying on human effort for placement often takes several weeks to complete. Reinforcement learning (RL) algorithms have demonstrated potential in achieving promising placement performance in a few hours. However, existing RL-based placement methods faced limitations in their singular construction of intrinsic rewards, as they failed to simultaneously address the requirements for driving exploration and capturing the actual value of actions. In this article, we proposed a placement method based on RL, named RAPlace. Firstly, residual networks with autoencoders were introduced to encode the canvas view, coupled with a graph attention network for encoding the netlist graph to enrich state features. Secondly, RAPlace combined intuitive rewards and exploration rewards to construct a more comprehensive intrinsic reward, aiding the RL agent in better exploration and exploitation. On the ISPD2005 benchmark, RAPlace achieved a 13.59% half-perimeter wire length (HPWL) optimization compared to the RL-based method DeepTH.
Authors
- Yujie Lin (ORCID: https://orcid.org/0000-0002-1709-5267)
- Yue Wu (ORCID: https://orcid.org/0000-0003-2874-8267)
- Hu Liu (ORCID: https://orcid.org/0000-0003-2225-7387)
- Xiaoyan Yang
Institutions
- Hangzhou Dianzi University (CN)
Publication Details
- Published
- 2025-05-09
- DOI
- https://doi.org/10.1109/iseda65950.2025.11101210
- Primary Topic
- Reinforcement Learning in Robotics
- Type
- article
- Field-Weighted Citation Impact
- 0.00