Efficient and High-Quality Prehensile Rearrangement in Cluttered and Confined Spaces. Wang, R., Miao, Y., & Bekris, K. E abstract bibtex Prehensile object rearrangement in cluttered and confined spaces has broad applications but is also challenging. For instance, rearranging products in a grocery shelf means that the robot cannot directly access all objects and has limited free space. This is harder than tabletop rearrangement where objects are easily accessible with top-down grasps, which simplifies robot-object interactions. This work focuses on problems where such interactions are critical for completing tasks. It proposes a new efficient and complete solver under general constraints for monotone instances, which can be solved by moving each object at most once. The monotone solver reasons about robot-object constraints and uses them to effectively prune the search space. The new monotone solver is integrated with a global planner to solve non-monotone instances with high-quality solutions fast. Furthermore, this work contributes an effective pre-processing tool to significantly speed up online motion planning queries for rearrangement in confined spaces. Experiments further demonstrate that the proposed monotone solver, equipped with the pre-processing tool, results in 57.3% faster computation and 3 times higher success rate than state-of-the-art methods. Similarly, the resulting global planner is computationally more efficient and has a higher success rate, while producing highquality solutions for non-monotone instances (i.e., only 1.3 additional actions are needed on average). Videos of demonstrating solutions on a real robotic system and codes can be found at https://github.com/Rui1223/uniform object rearrangement.
@article{wang_efficient_nodate,
title = {Efficient and {High}-{Quality} {Prehensile} {Rearrangement} in {Cluttered} and {Confined} {Spaces}},
abstract = {Prehensile object rearrangement in cluttered and confined spaces has broad applications but is also challenging. For instance, rearranging products in a grocery shelf means that the robot cannot directly access all objects and has limited free space. This is harder than tabletop rearrangement where objects are easily accessible with top-down grasps, which simplifies robot-object interactions. This work focuses on problems where such interactions are critical for completing tasks. It proposes a new efficient and complete solver under general constraints for monotone instances, which can be solved by moving each object at most once. The monotone solver reasons about robot-object constraints and uses them to effectively prune the search space. The new monotone solver is integrated with a global planner to solve non-monotone instances with high-quality solutions fast. Furthermore, this work contributes an effective pre-processing tool to significantly speed up online motion planning queries for rearrangement in confined spaces. Experiments further demonstrate that the proposed monotone solver, equipped with the pre-processing tool, results in 57.3\% faster computation and 3 times higher success rate than state-of-the-art methods. Similarly, the resulting global planner is computationally more efficient and has a higher success rate, while producing highquality solutions for non-monotone instances (i.e., only 1.3 additional actions are needed on average). Videos of demonstrating solutions on a real robotic system and codes can be found at https://github.com/Rui1223/uniform object rearrangement.},
language = {en},
author = {Wang, Rui and Miao, Yinglong and Bekris, Kostas E},
pages = {8},
}
Downloads: 0
{"_id":"knMM26LpK97NofZHr","bibbaseid":"wang-miao-bekris-efficientandhighqualityprehensilerearrangementinclutteredandconfinedspaces","author_short":["Wang, R.","Miao, Y.","Bekris, K. E"],"bibdata":{"bibtype":"article","type":"article","title":"Efficient and High-Quality Prehensile Rearrangement in Cluttered and Confined Spaces","abstract":"Prehensile object rearrangement in cluttered and confined spaces has broad applications but is also challenging. For instance, rearranging products in a grocery shelf means that the robot cannot directly access all objects and has limited free space. This is harder than tabletop rearrangement where objects are easily accessible with top-down grasps, which simplifies robot-object interactions. This work focuses on problems where such interactions are critical for completing tasks. It proposes a new efficient and complete solver under general constraints for monotone instances, which can be solved by moving each object at most once. The monotone solver reasons about robot-object constraints and uses them to effectively prune the search space. The new monotone solver is integrated with a global planner to solve non-monotone instances with high-quality solutions fast. Furthermore, this work contributes an effective pre-processing tool to significantly speed up online motion planning queries for rearrangement in confined spaces. Experiments further demonstrate that the proposed monotone solver, equipped with the pre-processing tool, results in 57.3% faster computation and 3 times higher success rate than state-of-the-art methods. Similarly, the resulting global planner is computationally more efficient and has a higher success rate, while producing highquality solutions for non-monotone instances (i.e., only 1.3 additional actions are needed on average). Videos of demonstrating solutions on a real robotic system and codes can be found at https://github.com/Rui1223/uniform object rearrangement.","language":"en","author":[{"propositions":[],"lastnames":["Wang"],"firstnames":["Rui"],"suffixes":[]},{"propositions":[],"lastnames":["Miao"],"firstnames":["Yinglong"],"suffixes":[]},{"propositions":[],"lastnames":["Bekris"],"firstnames":["Kostas","E"],"suffixes":[]}],"pages":"8","bibtex":"@article{wang_efficient_nodate,\n\ttitle = {Efficient and {High}-{Quality} {Prehensile} {Rearrangement} in {Cluttered} and {Confined} {Spaces}},\n\tabstract = {Prehensile object rearrangement in cluttered and confined spaces has broad applications but is also challenging. For instance, rearranging products in a grocery shelf means that the robot cannot directly access all objects and has limited free space. This is harder than tabletop rearrangement where objects are easily accessible with top-down grasps, which simplifies robot-object interactions. This work focuses on problems where such interactions are critical for completing tasks. It proposes a new efficient and complete solver under general constraints for monotone instances, which can be solved by moving each object at most once. The monotone solver reasons about robot-object constraints and uses them to effectively prune the search space. The new monotone solver is integrated with a global planner to solve non-monotone instances with high-quality solutions fast. Furthermore, this work contributes an effective pre-processing tool to significantly speed up online motion planning queries for rearrangement in confined spaces. Experiments further demonstrate that the proposed monotone solver, equipped with the pre-processing tool, results in 57.3\\% faster computation and 3 times higher success rate than state-of-the-art methods. Similarly, the resulting global planner is computationally more efficient and has a higher success rate, while producing highquality solutions for non-monotone instances (i.e., only 1.3 additional actions are needed on average). Videos of demonstrating solutions on a real robotic system and codes can be found at https://github.com/Rui1223/uniform object rearrangement.},\n\tlanguage = {en},\n\tauthor = {Wang, Rui and Miao, Yinglong and Bekris, Kostas E},\n\tpages = {8},\n}\n\n","author_short":["Wang, R.","Miao, Y.","Bekris, K. E"],"key":"wang_efficient_nodate","id":"wang_efficient_nodate","bibbaseid":"wang-miao-bekris-efficientandhighqualityprehensilerearrangementinclutteredandconfinedspaces","role":"author","urls":{},"metadata":{"authorlinks":{}},"html":""},"bibtype":"article","biburl":"https://bibbase.org/zotero/yuuki_koyama","dataSources":["bJBFjpaYFPYMt7By9"],"keywords":[],"search_terms":["efficient","high","quality","prehensile","rearrangement","cluttered","confined","spaces","wang","miao","bekris"],"title":"Efficient and High-Quality Prehensile Rearrangement in Cluttered and Confined Spaces","year":null}