arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1706.09949cs.RO
收藏

高效、高质量的堆栈重排

Efficient, High-Quality Stack Rearrangement

Rutgers, the State University of New Jersey(罗格斯大学新泽西州立大学)

Shuai D. Han, Nicholas M. Stiffler, Kostas E. Bekris, Jingjin Yu

摘要:

这项工作研究的重排问题,涉及机器人或对象在堆栈式容器,只能从一侧访问的排序。考虑了两种情况:一种是每个机器人或物体都需要到达特定的堆栈,另一种是每个机器人在堆栈中具有不同位置的设置。在这两种情况下,目标都是最小化需要执行的堆栈删除的数量。堆栈重排被证明是密切相关的卵石运动问题,一个有用的抽象多机器人路径规划。通过这种连接,可以很容易地解决堆栈重排的可行性。本文继续建立最优性的下限和上限,其差异仅为对数因子,在堆栈清除方面。然后,开发了一种算法解决方案,它产生的次优路径比卵石运动求解器快得多。此外,知情的搜索为基础的方法,提出了寻找高质量的解决方案。仿真结果表明了该方法的有效性和可扩展性。

英文摘要:

This work studies rearrangement problems involving the sorting of robots or objects in stack-like containers, which can be accessed only from one side. Two scenarios are considered: one where every robot or object needs to reach a particular stack, and a setting in which each robot has a distinct position within a stack. In both cases, the goal is to minimize the number of stack removals that need to be performed. Stack rearrangement is shown to be intimately connected to pebble motion problems, a useful abstraction in multi-robot path planning. Through this connection, feasibility of stack rearrangement can be readily addressed. The paper continues to establish lower and upper bounds on optimality, which differ only by a logarithmic factor, in terms of stack removals. An algorithmic solution is then developed that produces suboptimal paths much quicker than a pebble motion solver. Furthermore, informed search-based methods are proposed for finding high-quality solutions. The efficiency and desirable scalability of the methods is demonstrated in simulation.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑