Related papers: SAT-assembly: A new approach for designing self-as…
The interaction between a flexible polymer in good solvent and smaller associating solute molecules such as amphiphiles (surfactants) is considered theoretically. Attractive correlations, induced in the polymer because of the interaction,…
Particles with directional interactions are promising building blocks for new functional materials and may serve as models for biological structures. Mutually attractive nanoparticles that are deformable due to flexible surface groups, for…
Conventional wisdom presumes that low-coordinated crystal ground states require directional interactions. Using our recently introduced optimization procedure to achieve self-assembly of targeted structures (Phys. Rev. Lett. 95, 228301…
Structural quantities such as order parameters and correlation functions are often employed to gain insight into the physical behavior and properties of condensed matter systems. While standard quantities for characterizing structure exist,…
Controlling the size and shape of assembled structures is a fundamental challenge in self-assembly, and is highly relevant in material design and biology. Here, we show that specific, but promiscuous, short-range binding interactions make…
Self-assembly plays an essential role in many natural processes, involving the formation and evolution of living or non-living structures, and shows potential applications in many emerging domains. In existing research and practice, there…
Most successes in autonomous robotic assembly have been restricted to single target or category. We propose to investigate general part assembly, the task of creating novel target assemblies with unseen part shapes. As a fundamental step to…
Modeling potential alloys requires the exploration of all possible configurations of atoms. Additionally, modeling the thermal properties of materials requires knowledge of the possible ways of displacing the atoms. One solution to finding…
This perspective will overview an emerging paradigm for self-organized soft materials, {\it geometrically-frustrated assemblies}, where interactions between self-assembling elements (e.g. particles, macromolecules, proteins) favor local…
This paper presents a novel trajectory optimization formulation to solve the robotic assembly of the belt drive unit. Robotic manipulations involving contacts and deformable objects are challenging in both dynamic modeling and trajectory…
We present a strict separation between the class of "mismatch free" self-assembly systems and general aTAM systems. Mismatch free systems are those systems in which concurrently grown parts must always agree with each other. Tile…
Colloidal self-assembly -- the spontaneous organization of colloids into ordered structures -- has been considered key to produce next-generation materials. However, the present-day staggering variety of colloidal building blocks and the…
We summarise three applications of the obstacle problem to membrane contact, elastoplastic torsion and cavitation modelling, and show how the resulting models can be solved using mixed finite elements. It is challenging to construct fixed…
We consider parameterized concurrent systems consisting of a finite but unknown number of components, obtained by replicating a given set of finite state automata. Components communicate by executing atomic interactions whose participants…
The Boolean Satisfiability (SAT) problem is the canonical NP-complete problem and is fundamental to computer science, with a wide array of applications in planning, verification, and theorem proving. Developing and evaluating practical SAT…
Despite their sophisticated heuristics, boolean satisfiability (SAT) solvers are still vulnerable to symmetry, causing them to visit search regions that are symmetric to ones already explored. While symmetry handling is routine in other…
In computational complexity theory, a decision problem is NP-complete when it is both in NP and NP-hard. Although a solution to a NP-complete can be verified quickly, there is no known algorithm to solve it in polynomial time. There exists…
We use analytic theory and computer simulation to study patterns formed during the growth of two-component assemblies in 2D and 3D. We show that these patterns undergo a nonequilibrium phase transition, at a particular growth rate, between…
The Boolean Satisfiability Problem is perhaps one of the most well-known problems in theoretical computer science. On the one hand, it is proven to be NP-complete, which means that it is generally considered hard to solve. On the other…
A concept of a planar modular mechanical metamaterial inspired by the nature's principle of local adaptivity is proposed. The metamaterial consists of identical pieces similar to jigsaw puzzle tiles. Their rotation within assembly provides…