{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T16:32:48Z","timestamp":1781886768231,"version":"3.54.5"},"publisher-location":"New York, NY, USA","reference-count":21,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,4,13]],"date-time":"2022-04-13T00:00:00Z","timestamp":1649808000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,4,13]]},"DOI":"10.1145\/3505170.3506721","type":"proceedings-article","created":{"date-parts":[[2022,4,14]],"date-time":"2022-04-14T00:07:38Z","timestamp":1649894858000},"page":"107-115","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":12,"title":["A Reinforcement Learning Agent for Obstacle-Avoiding Rectilinear Steiner Tree Construction"],"prefix":"10.1145","author":[{"given":"Po-Yan","family":"Chen","sequence":"first","affiliation":[{"name":"National Yang Ming Chiao Tung University, Hsinchu, Taiwan Roc"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bing-Ting","family":"Ke","sequence":"additional","affiliation":[{"name":"National Yang Ming Chiao Tung University, Hsinchu, Taiwan Roc"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tai-Cheng","family":"Lee","sequence":"additional","affiliation":[{"name":"National Yang Ming Chiao Tung University, Hsinchu, Taiwan Roc"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"I-Ching","family":"Tsai","sequence":"additional","affiliation":[{"name":"Realtek Semiconductor Corporation, Hsinchu, Taiwan Roc"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tai-Wei","family":"Kung","sequence":"additional","affiliation":[{"name":"Realtek Semiconductor Corporation, Hsinchu, Taiwan Roc"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Li-Yi","family":"Lin","sequence":"additional","affiliation":[{"name":"Realtek Semiconductor Corporation, Hsinchu, Taiwan Roc"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"En-Cheng","family":"Liu","sequence":"additional","affiliation":[{"name":"Realtek Semiconductor Corporation, Hsinchu, Taiwan Roc"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yun-Chih","family":"Chang","sequence":"additional","affiliation":[{"name":"Realtek Semiconductor Corporation, Hsinchu, Taiwan Roc"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yih-Lang","family":"Li","sequence":"additional","affiliation":[{"name":"National Yang Ming Chiao Tung University, Hsinchu, Taiwan Roc"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mango C.-T.","family":"Chao","sequence":"additional","affiliation":[{"name":"National Yang Ming Chiao Tung University, Hsinchu, Taiwan Roc"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2022,4,13]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/0132071"},{"key":"e_1_3_2_1_2_1","first-page":"38","volume-title":"ICCD","author":"Shen Z.","year":"2005","unstructured":"Z. Shen Steiner tree construction with rectilinear blockages,\" in Proc . ICCD , 2005 , pp. 38 -- 44 . Z. Shen et al., \"Efficient rectilinear Steiner tree construction with rectilinear blockages,\" in Proc. ICCD, 2005, pp. 38--44."},{"issue":"4","key":"e_1_3_2_1_3_1","first-page":"643","article-title":"Obstacle avoiding rectilinear Steiner tree construction based on spanning graphs","volume":"27","author":"Lin C. W.","year":"2008","unstructured":"C. W. Lin , \" Obstacle avoiding rectilinear Steiner tree construction based on spanning graphs ,\" IEEE TCAD , vol. 27 , no. 4 , pp. 643 -- 653 , Apr. 2008 . C. W. Lin et al., \"Obstacle avoiding rectilinear Steiner tree construction based on spanning graphs,\" IEEE TCAD, vol. 27, no. 4, pp. 643--653, Apr. 2008.","journal-title":"IEEE TCAD"},{"issue":"12","key":"e_1_3_2_1_4_1","first-page":"2169","article-title":"EBOARST: An efficient edge-based obstacle-avoiding rectilinear Steiner tree construction algorithm","volume":"27","author":"Long J. Y.","year":"2008","unstructured":"J. Y. Long , \" EBOARST: An efficient edge-based obstacle-avoiding rectilinear Steiner tree construction algorithm ,\" IEEE TCAD , vol. 27 , no. 12 , pp. 2169 -- 2182 , Dec. 2008 . J. Y. Long et al., \"EBOARST: An efficient edge-based obstacle-avoiding rectilinear Steiner tree construction algorithm,\" IEEE TCAD, vol. 27, no. 12, pp. 2169--2182, Dec. 2008.","journal-title":"IEEE TCAD"},{"issue":"11","key":"e_1_3_2_1_5_1","first-page":"2007","article-title":"Multilayer obstacle-avoiding rectilinear Steiner tree construction based on spanning graphs","volume":"27","author":"Lin C.-W.","year":"2008","unstructured":"C.-W. Lin , \" Multilayer obstacle-avoiding rectilinear Steiner tree construction based on spanning graphs ,\" IEEE TCAD vol. 27 ,no. 11 , pp. 2007 -- 2016 , Nov. 2008 C.-W. Lin et al., \"Multilayer obstacle-avoiding rectilinear Steiner tree construction based on spanning graphs,\" IEEE TCAD vol. 27,no. 11, pp. 2007--2016, Nov. 2008","journal-title":"IEEE TCAD"},{"issue":"7","key":"e_1_3_2_1_6_1","first-page":"1050","article-title":"Obstacle-avoiding rectilinear Steiner tree construction: A Steiner-point based algorithm","volume":"31","author":"Liu C. H.","year":"2012","unstructured":"C. H. Liu , \" Obstacle-avoiding rectilinear Steiner tree construction: A Steiner-point based algorithm ,\" IEEE TCAD , vol. 31 , no. 7 , pp. 1050 -- 1060 , Jul. 2012 . C. H. Liu et al., \"Obstacle-avoiding rectilinear Steiner tree construction: A Steiner-point based algorithm,\" IEEE TCAD, vol. 31, no. 7, pp. 1050--1060, Jul. 2012.","journal-title":"IEEE TCAD"},{"key":"e_1_3_2_1_7_1","first-page":"12","article-title":"Efficient multilayer obstacle-avoiding rectilinear Steiner tree construction based on geometric reduction","volume":"33","author":"Liu C.-H.","year":"1928","unstructured":"C.-H. Liu \" Efficient multilayer obstacle-avoiding rectilinear Steiner tree construction based on geometric reduction ,\" IEEE TCAD 33 , 12 , 1928 --1941, Dec. 2014. C.-H. Liu et al. \" Efficient multilayer obstacle-avoiding rectilinear Steiner tree construction based on geometric reduction,\" IEEE TCAD 33,12,1928--1941, Dec. 2014.","journal-title":"IEEE TCAD"},{"key":"e_1_3_2_1_8_1","volume-title":"Lin et al., \"A maze routing-based methodology with bounded exploration and path-assessed retracing for constrained multilayer obstacle-avoiding rectilinear Steiner tree construction,\" ACM TODAES","author":"W.","year":"2018","unstructured":". K.- W. Lin et al., \"A maze routing-based methodology with bounded exploration and path-assessed retracing for constrained multilayer obstacle-avoiding rectilinear Steiner tree construction,\" ACM TODAES , Vol. 23 , Iss. 4, Article 45. May , 2018 . K.-W. Lin et al., \"A maze routing-based methodology with bounded exploration and path-assessed retracing for constrained multilayer obstacle-avoiding rectilinear Steiner tree construction,\" ACM TODAES, Vol. 23, Iss. 4, Article 45. May, 2018"},{"issue":"2","key":"e_1_3_2_1_9_1","first-page":"194","article-title":"FOARS: FLUTE based obstacle avoiding rectilinear Steiner tree construction","volume":"30","author":"Ajwani G.","year":"2011","unstructured":"G. Ajwani , \" FOARS: FLUTE based obstacle avoiding rectilinear Steiner tree construction ,\" IEEE TCAD , vol. 30 , no. 2 , pp. 194 -- 204 , Feb. 2011 . G. Ajwani et al., \"FOARS: FLUTE based obstacle avoiding rectilinear Steiner tree construction,\" IEEE TCAD, vol. 30, no. 2, pp. 194--204, Feb. 2011.","journal-title":"IEEE TCAD"},{"issue":"5","key":"e_1_3_2_1_10_1","first-page":"718","article-title":"On the construction of optimal obstacle-avoiding rectilinear Steiner minimum trees","volume":"30","author":"Huang T.","year":"2011","unstructured":"T. Huang , \" On the construction of optimal obstacle-avoiding rectilinear Steiner minimum trees ,\" IEEE TCAD , vol. 30 , no. 5 , pp. 718 -- 731 , May 2011 . T. Huang et al., \"On the construction of optimal obstacle-avoiding rectilinear Steiner minimum trees,\" IEEE TCAD, vol. 30, no. 5, pp. 718--731, May 2011.","journal-title":"IEEE TCAD"},{"issue":"6","key":"e_1_3_2_1_11_1","first-page":"882","article-title":"Young, \"ObSteiner: an exact algorithm for the construction of rectilinear Steiner minimum trees in the presence of complex rectilinear obstacles","volume":"32","year":"2013","unstructured":"Tao Huang and Evangeline F.Y . Young, \"ObSteiner: an exact algorithm for the construction of rectilinear Steiner minimum trees in the presence of complex rectilinear obstacles ,\" IEEE TCAD , Vol. 32 , No. 6 , pp. 882 -- 893 , 2013 . Tao Huang and Evangeline F.Y. Young, \"ObSteiner: an exact algorithm for the construction of rectilinear Steiner minimum trees in the presence of complex rectilinear obstacles,\" IEEE TCAD, Vol. 32, No. 6, pp. 882--893, 2013.","journal-title":"IEEE TCAD"},{"key":"e_1_3_2_1_12_1","first-page":"81","volume-title":"D. Z. Du","author":"Warme D. M.","year":"2000","unstructured":"D. M. Warme , \" Exact algorithms for plane Steiner tree problems: A computational study,\" in Advances in Steiner Trees , D. Z. Du , J. M. Smith, and J. H. Rubinstein, Eds. Boston, MA : Kluwer Academic , 2000 , pp. 81 -- 116 . D. M. Warme et al., \"Exact algorithms for plane Steiner tree problems: A computational study,\" in Advances in Steiner Trees, D. Z. Du, J. M. Smith, and J. H. Rubinstein, Eds. Boston, MA: Kluwer Academic, 2000, pp. 81--116."},{"key":"e_1_3_2_1_13_1","volume-title":"Reinforcement Learning: an Introduction,\" MIT Press","author":"Sutton R.","year":"1998","unstructured":". R. Sutton and A. Barto , \" Reinforcement Learning: an Introduction,\" MIT Press , 1998 . . R. Sutton and A. Barto, \"Reinforcement Learning: an Introduction,\" MIT Press, 1998."},{"key":"e_1_3_2_1_14_1","volume-title":"AIIDE","author":"G. M.","year":"2008","unstructured":". G. M. J.-B. Chaslot et al., \"Monte-Carlo tree search: A new framework for game AI,\" in Proc . AIIDE , Stanford, CA , 2008 . . G. M. J.-B. Chaslot et al., \"Monte-Carlo tree search: A new framework for game AI,\" in Proc. AIIDE, Stanford, CA, 2008."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10472-011-9258-6"},{"key":"e_1_3_2_1_16_1","first-page":"41","volume-title":"Proceedings of the 26th annual ICML","author":"Bengio Y.","year":"2009","unstructured":". Y. Bengio in Proceedings of the 26th annual ICML , pp. 41 -- 48 . ACM, 2009 .A. . Y. Bengio et al., \"Curriculum learning,\" in Proceedings of the 26th annual ICML, pp. 41--48. ACM, 2009.A."},{"key":"e_1_3_2_1_17_1","unstructured":". C. M. Bishop \"Pattern Recognition and Machine Learning \" New York :Springer 2006.  . C. M. Bishop \"Pattern Recognition and Machine Learning \" New York :Springer 2006."},{"key":"e_1_3_2_1_18_1","unstructured":". R. Sutton etal \"Policy gradient methods for reinforcement learning with function approximation \" In Advances in NIPS 000.  . R. Sutton et al. \"Policy gradient methods for reinforcement learning with function approximation \" In Advances in NIPS 000."},{"key":"e_1_3_2_1_19_1","first-page":"770","volume-title":"29th IEEE CVPR","author":"He K.","year":"2016","unstructured":". K. He residual learning for image recognition,\" in Proc . 29th IEEE CVPR , pp. 770 -- 778 , 2016 . . K. He et al., \"Deep residual learning for image recognition,\" in Proc. 29th IEEE CVPR, pp. 770--778, 2016."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1038\/nature24270"},{"key":"e_1_3_2_1_21_1","first-page":"1","article-title":"A Reinforcement Learning-Based Framework for Solving Physical Design Routing Problem in the Absence of Large Test Sets","year":"2019","unstructured":". Upma Gandhi ., \" A Reinforcement Learning-Based Framework for Solving Physical Design Routing Problem in the Absence of Large Test Sets ,\" ACM\/IEEE MLCAD , pp. 1 -- 6 , 2019 . . Upma Gandhi et al., \"A Reinforcement Learning-Based Framework for Solving Physical Design Routing Problem in the Absence of Large Test Sets,\" ACM\/IEEE MLCAD, pp. 1--6, 2019.","journal-title":"ACM\/IEEE MLCAD"}],"event":{"name":"ISPD '22: International Symposium on Physical Design","location":"Virtual Event Canada","acronym":"ISPD '22","sponsor":["SIGDA ACM Special Interest Group on Design Automation","SIGCHI ACM Special Interest Group on Computer-Human Interaction"]},"container-title":["Proceedings of the 2022 International Symposium on Physical Design"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3505170.3506721","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3505170.3506721","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T17:45:06Z","timestamp":1750268706000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3505170.3506721"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,13]]},"references-count":21,"alternative-id":["10.1145\/3505170.3506721","10.1145\/3505170"],"URL":"https:\/\/doi.org\/10.1145\/3505170.3506721","relation":{},"subject":[],"published":{"date-parts":[[2022,4,13]]},"assertion":[{"value":"2022-04-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}