On Minimizing the Number of Running Buffers for Tabletop Rearrangement

@article{Gao2021OnMT,
  title={On Minimizing the Number of Running Buffers for Tabletop Rearrangement},
  author={Kai Gao and Si Wei Feng and Jingjin Yu},
  journal={ArXiv},
  year={2021},
  volume={abs/2105.06357}
}
For tabletop rearrangement problems with overhand grasps, storage space outside the tabletop workspace, or buffers, can temporarily hold objects which greatly facilitates the resolution of a given rearrangement task. This brings forth the natural question of how many running buffers are required so that certain classes of tabletop rearrangement problems are feasible. In this work, we examine the problem for both the labeled (where each object has a specific goal pose) and the unlabeled (where… Expand

References

SHOWING 1-10 OF 61 REFERENCES
Complexity Results and Fast Methods for Optimal Tabletop Rearrangement with Overhand Grasps
Large-Scale Multi-Object Rearrangement
Dealing with Difficult Instances of Object Rearrangement
Geometric rearrangement of multiple movable objects on cluttered surfaces: A hybrid reasoning approach
Efficient Obstacle Rearrangement for Object Manipulation Tasks in Cluttered Environments
A Minimum Linear Arrangement Algorithm for Undirected Trees
  • Y. Shiloach
  • Mathematics, Computer Science
  • SIAM J. Comput.
  • 1979
Reducibility Among Combinatorial Problems
  • R. Karp
  • Computer Science
  • 50 Years of Integer Programming
  • 2010
A Framework for Push-Grasping in Clutter
...
1
2
3
4
5
...