Related papers: Efficient Algorithms for the Consensus Decision Pr…
This technical note extends recent results on the computational complexity of globally minimizing the error of piecewise-affine models to the related problem of minimizing the error of switching linear regression models. In particular, we…
In this paper, we study asynchronous consensus problems of continuous-time multi-agent systems with discontinuous information transmission. The proposed consensus control strategy is implemented only based on the state information at some…
In this paper, we propose a new self-triggered consensus algorithm in networks of multi-agents. Different from existing works, which are based on the observation of states, here, each agent determines its next update time based on its…
In this paper, we investigate the approximate consensus problem in highly dynamic networks in which topology may change continually and unpredictably. We prove that in both synchronous and partially synchronous systems, approximate…
This paper deals with stability of discrete-time switched linear systems whose all subsystems are unstable and the set of admissible switching signals obeys pre-specified restrictions on switches between the subsystems and dwell times on…
In this paper, we consider lightweight decentralised algorithms for achieving consensus in distributed systems. Each member of a distributed group has a private value from a fixed set consisting of, say, two elements, and the goal is for…
Deciding in an efficient way weak probabilistic bisimulation in the context of Probabilistic Automata is an open problem for about a decade. In this work we close this problem by proposing a procedure that checks in polynomial time the…
We study the popular distributed consensus method over networks composed of a number of densely connected clusters with a sparse connection between them. In these cluster networks, the method often constitutes two-time-scale dynamics, where…
In this paper, we provide a theoretical analysis for nonlinear discontinuous consensus protocols in networks of multiagents over weighted directed graphs. By integrating the analytic tools from nonsmooth stability analysis and graph theory,…
The consensus problem, briefly stated, consists of having processes in an asynchronous distributed system agree on a value. It is widely known that the consensus problem does not have a deterministic solution that ensures both termination…
Reducing the conditions under which a given set satisfies the stipulations of the subset sum proposition to a set of linear relationships, the question of whether a set satisfies subset sum may be answered in a polynomial number of steps by…
We consider finite and infinite-dimensional first-order consensus systems with timeconstant interaction coefficients. For symmetric coefficients, convergence to consensus is classically established by proving, for instance, that the usual…
We consider the average-consensus problem in a multi-node network of finite size. Communication between nodes is modeled by a sequence of directed signals with arbitrary communication delays. Four distributed algorithms that achieve…
In this paper we analyze the use of Chebyshev polynomials in distributed consensus applications. We study the properties of these polynomials to propose a distributed algorithm that reaches the consensus in a fast way. The algorithm is…
A set of stochastic matrices ${\cal P}$ is a consensus set if for every sequence of matrices $P(1), P(2), \ldots$ whose elements belong to ${\cal P}$ and every initial state $x(0)$, the sequence of states defined by $x(t) = P(t) P(t-1)…
Motivated by applications in machine learning and statistics, we study distributed optimization problems over a network of processors, where the goal is to optimize a global objective composed of a sum of local functions. In these problems,…
This paper considers a resilient high-dimensional constrained consensus problem and studies a resilient distributed algorithm for complete graphs. For convex constrained sets with a singleton intersection, a sufficient condition on…
This paper studies problems on locally stopping distributed consensus algorithms over networks where each node updates its state by interacting with its neighbors and decides by itself whether certain level of agreement has been achieved…
This paper investigates the consensus problem in almost sure sense for uncertain multi-agent systems with noises and fixed topology. By combining the tools of stochastic analysis, algebraic graph theory, and matrix theory, we analyze the…
We analyze a class of distributed quantized consen- sus algorithms for arbitrary networks. In the initial setting, each node in the network has an integer value. Nodes exchange their current estimate of the mean value in the network, and…