{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T08:05:22Z","timestamp":1772179522822,"version":"3.50.1"},"reference-count":34,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"NSF CCF","award":["2336612"],"award-info":[{"award-number":["2336612"]}]},{"name":"Enrich funds at Rice University"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Robot. Autom. Lett."],"published-print":{"date-parts":[[2026,4]]},"DOI":"10.1109\/lra.2026.3662639","type":"journal-article","created":{"date-parts":[[2026,2,9]],"date-time":"2026-02-09T21:09:14Z","timestamp":1770671354000},"page":"4385-4392","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Multi-Robot Motion Planning for Manifold-Constrained Manipulators by Randomized Scheduling and Informed Path Generation"],"prefix":"10.1109","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4193-7433","authenticated-orcid":false,"given":"Weihang","family":"Guo","sequence":"first","affiliation":[{"name":"Department of Computer Science, Rice University, Houston, TX, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3896-5110","authenticated-orcid":false,"given":"Zachary","family":"Kingston","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Rice University, Houston, TX, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4132-1217","authenticated-orcid":false,"given":"Kaiyu","family":"Hang","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Rice University, Houston, TX, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0699-8038","authenticated-orcid":false,"given":"Lydia E.","family":"Kavraki","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Rice University, Houston, TX, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-18299-5_2"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2011.5980408"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2005.1545306"},{"key":"ref4","first-page":"501","article-title":"Finding a needle in an exponential haystack: Discrete RRT for exploration of implicit roadmaps in multi-robot motion planning","volume-title":"Int. J. Robot. Res.","volume":"35","author":"Solovey","year":"2013"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2000.844730"},{"key":"ref6","first-page":"40","article-title":"Conflict-based search for optimal multi-agent pathfinding","volume-title":"Artif. Intell.","volume":"219","author":"Sharon","year":"2015"},{"issue":"3","key":"ref7","first-page":"4608","article-title":"Representation-optimal multi-robot motion planning using conflict-based search","volume-title":"IEEE Trans. Robot. Autom.","volume":"6","author":"Vidana","year":"2021"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1177\/0278364919868530"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1146\/annurev-control-060117-105226"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/70.508439"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s10514-019-09832-9"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2023\/29"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2023.3312980"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/IROS51168.2021.9636618"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/IROS45743.2020.9341153"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA46639.2022.9811643"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1177\/02783649231209337"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33017643"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2015.2445780"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2024.3402183"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2021.3077863"},{"issue":"10","key":"ref22","first-page":"11655","article-title":"LaCAM: Search-based algorithm for quick multi-agent pathfinding","volume-title":"Proc. AAAI Conf. Artif. Intell.","volume":"37","author":"Okumura","year":"2023"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1609\/socs.v5i1.18315"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2025.104349"},{"key":"ref25","article-title":"Multi-robot motion planning with diffusion models","volume-title":"Proc. 13th Int. Conf. Learn. Representations","author":"Shaoul","year":"2025"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2002.1014852"},{"key":"ref27","first-page":"72","article-title":"Toward efficient trajectory planning: The path-velocity decomposition","volume-title":"Int. J. Robot. Res.","volume":"5","author":"Kant","year":"1986"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/70.988973"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2014.6942705"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2024.3420548"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2022.3187265"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.65109\/uebb2736"},{"issue":"4","key":"ref33","first-page":"72","article-title":"The open motion planning library","volume-title":"IEEE Robot. Automat. Mag.","volume":"19","author":"ucan"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2012.6386109"}],"container-title":["IEEE Robotics and Automation Letters"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/7083369\/11400564\/11373867.pdf?arnumber=11373867","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T06:21:56Z","timestamp":1772173316000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11373867\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,4]]},"references-count":34,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/lra.2026.3662639","relation":{},"ISSN":["2377-3766","2377-3774"],"issn-type":[{"value":"2377-3766","type":"electronic"},{"value":"2377-3774","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,4]]}}}