Related papers: A Rotation-Invariant Embedded Platform for (Neural…
Physics-based simulation is essential for developing and evaluating robot manipulation policies, particularly in scenarios involving deformable objects and complex contact interactions. However, existing simulators often struggle to balance…
We develop a modeling and simulation framework capable of massively parallel simulation of multicellular systems with spatially resolved stochastic kinetics in individual cells. By the use of operator-splitting we decouple the simulation of…
A neural network-based framework is developed and experimentally demonstrated for the problem of estimating the shape of a soft continuum arm (SCA) from noisy measurements of the pose at a finite number of locations along the length of the…
As quantum devices scale to larger and larger sizes, a significant challenge emerges in scaling their coherent controls accordingly. Quantum cellular automata (QCAs) constitute a promising framework that bypasses this control problem:…
In this paper, we analyze the algebraic structure of some null boundary as well as some periodic boundary 2-D Cellular Automata (CA) rules by introducing a new matrix multiplication operation using only AND, OR instead of most commonly used…
Temporal modulation unlocks possibilities to dynamically control and modify the response of electromagnetic systems. Employing explicit dependencies of circuit or surface parameters on time enables the engineering of systems with…
Neuromorphic computing is a new paradigm for design of both the computing hardware and algorithms inspired by biological neural networks. The event-based nature and the inherent parallelism make neuromorphic computing a promising paradigm…
Quantum cellular automata (QCA) are reviewed, including early and more recent proposals. QCA are a generalization of (classical) cellular automata (CA) and in particular of reversible CA. The latter are reviewed shortly. An overview is…
Cellular automata are a discrete dynamical system which models massively parallel computation. Much attention is devoted to computations with small time complexity for which the parallelism may provide further possibilities. In this paper,…
Reservoir Computing with Cellular Automata (ReCA) is a relatively novel and promising approach. It consists of 3 steps: an encoding scheme to inject the problem into the CA, the CA iterations step itself and a simple classifying step,…
In this article, we discuss the family of cellular automata generated by so-called idempotent cellular automata (CA G such that G^2 = G) on the full shift. We prove a characterization of products of idempotent CA, and show examples of CA…
We present the design, characterization, and experimental results for a new modular robotic system for programmable self-assembly. The proposed system uses the Hybrid Cube Model (HCM), which integrates classical features from both…
A family of reversible deterministic cellular automata, including the rules 54 and 201 of [Bobenko et al., Commun. Math. Phys. 158, 127 (1993)] as well as their kinetically constrained quantum (unitary) or stochastic deformations, is shown…
In this paper we present a single-soliton two-component cellular automata (CA) model of waves as mobile self-localizations, also known as: particles, waves, or gliders; and its version with memory. The model is based on coding sets of…
We discovered that certain patterns called injective patterns remain stable during the revolution process, allowing us to create many reversible CA simply by using them to design the revolution rules. By examining injective patterns, we…
This paper introduces a simple formalism for dealing with deterministic, non- deterministic and stochastic cellular automata in an unified and composable manner. This formalism allows for local probabilistic correlations, a feature which is…
Magnetic navigation systems, including magnetic tracking systems and magnetic actuation systems, have shown great potential for occlusion-free localization and remote control of intracorporeal medical devices and robots in minimally…
We study self-similarity in one-dimensional probabilistic cellular automata (PCA) using the renormalization technique. We introduce a general framework for algebraic construction of renormalization groups (RG) on cellular automata and apply…
We consider the group structure of quantum cellular automata (QCA) modulo circuits and show that it is abelian even without assuming the presence of ancillas, at least for most reasonable choices of control space; this is a corollary of a…
The Stranded Cellular Automata (SCA) model consists of a grid of cells which can each contain between zero and two strands apiece and two turning rules that control when strands turn and when they cross. While patterns on this model have…