Related papers: Distributed Transformations of Hamiltonian Shapes …
We consider the distributed learning problem where a network of $n$ agents seeks to minimize a global function $F$. Agents have access to $F$ through noisy gradients, and they can locally communicate with their neighbors a network. We study…
For many-particle systems defined on lattices we investigate the global structure of effective Hamiltonians and observables obtained by means of a suitable basis transformation. We study transformations which lead to effective Hamiltonians…
Let I be an open interval, M be a real manifold, T*M its cotangent bundle and \Phi={\phi_t}, t in I, a homogeneous Hamiltonian isotopy of T*M defined outside the zero-section. Let \Lambda be the conic Lagrangian submanifold associated with…
The study introduces the Adaptive Quantum Ising Agents (AQIA) framework, a Hamiltonian-based methodology that extends programmable quantum matter into an adaptive domain. Each agent operates as a finite transverse-field Ising subsystem,…
This work proposes an extension to the leader-first follower (LFF) class of graphs used to solve the bearing-only formation control problem over directed graphs. The first contribution provides an equilibrium, stability, and convergence…
We develop a computational method to learn a molecular Hamiltonian matrix from matrix-valued time series of the electron density. As we demonstrate for three small molecules, the resulting Hamiltonians can be used for electron density…
Electronic band structure is a cornerstone of condensed matter physics and materials science. Conventional methods like Wannier interpolation (WI), which are commonly used to interpolate band structures onto dense k-point grids, often…
We present a novel, physically-based morphing technique for elastic shapes, leveraging the differentiable material point method (MPM) with space-time control through per-particle deformation gradients to accommodate complex topology…
We introduce a new approach to model and analyze \emph{Mobility}. It is fully based on discrete mathematics and yields a class of mobility models, called the \emph{Markov Trace} Model. This model can be seen as the discrete version of the…
We study the problem of distance-based formation control in autonomous multi-agent systems in which only distance measurements are available. This means that the target formations as well as the sensed variables are both determined by…
Reorienting diverse objects with a multi-fingered hand is a challenging task. Current methods in robotic in-hand manipulation are either object-specific or require permanent supervision of the object state from visual sensors. This is far…
The Hamiltonian approach to isomonodromic deformation systems for generic rational covariant derivative operators on the Riemann sphere, having any matrix dimension $r$ and any number of isolated singularities of arbitrary Poincar\'e rank,…
A team of mobile agents, starting from distinct nodes of a network, have to meet at the same node and declare that they all met. Agents execute the same algorithm, which they start when activated by an adversary or by an agent entering…
The Mutliagent Path Finding (MAPF) problem consists of identifying the trajectories that a set of agents should follow inside a given network in order to reach their desired destinations as soon as possible, but without colliding with each…
Shape-programmed sheets morph from one surface into another upon activation by stimuli such as illumination, and have attracted much interest for their potential engineering applications, especially in soft robotics. Complex shape changes…
We provide a method for the generation of effective continuum Hamiltonians that goes beyond the well known k.p method in being equally effective in both high, and low (or no) symmetry situations. Our approach is based on a surprising exact…
Condensed matter physics increasingly focuses on exploiting the magnetic order parameter orientation n as a tuning knob for properties of collinear magnetic materials, but a general method for constructing effective Hamiltonians with…
We introduce a simple network formation model for social networks. Agents are nodes, connecting to another agent by building a directed edge (or accepting a connection from another agent) has a cost, and reaching (or being reached by) other…
We state and prove a simple Theorem that allows one to generate invariant quantities in Metric-Affine Geometry, under a given transformation of the affine connection. We start by a general functional of the metric and the connection and…
In this work, we design distributed control laws for spatial self-organization of multi-agent swarms in 1D and 2D spatial domains. The objective is to achieve a desired density distribution over a simply-connected spatial domain. Since…