Related papers: Crash-Tolerant Consensus in Directed Graphs
We propose an algorithm for average consensus over a directed graph which is both fully asynchronous and robust to unreliable communications. We show its convergence to the average, while allowing for slowly growing but potentially…
This paper considers the Byzantine consensus problem for nodes with binary inputs. The nodes are interconnected by a network represented as an undirected graph, and the system is assumed to be synchronous. Under the classical point-to-point…
This work aims to address the design of fully distributed control protocols for stochastic consensus, and, for the first time, establishes the existence and uniqueness of solutions for the path-dependent and highly nonlinear closed-loop…
In an intelligent transportation system, the effects and relations of traffic flow at different points in a network are valuable features which can be exploited for control system design and traffic forecasting. In this paper, we define the…
An event-triggered control technique for consensus of multi-agent systems with general linear dynamics is presented. This paper extends previous work to consider agents that are connected using directed graphs. Additionally, the approach…
Given a graph $Y$ on $n$ vertices and a desired level of fault-tolerance $k$, an objective in fault-tolerant system design is to construct a supergraph $X$ on $n + k$ vertices such that the removal of any $k$ nodes from $X$ leaves a graph…
Sufficient conditions of consensus (synchronization) in networks described by digraphs and consisting of identical determenistic SIMO systems are derived. Identical and nonidentical control gains (positive arc weights) are considered.…
Inspired by distributed resource allocation problems in dynamic topology networks, we initiate the study of distributed consensus with finite messaging passing. We first find a sufficient condition on the network graph for which no…
The problem of achieving consensus in a network of connected systems arises in many science and engineering applications. In contrast to previous works, we focus on the system reactivity, i.e., the initial amplification of the norm of the…
The fault tolerance of random graphs with unbounded degrees with respect to connectivity is investigated, which relates to the reliability of wireless sensor networks with unreliable relay nodes. The model evaluates the network breakdown…
Given a network in which some pairs of nodes can communicate freely, and some subsets of the nodes could be faulty and colluding to disrupt communication, when can messages reliably be sent from one given node to another? We give a new…
This work considers the robustness of uncertain consensus networks. The first set of results studies the stability properties of consensus networks with negative edge weights. We show that if either the negative weight edges form a cut in…
Distributed consensus has been intensively studied in recent years as a means to mitigate state differences among dynamic nodes on a graph. It has been successfully employed in various applications, e.g., formation control of multi-robots,…
In this paper, we use the concept of colored edge graphs to model homogeneous faults in networks. We then use this model to study the minimum connectivity (and design) requirements of networks for being robust against homogeneous faults…
Network reliability is a well-studied problem that requires to measure the probability that a target node is reachable from a source node in a probabilistic (or uncertain) graph, i.e., a graph where every edge is assigned a probability of…
We analyze stability of consensus algorithms in networks of multi-agents with time-varying topologies and delays. The topology and delays are modeled as induced by an adapted process and are rather general, including i.i.d.\ topology…
Theoretical computer science plays an important role in the understanding of social networks and their properties. We can model information rippling throughout social networks, or the opinions of social media users for example, using graph…
In this paper, we study the target controllability problem of networked dynamical systems, in which we are tasked to steer a subset of network states towards a desired objective. More specifically, we derive necessary and sufficient…
This paper considers the consensus problem for a network of nodes with random interactions and sampled-data control actions. We first show that consensus in expectation, in mean square, and almost surely are equivalent for a general random…
We propose a distributed event-triggered control law to solve the consensus problem for multi-agent systems with nonlinear output. Under the condition that the underlying digraph is strongly connected, we propose some sufficient conditions…