{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T17:48:29Z","timestamp":1729619309021,"version":"3.28.0"},"reference-count":69,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,12]]},"DOI":"10.1109\/mrs.2017.8250930","type":"proceedings-article","created":{"date-parts":[[2018,1,11]],"date-time":"2018-01-11T23:28:41Z","timestamp":1515713321000},"page":"48-55","source":"Crossref","is-referenced-by-count":4,"title":["Expected constant-factor optimal multi-robot path planning in well-connected environments"],"prefix":"10.1109","author":[{"given":"Jingjin","family":"Yu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1177\/027836498400300405"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(84)90130-3"},{"key":"ref33","first-page":"556","article-title":"Cooperative multi-robot box pushing","author":"matari?","year":"1995","journal-title":"Proc IEEE Intl Conf Intell Robots Syst"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1177\/0278364905059067"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/43.969439"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008937911390"},{"journal-title":"The Complexity of Robot Motion Planning","year":"1988","author":"canny","key":"ref37"},{"key":"ref36","article-title":"Complexity of the generalized mover's problem","author":"reif","year":"1985","journal-title":"DTIC Document Tech Rep"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/ICAR.1997.620182"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.1995.525802"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2012.11.006"},{"key":"ref62","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1609\/icaps.v26i1.13796","article-title":"Multi-agent path finding with kinematic constraints","author":"h\u00f6nig","year":"2016","journal-title":"ICAPS"},{"key":"ref61","article-title":"Icbs: The improved conflict-based search algorithm for multi-agent pathfinding","author":"boyarski","year":"2015","journal-title":"Eighth Annual Symposium on Combinatorial Search"},{"key":"ref63","article-title":"Improved bounded-suboptimal multi-agent path finding solvers","author":"cohen","year":"2016","journal-title":"International Joint Conference on Artificial Intelligence"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/s11036-009-0153-x"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32695-0_50"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ACC.2007.4282736"},{"key":"ref65","doi-asserted-by":"crossref","DOI":"10.1609\/aaai.v27i1.8592","article-title":"A general formal framework for pathfinding problems with multiple agents","author":"erdem","year":"2013","journal-title":"AAAI"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2016.2593448"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TRA.2004.825275"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1109\/MRS.2017.8250930"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1984.715921"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800020109"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/70.182671"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.21236\/ADA196213"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2015.7139967"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/s004539910025"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ROMAN.2012.6343737"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2010.5509502"},{"journal-title":"Theory of Automatic Robot Assembly and Programming","year":"1992","author":"nnaji","key":"ref23"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2004.1307146"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/70.736776"},{"key":"ref50","article-title":"Finding the shortest move-sequence in the graph-generalized 15-puzzle is NP-hard","author":"goldreich","year":"1984","journal-title":"laboratory for Computer Science Massachusetts Institute of Technology Unpublished manuscript"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1016\/S0747-7171(08)80001-6"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2013.6631119"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2011.6095022"},{"key":"ref57","article-title":"Conflict-Based Search for Optimal Multi-Agent Path Finding","author":"sharon","year":"2012","journal-title":"Proc of the Twenty-sixth AAAI Conference on Artificial Intelligence"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2006.282536"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.1997.656573"},{"key":"ref54","doi-asserted-by":"crossref","first-page":"2573","DOI":"10.1109\/ROBOT.1995.525645","article-title":"Multi-robot cooperation through incremental plan-merging","volume":"3","author":"alami","year":"1995","journal-title":"Robotics and Automation 1995 Proceedings 1995 IEEE International Conference on"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2015.2503143"},{"key":"ref52","first-page":"1444","article-title":"Structure and intractability of optimal multi-robot path planning on graphs","author":"yu","year":"2013","journal-title":"Proceedings AAAI National Conference on Artificial Intelligence"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.15607\/RSS.2009.V.018"},{"key":"ref11","article-title":"k-color multi-robot motion planning","author":"solovey","year":"2012","journal-title":"Proceedings Workshop on Algorithmic Foundations of Robotics"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2006.878952"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36279-8_10"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1177\/0278364913515307"},{"journal-title":"Principles of Robot Motion Theory Algorithms and Implementations","year":"2005","author":"choset","key":"ref14"},{"key":"ref15","first-page":"1928","article-title":"Reciprocal velocity obstacles for real-time multi-agent navigation","author":"van den berg","year":"2008","journal-title":"Proceedings IEEE International Conference on Robotics & Automation"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1049\/ip-cta:20050152"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1177\/027836498600500106"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2005.853499"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2007.4399520"},{"key":"ref4","first-page":"2612","article-title":"A distributed and optimal motion planning approach for multiple mobile robots","author":"guo","year":"2002","journal-title":"Proceedings IEEE International Conference on Robotics & Automation"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/70.736775"},{"key":"ref6","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":"ref5","first-page":"23","article-title":"Cooperative pathfinding","author":"silver","year":"2005","journal-title":"The 1st Conference on Artificial Intelligence and Interactive Digital Entertainment"},{"key":"ref8","first-page":"294","article-title":"Push and swap: Fast cooperative pathfinding with completeness guarantees","author":"luna","year":"2011","journal-title":"Proceedings International Joint Conference on Artificial Intelligence"},{"key":"ref7","first-page":"1401","article-title":"A new approach to cooperative pathfinding","author":"jansen","year":"2008","journal-title":"International Conference on Autonomous Agents and Multiagent Systems"},{"journal-title":"A linear time algorithm for the feasibility of pebble motion on graphs","year":"2013","author":"yu","key":"ref49"},{"key":"ref9","first-page":"668","article-title":"Complete algorithms for cooperative pathfinding problems","author":"standley","year":"2011","journal-title":"Proceedings International Joint Conference on Artificial Intelligence"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.15607\/RSS.2015.XI.011"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-16595-0_1"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-009-9290-7"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1007\/PL00009259"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.15607\/RSS.2015.XI.046"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2005.05.008"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2013.6631083"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2012.6426233"}],"event":{"name":"2017 International Symposium on Multi-Robot and Multi-Agent Systems (MRS)","start":{"date-parts":[[2017,12,4]]},"location":"Los Angeles, CA","end":{"date-parts":[[2017,12,5]]}},"container-title":["2017 International Symposium on Multi-Robot and Multi-Agent Systems (MRS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8230762\/8250922\/08250930.pdf?arnumber=8250930","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,30]],"date-time":"2023-08-30T16:11:36Z","timestamp":1693411896000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8250930\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,12]]},"references-count":69,"URL":"https:\/\/doi.org\/10.1109\/mrs.2017.8250930","relation":{},"subject":[],"published":{"date-parts":[[2017,12]]}}}