On Rearrangement of Items Stored in Stacks

DOI10.1007/978-3-030-66723-8_31zbMath1469.68137arXiv2002.04979OpenAlexW3196856498MaRDI QIDQ3382003

Jingjin Yu, Mario Szegedy

Publication date: 20 September 2021

Published in: Algorithmic Foundations of Robotics XIV (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2002.04979

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Artificial intelligence for robotics (68T40)

Cites Work

• Unnamed Item
• Approaches for solving the container stacking problem with route distance minimization and stack rearrangement considerations
• Sorting twice through a stack
• Edge-coloring bipartite multigraphs in \(O(E \log D)\) time
• Online rules for container stacking
• Sorting in \(c \log n\) parallel steps
• On multiple moving objects
• Motion planning in the presence of movable obstacles
• Asymptotic aspects of Schreier graphs and Hanoi Towers groups.
• Perfect Matchings in $O(n\log n)$ Time in Regular Bipartite Graphs
• Path Planning among Movable Obstacles: A Probabilistically Complete Approach
• Planning Among Movable Obstacles with Artificial Constraints

This page was built for publication: On Rearrangement of Items Stored in Stacks