{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T14:42:12Z","timestamp":1743000132468,"version":"3.40.3"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030667221"},{"type":"electronic","value":"9783030667238"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-66723-8_31","type":"book-chapter","created":{"date-parts":[[2021,2,9]],"date-time":"2021-02-09T13:36:54Z","timestamp":1612877814000},"page":"518-533","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["On Rearrangement of Items Stored in Stacks"],"prefix":"10.1007","author":[{"given":"Mario","family":"Szegedy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jingjin","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,2,9]]},"reference":[{"key":"31_CR1","doi-asserted-by":"crossref","unstructured":"Ajtai, M., Koml\u00f3s, J., Szemer\u00e9di, E.: An 0 (n log n) sorting network. In: Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing, pp. 1\u20139 (1983)","DOI":"10.1145\/800061.808726"},{"issue":"4","key":"31_CR2","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1109\/70.704220","volume":"14","author":"O Ben-Shahar","year":"1998","unstructured":"Ben-Shahar, O., Rivlin, E.: Practical pushing planning for rearrangement tasks. IEEE Trans. Robot. Autom. 14(4), 549\u2013565 (1998)","journal-title":"IEEE Trans. Robot. Autom."},{"issue":"3","key":"31_CR3","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1007\/s00291-010-0205-4","volume":"32","author":"B Borgman","year":"2010","unstructured":"Borgman, B., van Asperen, E., Dekker, R.: Online rules for container stacking. OR Spectrum 32(3), 687\u2013716 (2010)","journal-title":"OR Spectrum"},{"key":"31_CR4","unstructured":"Brousseau, B.A.: Tower of hanoi with more pegs. J. Recreat. Math. 8 (1980)"},{"issue":"2","key":"31_CR5","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1287\/opre.21.2.577","volume":"21","author":"N Christofides","year":"1973","unstructured":"Christofides, N., Colloff, I.: The rearrangement of items in a warehouse. Oper. Res. 21(2), 577\u2013589 (1973)","journal-title":"Oper. Res."},{"issue":"1","key":"31_CR6","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s004930170002","volume":"21","author":"R Cole","year":"2001","unstructured":"Cole, R., Ost, K., Schirra, S.: Edge-coloring bipartite multigraphs in O(E log D) time. Combinatorica 21(1), 5\u201312 (2001)","journal-title":"Combinatorica"},{"key":"31_CR7","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/j.cor.2014.06.018","volume":"52","author":"NR Dayama","year":"2014","unstructured":"Dayama, N.R., Krishnamoorthy, M., Ernst, A., Narayanan, V., Rangaraj, N.: Approaches for solving the container stacking problem with route distance minimization and stack rearrangement considerations. Comput. Oper. Res. 52, 68\u201383 (2014)","journal-title":"Comput. Oper. Res."},{"key":"31_CR8","unstructured":"Demaine, E.D., Demaine, M.L., O\u2019Rourke, J.: Pushpush and push-1 are NP-hard in 2D. arXiv preprint cs\/0007021 (2000)"},{"key":"31_CR9","unstructured":"Demaine, E.D., Hoffmann, M.: Pushing blocks is NP-complete for noncrossing solution paths (2001)"},{"issue":"1\u20134","key":"31_CR10","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1007\/BF01840371","volume":"2","author":"M Erdmann","year":"1987","unstructured":"Erdmann, M., Lozano-Perez, T.: On multiple moving objects. Algorithmica 2(1\u20134), 477 (1987)","journal-title":"Algorithmica"},{"key":"31_CR11","doi-asserted-by":"crossref","unstructured":"Garrett, C.R., Lozano-P\u00e9rez, T., Kaelbling, L.P.: FFRob: an efficient heuristic for task and motion planning. In: Algorithmic Foundations of Robotics XI, pp. 179\u2013195. Springer, Cham (2015)","DOI":"10.1007\/978-3-319-16595-0_11"},{"issue":"3","key":"31_CR12","doi-asserted-by":"publisher","first-page":"1392","DOI":"10.1137\/100812513","volume":"42","author":"A Goel","year":"2013","unstructured":"Goel, A., Kapralov, M., Khanna, S.: Perfect matchings in o(n$$\\backslash $$logn) time in regular bipartite graphs. SIAM J. Comput. 42(3), 1392\u20131404 (2013)","journal-title":"SIAM J. Comput."},{"issue":"8","key":"31_CR13","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1016\/j.crma.2006.02.001","volume":"342","author":"R Grigorchuk","year":"2006","unstructured":"Grigorchuk, R., \u0160unik, Z.: Asymptotic aspects of schreier graphs and hanoi towers groups. C.R. Math. 342(8), 545\u2013550 (2006)","journal-title":"C.R. Math."},{"key":"31_CR14","doi-asserted-by":"crossref","unstructured":"Hall, P.: On representatives of subsets. In: Classic Papers in Combinatorics, pp. 58\u201362. Springer, Heidelberg (2009)","DOI":"10.1007\/978-0-8176-4842-8_4"},{"key":"31_CR15","unstructured":"Han, S.D., Stiffler, N.M., Bekris, K.E., Yu, J.: Efficient, high-quality stack rearrangement. IEEE Robot. Autom. Lett. 3(3), 1608\u20131615 (2018). Note: presented at ICRA 2018"},{"issue":"13\u201314","key":"31_CR16","doi-asserted-by":"publisher","first-page":"1775","DOI":"10.1177\/0278364918780999","volume":"37","author":"SD Han","year":"2018","unstructured":"Han, S.D., Stiffler, N.M., Krontiris, A., Bekris, K.E., Yu, J.: Complexity results and fast methods for optimal tabletop rearrangement with overhand grasps. Int. J. Robot. Res. 37(13\u201314), 1775\u20131795 (2018)","journal-title":"Int. J. Robot. Res."},{"key":"31_CR17","doi-asserted-by":"crossref","unstructured":"Havur, G., Ozbilgin, G., Erdem, E., Patoglu, V.: Geometric rearrangement of multiple movable objects on cluttered surfaces: a hybrid reasoning approach. In: 2014 IEEE International Conference on Robotics and Automation (ICRA), pp. 445\u2013452. IEEE (2014)","DOI":"10.1109\/ICRA.2014.6906894"},{"key":"31_CR18","doi-asserted-by":"crossref","unstructured":"Huang, E., Jia, Z., Mason, M.T.: Large-scale multi-object rearrangement. In: 2019 International Conference on Robotics and Automation (ICRA), pp. 211\u2013218. IEEE (2019)","DOI":"10.1109\/ICRA.2019.8793946"},{"key":"31_CR19","doi-asserted-by":"crossref","unstructured":"Krontiris, A., Bekris, K.E.: Dealing with difficult instances of object rearrangement. In: Robotics: Science and Systems (2015)","DOI":"10.15607\/RSS.2015.XI.045"},{"key":"31_CR20","doi-asserted-by":"crossref","unstructured":"Krontiris, A., Bekris, K.E.: Efficiently solving general rearrangement tasks: a fast extension primitive for an incremental sampling-based planner. In: 2016 IEEE International Conference on Robotics and Automation (ICRA), pp. 3924\u20133931. IEEE (2016)","DOI":"10.1109\/ICRA.2016.7487581"},{"key":"31_CR21","unstructured":"Shome, R., Solovey, K., Yu, J., Bekris, K., Halperin, D.: Fast, high-quality dual-arm rearrangement in synchronous, monotone tabletop setups. arXiv preprint arXiv:1810.12202 (2018)"},{"issue":"14","key":"31_CR22","doi-asserted-by":"publisher","first-page":"1750","DOI":"10.1177\/0278364916672311","volume":"35","author":"K Solovey","year":"2016","unstructured":"Solovey, K., Halperin, D.: On the hardness of unlabeled multi-robot motion planning. Int. J. Robot. Res. 35(14), 1750\u20131759 (2016)","journal-title":"Int. J. Robot. Res."},{"key":"31_CR23","unstructured":"Spiralris, D.K.G.M.P.: Coordinating pebble motion on graphs, the diameter of permutation groups, and applications (1984)"},{"issue":"11\u201312","key":"31_CR24","doi-asserted-by":"publisher","first-page":"1295","DOI":"10.1177\/0278364908098457","volume":"27","author":"M Stilman","year":"2008","unstructured":"Stilman, M., Kuffner, J.: Planning among movable obstacles with artificial constraints. Int. J. Robot. Res. 27(11\u201312), 1295\u20131307 (2008)","journal-title":"Int. J. Robot. Res."},{"key":"31_CR25","doi-asserted-by":"crossref","unstructured":"Szegedy, M.: In how many steps the $$k$$ peg version of the towers of hanoi game can be solved? In: Annual Symposium on Theoretical Aspects of Computer Science, pp. 356\u2013361. Springer, Heidelberg (1999)","DOI":"10.1007\/3-540-49116-3_33"},{"key":"31_CR26","doi-asserted-by":"crossref","unstructured":"Van Den Berg, J., Stilman, M., Kuffner, J., Lin, M., Manocha, D.: Path planning among movable obstacles: a probabilistically complete approach. In: Algorithmic Foundation of Robotics VIII, pp. 599\u2013614. Springer, Heidelberg (2009)","DOI":"10.1007\/978-3-642-00312-7_37"},{"issue":"1\u20132","key":"31_CR27","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/0304-3975(93)90321-J","volume":"117","author":"J West","year":"1993","unstructured":"West, J.: Sorting twice through a stack. Theoret. Comput. Sci. 117(1\u20132), 303\u2013313 (1993)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"31_CR28","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/BF01530890","volume":"3","author":"G Wilfong","year":"1991","unstructured":"Wilfong, G.: Motion planning in the presence of movable obstacles. Ann. Math. Artif. Intell. 3(1), 131\u2013150 (1991)","journal-title":"Ann. Math. Artif. Intell."},{"key":"31_CR29","doi-asserted-by":"crossref","unstructured":"Yu, J.: Constant factor time optimal multi-robot routing on high-dimensional grid. In: Robotics: Science and Systems (RSS) (2018)","DOI":"10.15607\/RSS.2018.XIV.013"}],"container-title":["Springer Proceedings in Advanced Robotics","Algorithmic Foundations of Robotics XIV"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-66723-8_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,9]],"date-time":"2021-02-09T14:17:57Z","timestamp":1612880277000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-66723-8_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030667221","9783030667238"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-66723-8_31","relation":{},"ISSN":["2511-1256","2511-1264"],"issn-type":[{"type":"print","value":"2511-1256"},{"type":"electronic","value":"2511-1264"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"9 February 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WAFR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on the Algorithmic Foundations of Robotics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Oulu","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Finland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 June 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 June 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wafr2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/robotics.cs.rutgers.edu\/wafr2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}