Resilience and Controllability of Dynamic Collective Behaviors

The network paradigm is used to gain insight into the structural root causes of the resilience of consensus in dynamic collective behaviors, and to analyze the controllability of the swarm dynamics. Here we devise the dynamic signaling network which is the information transfer channel underpinning the swarm dynamics of the directed interagent connectivity based on a topological neighborhood of interactions. The study of the connectedness of the swarm signaling network reveals the profound relationship between group size and number of interacting neighbors, which is found to be in good agreement with field observations on flock of starlings [Ballerini et al. (2008) Proc. Natl. Acad. Sci. USA, 105: 1232]. Using a dynamical model, we generate dynamic collective behaviors enabling us to uncover that the swarm signaling network is a homogeneous clustered small-world network, thus facilitating emergent outcomes if connectedness is maintained. Resilience of the emergent consensus is tested by introducing exogenous environmental noise, which ultimately stresses how deeply intertwined are the swarm dynamics in the physical and network spaces. The availability of the signaling network allows us to analytically establish for the first time the number of driver agents necessary to fully control the swarm dynamics

Leader-following Consensus of Multi-agent Systems over Finite Fields

The leader-following consensus problem of multi-agent systems over finite fields ${\mathbb F}_p$ is considered in this paper. Dynamics of each agent is governed by a linear equation over ${\mathbb F}_p$, where a distributed control protocol is utilized by the followers.Sufficient and/or necessary conditions on system matrices and graph weights in ${\mathbb F}_p$ are provided for the followers to track the leader

Coverage and Field Estimation on Bounded Domains by Diffusive Swarms

In this paper, we consider stochastic coverage of bounded domains by a diffusing swarm of robots that take local measurements of an underlying scalar field. We introduce three control methodologies with diffusion, advection, and reaction as independent control inputs. We analyze the diffusion-based control strategy using standard operator semigroup-theoretic arguments. We show that the diffusion coefficient can be chosen to be dependent only on the robots' local measurements to ensure that the swarm density converges to a function proportional to the scalar field. The boundedness of the domain precludes the need to impose assumptions on decaying properties of the scalar field at infinity. Moreover, exponential convergence of the swarm density to the equilibrium follows from properties of the spectrum of the semigroup generator. In addition, we use the proposed coverage method to construct a time-inhomogenous diffusion process and apply the observability of the heat equation to reconstruct the scalar field over the entire domain from observations of the robots' random motion over a small subset of the domain. We verify our results through simulations of the coverage scenario on a 2D domain and the field estimation scenario on a 1D domain.Comment: To appear in the proceedings of the 55th IEEE Conference on Decision and Control (CDC 2016

On the reachability and observability of path and cycle graphs

In this paper we investigate the reachability and observability properties of a network system, running a Laplacian based average consensus algorithm, when the communication graph is a path or a cycle. More in detail, we provide necessary and sufficient conditions, based on simple algebraic rules from number theory, to characterize all and only the nodes from which the network system is reachable (respectively observable). Interesting immediate corollaries of our results are: (i) a path graph is reachable (observable) from any single node if and only if the number of nodes of the graph is a power of two, $n=2^i, i\in \natural$, and (ii) a cycle is reachable (observable) from any pair of nodes if and only if $n$ is a prime number. For any set of control (observation) nodes, we provide a closed form expression for the (unreachable) unobservable eigenvalues and for the eigenvectors of the (unreachable) unobservable subsystem