{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,15]],"date-time":"2026-07-15T17:30:43Z","timestamp":1784136643639,"version":"3.55.0"},"reference-count":73,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"12","license":[{"start":{"date-parts":[[2023,12,1]],"date-time":"2023-12-01T00:00:00Z","timestamp":1701388800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,12,1]],"date-time":"2023-12-01T00:00:00Z","timestamp":1701388800000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,12,1]],"date-time":"2023-12-01T00:00:00Z","timestamp":1701388800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,12,1]],"date-time":"2023-12-01T00:00:00Z","timestamp":1701388800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"NSF","award":["IIS-1849348"],"award-info":[{"award-number":["IIS-1849348"]}]},{"name":"NSF","award":["CCF-2124010"],"award-info":[{"award-number":["CCF-2124010"]}]},{"DOI":"10.13039\/100000006","name":"ONR","doi-asserted-by":"publisher","award":["N00014-21-1-2418"],"award-info":[{"award-number":["N00014-21-1-2418"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Robot. Autom. Lett."],"published-print":{"date-parts":[[2023,12]]},"DOI":"10.1109\/lra.2023.3327655","type":"journal-article","created":{"date-parts":[[2023,10,25]],"date-time":"2023-10-25T18:01:52Z","timestamp":1698256912000},"page":"8303-8310","source":"Crossref","is-referenced-by-count":4,"title":["Scaling Infeasibility Proofs via Concurrent, Codimension-One, Locally-Updated Coxeter Triangulation"],"prefix":"10.1109","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1766-4316","authenticated-orcid":false,"given":"Sihui","family":"Li","sequence":"first","affiliation":[{"name":"Department of Computer Science, Colorado School of Mines, Golden, CO, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0907-2241","authenticated-orcid":false,"given":"Neil T.","family":"Dantam","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Colorado School of Mines, Golden, CO, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1177\/02783649231154674"},{"key":"ref57","article-title":"GUDHI User and Reference Manual","year":"2015"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.15607\/RSS.2021.XVII.064"},{"key":"ref56","article-title":"The NLopt nonlinear-optimization package","author":"johnson","year":"2023"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA48891.2023.10161339"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2012.6225337"},{"key":"ref14","article-title":"Meshing submanifolds using coxeter triangulations","author":"kachanovich","year":"2019"},{"key":"ref58","first-page":"797","article-title":"ThunderSVM: A fast SVM library on GPUs and CPUs","volume":"19","author":"wen","year":"2018","journal-title":"J Mach Learn Res"},{"key":"ref53","first-page":"385","article-title":"Adaptive contouring of a trivariate interpolant","author":"petersen","year":"1987","journal-title":"Geometric Modeling Algorithms and New Trends"},{"key":"ref52","author":"moore","year":"1992","journal-title":"Simplicial mesh generation with applications"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-21090-7_18"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1145\/192115.192124"},{"key":"ref10","article-title":"Sample-based planning with volumes in configuration space","author":"shkolnik","year":"2011"},{"key":"ref54","article-title":"A software package for sequential quadratic programming","author":"kraft","year":"1988"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2011.2160466"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.1996.503582"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1177\/0278364915577958"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1177\/027836402320556421"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1177\/02783640122067453"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1145\/2592798.2592820"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1017\/9781108297806"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-013-9557-2"},{"key":"ref48","article-title":"The Nine Chapters on the Mathematical Art.","year":"0"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975208"},{"key":"ref42","doi-asserted-by":"crossref","first-page":"1105","DOI":"10.1109\/TRO.2005.853485","article-title":"Narrow passage sampling for probabilistic roadmap planning","volume":"21","author":"sun","year":"2005","journal-title":"IEEE Trans Robot"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2003.1242285"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.2307\/1968753"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546877"},{"key":"ref49","first-page":"371","article-title":"Memc3: Compact and concurrent MemCache with dumber caching and smarter hashing","author":"fan","year":"0","journal-title":"Proc 10th USENIX Symp Networked Syst Des Implementation"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2000.844730"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/70.508439"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/MRA.2012.2205651"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/BF01530890"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2004.1308111"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1177\/0278364911406761"},{"key":"ref5","article-title":"Rapidly-exploring random trees: A new tool for path planning","author":"lavalle","year":"1998"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2012.6385875"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2019.2894861"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2023.3281152"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA48506.2021.9560934"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA40945.2020.9197291"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2001.932820"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA48506.2021.9562053"},{"key":"ref33","first-page":"2196","article-title":"Sample complexity of probabilistic roadmaps via $\\varepsilon$-nets","author":"tsao","year":"0","journal-title":"Proc IEEE Int Conf Robot Automat"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1177\/0278364917714338"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1177\/0278364908097884"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/70.704220"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA48891.2023.10161114"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1177\/02783649211056967"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.15607\/RSS.2022.XVIII.039"},{"key":"ref70","author":"cormen","year":"2022","journal-title":"Introduction to Algorithms"},{"key":"ref73","doi-asserted-by":"publisher","DOI":"10.1007\/s10514-019-09832-9"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-012-9736-1"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-28619-4_43"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1177\/0278364911429335"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2005.847599"},{"key":"ref67","first-page":"2243","article-title":"Efficient nearest-neighbor computation for GPU-based motion planning","author":"pan","year":"0","journal-title":"Proc IEEE\/RSJ Int Conf Intell Robots Syst"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2012.6225300"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2001.932865"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.15607\/RSS.2016.XII.004"},{"key":"ref20","first-page":"297","article-title":"Fast tree-based exploration of state space for robots with dynamics","author":"ladd","year":"2004","journal-title":"Algorithmic Foundations of Robotics VI"},{"key":"ref64","article-title":"UR5 collaborative robot arm: Flexible and lightweight cobot","year":"2023"},{"key":"ref63","article-title":"Packbot 510","year":"2023"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1177\/0278364915594679"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-44051-0_5"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1177\/0278364915614386"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2012.6386194"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1163\/156855300741960"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/IROS45743.2020.9340804"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1177\/0278364913498292"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48481-7_29"},{"key":"ref62","article-title":"Assembly robot","author":"makino","year":"1982"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1177\/0278364920931948"}],"container-title":["IEEE Robotics and Automation Letters"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/7083369\/10287676\/10295985-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7083369\/10287676\/10295985.pdf?arnumber=10295985","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,27]],"date-time":"2023-11-27T20:08:36Z","timestamp":1701115716000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10295985\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12]]},"references-count":73,"journal-issue":{"issue":"12"},"URL":"https:\/\/doi.org\/10.1109\/lra.2023.3327655","relation":{},"ISSN":["2377-3766","2377-3774"],"issn-type":[{"value":"2377-3766","type":"electronic"},{"value":"2377-3774","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,12]]}}}