Related papers: Consensus and Flocking under Communication Failure
Various social, financial, biological and technological systems can be modeled by interdependent networks. It has been assumed that in order to remain functional, nodes in one network must receive the support from nodes belonging to…
In this technical note we address the problem of achieving consensus in a network of homogeneous nonlinear systems. The communication network is supposed to be switching within a finite set of topologies which may be disconnected for finite…
The models of collective decision-making considered in this paper are nonlinear interconnected cooperative systems with saturating interactions. These systems encode the possible outcomes of a decision process into different steady states…
When networked systems of autonomous agents carry out complex tasks, the control and coordination sought after generally depend on a few fundamental control primitives. Chief among these primitives is consensus, where agents are to converge…
A new approach for the description of phenomena of social aggregation is suggested. On the basis of psychological concepts (as for instance social norms and cultural coordinates), we deduce a general mechanism for the social aggregation in…
This paper brings cooperative protocols for multi-agent systems with agents having a finite state-space. Both scalar single-integrator consensus and general LTI systems synchronization are considered. Systems having a finite state-space…
Flocking behavior has attracted considerable attention in multi-agent systems. The structure of flocking has been predominantly studied through the application of artificial potential fields coupled with velocity consensus. These…
The flow of contracting systems contracts 1-dimensional parallelotopes, i.e., line segments, at an exponential rate. One reason for the usefulness of contracting systems is that many interconnections of contracting sub-systems yield an…
Dissensus is a modeling framework for networks of dynamic agents in competition for scarce resources. Originally inspired by biological cells behaviors, it fits also marketing, finance and many other application areas. Competition is often…
We compare how well agents aggregate information in two repeated social learning environments. In the first setting agents have access to a public data set. In the second they have access to the same data, and also to the past actions of…
The problem of consensus in the presence of misbehaving agents has increasingly attracted attention in the literature. Prior results have established algorithms and graph structures for multi-agent networks which guarantee the consensus of…
This work is concerned with stochastic consensus conditions of multi-agent systems with both time-delays and measurement noises. For the case of additive noises, we develop some necessary conditions and sufficient conditions for stochastic…
We consider a variant of the Hegselmann-Krause model of consensus formation where information between agents propagates with a finite speed $\mathfrak{c}$. This leads to a system of ordinary differential equations (ODE) with state-dependent…
This paper presents a consensus protocol that achieves max-consensus in multi-agent systems over wireless channels. Interference, a feature of the wireless channel, is exploited: each agent receives a superposition of broadcast data, rather…
This study proposes a distributed algorithm that makes agents' adaptive grouping entrap multiple targets via automatic decision making, smooth flocking, and well-distributed entrapping. Agents make their own decisions about which targets to…
This work shows an approach to achieve output consensus among heterogeneous agents in a multi-agent environment where each agent is subject to input constraints. The communication among agents is described by a time-varying…
The movement of a flock with a single leader (and a directed path from it to every agent) can be stabilized. Nonetheless for large flocks perturbations in the movement of the leader may grow to a considerable size as they propagate…
We show that iterative coding systems can not surpass capacity using only quantities which naturally appear in density evolution. Although the result in itself is trivial, the method which we apply shows that in order to achieve capacity…
In this paper, we study estimation of potentially unstable linear dynamical systems when the observations are distributed over a network. We are interested in scenarios when the information exchange among the agents is restricted. In…
Collective movement is observed widely in nature, where individuals interact locally to produce globally ordered, coherent motion. In typical models of collective motion, each individual takes the average direction of multiple neighbors,…