{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,17]],"date-time":"2026-07-17T10:23:57Z","timestamp":1784283837802,"version":"3.55.0"},"reference-count":26,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"name":"Rutgers Unviersity"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Robot. Autom. Lett."],"published-print":{"date-parts":[[2016,1]]},"DOI":"10.1109\/lra.2015.2503143","type":"journal-article","created":{"date-parts":[[2015,12,1]],"date-time":"2015-12-01T19:04:15Z","timestamp":1448996655000},"page":"33-40","source":"Crossref","is-referenced-by-count":61,"title":["Intractability of Optimal Multirobot Path Planning on Planar Graphs"],"prefix":"10.1109","volume":"1","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4112-2250","authenticated-orcid":false,"given":"Jingjin","family":"Yu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1613\/jair.2408","article-title":"Exploiting subgraph structure in multi-robot path planning","volume":"31","author":"ryan","year":"2008","journal-title":"J Artif Intell Res"},{"key":"ref11","first-page":"668","article-title":"Complete algorithms for cooperative pathfinding problems","author":"standley","year":"0","journal-title":"Proc Int Joint Conf Artif Intell"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2011.6095022"},{"key":"ref13","first-page":"564","article-title":"Towards optimal cooperative path planning in hard setups through satisfiability solving","author":"surynek","year":"0","journal-title":"Proc 12th Pac Rim Int Conf Artif Intell"},{"key":"ref14","article-title":"Finding the shortest move-sequence in the graph-generalized 15-puzzle is NP-hard","author":"goldreich","year":"1984"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/S0747-7171(08)80001-6"},{"key":"ref16","first-page":"1261","article-title":"An optimization variant of multi-robot path planning is intractable","author":"surynek","year":"0","journal-title":"Proc AAAI Nat Conf Artif Intell"},{"key":"ref17","first-page":"1444","article-title":"Structure and intractability of optimal multi-robot path planning on graphs","author":"yu","year":"0","journal-title":"Proc AAAI Nat Conf Artif Intell"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1177\/027836498400300405"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(84)90130-3"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2013.6630673"},{"key":"ref3","first-page":"9","article-title":"Coordinating hundreds of cooperative, autonomous vehicles in warehouses","volume":"29","author":"wurman","year":"2008","journal-title":"AI Mag"},{"key":"ref6","first-page":"399","article-title":"Note on the ‘15’ puzzle","volume":"2","author":"story","year":"1879","journal-title":"Amer J Math"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-19457-3_39"},{"key":"ref8","author":"loyd","year":"1959","journal-title":"Mathematical Puzzles of Sam Loyd"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(74)90098-7"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/MRA.2006.1678135"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1984.715921"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2004.1308031"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.15607\/RSS.2015.XI.046"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-16595-0_42"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2005.05.008"},{"key":"ref24","author":"garey","year":"1979","journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"ref26","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/978-3-642-36279-8_10","article-title":"Multi-agent path planning and network flow","volume":"86","author":"yu","year":"2013","journal-title":"Algorithmic Foundation of Robotics VI Springer Tracts in Advanced Robotics"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14031-0_25"}],"container-title":["IEEE Robotics and Automation Letters"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7083369\/7163696\/7342901.pdf?arnumber=7342901","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T15:57:50Z","timestamp":1642003070000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7342901\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,1]]},"references-count":26,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/lra.2015.2503143","relation":{},"ISSN":["2377-3766","2377-3774"],"issn-type":[{"value":"2377-3766","type":"electronic"},{"value":"2377-3774","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,1]]}}}