Related papers: SAT-assembly: A new approach for designing self-as…
On the one hand, Constraint Satisfaction Problems allow one to declaratively model problems. On the other hand, propositional satisfiability problem (SAT) solvers can handle huge SAT instances. We thus present a technique to declaratively…
Self-folding is an emerging paradigm for the inverse design of three-dimensional structures. While most efforts have concentrated on the shape of the net, our approach introduces a new design dimension-bond specificity between the edges. We…
Colloidal particles can spontaneously self-assemble into ordered structures, which not only can manipulate the propagation of light, but also vibration or phonons. Using Monte Carlo simulation, we study the self-assembly of perfectly…
This paper investigates the use of a sampling-based approach, the RRT*, to reconfigure a 2D set of connected tiles in complex environments, where multiple obstacles might be present. Since the target application is automated building of…
Boolean satisfiability is a propositional logic problem of interest in multiple fields, e.g., physics, mathematics, and computer science. Beyond a field of research, instances of the SAT problem, as it is known, require efficient solution…
Alongside the effort underway to build quantum computers, it is important to better understand which classes of problems they will find easy and which others even they will find intractable. We study random ensembles of the QMA$_1$-complete…
In this paper, we address a general eigenstructure assignment problem where the objective is to distribute the closed-loop modes over the components of the system outputs in such a way that, if a certain mode appears in a given output, it…
This work establishes a solution to the problem of assessing the capacity of multi-object assemblies to withstand external forces without becoming unstable. Our physically-grounded approach handles arbitrary structures made from rigid…
Using elementary rigorous methods we prove the existence of a clustered phase in the random $K$-SAT problem, for $K\geq 8$. In this phase the solutions are grouped into clusters which are far away from each other. The results are in…
In order to optimize a self-assembly reaction, it is essential to understand the factors that govern its pathway. Here, we examine the influence of nucleation pathways in a model system for addressable, multicomponent self-assembly based on…
Flexibility governs the many properties of materials and is crucial for the function of proteins and biopolymers. However, how the self-assembly of flexibly bonded particles can lead to larger structures with global reconfigurability is…
The dynamics of real-world applications and systems require efficient methods for improving infeasible solutions or restoring corrupted ones by making modifications to the current state of a system in a restricted way. We propose a new…
Algorithmic self-assembly, a generalization of crystal growth processes, has been proposed as a mechanism for autonomous DNA computation and for bottom-up fabrication of complex nanostructures. A `program' for growing a desired structure…
Topological Interlocking assemblies are arrangements of blocks kinematically constrained by a fixed frame, such that all rigid body motions of each block are constrained only by its permanent contact with other blocks and the frame. In the…
Self-assembly processes are widespread in nature, and lie at the heart of many biological and physical phenomena. The characteristics of self-assembly building blocks determine the structures that they form. Two crucial properties are the…
Patterned self-assembly tile set synthesis PATS is the problem of finding a minimal tile set which uniquely self-assembles into a given pattern. Czeizler and Popa proved the NP-completeness of PATS and Seki showed that the PATS problem is…
The satisfiability problem is known to be $\mathbf{NP}$-complete in general and for many restricted cases. One way to restrict instances of $k$-SAT is to limit the number of times a variable can be occurred. It was shown that for an…
We consider partially ordered sets of combinatorial structures under consecutive orders, meaning that two structures are related when one embeds in the other such that `consecutive' elements remain consecutive in the image. Given such a…
This paper addresses the concurrency issues affecting Behavior Trees (BTs), a popular tool to model the behaviors of autonomous agents in the video game and the robotics industry. BT designers can easily build complex behaviors composing…
Self-assembled structures are possible solutions to the problem of increasing the density and connectivity of memristive units in massive arrays. Although they would allow surpassing the limit imposed by the lithographic feature size, the…