{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T17:04:03Z","timestamp":1783616643687,"version":"3.55.0"},"reference-count":66,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2016,10,1]],"date-time":"2016-10-01T00:00:00Z","timestamp":1475280000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2016,10,1]],"date-time":"2016-10-01T00:00:00Z","timestamp":1475280000000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2016,10,1]],"date-time":"2016-10-01T00:00:00Z","timestamp":1475280000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2016,10,1]],"date-time":"2016-10-01T00:00:00Z","timestamp":1475280000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1328018"],"award-info":[{"award-number":["1328018"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"National Robotics Initiative","award":["1617744"],"award-info":[{"award-number":["1617744"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Robot."],"published-print":{"date-parts":[[2016,10]]},"DOI":"10.1109\/tro.2016.2593448","type":"journal-article","created":{"date-parts":[[2016,8,10]],"date-time":"2016-08-10T20:07:39Z","timestamp":1470859659000},"page":"1163-1177","source":"Crossref","is-referenced-by-count":287,"title":["Optimal Multirobot Path Planning on Graphs: Complete Algorithms and Effective Heuristics"],"prefix":"10.1109","volume":"32","author":[{"given":"Jingjin","family":"Yu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Steven M.","family":"LaValle","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(74)90098-7"},{"key":"ref38","author":"loyd","year":"1959","journal-title":"Mathematical Puzzles of Sam Loyd"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/ICAR.1997.620182"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.1995.525802"},{"key":"ref31","first-page":"556","article-title":"Cooperative multi-robot box pushing","author":"matari?","year":"1995","journal-title":"Proc IEEE\/RSJ Int Conf Intell Robots Syst"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1177\/0278364905059067"},{"key":"ref37","first-page":"399","article-title":"Note on the ‘15’ puzzle","volume":"2","author":"story","year":"1879","journal-title":"Am J Math"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546877"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-4022-9"},{"key":"ref34","author":"choset","year":"2005","journal-title":"Principles of Robot Motion Theory Algorithms and Implementations"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2005.41"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1006\/jctb.1995.1006"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1287\/opre.6.3.419"},{"key":"ref63","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1613\/jair.2241","article-title":"Compressed pattern databases.","volume":"30","author":"felner","year":"2007","journal-title":"J Artif Intell Res"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008937911390"},{"key":"ref64","article-title":"Gurobi optimizer reference manual","year":"2014"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TRA.2004.825275"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.2307\/1910129"},{"key":"ref66","article-title":"An effective algorithmic framework for near optimal multi-robot path planning","author":"yu","year":"2015","journal-title":"Proc Int Symp Robot Res"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/43.969439"},{"key":"ref2","first-page":"668","article-title":"Complete algorithms for cooperative pathfinding problems","author":"standley","year":"2011","journal-title":"Proc Int Joint Conf Artif Intell"},{"key":"ref1","first-page":"173","article-title":"Finding optimal solutions to cooperative pathfinding problems","author":"standley","year":"2010","journal-title":"Proc AAAI Nat Conf Artif Intell"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/s004539910025"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2010.5509502"},{"key":"ref21","author":"nnaji","year":"1992","journal-title":"Theory of Automatic Robot Assembly and Programming"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2004.1307146"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/70.736776"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/s11036-009-0153-x"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ACC.2007.4282736"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2011.5980408"},{"key":"ref51","first-page":"227","article-title":"Space-time group motion planning","author":"van der stappen","year":"2012","journal-title":"Proc Workshop Algorithmic Foundations Robot"},{"key":"ref59","author":"ahuja","year":"1993","journal-title":"Network Flows Theory Algorithms and Applications"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1007\/BF02216922"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1016\/S0747-7171(08)80001-6"},{"key":"ref56","first-page":"155","article-title":"Fast, near-optimal computation for multi-robot path planning on graphs","author":"yu","year":"2013","journal-title":"Proc 17th AAAI Conf Late-Breaking Develop Field Artif Intell"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2013.6631084"},{"key":"ref54","article-title":"Towards using discrete multiagent pathfinding to address continuous problems","author":"krontiris","year":"0"},{"key":"ref53","first-page":"591","article-title":"Finding a needle in an exponential haystack: Discrete RRT for exploration of implicit roadmaps in multi-robot motion planning","author":"solovey","year":"2014","journal-title":"Proc Int Workshop Algorithmic Found Robot"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2008.918056"},{"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":"1401","article-title":"A new approach to cooperative pathfinding","author":"jansen","year":"2008","journal-title":"Proc 1st Int Conf Autonomous Agents Multiagent Syst"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1984.715921"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2009.5152326"},{"key":"ref13","first-page":"294","article-title":"Push and swap: Fast cooperative path-finding with completeness guarantees","author":"luna","year":"2011","journal-title":"Proc Int Joint Conf Artif Intell"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2005.1545306"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.15607\/RSS.2009.V.018"},{"key":"ref16","first-page":"191","article-title":"$k$-color multi-robot motion planning","author":"solovey","year":"2012","journal-title":"Proc Workshop Algorithmic Found Robot"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36279-8_10"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1177\/0278364913515307"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.15607\/RSS.2015.XI.011"},{"key":"ref4","article-title":"Optimal multi-robot path planning on graphs: Structure and computational complexity","author":"yu","year":"2015"},{"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","doi-asserted-by":"publisher","DOI":"10.1109\/70.182671"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.1986.1087401"},{"key":"ref8","first-page":"23","article-title":"Cooperative pathfinding","author":"silver","year":"2005","journal-title":"Proc Artif Intell Interactive Digit Entertainment Conf"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/70.736775"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2008.4543489"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2006.878952"},{"key":"ref46","article-title":"ICBS: The improved conflict-based search algorithm for multi-agent pathfinding","author":"boyarski","year":"0"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2012.11.006"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1177\/027836498600500304"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32695-0_50"},{"key":"ref42","article-title":"Multi-agent pathfinding with simultaneous execution of single-agent primitives","author":"sajid","year":"0"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-16595-0_42"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2011.6095022"},{"key":"ref43","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1613\/jair.4447","article-title":"Push and rotate: A complete multi-agent pathfinding algorithm","volume":"51","author":"de wilde","year":"2014","journal-title":"J Artif Intell Res"}],"container-title":["IEEE Transactions on Robotics"],"original-title":[],"link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/ieeexplore.ieee.org\/ielaam\/8860\/7580590\/7539623-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/xplorestaging.ieee.org\/ielx7\/8860\/7580590\/07539623.pdf?arnumber=7539623","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,8]],"date-time":"2022-04-08T18:51:35Z","timestamp":1649443895000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/ieeexplore.ieee.org\/document\/7539623\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,10]]},"references-count":66,"journal-issue":{"issue":"5"},"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1109\/tro.2016.2593448","relation":{},"ISSN":["1552-3098","1941-0468"],"issn-type":[{"value":"1552-3098","type":"print"},{"value":"1941-0468","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,10]]}}}