ArrangeNet: A Voting-Based Network for Predicting Goal Positions in Robotic Object Rearrangement
Robotic object rearrangement is an important task that involves pick-and-place operations to move objects according to the desired goal layouts. In this paper, we propose a novel method to solve the object rearrangement task: ArrangeNet. Given RGB images of the initial and target scenes and queried objects, ArrangeNet implicitly solves object segmentation and matching problems through the attention mechanism in transformer. The goal positions of objects are predicted by leveraging the contextual information among them. The final positions of objects are obtained through a voting mechanism to eliminate the uncertainties due to partial views or occlusions. Experimental results demonstrate the effectiveness of the proposed ArrangeNet in robotic object rearrangement tasks, especially in challenging scenes with partial occlusions.
Authors
- Xuan An (ORCID: https://orcid.org/0009-0003-6452-9667)
- Zhigang Wang (ORCID: https://orcid.org/0000-0002-7123-335X)
- Shuo Wang (ORCID: https://orcid.org/0000-0002-1390-9219)
- Yinghao Cai (ORCID: https://orcid.org/0000-0003-3024-2943)
- Tao Lu (ORCID: https://orcid.org/0000-0003-3374-5845)
Institutions
- Chinese Academy of Sciences (CN)
- Institute of Automation (CN)
Publication Details
- Published
- 2024-12-10
- DOI
- https://doi.org/10.1109/robio64047.2024.10907429
- Primary Topic
- Genome Rearrangement Algorithms
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- National Natural Science Foundation of China
- National Key Research and Development Program of China