Noncooperative algorithms in self-assembly

We show the first non-trivial positive algorithmic results (i.e. programs whose output is larger than their size), in a model of self-assembly that has so far resisted many attempts of formal analysis or programming: the planar non-cooperative variant of Winfree's abstract Tile Assembly Model. This model has been the center of several open problems and conjectures in the last fifteen years, and the first fully general results on its computational power were only proven recently (SODA 2014). These results, as well as ours, exemplify the intricate connections between computation and geometry that can occur in self-assembly. In this model, tiles can stick to an existing assembly as soon as one of their sides matches the existing assembly. This feature contrasts with the general cooperative model, where it can be required that tiles match on \emph{several} of their sides in order to bind. In order to describe our algorithms, we also introduce a generalization of regular expressions called Baggins expressions. Finally, we compare this model to other automata-theoretic models.Comment: A few bug fixes and typo correction

Intrinsic universality and the computational power of self-assembly

This short survey of recent work in tile self-assembly discusses the use of simulation to classify and separate the computational and expressive power of self-assembly models. The journey begins with the result that there is a single universal tile set that, with proper initialization and scaling, simulates any tile assembly system. This universal tile set exhibits something stronger than Turing universality: it captures the geometry and dynamics of any simulated system. From there we find that there is no such tile set in the noncooperative, or temperature 1, model, proving it weaker than the full tile assembly model. In the two-handed or hierarchal model, where large assemblies can bind together on one step, we encounter an infinite set, of infinite hierarchies, each with strictly increasing simulation power. Towards the end of our trip, we find one tile to rule them all: a single rotatable flipable polygonal tile that can simulate any tile assembly system. It seems this could be the beginning of a much longer journey, so directions for future work are suggested.Comment: In Proceedings MCU 2013, arXiv:1309.104

Intrinsic universality in tile self-assembly requires cooperation

We prove a negative result on the power of a model of algorithmic self-assembly for which it has been notoriously difficult to find general techniques and results. Specifically, we prove that Winfree's abstract Tile Assembly Model, when restricted to use noncooperative tile binding, is not intrinsically universal. This stands in stark contrast to the recent result that, via cooperative binding, the abstract Tile Assembly Model is indeed intrinsically universal. Noncooperative self-assembly, also known as "temperature 1", is where tiles bind to each other if they match on one or more sides, whereas cooperative binding requires binding on multiple sides. Our result shows that the change from single- to multi-sided binding qualitatively improves the kinds of dynamics and behavior that these models of nanoscale self-assembly are capable of. Our lower bound on simulation power holds in both two and three dimensions; the latter being quite surprising given that three-dimensional noncooperative tile assembly systems simulate Turing machines. On the positive side, we exhibit a three-dimensional noncooperative self-assembly tile set capable of simulating any two-dimensional noncooperative self-assembly system. Our negative result can be interpreted to mean that Turing universal algorithmic behavior in self-assembly does not imply the ability to simulate arbitrary algorithmic self-assembly processes.Comment: Added references. Improved presentation of definitions and proofs. This article uses definitions from arXiv:1212.4756. arXiv admin note: text overlap with arXiv:1006.2897 by other author

Game Theoretic Strategies for Spacecraft Rendezvous and Motion Synchronization

The rendezvous problem between two active spacecraft is formulated as a two player nonzero-sum differential game. The local-vertical local-horizontal (LVLH) rotating reference frame is used to describe the dynamics of the game. Linear quadratic cooperative and noncooperative differential games are applied to obtain a feedback control law. A comparison between Pareto and Nash equilibria was then performed. The state-dependent Riccati equation (SDRE) method is applied to extend the Linear Quadratic differential game theory to obtain a feedback controller in the case of nonlinear relative motion dynamics. Finally, a multiplayer sequential game strategy is synthesized to extend the control law to the relative motion synchronization of multiple vehicles

Directed Non-Cooperative Tile Assembly Is Decidable

We provide a complete characterisation of all final states of a model called directed non-cooperative tile self-assembly, also called directed temperature 1 tile assembly, which proves that this model cannot possibly perform Turing computation. This model is a deterministic version of the more general undirected model, whose computational power is still open. Our result uses recent results in the domain, and solves a conjecture formalised in 2011. We believe that this is a major step towards understanding the full model. Temperature 1 tile assembly can be seen as a two-dimensional extension of finite automata, where geometry provides a form of memory and synchronisation, yet the full power of these "geometric blockings" was still largely unknown until recently (note that nontrivial algorithms which are able to build larger structures than the naive constructions have been found)

Price Variations in a Stock Market With Many Agents

Large variations in stock prices happen with sufficient frequency to raise doubts about existing models, which all fail to account for non-Gaussian statistics. We construct simple models of a stock market, and argue that the large variations may be due to a crowd effect, where agents imitate each other's behavior. The variations over different time scales can be related to each other in a systematic way, similar to the Levy stable distribution proposed by Mandelbrot to describe real market indices. In the simplest, least realistic case, exact results for the statistics of the variations are derived by mapping onto a model of diffusing and annihilating particles, which has been solved by quantum field theory methods. When the agents imitate each other and respond to recent market volatility, different scaling behavior is obtained. In this case the statistics of price variations is consistent with empirical observations. The interplay between ``rational'' traders whose behavior is derived from fundamental analysis of the stock, including dividends, and ``noise traders'', whose behavior is governed solely by studying the market dynamics, is investigated. When the relative number of rational traders is small, ``bubbles'' often occur, where the market price moves outside the range justified by fundamental market analysis. When the number of rational traders is larger, the market price is generally locked within the price range they define.Comment: 39 pages (Latex) + 20 Figures and missing Figure 1 (sorry), submitted to J. Math. Eco

Assembly as a noncooperative game of its pieces: analysis of 1D sphere assemblies

We propose an event-driven algorithm for the control of simple robot assembly problems based on noncooperative game theory. We examine rigorously the simplest setting — three bodies with one degree of freedom and offer extensive simulations for the 2 DOF extension. The initial analysis and the accompanying simulations suggest that this approach may indeed, offer an attractive means of building robust event driven assembly systems

Study on Resource Configuration on Cloud Manufacturing

The purpose of manufacturing is to realize the requirement of customer. In manufacturing process of cloud system, there exist a lot of resource services which have similar functional characteristics to realize the requirement. It makes the manufacturing process more diverse. To develop the quality and reduce cost, a resource configuration model on cloud-manufacturing platform is put forward in this paper. According to the generalized six-point location principle, a growth design from the requirement of customers to entities with geometric constraints is proposed. By the requirement growing up to product, a configuration process is used to match the entities with the instances which the resources in the database could supply. Different from most existing studies, this paper studies the tolerance design with multiple candidate resource suppliers on cloud manufacturing to make the market play a two-level game considering the benefit of customers and the profit of resources to give an optimal result. A numerical case study is used to illustrate the proposed model and configuration process. The performance and advantage of the proposed method are discussed at the end