Related papers: From Consensus to Robust Clustering: Multi-Agent S…
The constrained consensus problem considered in this paper, denoted interval consensus, is characterized by the fact that each agent can impose a lower and upper bound on the achievable consensus value. Such constraints can be encoded in…
Group consensus implies reaching multiple groups where agents belonging to the same cluster reach state consensus. This paper focuses on linear multi-agent systems under nonnegative directed graphs. A new necessary and sufficient condition…
We study opinion dynamics on networks with a nontrivial community structure, assuming individuals can update their binary opinion as the result of the interactions with an external influence with strength $h\in [0,1]$ and with other…
We study necessary and sufficient conditions for contraction and incremental stability of dynamical systems with respect to non-Euclidean norms. First, we introduce weak pairings as a framework to study contractivity with respect to…
Many real-world complex systems rely on cluster synchronization to function properly. A cluster of nodes exhibits synchronous behavior while others behave erratically. Predicting the emergence of these clusters and understanding the…
This paper proposes a new approach to analyze and design distributed robust consensus control protocols for general linear leaderless multi-agent systems (MASs) in presence of relative-state constraints or uncertainties. First, we show that…
The problem of clustering noisy and incompletely observed high-dimensional data points into a union of low-dimensional subspaces and a set of outliers is considered. The number of subspaces, their dimensions, and their orientations are…
Distributed consensus protocols provide a mechanism for spreading information within clustered networks, allowing agents and clusters to make decisions without requiring direct access to the state of the ensemble. In this work, we propose a…
Model selection is a major challenge in non-parametric clustering. There is no universally admitted way to evaluate clustering results for the obvious reason that no ground truth is available. The difficulty to find a universal evaluation…
This article deals with the consensus problem involving agents with time-varying singularities in the dynamics or communication in undirected graph networks. Existing results provide control laws which guarantee asymptotic consensus. These…
We consider the problem of multi-agent consensus where some agents are subject to faults/attacks and might make updates arbitrarily. The network consists of agents taking integer-valued (i.e., quantized) states under directed communication…
Recently, we proposed polycontextural networks as a model of evolving systems of interacting beliefs. Here, we present an analysis of the phase transition as well as the scaling properties. The model contains interacting agents that strive…
In this paper, we investigate the robustness to external disturbances of switched discrete and continuous systems with multiple equilibria. It is shown that if each subsystem of the switched system is Input-to-State Stable (ISS), then under…
We study a model of opinion dynamics introduced by Krause: each agent has an opinion represented by a real number, and updates its opinion by averaging all agent opinions that differ from its own by less than 1. We give a new proof of…
This paper addresses the problem of resilient consensus in the presence of misbehaving nodes. Although it is typical to assume knowledge of at least some nonlocal information when studying secure and fault-tolerant consensus algorithms,…
In this paper, we study the continuous-time consensus problem in the presence of adversaries. The networked multi-agent system is modeled as a switched system, where the normal agents have integrator dynamics and the switching signal…
This paper proposes a reliable learning-based adaptive control framework for nonlinear multi-agent systems (MASs) subject to Denial-of-Service (DoS) attacks and singular control gains, two critical challenges in cyber-physical systems. A…
In the realm of big data, discerning patterns in nonlinear systems affected by external control inputs is increasingly challenging. Our approach blends the coarse-graining strengths of centroid-based unsupervised clustering with the clarity…
The ability to achieve coordinated behavior -- engineered or emergent -- on networked systems has attracted widespread interest over several fields. This interest has led to remarkable advances in developing a theoretical understanding of…
This paper proposes the matrix-weighted consensus algorithm, which is a generalization of the consensus algorithm in the literature. Given a networked dynamical system where the interconnections between agents are weighted by nonnegative…