Related papers: Improved Leader Election for Self-Organizing Progr…
We consider a hypothetical apparatus that implements measurements for arbitrary 4-local quantum observables A on n qubits. The apparatus implements the ``measurement algorithm'' after receiving a classical description of A. We show that a…
We study the filtering problem over a Lie group that plays an important role in robotics and aerospace applications. We present a new particle filtering algorithm based on stochastic control. In particular, our algorithm is based on a…
Atom-like emitters in solids are promising platforms for quantum sensing and information processing, but inhomogeneities in the emitter fine structure complicate quantum control. We present a framework that leverages this diversity to…
Given a set of $n\geq 1$ autonomous, anonymous, indistinguishable, silent, and possibly disoriented mobile unit disk (i.e., fat) robots operating following Look-Compute-Move cycles in the Euclidean plane, we consider the Pattern Formation…
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…
Spontaneous segregation of run-and-tumble particles with different velocities in microchannels is investigated by numerical simulations. Self-propelled particles are known to accumulate in the proximity of walls. Here we show how fast…
Consider a computer network that consists of a path with $n$ nodes. The nodes are labeled with inputs from a constant-sized set, and the task is to find output labels from a constant-sized set subject to some local constraints---more…
The paper surveys topological problems relevant to the motion planning problem of robotics and includes some new results and constructions. First we analyse the notion of topological complexity of configuration spaces which is responsible…
We present a geometric design rule for size-controlled clustering of self-propelled particles. We show that active particles that tend to rotate under an external force have an intrinsic, signed parameter with units of curvature which we…
We discuss biologically inspired, inherently non-equilibrium self-propelled particle models, in which the particles interact with their neighbours by choosing at each time step the local average direction of motion. We summarize some of the…
An optimal control strategy is developed to construct nanostructures of desired geometry along line segments by means of directed self-assembly of charged particles. Such a control strategy determines the electric potentials of a set of…
Recently, several claims have been made that certain fundamental problems of distributed computing, including Leader Election and Distributed Consensus, begin to admit feasible and efficient solutions when the model of distributed…
A particle filter is introduced to numerically approximate a solution of the global optimization problem. The theoretical significance of this work comes from its variational aspects: (i) the proposed particle filter is a controlled…
A team consisting of an unknown number of mobile agents, starting from different nodes of an unknown network, possibly at different times, have to meet at the same node. Agents are anonymous (identical), execute the same deterministic…
We study the problem of leader election among mobile agents operating in an arbitrary network modeled as an undirected graph. Nodes of the network are unlabeled and all agents are identical. Hence the only way to elect a leader among agents…
We present randomized distributed algorithms for the maximal independent set problem (MIS) that, while keeping the time complexity nearly matching the best known, reduce the energy complexity substantially. These algorithms work in the…
In this paper we consider a network of processors aiming at cooperatively solving linear programming problems subject to uncertainty. Each node only knows a common cost function and its local uncertain constraint set. We propose a…
Electromagnetismlike Optimization (EMO) is a global optimization algorithm, particularly well suited to solve problems featuring nonlinear and multimodal cost functions. EMO employs searcher agents that emulate a population of charged…
We experimentally and numerically study the dependence of different navigation strategies regarding the effectivity of an active particle to reach a predefined target area. As the only control parameter, we vary the particle's propulsion…
Direct design of complex functional materials would revolutionize technologies ranging from printable organs to novel clean energy devices. However, even incremental steps towards designing functional materials have proven challenging. If…