{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,16]],"date-time":"2026-06-16T06:12:35Z","timestamp":1781590355135,"version":"3.54.5"},"reference-count":48,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2023,8,1]],"date-time":"2023-08-01T00:00:00Z","timestamp":1690848000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"name":"JSPS KAKENHI","award":["20J23011"],"award-info":[{"award-number":["20J23011"]}]},{"name":"JSPS KAKENHI","award":["21K11748"],"award-info":[{"award-number":["21K11748"]}]},{"name":"JSPS KAKENHI","award":["21H03423"],"award-info":[{"award-number":["21H03423"]}]},{"name":"JST ACT-X","award":["JPMJAX22A1"],"award-info":[{"award-number":["JPMJAX22A1"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Robot."],"published-print":{"date-parts":[[2023,8]]},"DOI":"10.1109\/tro.2023.3258690","type":"journal-article","created":{"date-parts":[[2023,4,5]],"date-time":"2023-04-05T18:03:10Z","timestamp":1680717790000},"page":"2720-2737","source":"Crossref","is-referenced-by-count":10,"title":["Offline Time-Independent Multiagent Path Planning"],"prefix":"10.1109","volume":"39","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9491-7367","authenticated-orcid":false,"given":"Keisuke","family":"Okumura","sequence":"first","affiliation":[{"name":"School of Computing, Tokyo Institute of Technology, Tokyo, Japan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6625-0035","authenticated-orcid":false,"given":"Fran\u00e7ois","family":"Bonnet","sequence":"additional","affiliation":[{"name":"School of Computing, Tokyo Institute of Technology, Tokyo, Japan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5406-1966","authenticated-orcid":false,"given":"Yasumasa","family":"Tamura","sequence":"additional","affiliation":[{"name":"School of Computing, Tokyo Institute of Technology, Tokyo, Japan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2377-205X","authenticated-orcid":false,"given":"Xavier","family":"D\u00e9fago","sequence":"additional","affiliation":[{"name":"School of Computing, Tokyo Institute of Technology, Tokyo, Japan"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1609\/socs.v10i1.18510"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-62533-1"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2016.7759750"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v31i1.11035"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2019.2894217"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1613\/jair.1.11734"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1609\/icaps.v27i1.13866"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/68"},{"key":"ref9","article-title":"STT-CBS: A. conflict-based search algorithm for multi-agent path finding with stochastic travel times","author":"Peltzer","year":"2020"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1609\/icaps.v30i1.6642"},{"issue":"1","key":"ref11","first-page":"9","article-title":"Coordinating hundreds of cooperative, autonomous vehicles in warehouses","volume-title":"AI Mag.","volume":"29","author":"Wurman","year":"2008"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1613\/jair.2502"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.autcon.2018.08.004"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139168724.006"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/45075.46163"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1984.715921"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/BF01840371"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2014.11.006"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i13.17347"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2022\/645"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.2200\/S00908ED1V01Y201903DCT015"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1609\/icaps.v30i1.6663"},{"key":"ref23","first-page":"168","article-title":"Finding a shortest solution for the $n\\times n$ extension of the 15-puzzle is intractable","volume-title":"Proc. AAAI Conf. Artif. Intell.","author":"Ratner","year":"1986"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v27i1.8541"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1609\/aiide.v1i1.18726"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2022.103752"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1609\/socs.v5i1.18315"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA48506.2021.9561111"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/356586.356588"},{"issue":"ch. 7","key":"ref30","article-title":"Deadlocks","volume-title":"Operating System Concepts","author":"Silberschatz","year":"2006"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCA.2003.820590"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2015.2445780"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2021.3075371"},{"key":"ref34","first-page":"3","article-title":"Reciprocal n-body collision avoidance","volume-title":"Proc. Robot. Res., 14th Int. Symp. ISRR","author":"Den Berg","year":"2011"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/s10514-011-9267-7"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-05816-6_12"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2022.3152702"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2014.11.001"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2022.105809"},{"key":"ref40","article-title":"Push and rotate: Cooperative multi-agent path planning","volume-title":"J. Artif. Intell. Res.","author":"Wilde","year":"2014"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i14.17466"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v37i10.26377"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1613\/jair.1.12397"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.1989.100033"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2019.8793522"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1137\/0606030"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1609\/icaps.v32i1.19810"},{"key":"ref48","article-title":"Optimal cooperative motion planning for vehicles at intersections","author":"Gregoire","year":"2013"}],"container-title":["IEEE Transactions on Robotics"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8860\/10214173\/10092929.pdf?arnumber=10092929","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,14]],"date-time":"2024-03-14T04:30:39Z","timestamp":1710390639000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10092929\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8]]},"references-count":48,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tro.2023.3258690","relation":{},"ISSN":["1552-3098","1941-0468"],"issn-type":[{"value":"1552-3098","type":"print"},{"value":"1941-0468","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,8]]}}}