IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-031-13074-8_11.html
   My bibliography  Save this book chapter

Reinforcement Learning for Routing

In: Machine Learning Applications in Electronic Design Automation

Author

Listed:
  • Haiguang Liao

    (Carnegie Mellon University)

  • Levent Burak Kara

    (Carnegie Mellon University)

Abstract

Routing has been one of the most critical and challenging steps in electronics design automation (EDA), and existing solutions have historically relied heavily on heuristics and analytical methods. In recent years, reinforcement learning (RL) has emerged as an alternative for use in various routing problems in the space of chip design. RL-based methods tend to outperform existing heuristics and analytical routing algorithms across various metrics including efficiency and solution quality, and a few are able to solve problems that previously remained unsolved. This chapter provides a review of recent RL routing approaches in EDA and shares insights into open challenges and opportunities. Methods covered in this chapter include RL for global routing, RL for detailed routing, RL for standard cell routing, and RL for other related routing problems.

Suggested Citation

  • Haiguang Liao & Levent Burak Kara, 2022. "Reinforcement Learning for Routing," Springer Books, in: Haoxing Ren & Jiang Hu (ed.), Machine Learning Applications in Electronic Design Automation, chapter 0, pages 277-306, Springer.
  • Handle: RePEc:spr:sprchp:978-3-031-13074-8_11
    DOI: 10.1007/978-3-031-13074-8_11
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-3-031-13074-8_11. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.