The DOI matches its Crossref record; its reference list is not available.
Sampling-Based Planning for Retrieving Near-Cylindrical Objects in Cluttered Scenes Using Hierarchical Graphs
Abstract
We present an incremental sampling-based task and motion planner for retrieving near-cylindrical objects, like bottle, in cluttered scenes, which computes a plan for removing obstacles to generate a collision-free motion of a robot to retrieve the target object. Our proposed planner uses a two-level hierarchy, including the first-level roadmap for the target object motion and the second-level retrieval graph for the entire robot motion, to aid in deciding the order and trajectory of object removal. We use an incremental expansion strategy to update the roadmap and retrieval graph from the collisions between the target object, the robot, and the obstacles, in order to optimize the object removal sequence. The performance of our method is highlighted in several benchmark scenes, including a fixed robotic arm in a cluttered scene with known obstacle locations and a scene, where locations of some objects or even the target object are unknown due to occlusions. Our method can also efficiently solve the high-dimensional planning problem of object retrieval using a mobile manipulator and be combined with the symbolic planner to plan complex multistep tasks. We deploy our method to a physical robot and integrate it with nonprehensile actions to improve operational efficiency. Compared to the state-of-the-art approaches, our method reduces task and motion planning time up to 24.6$\%$with a higher success rate, and still provides a near-optimal plan.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“Moreover, sampling-based motion planning [19, 35], a kind of commonly used approach for planning and manipulation, also faces performance degradation with increasing occluders [38] as the probability of valid sampling rapidly diminishes.”
From Learning Environment-Aware Affordance for 3D Articulated Object Manipulation under Occlusions (2023) · cites this paper as [38]
Citations
No citation lists for this paper
No citation lists for this paper yet — checked again daily.
References 46 · Cited by 15
Research works printed but not linked: 46
- 10.1109/ICRA40945.2020.9196652 · DOI
- 10.1109/TRO.2020.3047472 · DOI
- 10.1177/0278364913507795 · DOI
- 10.1007/978-3-540-68405-3_6 · DOI
- 10.1007/978-3-642-00312-7_37 · DOI
- 10.1007/BF01530890 · DOI
- Demaine, 2000, Pushpush and push-1 are np-hard in 2D, 211
- 10.1109/ROBOT.2007.363986 · DOI
- 10.1109/robot.1991.131618 · DOI
- 10.1142/S0219843605000545 · DOI
- 10.1177/0278364908098457 · DOI
- 10.1109/3477.718517 · DOI
- 10.1007/s10514-012-9306-z · DOI
- 10.1109/ICRA.2015.7139621 · DOI
- 10.1109/ICRA.2014.6906922 · DOI
- 10.1109/LRA.2017.2783445 · DOI
- 10.1109/ICRA46639.2022.9811934 · DOI
- 10.1109/ICRA48506.2021.9561716 · DOI
- 10.15607/RSS.2021.XVII.072 · DOI
- 10.1109/ICRA.2019.8793616 · DOI
- 10.1109/ICRA48506.2021.9561282 · DOI
- 10.1109/ICRA40945.2020.9196689 · DOI
- 10.1109/ICRA.2017.7989544 · DOI
- 10.1109/ICRA48506.2021.9561895 · DOI
- 10.1109/IROS.2011.6094737 · DOI
- 10.1109/ICRA48506.2021.9561073 · DOI
- 10.1109/ICRA.2018.8462863 · DOI
- 10.1109/ICRA40945.2020.9197451 · DOI
- 10.1109/ICRA40945.2020.9197295 · DOI
- 10.1007/978-3-319-16595-0_11 · DOI
- 10.1609/icaps.v30i1.6739 · DOI · Paper page
- 10.1177/0278364915619022 · DOI
- 10.1109/IROS.2012.6385972 · DOI
- 10.1177/0278364914545811 · DOI
- 10.1109/BioRob.2012.6290776 · DOI
- de Silva, 2013, Towards combining HTN planning and geometric task planning
- Toussaint, 2015, Logic-geometric programming: An optimization-based approach to combined task and motion planning, 1930
- 10.15607/RSS.2018.XIV.044 · DOI
- 10.1109/IROS.2018.8594027 · DOI
- 10.1177/0278364919848837 · DOI
- 10.1109/ICRA.2016.7487165 · DOI
- 10.1109/LRA.2019.2894861 · DOI
- 10.1109/ICRA40945.2020.9197291 · DOI
- 10.15607/rss.2013.ix.017 · DOI
- 10.1609/socs.v6i1.18380 · DOI
- 10.1109/ROBOT.2000.844730 · DOI · Paper page
Metadata
- Authors
- Tian, H., Song, C., Wang, C., Zhang, X., & Pan, J.
- Affiliations
- University of Hong Kong (HK)
- Southern University of Science and Technology (CN)
- East China Normal University (CN)
- Venue
- IEEE Transactions on Robotics
- Published
- 2023-02
- Volume
- 39
- Issue
- 1
- Pages
- 165-182
- ISSN
- 1552-3098 (ISSN-L)
- 1941-0468
- OpenAlex
- W4292972737
- Cited by
- 15
- References
- 46
- Citations by year
- 2026: 3 · 2025: 6 · 2024: 4 · 2023: 2
- FWCI
- 0.98
- Type
- journal article
- Language
- en
- Open access
- closed
- Licence
- Locations
- IEEE Transactions on Robotics (publishedVersion)
- Funders
- HKSAR Research Grants Council
- General Research Fund (11202119, 11207818)
- Innovation and Technology Commission of the HKSAR Government
- Shenzhen Long-term Support Program for Higher Education
- Topics
- Physical Sciences › Engineering › Control and Systems Engineering › Robotic Path Planning Algorithms
- Physical Sciences › Engineering › Control and Systems Engineering › Robot Manipulation and Learning
- Physical Sciences › Computer Science › Artificial Intelligence › AI-based Problem Solving and Planning
- Keywords
- task and motion planning, sampling-based motion planning, object retrieval, cluttered scenes, hierarchical graphs, roadmap, obstacle removal, collision-free motion, mobile manipulators, occlusion
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Sampling-Based Planning for Retrieving Near-Cylindrical Objects in Cluttered Scenes Using Hierarchical Graphs. https://app.cochat.ai/papers/10.1109/tro.2022.3191596
- The paper
- Tian, H., Song, C., Wang, C., Zhang, X., & Pan, J. (2023). Sampling-Based Planning for Retrieving Near-Cylindrical Objects in Cluttered Scenes Using Hierarchical Graphs. IEEE Transactions on Robotics. https://doi.org/10.1109/tro.2022.3191596