Mobile Manipulation Planning for Tabletop Rearrangement
Jiaming Hu, Jiawei Wang, Henrik I Christensen

TL;DR
This paper presents an improved mobile manipulation planner for tabletop rearrangement that reduces unnecessary robot movements and enhances plan quality and efficiency through strategic operation grouping and state re-exploration.
Contribution
It introduces a novel planning strategy enabling multiple operations from a single position and incorporates state re-exploration, improving over previous methods in efficiency and solution quality.
Findings
Outperforms existing planners in solution quality
Reduces planning time significantly
Enables multiple operations from a single robot position
Abstract
Efficient tabletop rearrangement planning seeks to find high-quality solutions while minimizing total cost. However, the task is challenging due to object dependencies and limited buffer space for temporary placements. The complexity increases for mobile robots, which must navigate around the table with restricted access. A*-based methods yield high-quality solutions, but struggle to scale as the number of objects increases. Monte Carlo Tree Search (MCTS) has been introduced as an anytime algorithm, but its convergence speed to high-quality solutions remains slow. Previous work~\cite{strap2024} accelerated convergence but required the robot to move to the closest position to the object for each pick and place operation, leading to inefficiencies. To address these limitations, we extend the planner by introducing a more efficient strategy for mobile robots. Instead of selecting the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDigital Rights Management and Security
