Related papers: Orientation and Connectivity Based Criteria for As…

The non-consensus problems of high order linear time-invariant dynamical homogeneous multi-agent systems are concerned. Based on the conditions of consensus achievement, the mechanisms that lead to non-consensus motions are analyzed.…

This paper presents a consensus algorithm under misaligned orientations, which is defined as (i) misalignment to global coordinate frame of local coordinate frames, (ii) biases in control direction or sensing direction, or (iii) misaligned…

We study the problems of asymptotic and approximate consensus in which agents have to get their values arbitrarily close to each others' inside the convex hull of initial values, either without or with an explicit decision by the agents. In…

This paper considers the consensusability of multi-agent systems with delay and packet dropout. By proposing a kind of predictor-like protocol, sufficient and necessary conditions are given for the mean-square consensusability in terms of…

A generalized family of Adversary Robust Consensus protocols is proposed and analyzed. These are distributed algorithms for multi-agents systems seeking to agree on a common value of a shared variable, even in the presence of faulty or…

In this paper, we study the leaderless consensus problem for multiple Lagrangian systems in the presence of parametric uncertainties and external disturbances under directed graphs. For achieving asymptotic behavior, a robust continuous…

Two finite-time consensus protocols are proposed for multi-dimensional multi-agent systems, using direction-preserving and component-wise signum controls respectively. Filippov solutions and non-smooth analysis techniques are adopted to…

In this article, we establish exponential contraction results for the diameter and variance of general first-order multiagent systems. Our approach is based on compactification techniques, and works under rather mild assumptions. Namely, we…

This note studies a network of agents having continuous-time dynamics with quantized interactions and time-varying directed topology. Due to the discontinuity of the dynamics, solutions of the resulting ODE system are intended in the sense…

Consensus planning is a method for coordinating decision making across complex systems and organizations, including complex supply chain optimization pipelines. It arises when large interdependent distributed agents (systems) share common…

The design of sensor networks capable of reaching a consensus on a globally optimal decision test, without the need for a fusion center, is a problem that has received considerable attention in the last years. Many consensus algorithms have…

This paper focuses on consensus problems for high-order, linear multi-agent systems. Undirected communication topologies and fixed, uniform communication time delay are taken into account. This class of problems has been widely study in the…

Results for estimating the convergence rate of non-stationary distributed consensus algorithms are provided, on the basis of qualitative (mainly topological) as well as basic quantitative information (lower-bounds on the matrix entries).…

This paper presents a decentralized algorithm for a team of agents to track time-varying fixed points that are the solutions to time-varying convex optimization problems. The algorithm is first-order, and it allows for total asynchrony in…

We consider the problem of solving consensus using deterministic algorithms in a synchronous dynamic network with unreliable, directional point-to-point links, which are under the control of a message adversary. In contrast to a large body…

This paper addresses the problem of positive consensus of directed multi-agent systems with observer-type output-feedback protocols. More specifically, directed graph is used to model the communication topology of the multi-agent system and…

This paper investigates a robust positive consensus problem for a class of heterogeneous high-order multi-agent systems subject to external inputs. Compared with existing multi-agent consensus results, the most distinct feature of the…

In this paper, we focus on the distributed quantized average consensus problem in open multi-agent systems consisting of communication links that change dynamically over time. Open multi-agent systems exhibiting the aforementioned…

In this paper, the communication effort required in a multi-agent system (MAS) is minimized via an explicit optimization formulation. The paper considers a MAS of single-integrator agents with bounded inputs and a time-invariant…

We introduce the problem of asymptotic subspace consensus, which requires the outputs of processes to converge onto a common subspace while remaining inside the convex hull of initial vectors.This is a relaxation of asymptotic consensus in…