![Loading...](https://link.springer.com/static/c4a417b97a76cc2980e3c25e2271af3129e08bbe/images/pdf-preview/spacer.gif)
-
Article
Open AccessConnected Reconfiguration of Lattice-Based Cellular Structures by Finite-Memory Robots
We provide algorithmic methods for connected reconfiguration of lattice-based cellular structures by finite-state robots, motivated by large-scale constructions in space. We present algorithms that are able to...
-
Article
Open AccessParticle-Based Assembly Using Precise Global Control
In micro- and nano-scale systems, particles can be moved by using an external force like gravity or a magnetic field. In the presence of adhesive particles that can attach to each other, the challenge is to de...
-
Article
Open AccessCADbots: Algorithmic Aspects of Manipulating Programmable Matter with Finite Automata
We contribute results for a set of fundamental problems in the context of programmable matter by presenting algorithmic methods for evaluating and manipulating a collective of particles by a finite automaton t...
-
Article
Tilt Assembly: Algorithms for Micro-factories That Build Objects with Uniform External Forces
We present algorithmic results for the parallel assembly of many micro-scale objects in two and three dimensions from tiny particles, which has been proposed in the context of programmable matter and self-asse...
-
Chapter and Conference Paper
Train Scheduling: Hardness and Algorithms
We introduce the Train Scheduling Problem which can be described as follows: Given m trains via their tracks, i.e., curves in the plane, and the trains’ lengths, we want to compute a schedule that moves collision...
-
Article
Path Refinement in Weighted Regions
In this paper, we study the weighted region problem (WRP) which is to compute a shortest path in a weighted partitioning of a plane. Recent results show that WRP is not solvable in any algebraic computation mo...
-
Chapter and Conference Paper
Don’t Rock the Boat: Algorithms for Balanced Dynamic Loading and Unloading
We consider dynamic loading and unloading problems for heavy geometric objects. The challenge is to maintain balanced configurations at all times: minimize the maximal motion of the overall center of gravity. ...