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
TLDR
The paper builds on reductions from well-understood, hard combinatorial challenges to propose an algorithmic pipeline for dealing with the rearrangement problems, which exhibits highly desirable scalability as the number of objects increases in both the overlapping and non-overlapping setup. Expand
Large-Scale Multi-Object Rearrangement
TLDR
A new robotic tabletop rearrangement system that can solve the singulation and separation problems addressed in prior work, but can also solve sorting problems and spell out words, among other things. Expand
Uniform Object Rearrangement: From Complete Monotone Primitives to Efficient Non-Monotone Informed Search
TLDR
This work studies the algorithmic structure of rearranging uniform objects, where robot-object collisions do not occur but object- object collisions have to be avoided, and proposes a near-optimal paths solution. Expand
Dealing with Difficult Instances of Object Rearrangement
TLDR
The paper aims to emphasize the benefit of using more powerful motion primitives in the context of task planning for object rearrangement than an individual pick-andplace, and uses either the monotone or the new non-monotone method as a local planner in thecontext of a higher-level task planner that searches the space of object placements and which provides stronger guarantees. Expand
Geometric rearrangement of multiple movable objects on cluttered surfaces: A hybrid reasoning approach
TLDR
The usefulness of the integrated AI approach with several scenarios that cannot be solved by the existing approaches are illustrated, and a formal hybrid reasoning framework that allows embedding of geometric reasoning in task planning is introduced. Expand
Efficient Obstacle Rearrangement for Object Manipulation Tasks in Cluttered Environments
TLDR
An algorithm is presented that produces a plan for relocating obstacles in order to grasp a target in clutter by a robotic manipulator without collisions and improves up to 31% of the execution time compared to other competitors. Expand
A Minimum Linear Arrangement Algorithm for Undirected Trees
  • Y. Shiloach
  • Mathematics, Computer Science
  • SIAM J. Comput.
  • 1979
TLDR
The minimum linear arrangement problem for general undirected graphs is a special case of more general placement problems which might occur in solving wiring problems as well as many other placement problems and has a lot in common with job sequencing problems. Expand
Planning for target retrieval using a robotic manipulator in cluttered and occluded environments
TLDR
This paper presents planning algorithms for a robotic manipulator with a fixed base in order to grasp a target object in cluttered environments and proposes algorithms that aim to minimize the number of objects to be relocated. Expand
Reducibility Among Combinatorial Problems
  • R. Karp
  • Computer Science
  • 50 Years of Integer Programming
  • 2010
TLDR
Throughout the 1960s I worked on combinatorial optimization problems including logic circuit design with Paul Roth and assembly line balancing and the traveling salesman problem with Mike Held, which made me aware of the importance of distinction between polynomial-time and superpolynomial-time solvability. Expand
A Framework for Push-Grasping in Clutter
TLDR
This work introduces a framework for planning in clutter that uses a library of actions inspired by human strategies that succeeds where traditional grasp planners fail, and works under high uncertainty by utilizing the funneling effect of pushing. Expand
...
1
2
3
4
5
...