Title | Sampling-Based Planning for Retrieving Near-Cylindrical Objects in Cluttered Scenes Using Hierarchical Graphs |
Author | |
Corresponding Author | Pan, Jia |
Publication Years | 2022-08-01
|
DOI | |
Source Title | |
ISSN | 1552-3098
|
EISSN | 1941-0468
|
Volume | PPIssue:99Pages:1-18 |
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.;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. |
Keywords | |
URL | [Source Record] |
Indexed By | |
Language | English
|
SUSTech Authorship | Others
|
Funding Project | HKSAR Research Grants Council (RGC) General Research Fund (GRF) HKU[
|
WOS Research Area | Robotics
; Robotics
|
WOS Subject | Robotics
; Robotics
|
WOS Accession No | WOS:000846395600001
|
Publisher | |
EI Accession Number | 20223712722988
|
EI Keywords | Benchmarking
; Bottles
; Manipulators
; Motion Planning
; Probabilistic Logics
; Benchmarking
; Bottles
; Manipulators
; Motion Planning
; Probabilistic Logics
|
ESI Classification Code | Packaging Materials:694.2
; Computer Theory, Includes Formal Logic, Automata Theory, Switching Theory, Programming Theory:721.1
; Computer Programming:723.1
; Robotics:731.5
; Packaging Materials:694.2
; Computer Theory, Includes Formal Logic, Automata Theory, Switching Theory, Programming Theory:721.1
; Computer Programming:723.1
; Robotics:731.5
|
Data Source | Web of Science
|
PDF url | https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=9863895 |
Citation statistics |
Cited Times [WOS]:0
|
Document Type | Journal Article |
Identifier | http://kc.sustech.edu.cn/handle/2SGJ60CL/395918 |
Department | Department of Mechanical and Energy Engineering |
Affiliation | 1.Univ Hong Kong, Dept Comp Sci, Hong Kong, Peoples R China 2.Ctr Garment Prod Ltd, Hong Kong, Peoples R China 3.Southern Univ Sci & Technol, Dept Mech & Energy Engn, Shenzhen 518055, Peoples R China 4.East China Normal Univ, Sch Comp Sci & Technol, Shanghai 200050, Peoples R China 5.East China Normal Univ, Sch Software Engn, Shanghai 200050, Peoples R China |
Recommended Citation GB/T 7714 |
Tian, Hao,Song, Chaoyang,Wang, Changbo,et al. Sampling-Based Planning for Retrieving Near-Cylindrical Objects in Cluttered Scenes Using Hierarchical Graphs[J]. IEEE Transactions on Robotics,2022,PP(99):1-18.
|
APA |
Tian, Hao,Song, Chaoyang,Wang, Changbo,Zhang, Xinyu,&Pan, Jia.(2022).Sampling-Based Planning for Retrieving Near-Cylindrical Objects in Cluttered Scenes Using Hierarchical Graphs.IEEE Transactions on Robotics,PP(99),1-18.
|
MLA |
Tian, Hao,et al."Sampling-Based Planning for Retrieving Near-Cylindrical Objects in Cluttered Scenes Using Hierarchical Graphs".IEEE Transactions on Robotics PP.99(2022):1-18.
|
Files in This Item: | ||||||
File Name/Size | DocType | Version | Access | License | ||
Sampling-Based_Plann(3928KB) | Restricted Access | -- |
|
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment