{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,19]],"date-time":"2025-12-19T10:14:34Z","timestamp":1766139274399,"version":"3.48.0"},"reference-count":34,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,10,19]],"date-time":"2025-10-19T00:00:00Z","timestamp":1760832000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,10,19]],"date-time":"2025-10-19T00:00:00Z","timestamp":1760832000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,10,19]]},"DOI":"10.1109\/iros60139.2025.11246429","type":"proceedings-article","created":{"date-parts":[[2025,11,27]],"date-time":"2025-11-27T18:54:45Z","timestamp":1764269685000},"page":"8683-8690","source":"Crossref","is-referenced-by-count":1,"title":["Space-Time Graphs of Convex Sets for Multi-Robot Motion Planning"],"prefix":"10.1109","author":[{"given":"Jingtao","family":"Tang","sequence":"first","affiliation":[{"name":"Simon Fraser University,School of Computing Science,Burnaby,Canada,V5A1S6"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zining","family":"Mao","sequence":"additional","affiliation":[{"name":"Simon Fraser University,School of Computing Science,Burnaby,Canada,V5A1S6"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lufan","family":"Yang","sequence":"additional","affiliation":[{"name":"Simon Fraser University,School of Computing Science,Burnaby,Canada,V5A1S6"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hang","family":"Ma","sequence":"additional","affiliation":[{"name":"Simon Fraser University,School of Computing Science,Burnaby,Canada,V5A1S6"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","article-title":"Rapidly-exploring random trees: A new tool for path planning","volume-title":"Research Report 9811","author":"LaValle","year":"1998"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/70.508439"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1137\/22M1523790"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/BF01840371"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33017643"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1609\/socs.v10i1.18510"},{"key":"ref7","doi-asserted-by":"crossref","DOI":"10.1609\/socs.v18i1.35996","article-title":"Reevaluation of large neighborhood search for mapf: Findings and opportunities","author":"Tan","year":"2025"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1177\/0278364915615688"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2024.3363543"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2014.11.006"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1609\/aiide.v1i1.18726"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1609\/socs.v10i1.18501"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2022.103662"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/IROS47612.2022.9982018"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2021.3068910"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2014.6907855"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/IROS47612.2022.9981739"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2011.5980306"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA46639.2022.9811814"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2000.844730"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1177\/0278364911406761"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-16595-0_7"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA57147.2024.10610005"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1177\/02783649231201437"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2024.3434168"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.15607\/RSS.2023.XIX.057"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2023.3291463"},{"article-title":"Gcs*: Forward heuristic search on implicit graphs of convex sets","year":"2024","author":"Chia","key":"ref28"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.15607\/rss.2024.xx.113"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1126\/scirobotics.adf7843"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/IROS58592.2024.10802426"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/321043.321046"},{"key":"ref33","volume-title":"Introduction to linear optimization","volume":"6","author":"Bertsimas","year":"1997"},{"article-title":"Drake: Model-based design and verification for robotics","year":"2019","author":"Tedrake","key":"ref34"}],"event":{"name":"2025 IEEE\/RSJ International Conference on Intelligent Robots and Systems (IROS)","start":{"date-parts":[[2025,10,19]]},"location":"Hangzhou, China","end":{"date-parts":[[2025,10,25]]}},"container-title":["2025 IEEE\/RSJ International Conference on Intelligent Robots and Systems (IROS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11245651\/11245652\/11246429.pdf?arnumber=11246429","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T11:02:37Z","timestamp":1766055757000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11246429\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,19]]},"references-count":34,"URL":"https:\/\/doi.org\/10.1109\/iros60139.2025.11246429","relation":{},"subject":[],"published":{"date-parts":[[2025,10,19]]}}}