{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T10:49:32Z","timestamp":1778496572418,"version":"3.51.4"},"reference-count":26,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,5,29]],"date-time":"2023-05-29T00:00:00Z","timestamp":1685318400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,5,29]],"date-time":"2023-05-29T00:00:00Z","timestamp":1685318400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF","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":[],"published-print":{"date-parts":[[2023,5,29]]},"DOI":"10.1109\/icra48891.2023.10160351","type":"proceedings-article","created":{"date-parts":[[2023,7,4]],"date-time":"2023-07-04T17:20:56Z","timestamp":1688491256000},"page":"1364-1370","source":"Crossref","is-referenced-by-count":5,"title":["Toward Efficient Physical and Algorithmic Design of Automated Garages"],"prefix":"10.1109","author":[{"given":"Teng","family":"Guo","sequence":"first","affiliation":[{"name":"Rutgers, the State University of New Jersey,Department of Computer Science,Piscataway,NJ,USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jingjin","family":"Yu","sequence":"additional","affiliation":[{"name":"Rutgers, the State University of New Jersey,Department of Computer Science,Piscataway,NJ,USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2016.2593448"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v27i1.8541"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v27i1.8592"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v24i1.7767"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2009.5152326"},{"key":"ref10","article-title":"Multiagent pathfinding: Definitions, variants, and benchmarks","author":"stern","year":"0","journal-title":"Twelfth Annual Symposium on Combinatorial Search"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIIEC.2013.62"},{"key":"ref1","article-title":"First AGV Robotic Parking System in Hong Kong developed by Yeefung","year":"2021","journal-title":"Yeefung Automation"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2012.11.006"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2014.11.006"},{"key":"ref19","article-title":"Push and swap: Fast cooperative path- finding with completeness guarantees","author":"luna","year":"0","journal-title":"Twenty-Second International Joint Conference on Artificial Intelligence"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1609\/socs.v5i1.18315"},{"key":"ref24","article-title":"Optimal target assignment and path finding for teams of agents","author":"ma","year":"2016","journal-title":"AAMAS"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.15607\/RSS.2018.XIV.013"},{"key":"ref26","article-title":"On rearrangement of items stored in stacks","author":"szegedy","year":"0","journal-title":"Intl Workshop on the Algorithmic Foundations of Robotics"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v31i1.11035"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.15607\/RSS.2022.XVIII.057"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2018.8594417"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/IROS47612.2022.9982231"},{"key":"ref8","article-title":"Optimal algorithms for scheduling multiple simultaneously movable empty cells to retrieve a load in puzzle-based storage systems","author":"yu","year":"2016","journal-title":"Available at SSRN"},{"key":"ref7","first-page":"168","article-title":"Finding a shortest solution for the n× n extension of the 15-puzzle is intractable","author":"ratner","year":"1986","journal-title":"AAAI"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ITSC55140.2022.9922035"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/IVS.2015.7225798"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/IVS.2014.6856561"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1002\/nav.20230"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.trb.2017.12.017"}],"event":{"name":"2023 IEEE International Conference on Robotics and Automation (ICRA)","location":"London, United Kingdom","start":{"date-parts":[[2023,5,29]]},"end":{"date-parts":[[2023,6,2]]}},"container-title":["2023 IEEE International Conference on Robotics and Automation (ICRA)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10160211\/10160212\/10160351.pdf?arnumber=10160351","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,24]],"date-time":"2023-07-24T17:32:30Z","timestamp":1690219950000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10160351\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,29]]},"references-count":26,"URL":"https:\/\/doi.org\/10.1109\/icra48891.2023.10160351","relation":{},"subject":[],"published":{"date-parts":[[2023,5,29]]}}}