skip to main content

Attention:

The NSF Public Access Repository (NSF-PAR) system and access will be unavailable from 11:00 PM ET on Friday, July 12 until 9:00 AM ET on Saturday, July 13 due to maintenance. We apologize for the inconvenience.


Title: Coordinated Particle Relocation with Global Signals and Local Friction (Media Exposition)
In this video, we present theoretical and practical methods for achieving arbitrary reconfiguration of a set of objects, based on the use of external forces, such as a magnetic field or gravity: Upon actuation, each object is pushed in the same direction. This concept can be used for a wide range of applications in which particles do not have their own energy supply or in which they are subject to the same global control commands. A crucial challenge for achieving any desired target configuration is breaking global symmetry in a controlled fashion. Previous work (some of which was presented during SoCG 2015) made use of specifically placed barriers; however, introducing precisely located obstacles into the workspace is impractical for many scenarios. In this paper, we present a different, less intrusive method: making use of the interplay between static friction with a boundary and the external force to achieve arbitrary reconfiguration. Our key contributions are theoretical characterizations of the critical coefficient of friction that is sufficient for rearranging two particles in triangles, convex polygons, and regular polygons; a method for reconfiguring multiple particles in rectangular workspaces, and deriving practical algorithms for these rearrangements. Hardware experiments show the efficacy of these procedures, demonstrating the usefulness of this novel approach.  more » « less
Award ID(s):
1553063 1619278 1932572
NSF-PAR ID:
10163095
Author(s) / Creator(s):
; ;  ;
Date Published:
Journal Name:
36th International Symposium on Computational Geometry (SoCG 2020)
Volume:
164
Page Range / eLocation ID:
72:1--72:5
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. We investigate algorithmic control of a large swarm of mobile particles (such as robots, sensors, or building material) that move in a 2D workspace using a global input signal (such as gravity or a magnetic field). Upon activation of the field, each particle moves maximally in the same direction until forward progress is blocked by a stationary obstacle or another stationary particle. In an open workspace, this system model is of limited use because it has only two controllable degrees of freedom—all particles receive the same inputs and move uniformly. We show that adding a maze of obstacles to the environment can make the system drastically more complex but also more useful. We provide a wide range of results for a wide range of questions. These can be subdivided into external algorithmic problems, in which particle configurations serve as input for computations that are performed elsewhere, and internal logic problems, in which the particle configurations themselves are used for carrying out computations. For external algorithms, we give both negative and positive results. If we are given a set of stationary obstacles, we prove that it is NP-hard to decide whether a given initial configuration of unit-sized particles can be transformed into a desired target configuration. Moreover, we show that finding a control sequence of minimum length is PSPACE-complete. We also work on the inverse problem, providing constructive algorithms to design workspaces that efficiently implement arbitrary permutations between different configurations. For internal logic, we investigate how arbitrary computations can be implemented. We demonstrate how to encode dual-rail logic to build a universal logic gate that concurrently evaluates AND, NAND, NOR, and OR operations. Using many of these gates and appropriate interconnects, we can evaluate any logical expression. However, we establish that simulating the full range of complex interactions present in arbitrary digital circuits encounters a fundamental difficulty: a FAN-OUT gate cannot be generated. We resolve this missing component with the help of 2 9 1 particles, which can create FAN-OUT gates that produce multiple copies of the inputs. Using these gates we provide rules for replicating arbitrary digital circuits. 
    more » « less
  2. We present and rigorously analyze the behavior of a distributed, stochastic algorithm for separation and integration in self-organizing particle systems, an abstraction of programmable matter. Such systems are composed of individual computational particles with limited memory, strictly local communication abilities, and modest computational power. We consider heterogeneous particle systems of two different colors and prove that these systems can collectively separate into different color classes or integrate, indifferent to color. We accomplish both behaviors with the same fully distributed, local, stochastic algorithm. Achieving separation or integration depends only on a single global parameter determining whether particles prefer to be next to other particles of the same color or not; this parameter is meant to represent external, environmental influences on the particle system. The algorithm is a generalization of a previous distributed, stochastic algorithm for compression (PODC '16), which can be viewed as a special case of separation where all particles have the same color. It is significantly more challenging to prove that the desired behavior is achieved in the heterogeneous setting, however, even in the bichromatic case we focus on. This requires combining several new techniques, including the cluster expansion from statistical physics, a new variant of the bridging argument of Miracle, Pascoe and Randall (RANDOM '11), the high-temperature expansion of the Ising model, and careful probabilistic arguments. 
    more » « less
  3. Superlubricity is a terminology often used to describe a sliding regime in which the adhesion leading to friction or resistance to sliding literally vanishes. For improved energy security, environmental sustainability, and a decarbonized economy, achieving superlubric sliding surfaces in moving mechanical systems sounds very exciting, since friction adversely impacts the efficiency, durability, and environmental compatibility of many moving mechanical systems used in industrial sectors. Accordingly, scientists and engineers have been exploring new ways to achieve macroscale superlubricity through the use of advanced materials, coatings, and lubricants for many years. As a result of such concerted efforts, recent developments indicate that with the use of the right kinds of solids, liquids, and gases on or in the vicinity of sliding contact interfaces, one can indeed achieve friction coefficients well below 0.01. The friction coefficient below this threshold is commonly termed the superlubric sliding regime. Hopefully, these developments will foster further research in the field of superlubricity and will ultimately give rise to the industrial scale realization of nearly-frictionless mechanical systems consuming far less energy and causing much-reduced greenhouse gas emissions. This will ultimately have a substantial positive impact on the realization of economically and environmentally viable industrial practices supporting a decarbonized energy future. In this paper, we will provide an overview of recent progress in superlubricity research involving solid, liquid, and gaseous media and discuss the prospects for achieving superlubricity in engineering applications leading to greater efficiency, durability, environmental quality, and hence global sustainability. 
    more » « less
  4. In DNA nanotechnology, DNA molecules are designed, engineered, and assembled into arbitrary-shaped architectures with predesigned functions. Static DNA assemblies often have delicate designs with structural rigidity to overcome thermal fluctuations. Dynamic structures reconfigure in response to external cues, which have been explored to create functional nanodevices for environmental sensing and other applications. However, the precise control of reconfiguration dynamics has been a challenge due partly to flexible single-stranded DNA connections between moving parts. Deformable structures are special dynamic constructs with deformation on double-stranded parts and single-stranded hinges during transformation. These structures often have better control in programmed deformation. However, related deformability and mechanics including transformation mechanisms are not well understood or documented. In this review, we summarize the development of dynamic and deformable DNA nanostructures from a mechanical perspective. We present deformation mechanisms such as single-stranded DNA hinges with lock-and-release pairs, jack edges, helicity modulation, and external loading. Theoretical and computational models are discussed for understanding their associated deformations and mechanics. We elucidate the pros and cons of each model and recommend design processes based on the models. The design guidelines should be useful for those who have limited knowledge in mechanics as well as expert DNA designers. 
    more » « less
  5. The highly sparse nature of propagation channels and the restricted use of radio frequency (RF) chains at transceivers limit the performance of millimeter wave (mmWave) multiple-input multiple-output (MIMO) systems. Introducing reconfigurable antennas to mmWave can offer an additional degree of freedom on designing mmWave MIMO systems. This paper provides a theoretical framework for studying the mmWave MIMO with reconfigurable antennas. We present an architecture of reconfigurable mmWave MIMO with beamspace hybrid analog-digital beamformers and reconfigurable antennas at both the transmitter and the receiver. We show that employing reconfigurable antennas can provide throughput gain for the mmWave MIMO. We derive the expression for the average throughput gain of using reconfigurable antennas, and further simplify the expression by considering the case of large number of reconfiguration states. In addition, we propose a low-complexity algorithm for the reconfiguration state and beam selection, which achieves nearly the same throughput performance as the optimal selection of reconfiguration state and beams by exhaustive search. 
    more » « less