Fast High-Quality Tabletop Rearrangement in Bounded Workspace
Authors:
- 23 May 2022
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1961-1967
Abstract
In this paper, we examine the problem of rearranging many objects on a tabletop in a cluttered setting using overhand grasps. Efficient solutions for the problem, which capture a common task that we solve on a daily basis, are essential in enabling truly intelligent robotic manipulation. In a given instance, objects may need to be placed at temporary positions (“buffers”) to complete the rearrangement, but allocating these buffer locations can be highly challenging in a cluttered environment. To tackle the challenge, a two-step baseline planner is first developed, which generates a primitive plan based on inherent combinatorial constraints induced by start and goal poses of the objects and then selects buffer locations assisted by the primitive plan. We then employ the “lazy” planner in a tree search framework which is further sped up by adapting a novel preprocessing routine. Simulation experiments show our methods can quickly generate high-quality solutions and are more robust in solving large-scale instances than existing state-of-the-art approaches. source: github.com/arc-l/TRLBKeywords
All Related Versions
Funding Information
- NSF (IIS-1845888,CCF-1934924,IIS-2132972)
This publication has 24 references indexed in Scilit:
- Lazy collision checking in asymptotically-optimal motion planning2015
- Lazy Toggle PRM: A single-query approach to motion planning2013
- Hierarchical Decision Theoretic Planning for Navigation Among Movable Obstacles2013
- Mathematical model and efficient algorithms for object packing problemComputational Geometry, 2010
- Planning Among Movable Obstacles with Artificial ConstraintsThe International Journal of Robotics Research, 2008
- Planning and executing navigation among movable obstaclesAdvanced Robotics, 2007
- The Lifting Model for ReconfigurationDiscrete & Computational Geometry, 2006
- NAVIGATION AMONG MOVABLE OBSTACLES: REAL-TIME REASONING IN COMPLEX ENVIRONMENTSInternational Journal of Humanoid Robotics, 2005
- A Minimum Linear Arrangement Algorithm for Undirected TreesSIAM Journal on Computing, 1979
- Optimal Linear OrderingSIAM Journal on Applied Mathematics, 1973