Distributed Shaping of Robot Swarms Through Spatial Moments of Arbitrary Order
Organizations: Department of Computer Engineering, Automation, and Robotics, and the Institute of Mathematics (IMAG) at the University of Granada, Spain
Abstract
This paper shapes a swarm into a target pattern, such as a figure taken from an image, by controlling its spatial moments. The image is sampled into a reference configuration whose centroid and covariance set the position and principal spreads of the formation, while its higher-order moments, expressed in covariance-normalized (whitened) coordinates, encode the remaining shape. In contrast with geometric formation control, which prescribes distances, bearings, or relative positions between specific agents, this specification concerns the swarm as a whole and assigns no agent to a particular place. The key mechanism is orthogonalization in the swarm's own empirical inner product: projecting negative-gradient velocities onto the complement of low-degree polynomials sampled at the agents makes every higher-order correction preserve all lower-order moments exactly. The resulting hierarchical controller has lower triangular error dynamics and converges locally exponentially for any positive gains, so orders can be added without undoing those already achieved. A joint alternative regulates the higher moments together through a regularized Gauss--Newton step while preserving the centroid and covariance dynamics. We give bounds on the number of agents and sufficient conditions for regularity. Both controllers admit a distributed implementation that uses only relative positions and neighbor communication and retains local exponential convergence when estimation is sufficiently fast. In a distributed simulation on a sparse graph, 350 agents form an airplane from an unstructured swarm through moments up to order ten; the hierarchy reaches the full specification, while the joint law approaches it with smaller velocities.
Figures & tables
| Approach | Control target | Implementation | Required information | Architecture | Cross-order preservation |
|---|---|---|---|---|---|
| Density feedback [ 7 , 8 ] | Density profile | Density-error feedback | Measured / estimated density; localization varies | Distributed / mean-field | Not explicitly enforced |
| PDE-constrained optimization [ 9 , 10 ] | Density profile | PDE-constrained optimal control | Density model; position for field execution a | Global design; execution varies | Not explicitly enforced |
| Second-order moment control [ 11 , 12 , 13 ] | Centroid and covariance (inertial moments) | Abstraction-based or gradient feedback; consensus estimation | Absolute positions in a common frame; neighbor messages | Centralized abstraction / distributed | No higher orders |
| Image-moment control [ 14 ] | Higher-order image moments (Legendre, pseudo-Zernike) on a fixed domain | Gradient of weighted moment error; optimization-based estimation | Global position in a common frame; neighbor messages | Distributed execution | Not enforced; orders weighted empirically |
| Proposed moment-based control | Finite-order central moments, covariance-normalized; any dimension | Projected feedback; distributed estimation | Relative positions in local frames with common orientation; neighbor messages | Distributed execution | All lower orders (hierarchical); centroid and covariance (joint) |
| Hierarchical | Joint | |
|---|---|---|
| Parameters | gains, schedule | |
| Orders preserved | all lower orders | and |
| Conditioning at | ||
| Scalars per message | ||
| Final error, orders – | ||
| Deviation from exact control |
Multi-Robot Formation Control
Multi-robot formation control coordinates robots to maintain, change, or navigate in groups while meeting task and safety constraints.
See all 62 papers