Corpus ID: 211082847

On Rearrangement of Items Stored in Stacks

@article{Szegedy2020OnRO,
  title={On Rearrangement of Items Stored in Stacks},
  author={Mario Szegedy and Jingjin Yu},
  journal={ArXiv},
  year={2020},
  volume={abs/2002.04979}
}
  • Mario Szegedy, Jingjin Yu
  • Published in ArXiv 2020
  • Computer Science, Engineering
  • There are $n \ge 2$ stacks, each filled with $d$ items (its full capacity), and one empty stack with capacity $d$. A robot arm, in one stack operation (move), may pop one item from the top of a non-empty stack and subsequently push it into a stack that is not at capacity. In a {\em labeled} problem, all $nd$ items are distinguishable and are initially randomly scattered in the $n$ stacks. The items must be rearranged using pop-and-push moves so that at the end, the $k^{\rm th}$ stack holds… CONTINUE READING

    Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

    Figures and Topics from this paper.

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 28 REFERENCES

    Sorting Twice Through a Stack

    • Julian West
    • Mathematics, Computer Science
    • Theor. Comput. Sci.
    • 1993
    VIEW 1 EXCERPT
    HIGHLY INFLUENTIAL

    An 0(n log n) sorting network

    VIEW 1 EXCERPT
    HIGHLY INFLUENTIAL

    Large-Scale Multi-Object Rearrangement

    VIEW 1 EXCERPT

    Constant Factor Time Optimal Multi-Robot Routing on High-Dimensional Grids in Mostly Sub-Quadratic Time

    • Jingjin Yu
    • Engineering, Computer Science
    • Robotics: Science and Systems
    • 2018
    VIEW 3 EXCERPTS

    Efficiently solving general rearrangement tasks: A fast extension primitive for an incremental sampling-based planner

    Efficient, High-Quality Stack Rearrangement

    VIEW 4 EXCERPTS