{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T21:00:48Z","timestamp":1729630848994,"version":"3.28.0"},"reference-count":29,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,5]]},"DOI":"10.1109\/icra.2013.6631083","type":"proceedings-article","created":{"date-parts":[[2013,10,21]],"date-time":"2013-10-21T18:11:25Z","timestamp":1382379085000},"page":"3606-3611","source":"Crossref","is-referenced-by-count":6,"title":["Efficient formation path planning on large graphs"],"prefix":"10.1109","author":[{"given":"Max","family":"Katsev","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jingjin","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Steven M.","family":"LaValle","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"19","first-page":"23","article-title":"Cooperative pathfinding","author":"silver","year":"2005","journal-title":"The 1st Conference on Artificial Intelligence and Interactive Digital Entertainment"},{"key":"17","first-page":"474","article-title":"A polynomial time primal network simplex algorithm for minimum cost flows","author":"orlin","year":"1996","journal-title":"Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms Ser SODA '96"},{"key":"18","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":"15","doi-asserted-by":"publisher","DOI":"10.1007\/s10514-012-9303-2"},{"key":"16","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":"13","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546877"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/70.736775"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800020109"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-4022-9"},{"key":"21","article-title":"K-color multi-robot motion planning","author":"solovey","year":"2012","journal-title":"The Tenth International Workshop on Algorithmic Foundations of Robotics (WAFR)"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1109\/70.988973"},{"journal-title":"C Implementation of the Hungarian Method","year":"2004","author":"stachniss","key":"22"},{"key":"23","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":"24","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2009.5152326"},{"key":"25","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":"26","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":"27","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2012.6426233"},{"key":"28","article-title":"Multi-agent path planning and network flow","author":"yu","year":"2012","journal-title":"The Tenth International Workshop on Algorithmic Foundations of Robotics (WAFR)"},{"key":"29","doi-asserted-by":"publisher","DOI":"10.1109\/70.182671"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1007\/BF02216922"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579135"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2006.878952"},{"journal-title":"Network Flows Theory Algorithms and Applications","year":"1993","author":"ahuja","key":"1"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2011.06.003"},{"journal-title":"Linear Programming and Extensions","year":"1963","author":"dantzig","key":"6"},{"journal-title":"Introduction to Algorithms","year":"2001","author":"cormen","key":"5"},{"journal-title":"Principles of Robot Motion Theory Algorithms and Implementations","year":"2005","author":"choset","key":"4"},{"journal-title":"Flows in Networks","year":"1962","author":"ford","key":"9"},{"key":"8","first-page":"1419","article-title":"On multiple moving objects","author":"erdmann","year":"1986","journal-title":"Proceedings IEEE International Conference on Robotics &Automation"}],"event":{"name":"2013 IEEE International Conference on Robotics and Automation (ICRA)","start":{"date-parts":[[2013,5,6]]},"location":"Karlsruhe, Germany","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\/06631083.pdf?arnumber=6631083","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\/6631083\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,5]]},"references-count":29,"URL":"https:\/\/doi.org\/10.1109\/icra.2013.6631083","relation":{},"subject":[],"published":{"date-parts":[[2013,5]]}}}