6 papers
Reconfiguration of Squares Using a Constant Number of Moves Each
Thijs van der Horst, Maarten Löffler, Tim Ophelders +1
Multi-robot motion planning is a hard problem. We investigate restricted variants of the problem where square robots are allowed to slide over an arbitrary curve to a new position…
Intrinsic Universality in Seeded Active Tile Self-Assembly
Tim Gomez, Elise Grizzell, Asher Haun +4
The Tile Automata (TA) model describes self-assembly systems in which monomers can build structures and transition with an adjacent monomer to change their states. This paper shows…
Robust Bichromatic Classification using Two Lines
Erwin Glazenburg, Thijs van der Horst, Tom Peters +2
Given two sets and of points in the plane, we present efficient algorithms to find a two-line linear classifier that best separates the "red" points in from the "bl…
Optimal In-Place Compaction of Sliding Cubes
Irina Kostitsyna, Tim Ophelders, Irene Parada +3
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.…
On the Computational Power of Energy-Constrained Mobile Robots: Algorithms and Cross-Model Analysis
Kevin Buchin, Paola Flocchini, Irina Kostitsyna +3
We consider distributed systems of identical autonomous computational entities, called robots, moving and operating in the plane in synchronous Look-Compute-Move (LCM) cycles. The…
Fast Reconfiguration for Programmable Matter
Irina Kostitsyna, Tom Peters, Bettina Speckmann
The concept of programmable matter envisions a very large number of tiny and simple robot particles forming a smart material. Even though the particles are restricted to local comm…