{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,17]],"date-time":"2026-07-17T13:50:00Z","timestamp":1784296200208,"version":"3.55.0"},"reference-count":55,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2020,4,1]],"date-time":"2020-04-01T00:00:00Z","timestamp":1585699200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,4,1]],"date-time":"2020-04-01T00:00:00Z","timestamp":1585699200000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,4,1]],"date-time":"2020-04-01T00:00:00Z","timestamp":1585699200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,4,1]],"date-time":"2020-04-01T00:00:00Z","timestamp":1585699200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["IIS-1734419"],"award-info":[{"award-number":["IIS-1734419"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["IIS-1845888"],"award-info":[{"award-number":["IIS-1845888"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Robot. Autom. Lett."],"published-print":{"date-parts":[[2020,4]]},"DOI":"10.1109\/lra.2020.2967326","type":"journal-article","created":{"date-parts":[[2020,1,17]],"date-time":"2020-01-17T20:57:20Z","timestamp":1579294640000},"page":"1350-1357","source":"Crossref","is-referenced-by-count":65,"title":["DDM: Fast Near-Optimal Multi-Robot Path Planning Using Diversified-Path and Optimal Sub-Problem Solution Database Heuristics"],"prefix":"10.1109","volume":"5","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7741-2378","authenticated-orcid":false,"given":"Shuai D.","family":"Han","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4112-2250","authenticated-orcid":false,"given":"Jingjin","family":"Yu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2008.4543489"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1177\/0278364913506268"},{"key":"ref33","first-page":"837","article-title":"Lifelong multi-agent path finding for online pickup and delivery tasks","author":"ma","year":"0","journal-title":"Proc 16th Conf Auton Agents MultiAgent Syst"},{"key":"ref32","article-title":"Automatic algorithm selection in multi-agent pathfinding","author":"sigurdson","year":"2019","journal-title":"arXiv 1906 03992"},{"key":"ref31","first-page":"2247","article-title":"X*: Anytime multiagent planning with bounded search","author":"vedder","year":"0","journal-title":"Proc 8th Int Conf Auton Agents Multiagent Syst"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.15607\/RSS.2018.XIV.013"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2012.6426233"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1177\/0278364913515307"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/76"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2019.2894217"},{"key":"ref28","first-page":"55","article-title":"Mapp: a scalable multi-agent path planning algorithm with tractability and completeness guarantees","volume":"42","author":"wang","year":"2011","journal-title":"J Artif Intell Res"},{"key":"ref27","first-page":"3067","article-title":"Improved Solvers for Bounded-Suboptimal Multi-Agent Path Finding","author":"cohen","year":"0","journal-title":"Proc Int Joint Conf Artif Intell"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2006.282536"},{"key":"ref2","first-page":"9","article-title":"Coordinating hundreds of cooperative, autonomous vehicles in warehouses","volume":"29","author":"wurman","year":"2008","journal-title":"AI Mag"},{"key":"ref1","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":"ref20","first-page":"1752","article-title":"Coordinating hundreds of cooperative, autonomous vehicles in warehouses","author":"wurman","year":"0","journal-title":"Proc 19th Innov Appl Artif Intell Conf"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32695-0_50"},{"key":"ref21","article-title":"Multi-agent pathfinding: Definitions, variants, and benchmarks","author":"stern","year":"2019","journal-title":"12th Ann Symp Combinatorial"},{"key":"ref24","first-page":"668","article-title":"Complete algorithms for cooperative pathfinding problems","author":"standley","year":"0","journal-title":"Proc Int Joint Conf Artif Intell"},{"key":"ref23","first-page":"290","article-title":"A general formal framework for pathfinding problems with multiple agents","author":"erdem","year":"0","journal-title":"Proc 27th AAAI Conf Artif Intell"},{"key":"ref26","first-page":"740","author":"boyarski","year":"0","journal-title":"Proc 8th Annu Symp Comb Search"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2014.11.001"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2016.2623345"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1007\/11527862_18"},{"key":"ref55","article-title":"Ddm: Fast near-optimal multi-robot path planning using diversified-path and optimal sub-problem solution database heuristics","author":"han","year":"2019","journal-title":"arXiv 1904 02598"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/MRS.2019.8901065"},{"key":"ref53","first-page":"141","article-title":"Finding optimal solutions to sokoban using instance dependent pattern databases","author":"pereira","year":"0","journal-title":"Proc 6th Ann Symp Combinator Search (SoCS)"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1613\/jair.2241"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/70.736775"},{"key":"ref11","first-page":"2612","article-title":"A distributed and optimal motion planning approach for multiple mobile robots","author":"guo","year":"0","journal-title":"Proc IEEE Int Conf Robot Autom"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2011.2120810"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2010.5509502"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2004.1307146"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/s11036-009-0153-x"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008937911390"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1177\/0278364905059067"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.1995.525802"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ICAR.1997.620182"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ROMAN.2012.6343737"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2002.1014852"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.21236\/ADA196213"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2005.1545306"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/S0921-8890(02)00256-7"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2016.2593448"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.15607\/RSS.2009.V.018"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.15607\/RSS.2009.V.003"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22670-0_1"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2009.5152696"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2009.5152773"},{"key":"ref48","first-page":"19","article-title":"Suboptimal variants of the conflict-based search algorithm for the multi-agent pathfinding problem","author":"barer","year":"0","journal-title":"the 7th Annual Symposium on Combinatorial Search"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2016.2524067"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-16595-0_1"},{"key":"ref41","article-title":"Coordinating the motion of labeled discs with optimality guarantees under extreme density","author":"chinta","year":"0","journal-title":"Proc Int Worksh Algorithm Found Robot"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2008.4543392"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.15607\/RSS.2015.XI.011"}],"container-title":["IEEE Robotics and Automation Letters"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/7083369\/8932682\/8962218-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7083369\/8932682\/08962218.pdf?arnumber=8962218","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T17:32:48Z","timestamp":1651080768000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8962218\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,4]]},"references-count":55,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/lra.2020.2967326","relation":{},"ISSN":["2377-3766","2377-3774"],"issn-type":[{"value":"2377-3766","type":"electronic"},{"value":"2377-3774","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,4]]}}}