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

压缩正方形:输入敏感的滑动正方形就地重构

Compacting Squares: Input-Sensitive In-Place Reconfiguration of Sliding Squares

University of Massachusetts Lowell(马萨诸塞大学洛厄尔分校);Massachusetts Institute of Technology(麻省理工学院);Siemens Electronic Design Automation(西门子电子设计自动化公司);TU Eindhoven(埃因霍温理工大学);Technical University of Denmark(丹麦技术大学);JAIST(北陆先端科学技术大学院大学);TU Wien(维也纳工业大学)

Hugo A. Akitaya, Erik D. Demaine, Matias Korman, Irina Kostitsyna, Irene Parada, Willem Sonke, Bettina Speckmann, Ryuhei Uehara, Jules Wulms

摘要:

模块化机器人的一个成熟的理论模型是二维的方形模块的边缘连接配置,它可以通过所谓的滑动移动重新配置。Dumitrescu和Pach [Graphs and Combinatorics,2006]证明了总是可以使用最多$O(n^2)$滑动移动将$n$正方形的一个边连接配置重新配置为任何其他配置,同时保持配置始终连接。对于某些配置对,重新配置可能需要$Ω(n^2)$滑动移动。然而,显著较少的移动可能就足够了。我们证明了对于给定的一对边连通的配置,最小化滑动移动的次数是NP-困难的。在积极的一面,我们提出了Gather&Compact,一个输入敏感的就地算法,只需要$O(\bar{P} n)$滑动移动将一个配置转换为另一个,其中$\bar{P}$是两个边界框的最大周长。正方形只能在边界框内移动,除了一次最多一个正方形可以移动通过边界框附近的位置。$O(\bar{P} n)$边界永远不会超过$O(n^2)$,并且在仅由$n$和$\bar{P}$参数化的所有边界中是最优的(直到常数因子)。我们的算法是建立在模块化机器人的连接良好的组件可以有效地转换的基本原则。因此,我们迭代地增加配置内的连通性,以最终到达单个实心$xy$ -单调分量。我们实现了Gather&Compact,并通过实验将其与Moreno和Sacristán [EuroCG 2020]对Dumitrescu和Pach算法(MSDP)的就地修改进行了比较。我们的实验表明,在所有类型的方形配置上,Gather&Compact始终优于MSDP。

英文摘要:

A well-established theoretical model for modular robots in two dimensions are edge-connected configurations of square modules, which can reconfigure through so-called sliding moves. Dumitrescu and Pach [Graphs and Combinatorics, 2006] proved that it is always possible to reconfigure one edge-connected configuration of $n$ squares into any other using at most $O(n^2)$ sliding moves, while keeping the configuration connected at all times. For certain pairs of configurations, reconfiguration may require $Ω(n^2)$ sliding moves. However, significantly fewer moves may be sufficient. We prove that it is NP-hard to minimize the number of sliding moves for a given pair of edge-connected configurations. On the positive side we present Gather&Compact, an input-sensitive in-place algorithm that requires only $O(\bar{P} n)$ sliding moves to transform one configuration into the other, where $\bar{P}$ is the maximum perimeter of the two bounding boxes. The squares move within the bounding boxes only, with the exception of at most one square at a time which may move through the positions adjacent to the bounding boxes. The $O(\bar{P} n)$ bound never exceeds $O(n^2)$, and is optimal (up to constant factors) among all bounds parameterized by just $n$ and $\bar{P}$. Our algorithm is built on the basic principle that well-connected components of modular robots can be transformed efficiently. Hence we iteratively increase the connectivity within a configuration, to finally arrive at a single solid $xy$-monotone component. We implemented Gather&Compact and compared it experimentally to the in-place modification by Moreno and Sacristán [EuroCG 2020] of the Dumitrescu and Pach algorithm (MSDP). Our experiments show that Gather&Compact consistently outperforms MSDP by a significant margin, on all types of square configurations.

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

↑