Related papers: REDCHO: Robust Exact Dynamic Consensus of High Ord…
In this paper, we consider finite-time state agreement problems for continuous-time multi-agent systems and propose two protocols, which ensure that states of agents reach an agreement in a finite time. Moreover, the second protocol solves…
This paper presents a finite-time heterogeneous cyclic pursuit scheme that ensures consensus among agents modelled as integrators. It is shown that for the proposed sliding mode control, even when the gains corresponding to each agent are…
In this paper, we develop a novel dynamic distributed optimal safe consensus protocol to simultaneously achieve safety requirements and output optimal consensus. Specifically, we construct a distributed projection optimization algorithm…
We study the problem of resilient consensus of sampled-data multi-agent networks with double-integrator dynamics. The term resilient points to algorithms considering the presence of attacks by faulty/malicious agents in the network. Each…
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…
We consider continuous-time consensus systems whose interactions satisfy a form or reciprocity that is not instantaneous, but happens over time. We show that these systems have certain desirable properties: They always converge…
Distributed sensor networks have gained interest thanks to the developments in processing power and communications. Event-triggering mechanisms can be useful in reducing communication between the nodes of the network, while still ensuring…
This paper addresses the finite-time non-overshooting leader-following consensus problem for multi-agent systems, whose agents are modeled by a dynamical system topologically equivalent to the integrator chain. Based on the weighted…
In this note, we discuss the problem of consensus finding in communication networks of agents with dynamically switching topologies. In particular, we consider the case of directed networks with unbalanced matrices of communication rates.…
We propose a new dynamic average consensus algorithm that is robust to information-sharing noise arising from differential-privacy design. Not only is dynamic average consensus widely used in cooperative control and distributed tracking, it…
This paper studies the robustness of a dynamic average consensus algorithm to communication delay over strongly connected and weight-balanced (SCWB) digraphs. Under delay-free communication, the algorithm of interest achieves a practical…
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…
The paper proposes an intermittent communication mechanism for the tracking consensus of high-order nonlinear multi-agent systems (MASs) surrounded by random disturbances. Each collaborating agent is described by a class of high-order…
This paper investigates the problem of securing exponentially fast consensus (exponential consensus for short) for identical agents with finite-dimensional linear system dynamics over dynamic network topology. Our aim is to find the weakest…
In this paper, we address the discrete-time average consensus problem in strongly connected directed graphs, where nodes exchange information over unreliable error-prone communication links. We enhance the Robustified Ratio Consensus…
The leader-following consensus problem for general linear multi-agent systems over jointly connected switching networks has been a challenging problem and the solvability of the problem has been limited to the class of linear multi-agent…
The emergence of large-scale multi-agent systems has led to controller synthesis methods for sparse communication between agents. However, most sparse controller synthesis algorithms remain centralized, requiring information exchange and…
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 article provides an introduction to event-triggered coordination for multi-agent average consensus. We provide a comprehensive account of the motivations behind the use of event-triggered strategies for consensus, the methods for…
We investigate convergence properties of a proposed distributed model predictive control (DMPC) scheme, where agents negotiate to compute an optimal consensus point using an incremental subgradient method based on primal decomposition as…