{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T11:56:35Z","timestamp":1742990195014,"version":"3.40.3"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030954581"},{"type":"electronic","value":"9783030954598"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-030-95459-8_18","type":"book-chapter","created":{"date-parts":[[2022,2,17]],"date-time":"2022-02-17T19:02:27Z","timestamp":1645124547000},"page":"291-310","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Taming Combinatorial Challenges in\u00a0Clutter Removal"],"prefix":"10.1007","author":[{"given":"Wei N.","family":"Tang","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":[[2022,2,17]]},"reference":[{"key":"18_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/978-3-642-14031-0_25","volume-title":"Computing and Combinatorics","author":"M de Berg","year":"2010","unstructured":"de Berg, M., Khosravi, A.: Optimal binary space partitions in the plane. In: Thai, M.T., Sahni, S. (eds.) COCOON 2010. LNCS, vol. 6196, pp. 216\u2013225. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14031-0_25"},{"key":"18_CR2","volume-title":"The Complexity of Robot Motion Planning","author":"J Canny","year":"1988","unstructured":"Canny, J.: The Complexity of Robot Motion Planning. MIT Press, Cambridge (1988)"},{"key":"18_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/978-3-540-75538-8_7","volume-title":"Computers and Games","author":"R Coulom","year":"2007","unstructured":"Coulom, R.: Efficient selectivity and backup operators in Monte-Carlo tree search. In: van den Herik, H.J., Ciancarini, P., Donkers, H.H.L.M. (eds.) CG 2006. LNCS, vol. 4630, pp. 72\u201383. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-75538-8_7"},{"unstructured":"Dantam, N.T., Kingston, Z.K., Chaudhuri, S., Kavraki, L.E.: Incremental task and motion planning: a constraint-based approach. In: Robotics: Science and Systems, pp. 1\u20136 (2016)","key":"18_CR4"},{"key":"18_CR5","volume-title":"Computers and Intractability","author":"MR Garey","year":"2002","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability. WH Freeman, New York (2002)"},{"key":"18_CR6","series-title":"Springer Tracts in Advanced Robotics","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/978-3-319-16595-0_11","volume-title":"Algorithmic Foundations of Robotics XI","author":"CR Garrett","year":"2015","unstructured":"Garrett, C.R., Lozano-P\u00e9rez, T., Kaelbling, L.P.: FFRob: an efficient heuristic for task and motion planning. In: Akin, H.L., Amato, N.M., Isler, V., van der Stappen, A.F. (eds.) Algorithmic Foundations of Robotics XI. STAR, vol. 107, pp. 179\u2013195. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-16595-0_11"},{"issue":"3\u20134","key":"18_CR7","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1007\/s004539910025","volume":"26","author":"D Halperin","year":"2000","unstructured":"Halperin, D., Latombe, J.C., Wilson, R.H.: A general framework for assembly planning: the motion space approach. Algorithmica 26(3\u20134), 577\u2013601 (2000)","journal-title":"Algorithmica"},{"issue":"13\u201314","key":"18_CR8","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."},{"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)","key":"18_CR9","DOI":"10.1109\/ICRA.2014.6906894"},{"issue":"7","key":"18_CR10","doi-asserted-by":"publisher","first-page":"846","DOI":"10.1177\/0278364911406761","volume":"30","author":"S Karaman","year":"2011","unstructured":"Karaman, S., Frazzoli, E.: Sampling-based algorithms for optimal motion planning. Int. J. Robot. Res. 30(7), 846\u2013894 (2011)","journal-title":"Int. J. Robot. Res."},{"issue":"5","key":"18_CR11","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/0020-0190(93)90085-N","volume":"48","author":"L Kavraki","year":"1993","unstructured":"Kavraki, L., Latombe, J.C., Wilson, R.H.: On the complexity of assembly partitioning. Inf. Process. Lett. 48(5), 229\u2013235 (1993)","journal-title":"Inf. Process. Lett."},{"unstructured":"Kavraki, L., Svestka, P., Overmars, M.H.: Probabilistic roadmaps for path planning in high-dimensional configuration spaces, vol. 1994 (1994)","key":"18_CR12"},{"issue":"3","key":"18_CR13","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/0020-0190(95)00083-O","volume":"55","author":"LE Kavraki","year":"1995","unstructured":"Kavraki, L.E., Kolountzakis, M.N.: Partitioning a planar assembly into two connected parts is NP-complete. Inf. Process. Lett. 55(3), 159\u2013165 (1995)","journal-title":"Inf. Process. Lett."},{"key":"18_CR14","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1007\/11871842_29","volume-title":"Machine Learning: ECML 2006","author":"L Kocsis","year":"2006","unstructured":"Kocsis, L., Szepesv\u00e1ri, C.: Bandit based Monte-Carlo planning. In: F\u00fcrnkranz, J., Scheffer, T., Spiliopoulou, M. (eds.) ECML 2006. LNCS (LNAI), vol. 4212, pp. 282\u2013293. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11871842_29"},{"doi-asserted-by":"crossref","unstructured":"Krontiris, A., Bekris, K.E.: Dealing with difficult instances of object rearrangement. In: Robotics: Science and Systems (2015)","key":"18_CR15","DOI":"10.15607\/RSS.2015.XI.045"},{"issue":"5","key":"18_CR16","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1177\/02783640122067453","volume":"20","author":"SM LaValle","year":"2001","unstructured":"LaValle, S.M., Kuffner, J.J., Jr.: Randomized kinodynamic planning. Int. J. Robot. Res. 20(5), 378\u2013400 (2001)","journal-title":"Int. J. Robot. Res."},{"issue":"10","key":"18_CR17","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1145\/359156.359164","volume":"22","author":"T Lozano-P\u00e9rez","year":"1979","unstructured":"Lozano-P\u00e9rez, T., Wesley, M.A.: An algorithm for planning collision-free paths among polyhedral obstacles. Commun. ACM 22(10), 560\u2013570 (1979)","journal-title":"Commun. ACM"},{"doi-asserted-by":"crossref","unstructured":"Lozano-Perez, T., Wilson, R.H.: Assembly sequencing for arbitrary motions. In: Proceedings IEEE International Conference on Robotics and Automation (ICRA), pp. 527\u2013532 (1993)","key":"18_CR18","DOI":"10.1109\/ROBOT.1993.291904"},{"key":"18_CR19","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/9407.001.0001","volume-title":"Disaster Robotics","author":"RR Murphy","year":"2014","unstructured":"Murphy, R.R.: Disaster Robotics. MIT Press, Cambridge (2014)"},{"doi-asserted-by":"crossref","unstructured":"Natarajan, B.K.: On planning assemblies. In: Proceedings of the Fourth Annual Symposium on Computational Geometry, pp. 299\u2013308. ACM (1988)","key":"18_CR20","DOI":"10.1145\/73393.73424"},{"key":"18_CR21","series-title":"Springer Tracts in Advanced Robotics","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/978-3-540-68405-3_6","volume-title":"Algorithmic Foundation of Robotics VII","author":"D Nieuwenhuisen","year":"2008","unstructured":"Nieuwenhuisen, D., van\u00a0der Stappen, A.F., Overmars, M.H.: An effective framework for path planning amidst movable obstacles. In: Akella, S., Amato, N.M., Huang, W.H., Mishra, B. (eds.) Algorithmic Foundation of Robotics VII. STAR, vol. 47, pp. 87\u2013102. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-68405-3_6"},{"issue":"1\u20132","key":"18_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1163\/156855308X392654","volume":"23","author":"J Ota","year":"2009","unstructured":"Ota, J.: Rearrangement planning of multiple movable objects by a mobile robot. Adv. Robot. 23(1\u20132), 1\u201318 (2009)","journal-title":"Adv. Robot."},{"key":"18_CR23","series-title":"Springer Tracts in Advanced Robotics","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/978-3-319-16595-0_27","volume-title":"Algorithmic Foundations of Robotics XI","author":"M Otte","year":"2015","unstructured":"Otte, M., Frazzoli, E.: $${\\rm RRT^{X}}$$: real-time motion planning\/replanning for environments with unpredictable obstacles. In: Akin, H.L., Amato, N.M., Isler, V., van der Stappen, A.F. (eds.) Algorithmic Foundations of Robotics XI. STAR, vol. 107, pp. 461\u2013478. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-16595-0_27"},{"doi-asserted-by":"crossref","unstructured":"Plaku, E., Hager, G.D.: Sampling-based motion and symbolic action planning with geometric and differential constraints. In: 2010 IEEE International Conference on Robotics and Automation (ICRA), pp. 5002\u20135008. IEEE (2010)","key":"18_CR24","DOI":"10.1109\/ROBOT.2010.5509563"},{"issue":"2","key":"18_CR25","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1109\/MRA.2013.2255424","volume":"20","author":"G Pratt","year":"2013","unstructured":"Pratt, G., Manzo, J.: The DARPA robotics challenge [competitions]. IEEE Robot. Autom. Mag. 20(2), 10\u201312 (2013)","journal-title":"IEEE Robot. Autom. Mag."},{"issue":"11\u201312","key":"18_CR26","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."},{"unstructured":"Tang, W.N., Yu, J.: Taming combinatorial challenges in optimal clutter removal tasks. arXiv:1905.13530 (2019)","key":"18_CR27"},{"doi-asserted-by":"publisher","unstructured":"van den Berg, J., Stilman, M., Kuffner, J., Lin, M., Manocha, D.: Path planning among movable obstacles: a probabilistically complete approach. In: Chirikjian, G.S., Choset, H., Morales, M., Murphey, T. (eds.) Algorithmic Foundation of Robotics VIII. STAR, vol. 57, pp. 599\u2013614. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00312-7_37","key":"18_CR28","DOI":"10.1007\/978-3-642-00312-7_37"},{"unstructured":"Vega-Brown, W., Roy, N.: Asymptotically optimal planning under piecewise-analytic constraints. In: The 12th International Workshop on the Algorithmic Foundations of Robotics (2016)","key":"18_CR29"},{"issue":"1","key":"18_CR30","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."},{"issue":"2","key":"18_CR31","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1016\/0004-3702(94)90048-5","volume":"71","author":"RH Wilson","year":"1994","unstructured":"Wilson, R.H., Latombe, J.C.: Geometric reasoning about mechanical assembly. Artif. Intell. 71(2), 371\u2013396 (1994)","journal-title":"Artif. Intell."}],"container-title":["Springer Proceedings in Advanced Robotics","Robotics Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-95459-8_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,18]],"date-time":"2024-09-18T20:57:08Z","timestamp":1726693028000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-95459-8_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030954581","9783030954598"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-95459-8_18","relation":{},"ISSN":["2511-1256","2511-1264"],"issn-type":[{"type":"print","value":"2511-1256"},{"type":"electronic","value":"2511-1264"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"17 February 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ISRR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The International Symposium of Robotics Research","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hanoi","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Vietnam","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 October 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 October 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"isrr2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/h2t-projects.webarchiv.kit.edu\/Projects\/ISRR2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}