{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T06:45:41Z","timestamp":1730270741800,"version":"3.28.0"},"reference-count":28,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,10,1]],"date-time":"2023-10-01T00:00:00Z","timestamp":1696118400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,10,1]],"date-time":"2023-10-01T00:00:00Z","timestamp":1696118400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["2211505,2218760"],"award-info":[{"award-number":["2211505,2218760"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,10,1]]},"DOI":"10.1109\/iros55552.2023.10342011","type":"proceedings-article","created":{"date-parts":[[2023,12,13]],"date-time":"2023-12-13T19:17:55Z","timestamp":1702495075000},"page":"6281-6288","source":"Crossref","is-referenced-by-count":0,"title":["Soy: An Efficient MILP Solver for Piecewise-Affine Systems"],"prefix":"10.1109","author":[{"given":"Haoze","family":"Wu","sequence":"first","affiliation":[{"name":"Stanford University,Department of Computer Science"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Min","family":"Wu","sequence":"additional","affiliation":[{"name":"Stanford University,Department of Computer Science"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dorsa","family":"Sadigh","sequence":"additional","affiliation":[{"name":"Stanford University,Department of Computer Science"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Clark","family":"Barrett","sequence":"additional","affiliation":[{"name":"Stanford University,Department of Computer Science"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/lra.2017.2779821"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-008-0001-1"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIE.2013.2254094"},{"volume-title":"The MOSEK optimization toolbox for MATLAB manual. Version 10.0.","year":"2022","author":"ApS","key":"ref4"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-10575-8_11"},{"key":"ref6","first-page":"51","article-title":"CaDiCaL, Kissat, Paracooba, Plingeling and Treengeling entering the SAT Competition 2020","volume-title":"Proc. of SAT Competition 2020 - Solver and Benchmark Descriptions, ser. Department of Computer Science Report Series B","volume":"B-2020\u20131","author":"Biere","year":"2020"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1201\/b10905"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.2307\/2684568"},{"issue":"53","key":"ref10","first-page":"157","article-title":"V12. 1: Users manual for cplex","volume":"46","author":"Cplex","year":"2009","journal-title":"International Business Machines Corporation"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.2140\/pjm.1955.5.183"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/HUMANOIDS.2014.7041373"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-27813-9_14"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.2.1.61"},{"volume-title":"Model.computeiis() - gurobi optimization","year":"2023","key":"ref15"},{"volume-title":"Gurobi Optimizer Reference Manual","year":"2023","key":"ref16"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/HUMANOIDS.2017.8246970"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.2307\/2685466"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/FMCAD.2013.6679409"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2016.7487282"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/3302504.3311801"},{"key":"ref22","article-title":"Shortest paths in graphs of convex sets","author":"Marcucci","year":"2021","journal-title":"arXiv preprint"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/s10817-018-09508-6"},{"key":"ref24","first-page":"337","article-title":"Noise strategies for improving local search","volume":"94","author":"Selman","year":"1994","journal-title":"AAAI"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/3049797.3049819"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.1981.1102596"},{"volume-title":"Drake: Model-based design and verification for robotics","year":"2019","key":"ref27"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-99524-9_8"}],"event":{"name":"2023 IEEE\/RSJ International Conference on Intelligent Robots and Systems (IROS)","start":{"date-parts":[[2023,10,1]]},"location":"Detroit, MI, USA","end":{"date-parts":[[2023,10,5]]}},"container-title":["2023 IEEE\/RSJ International Conference on Intelligent Robots and Systems (IROS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10341341\/10341342\/10342011.pdf?arnumber=10342011","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,20]],"date-time":"2023-12-20T00:27:45Z","timestamp":1703032065000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10342011\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10,1]]},"references-count":28,"URL":"https:\/\/doi.org\/10.1109\/iros55552.2023.10342011","relation":{},"subject":[],"published":{"date-parts":[[2023,10,1]]}}}