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

滑动立方体的最优原地压缩

Optimal In-Place Compaction of Sliding Cubes

TU Eindhoven(埃因霍温理工大学);Utrecht University(乌得勒支大学);Universitat Politècnica de Catalunya(加泰罗尼亚理工大学)

Irina Kostitsyna, Tim Ophelders, Irene Parada, Tom Peters, Willem Sonke, Bettina Speckmann

AI总结:

本文提出一种原地算法,以与输入立方体坐标之和成比例的移动次数将任意n立方体配置重构为紧凑规范形状,该结果渐近最优,并可扩展到三维以上。

摘要:

滑动立方体模型是一个成熟的理论框架,支持对由面连接立方体组成的模块化机器人的重构算法进行分析。目前已知的解决重构问题的最佳算法由Abel和Kominers提出[arXiv, 2011],该算法使用O(n^3)次移动将任意n立方体配置转换为任意其他n立方体配置。与文献中常见做法一致,该算法将输入重构为中间规范形状。在本文中,我们提出一种原地算法,该算法使用与输入立方体坐标之和成比例的移动次数,将任意n立方体配置重构为紧凑规范形状。该结果在渐近意义下是最优的。此外,我们的算法可直接扩展到三维以上的维度。

英文摘要:

The sliding cubes model is a well-established theoretical framework that supports the analysis of reconfiguration algorithms for modular robots consisting of face-connected cubes. The best algorithm currently known for the reconfiguration problem, by Abel and Kominers [arXiv, 2011], uses O(n3) moves to transform any n-cube configuration into any other n-cube configuration. As is common in the literature, this algorithm reconfigures the input into an intermediate canonical shape. In this paper we present an in-place algorithm that reconfigures any n-cube configuration into a compact canonical shape using a number of moves proportional to the sum of coordinates of the input cubes. This result is asymptotically optimal. Furthermore, our algorithm directly extends to dimensions higher than three.

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

↑