Related papers: Tilt Assembly: Algorithms for Micro-Factories That…
Shape assembly composes complex shapes geometries by arranging simple part geometries and has wide applications in autonomous robotic assembly and CAD modeling. Existing works focus on geometry reasoning and neglect the actual physical…
We investigate motion planning algorithms for the assembly of shapes in the \emph{tilt model} in which unit-square tiles move in a grid world under the influence of uniform external forces and self-assemble according to certain rules. We…
Robotic assembly planning enables architects to explicitly account for the assembly process during the design phase, and enables efficient building methods that profit from the robots' different capabilities. Previous work has addressed…
Team assembly is a problem that demands trade-offs between multiple fairness criteria and computational optimization. We focus on four criteria: (i) fair distribution of workloads within the team, (ii) fair distribution of skills and…
We consider the {\em Shaped Partition Problem} of partitioning $n$ given vectors in real $k$-space into $p$ parts so as to maximize an arbitrary objective function which is convex on the sum of vectors in each part, subject to arbitrary…
Three-dimensional harmless contactless manipulation and assembly of micro-objects and micro-organisms would open new horizons in microrobotics and microbiology, e.g. for microsystems assembly or tissue engineering. In our previous work…
Design requirements for moving parts in mechanical assemblies are typically specified in terms of interactions with other parts. Some are purely kinematic (e.g., pairwise collision avoidance) while others depend on physics and material…
The process of self-assembly is guided by the minimization of free energy, which limits the symmetries available for assembly and ultimately the usefulness of devices fabricated in this fashion. Here, we demonstrate experimentally for the…
Users frequently seek to fabricate objects whose outer surfaces consist of regions with different surface attributes, such as color or material. Manufacturing such objects in a single piece is often challenging or even impossible. The…
Parameterizing by the largest processing time $p_{max}$ and the number of different job processing times $d$, we propose a proximity technique for High-Multiplicity Scheduling on Uniform Machines for the objectives Makespan Minimization…
The regular polyhedra have the highest order of 3D symmetries and are exceptionally at- tractive templates for (self)-assembly using minimal types of building blocks, from nano-cages and virus capsids to large scale constructions like glass…
Assembling parts into an object is a combinatorial problem that arises in a variety of contexts in the real world and involves numerous applications in science and engineering. Previous related work tackles limited cases with identical unit…
In the Maximum Independent Set of Objects problem, we are given an $n$-vertex planar graph $G$ and a family $\mathcal{D}$ of $N$ objects, where each object is a connected subgraph of $G$. The task is to find a subfamily $\mathcal{F}…
We study the complexity of symmetric assembly puzzles: given a collection of simple polygons, can we translate, rotate, and possibly flip them so that their interior-disjoint union is line symmetric? On the negative side, we show that the…
Recent advances in synthetic methods enable designing subunits that self-assemble into structures with precise, finite sizes and well-defined architectures, but yields are frequently suppressed by the formation of off-target metastable…
Self-assembly is one of the most promising strategies for making functional materials at the nanoscale, yet new design principles for making self-limiting architectures, rather than spatially unlimited periodic lattice structures, are…
We study the d-dimensional hypercube knapsack problem where we are given a set of d-dimensional hypercubes with associated profits, and a knapsack which is a unit d-dimensional hypercube. The goal is to find an axis-aligned non-overlapping…
We consider the Demand Strip Packing problem (DSP), in which we are given a set of jobs, each specified by a processing time and a demand. The task is to schedule all jobs such that they are finished before some deadline $D$ while…
We investigate a fundamental question regarding a benchmark class of shapes in one of the simplest, yet most widely utilized abstract models of algorithmic tile self-assembly. Specifically, we study the directed tile complexity of a $k…
The precise arrangement of microscopic objects is critical to the development of functional materials and ornately patterned surfaces. Here, we present an acoustics-based method for the rapid arrangement of microscopic particles into…