一种滑动立方体机器人在二次移动次数内的通用原地重构算法
A Universal In-Place Reconfiguration Algorithm for Sliding Cube-Shaped Robots in a Quadratic Number of Moves
AI总结:
本文提出首个通用滑动立方体机器人重构算法,在O(n^2)次移动内实现任意n模块配置间的重构,并给出原地变体,确保除一个模块外所有模块保持在起始与结束配置的包围盒并集内。
摘要:
在模块化机器人重构问题中,给定 $n$ 个立方体形状的模块(或机器人)以及两个配置,即 $n$ 个模块的放置方式,使得它们的并集是面连通的。目标是找到一系列移动,使用“滑动移动”将模块从一种配置重构为另一种配置,其中模块滑过相邻模块的面或边缘,并始终保持配置的连通性。多年来,已知该模型中的某些模块配置之间至少需要 $\Omega(n^2)$ 次移动才能重构。在本文中,我们引入了第一个通用重构算法——即我们证明任何 $n$ 模块配置都可以仅使用滑动移动重构为任何指定的 $n$ 模块配置。我们的算法在 $O(n^2)$ 次移动内实现重构,因此渐近紧致。我们还提出了一种原地重构的变体,它确保在整个重构过程中,除一个模块外,所有模块都将包含在起始和结束配置的包围盒的并集中。
英文摘要:
In the modular robot reconfiguration problem, we are given $n$ cube-shaped modules (or robots) as well as two configurations, i.e., placements of the $n$ modules so that their union is face-connected. The goal is to find a sequence of moves that reconfigures the modules from one configuration to the other using "sliding moves," in which a module slides over the face or edge of a neighboring module, maintaining connectivity of the configuration at all times. For many years it has been known that certain module configurations in this model require at least $Ω(n^2)$ moves to reconfigure between them. In this paper, we introduce the first universal reconfiguration algorithm -- i.e., we show that any $n$-module configuration can reconfigure itself into any specified $n$-module configuration using just sliding moves. Our algorithm achieves reconfiguration in $O(n^2)$ moves, making it asymptotically tight. We also present a variation that reconfigures in-place, it ensures that throughout the reconfiguration process, all modules, except for one, will be contained in the union of the bounding boxes of the start and end configuration.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。