Optimal In-Place Compaction of Sliding Cubes

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

8 Downloads (Pure)

Abstract

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. As is common in the literature, we focus on reconfiguration via an intermediate canonical shape. Specifically, 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 and strictly improves on all prior work. Furthermore, our algorithm directly extends to dimensions higher than three.
Original languageEnglish
Title of host publication19th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2024
EditorsHans L. Bodlaender
PublisherSchloss Dagstuhl - Leibniz-Zentrum für Informatik
Pages31:1-31:14
Number of pages14
ISBN (Electronic)978-3-95977-318-8
DOIs
Publication statusPublished - 31 May 2024
Event19th Scandinavian Symposium on Algorithm Theory, SWAT 2024 - Helsinki, Finland
Duration: 12 Jun 202414 Jun 2024

Publication series

NameLeibniz International Proceedings in Informatics (LIPIcs)
Volume294
ISSN (Electronic)1868-8969

Conference

Conference19th Scandinavian Symposium on Algorithm Theory, SWAT 2024
Country/TerritoryFinland
CityHelsinki
Period12/06/2414/06/24

Funding

Tim Ophelders: partially supported by the Dutch Research Council (NWO) under project no. VI.Veni.212.260.

FundersFunder number
Nederlandse Organisatie voor Wetenschappelijk Onderzoek

    Keywords

    • Modular robots
    • Reconfiguration algorithm
    • Sliding cubes

    Fingerprint

    Dive into the research topics of 'Optimal In-Place Compaction of Sliding Cubes'. Together they form a unique fingerprint.

    Cite this