arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1906.08809cs.LGcs.AIstat.ML
收藏

一种全局布线的深度强化学习方法

A Deep Reinforcement Learning Approach for Global Routing

Carnegie Mellon University(卡内基梅隆大学)

Haiguang Liao, Wentai Zhang, Xuliang Dong, Barnabas Poczos, Kenji Shimada, Levent Burak Kara

摘要:

全局布线在电子电路设计中一直是历史上具有挑战性的问题,其中挑战是在不违反印刷电路板或集成电路的设计规则的情况下用导线连接大量且任意数量的电路组件。类似的布线问题也存在于复杂的水力系统、管道系统和物流网络的设计中。现有的解决方案通常包括贪心算法和硬编码的算法。因此,现有的方法缺乏模型灵活性和非最佳解决方案。作为一种替代方法,这项工作提出了一种深度强化学习方法,用于在模拟环境中解决全局布线问题。所提出的方法的核心是深度强化学习,它使智能体能够基于利用深度强化学习的联合优化机制提出的各种问题来产生路由的最佳策略。详细解释和论证了联合优化机制,探索了最佳网络结构和学习模型的参数。在此基础上,给出了优化模型的路由方案和路由奖励。结果表明,该方法可以优于顺序A* 方法的基准方法,这表明深度强化学习对于全局布线和其他布线或路径规划问题具有很大的潜力。这项工作的另一个主要贡献是开发了一个全局布线问题集生成器,能够生成具有不同大小和约束的参数化全局布线问题集,从而能够评估不同的布线算法并生成用于未来数据驱动布线方法的训练数据集。

英文摘要:

Global routing has been a historically challenging problem in electronic circuit design, where the challenge is to connect a large and arbitrary number of circuit components with wires without violating the design rules for the printed circuit boards or integrated circuits. Similar routing problems also exist in the design of complex hydraulic systems, pipe systems and logistic networks. Existing solutions typically consist of greedy algorithms and hard-coded heuristics. As such, existing approaches suffer from a lack of model flexibility and non-optimum solutions. As an alternative approach, this work presents a deep reinforcement learning method for solving the global routing problem in a simulated environment. At the heart of the proposed method is deep reinforcement learning that enables an agent to produce an optimal policy for routing based on the variety of problems it is presented with leveraging the conjoint optimization mechanism of deep reinforcement learning. Conjoint optimization mechanism is explained and demonstrated in details; the best network structure and the parameters of the learned model are explored. Based on the fine-tuned model, routing solutions and rewards are presented and analyzed. The results indicate that the approach can outperform the benchmark method of a sequential A* method, suggesting a promising potential for deep reinforcement learning for global routing and other routing or path planning problems in general. Another major contribution of this work is the development of a global routing problem sets generator with the ability to generate parameterized global routing problem sets with different size and constraints, enabling evaluation of different routing algorithms and the generation of training datasets for future data-driven routing approaches.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑