{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T22:12:48Z","timestamp":1740175968573,"version":"3.37.3"},"reference-count":43,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2018,7,1]],"date-time":"2018-07-01T00:00:00Z","timestamp":1530403200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2018,7,1]],"date-time":"2018-07-01T00:00:00Z","timestamp":1530403200000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2018,7,1]],"date-time":"2018-07-01T00:00:00Z","timestamp":1530403200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2018,7,1]],"date-time":"2018-07-01T00:00:00Z","timestamp":1530403200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"NSF","award":["IIS-1617744, IIS-1451737, IIS-1734419, and CCF-1330789"],"award-info":[{"award-number":["IIS-1617744, IIS-1451737, IIS-1734419, and CCF-1330789"]}]},{"name":"Rutgers University"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Robot. Autom. Lett."],"published-print":{"date-parts":[[2018,7]]},"DOI":"10.1109\/lra.2018.2800116","type":"journal-article","created":{"date-parts":[[2018,1,31]],"date-time":"2018-01-31T19:19:30Z","timestamp":1517426370000},"page":"1608-1615","source":"Crossref","is-referenced-by-count":15,"title":["Efficient, High-Quality Stack Rearrangement"],"prefix":"10.1109","volume":"3","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7741-2378","authenticated-orcid":false,"given":"Shuai D.","family":"Han","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0164-1809","authenticated-orcid":false,"given":"Nicholas M.","family":"Stiffler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kostas E.","family":"Bekris","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4112-2250","authenticated-orcid":false,"given":"Jingjin","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.2172\/4785039"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TSSC.1968.300136"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2014.06.018"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.15607\/RSS.2017.XIII.051"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2016.7487581"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.15607\/RSS.2015.XI.045"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1016\/S0747-7171(08)80001-6"},{"key":"ref36","first-page":"1","article-title":"Studies in complexity and cryptography","author":"goldreich","year":"2011","journal-title":"Finding the shortest move-sequence in the graph-generalized 15-puzzle is NP-hard"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/s00291-009-0176-5"},{"key":"ref34","doi-asserted-by":"crossref","first-page":"701","DOI":"10.1016\/S0360-8352(97)00024-7","article-title":"Evaluation of the number of rehandles in container yards","volume":"32","author":"kim","year":"1997","journal-title":"Comput Ind Eng"},{"key":"ref10","first-page":"1","article-title":"From feasibility tests to path planners for multi-agent pathfinding","author":"krontiris","year":"0","journal-title":"Proceedings of the International Symposium on Combinatorial Search"},{"journal-title":"Heuristics Intelligent Search Strategies for Computer Problem Solving","year":"1984","author":"pearl","key":"ref40"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2011.6095085"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2012.6225297"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36279-8_10"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2014.11.006"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2016.2593448"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/MRS.2017.8250930"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/70.704220"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2002.1013478"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1287\/opre.21.2.577"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-16595-0_11"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2005.1545306"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2014.6906922"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.15607\/RSS.2015.XI.046"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1984.715921"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/HUMANOIDS.2014.7041499"},{"key":"ref5","first-page":"1118","article-title":"Multiple path coordination for mobile robots: A geometric algorithm","author":"leroy","year":"0","journal-title":"Proc Int Joint Conf Artif Intell"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/PL00009259"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1137\/060652063"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.15607\/RSS.2015.XI.011"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-009-9290-7"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/PL00009476"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/BF01530890"},{"key":"ref22","first-page":"211","article-title":"Pushpush and push-1 are np-hard in 2d","author":"demaine","year":"0","journal-title":"Proc Can Conf Comput Geometry"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.1991.131618"},{"key":"ref42","first-page":"668","article-title":"Complete algorithms for cooperative pathfinding problems","author":"standley","year":"0","journal-title":"Proc Int Joint Conf Artif Intell"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00312-7_37"},{"key":"ref41","first-page":"156","article-title":"Computing the shortest path: A* search meets graph theory","author":"goldberg","year":"0","journal-title":"Proc ACM-SIAM Symp Discrete Algorithms"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-68405-3_6"},{"key":"ref26","first-page":"445","article-title":"Geometric rearrangement of multiple moveable objects on cluttered surfaces: A hybrid reasoning approach","author":"havur","year":"0","journal-title":"Proc IEEE Int Conf Robot Autom"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2014.11.006"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2007.363986"}],"container-title":["IEEE Robotics and Automation Letters"],"original-title":[],"link":[{"URL":"http:\/\/ieeexplore.ieee.org\/ielaam\/7083369\/8302435\/8276280-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7083369\/8302435\/08276280.pdf?arnumber=8276280","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,8]],"date-time":"2022-04-08T18:54:52Z","timestamp":1649444092000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8276280\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7]]},"references-count":43,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/lra.2018.2800116","relation":{},"ISSN":["2377-3766","2377-3774"],"issn-type":[{"type":"electronic","value":"2377-3766"},{"type":"electronic","value":"2377-3774"}],"subject":[],"published":{"date-parts":[[2018,7]]}}}