{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,11]],"date-time":"2026-08-11T15:52:21Z","timestamp":1786463541468,"version":"3.56.0"},"reference-count":24,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T00:00:00Z","timestamp":1554076800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T00:00:00Z","timestamp":1554076800000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T00:00:00Z","timestamp":1554076800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T00:00:00Z","timestamp":1554076800000},"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-1724392"],"award-info":[{"award-number":["IIS-1724392"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100005423","name":"Association of Research Libraries","doi-asserted-by":"publisher","award":["W911NF-17-2-0196"],"award-info":[{"award-number":["W911NF-17-2-0196"]}],"id":[{"id":"10.13039\/100005423","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Robot. Autom. Lett."],"published-print":{"date-parts":[[2019,4]]},"DOI":"10.1109\/lra.2019.2894217","type":"journal-article","created":{"date-parts":[[2019,1,22]],"date-time":"2019-01-22T02:20:15Z","timestamp":1548123615000},"page":"1125-1131","source":"Crossref","is-referenced-by-count":109,"title":["Persistent and Robust Execution of MAPF Schedules in Warehouses"],"prefix":"10.1109","volume":"4","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0773-028X","authenticated-orcid":false,"given":"Wolfgang","family":"Honig","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Scott","family":"Kiesel","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andrew","family":"Tinka","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Joseph W.","family":"Durham","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8394-6912","authenticated-orcid":false,"given":"Nora","family":"Ayanian","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref10","first-page":"3605","article-title":"Multi-agent path finding with delay probabilities","author":"ma","year":"0","journal-title":"Proc AAAI Conf Artif Intell"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2018.2853613"},{"key":"ref12","first-page":"748","article-title":"A scheduling-based approach to multi-agent path finding with weighted and capacitated ARCS","author":"bart\u00e1k","year":"0","journal-title":"Proc 1st Int Conf Autonomous Agents Multiagent Syst"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2017\/684"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/s10514-017-9673-6"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1287\/opre.47.1.113"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2008.4543489"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2017.2656241"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2017.2659727"},{"key":"ref19","article-title":"Robust trajectory execution for multi-robot teams using distributed real-time replanning","author":"senbaslar","year":"0","journal-title":"Proc Intl Symp Distrib Autonom Robotic Syst"},{"key":"ref4","first-page":"168","article-title":"Finding a shortest solution for the N × N extension of the 15-puzzle is intractable","author":"ratner","year":"0","journal-title":"Proc Nat Conf Artif Intell"},{"key":"ref3","first-page":"837","article-title":"Lifelong multi-agent path finding for online pickup and delivery tasks","author":"ma","year":"0","journal-title":"Proc 1st Int Conf Autonomous Agents Multiagent Syst"},{"key":"ref6","first-page":"564","article-title":"Towards optimal cooperative path planning in hard setups through satisfiability solving","volume":"7458","author":"surynek","year":"0","journal-title":"Proc Pacific Rim Int Conf Artif Intell"},{"key":"ref5","first-page":"29","article-title":"Search-based optimal solvers for the multi-agent pathfinding problem: Summary and challenges","author":"felner","year":"0","journal-title":"Proc Symp Combinatorial Search"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2009.5152326"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1613\/jair.4447"},{"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","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2016.2593448"},{"key":"ref9","first-page":"2","article-title":"Robust multi-agent path finding","author":"atzmon","year":"0","journal-title":"Proc Symp Combinatorial Search"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2015.2445780"},{"key":"ref22","first-page":"757","article-title":"Conflict-based search with optimal task assignment","author":"h\u00f6nig","year":"0","journal-title":"Proc 1st Int Conf Autonomous Agents Multiagent Syst"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2014.11.006"},{"key":"ref24","first-page":"5382","article-title":"Mixed reality for robotics","author":"h\u00f6nig","year":"0","journal-title":"Proc IEEE\/RSJ Int Conf Intell Robots Syst"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2011.5980306"}],"container-title":["IEEE Robotics and Automation Letters"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielaam\/7083369\/8581687\/8620328-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7083369\/8581687\/08620328.pdf?arnumber=8620328","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T20:56:05Z","timestamp":1657745765000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8620328\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,4]]},"references-count":24,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/lra.2019.2894217","relation":{},"ISSN":["2377-3766","2377-3774"],"issn-type":[{"value":"2377-3766","type":"electronic"},{"value":"2377-3774","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,4]]}}}