{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,13]],"date-time":"2025-09-13T16:34:48Z","timestamp":1757781288057,"version":"3.40.5"},"reference-count":33,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T00:00:00Z","timestamp":1748736000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T00:00:00Z","timestamp":1748736000000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T00:00:00Z","timestamp":1748736000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T00:00:00Z","timestamp":1748736000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"Amazon.com","award":["2D-06310236"],"award-info":[{"award-number":["2D-06310236"]}]},{"name":"Lincoln Labs"},{"name":"MIT EECS Advanced Undergraduate Research Opportunities Program"},{"DOI":"10.13039\/100023581","name":"National Science Foundation Graduate Research Fellowship Program","doi-asserted-by":"publisher","award":["2141064"],"award-info":[{"award-number":["2141064"]}],"id":[{"id":"10.13039\/100023581","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Robot. Autom. Lett."],"published-print":{"date-parts":[[2025,6]]},"DOI":"10.1109\/lra.2025.3564204","type":"journal-article","created":{"date-parts":[[2025,4,24]],"date-time":"2025-04-24T17:07:55Z","timestamp":1745514475000},"page":"6183-6190","source":"Crossref","is-referenced-by-count":1,"title":["Planning Shorter Paths in Graphs of Convex Sets by Undistorting Parametrized Configuration Spaces"],"prefix":"10.1109","volume":"10","author":[{"ORCID":"https:\/\/orcid.org\/0009-0001-7936-395X","authenticated-orcid":false,"given":"Shruti","family":"Garg","sequence":"first","affiliation":[{"name":"Computer Science and Artificial Intelligence Laboratory (CSAIL), Massachusetts Institute of Technology, Cambridge, MA, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5411-0710","authenticated-orcid":false,"given":"Thomas","family":"Cohn","sequence":"additional","affiliation":[{"name":"Computer Science and Artificial Intelligence Laboratory (CSAIL), Massachusetts Institute of Technology, Cambridge, MA, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8712-7092","authenticated-orcid":false,"given":"Russ","family":"Tedrake","sequence":"additional","affiliation":[{"name":"Computer Science and Artificial Intelligence Laboratory (CSAIL), Massachusetts Institute of Technology, Cambridge, MA, USA"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1137\/22m1523790"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1126\/scirobotics.adf7843"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA57147.2024.10610675"},{"article-title":"Motion planning along manifolds with geodesic convexity and analytic inverse kinematics","year":"2024","author":"Cohn","key":"ref4"},{"article-title":"Finding and optimizing certified, collision-free regions in configuration space for robot manipulators","year":"2022","author":"Amice","key":"ref5"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/icra57147.2024.10611296"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/70.508439"},{"article-title":"Rapidly-exploring random trees: A new tool for path planning","year":"1998","author":"LaValle","key":"ref8"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1177\/0278364911406761"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.2514\/3.20223"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/IROS40897.2019.8967788"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-009-9291-0"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1137\/s1052623499350013"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-51547-2_15"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2009.5152817"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2011.5980280"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA48891.2023.10160765"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2018.2819195"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-63403-2_11"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1126\/scirobotics.adf7843"},{"key":"ref21","article-title":"Planning optimal collision-free trajectories with non-convex cost functions using graphs of convex sets","volume-title":"Proc. 2023 Workshop Task Motion Planning, Theory Pract. IEEE\/RSJ Int. Conf. Intell. Robots Syst.","author":"Clark","year":"2023"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2024.3434168"},{"key":"ref23","article-title":"Guiding nonconvex trajectory optimization with hierarchical graphs of convex sets","volume-title":"Masters thesis","author":"von Wrangel","year":"2024"},{"key":"ref24","volume-title":"Riemannian Geometry","volume":"2","author":"DoCarmo","year":"1992"},{"year":"2024","key":"ref25","article-title":"The MOSEK optimization toolbox for Drake manual. Version 10.1."},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-2025-2_9"},{"key":"ref27","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/978-3-540-35447-5_3","article-title":"Chapter 3 Line search methods","volume-title":"Numerical Optimization","author":"Nocedal","year":"2006"},{"article-title":"Jax: Composable transformations of python numpy programs","year":"2018","author":"Contributors","key":"ref28"},{"article-title":"Growing convex collision-free regions in configuration space using nonlinear programming","year":"2023","author":"Petersen","key":"ref29"},{"article-title":"Faster algorithms for growing collision-free convex polytopes in robot configuration space","year":"2024","author":"Werner","key":"ref30"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/icra57147.2024.10611675"},{"article-title":"GCS*: Forward heuristic search on implicit graphs of convex sets","year":"2024","author":"Chia","key":"ref32"},{"article-title":"Multi-query shortest-path problem in graphs of convex sets","year":"2024","author":"Morozov","key":"ref33"}],"container-title":["IEEE Robotics and Automation Letters"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/7083369\/10969146\/10976384-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/7083369\/10969146\/10976384.pdf?arnumber=10976384","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,9]],"date-time":"2025-05-09T18:02:51Z","timestamp":1746813771000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10976384\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6]]},"references-count":33,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/lra.2025.3564204","relation":{},"ISSN":["2377-3766","2377-3774"],"issn-type":[{"type":"electronic","value":"2377-3766"},{"type":"electronic","value":"2377-3774"}],"subject":[],"published":{"date-parts":[[2025,6]]}}}