{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T23:33:21Z","timestamp":1771025601143,"version":"3.50.1"},"reference-count":33,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,5]]},"DOI":"10.1109\/icra.2013.6631084","type":"proceedings-article","created":{"date-parts":[[2013,10,21]],"date-time":"2013-10-21T18:11:25Z","timestamp":1382379085000},"page":"3612-3617","source":"Crossref","is-referenced-by-count":98,"title":["Planning optimal paths for multiple robots on graphs"],"prefix":"10.1109","author":[{"given":"Jingjin","family":"Yu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Steven M.","family":"LaValle","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2010.5509502"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2004.1307146"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1016\/S0747-7171(08)80001-6"},{"key":"33","doi-asserted-by":"publisher","DOI":"10.1109\/70.182671"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.1995.525940"},{"key":"16","author":"nnaji","year":"1992","journal-title":"Theory of Automatic Robot Assembly and Programming"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/70.736775"},{"key":"14","first-page":"294","article-title":"Push and swap: Fast cooperative pathfinding with completeness guarantees","author":"luna","year":"2011","journal-title":"Twenty-Second International Joint Conference on Artificial Intelligence"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-4022-9"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546877"},{"key":"21","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":"Journal of Artificial Intelligence Research"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.1995.525802"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1109\/ACC.2007.4282736"},{"key":"23","first-page":"23","article-title":"Cooperative pathfinding","author":"silver","year":"2005","journal-title":"The 1st Conference on Artificial Intelligence and Interactive Digital Entertainment"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1007\/s11036-009-0153-x"},{"key":"25","first-page":"668","article-title":"Complete algorithms for cooperative pathfinding problems","author":"standley","year":"2011","journal-title":"Twenty-Second International Joint Conference on Artificial Intelligence"},{"key":"26","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2009.5152326"},{"key":"27","first-page":"1261","article-title":"An optimization variant of multi-robot path planning is intractable","author":"surynek","year":"2010","journal-title":"The Twenty-Fourth AAAI Conference on Artificial Intelligence (AAAI-10)"},{"key":"28","doi-asserted-by":"publisher","DOI":"10.1109\/TRA.2004.825275"},{"key":"29","article-title":"Prioritized motion planning for multiple robots","author":"berg den j van","year":"2005","journal-title":"Proceedings IEEE\/RSJ International Conference on Intelligent Robots and Systems"},{"key":"3","author":"choset","year":"2005","journal-title":"Principles of Robot Motion Theory Algorithms and Implementations"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/70.736776"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/ICAR.1997.620182"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02216922"},{"key":"30","doi-asserted-by":"crossref","DOI":"10.15607\/RSS.2009.V.018","article-title":"Centralized path planning for multiple robots: Optimal decoupling into sequential plans","author":"berg den j van","year":"2009","journal-title":"Proceedings Robotics Science and Systems"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1177\/0278364905059067"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008937911390"},{"key":"32","article-title":"Multi-agent path planning and network flow","author":"yu","year":"2012","journal-title":"The Tenth International Workshop on Algorithmic Foundations of Robotics"},{"key":"5","author":"ford","year":"1962","journal-title":"Flows in Networks"},{"key":"31","author":"yu","year":"2012","journal-title":"Diameters of permutation groups on graphs and linear time feasibility test of pebble motion problems"},{"key":"4","first-page":"1419","article-title":"On multiple moving objects","author":"erdmann","year":"1986","journal-title":"Proceedings IEEE International Conference on Robotics &Automation"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/TSSC.1968.300136"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1007\/s004539910025"}],"event":{"name":"2013 IEEE International Conference on Robotics and Automation (ICRA)","location":"Karlsruhe, Germany","start":{"date-parts":[[2013,5,6]]},"end":{"date-parts":[[2013,5,10]]}},"container-title":["2013 IEEE International Conference on Robotics and Automation"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6615630\/6630547\/06631084.pdf?arnumber=6631084","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,30]],"date-time":"2019-07-30T22:13:44Z","timestamp":1564524824000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6631084\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,5]]},"references-count":33,"URL":"https:\/\/doi.org\/10.1109\/icra.2013.6631084","relation":{},"subject":[],"published":{"date-parts":[[2013,5]]}}}