The paper proposes a distributed eventtriggered consensus approach for linear multi-agent systems with guarantees over rate of convergence, resilience to control gain uncertainties, and Pareto optimality of design parameters, namely, the event-triggering threshold (ET) and control gain. The event-triggered consensus problem is first converted to stability problem of an equivalent system. The Lyapunov stability theorem is then used to incorporate the performance constraints with the event-triggered consensus. Using an approximated linear scalarization method, the ET and the control gain are designed simultaneously by solving a convex constrained optimization problem. Followed by some preliminary steps, the optimization can be performed locally, i.e., no global information is required. The effectiveness of the proposed approach is studied through simulations for an experimental multi-agent system.
This paper studies the optimal output consensus problem for a group of heterogeneous linear multi-agent systems. Different from existing results, we aim at effective controllers for these high-order agents under both event-triggered control and event-triggered communication settings. We conduct an embedded design for the problem and constructively propose a multi-rate event-triggered controller with a set of applicable parameters. The proposed event-triggered rules are shown to be free of Zeno behaviors and can achieve the optimal output consensus goal for these high-order agents. A simulation…
This paper investigates the communication strategy for second-order multi-agent systems with nonlinear dynamics. To save the scarce resources of communication channels, a novel event-triggered communication mechanism is designed without using continuous signals among the followers. To get rid of the centralized information depending on the spectrum of the Laplacian matrix, a consensus protocol with updated coupling gains and an event-triggered strategy of interagent communication with updated thresholds are presented. To minimize the impacts of noise, only relative positions among agents are e…
The paper considers the problem of multi-agent consensus in the presence of adversarial agents which may try to prevent and introduce undesired influence on the coordination among the regular agents. To our setting, we extend the so-called mean subsequence reduced algorithms with the aim to reduce the amount of communication via two measures: The agents exchange information in the form of ternary data at each transmission and moreover keep the frequency of data exchange low by employing self- and event-triggered communication. We will observe that in hostile environments with adversaries, the …
It is well known that the employed triggering scheme has great impact on the control performance when control loops operate under scarce communication resources. Various practical and simulative works have demonstrated the potential of event-triggered control to reduce communication while providing a similar performance level when compared to time-triggered control. For non-cooperative networked control systems, analytical performance comparisons of time- and event-triggered control support this finding under certain assumptions. While being well-studied in the non-cooperative setting, it rema…
This work presents a rigorous analysis of the adverse effects of cyber-physical attacks on the performance of multi-agent consensus with event-triggered control protocols. It is shown how a strategic malicious attack on sensors and actuators can deceive the triggering condition of both state-based event-triggered mechanism and combinational state-based event-triggered mechanism, which are commonplace and widely used in the literature. More precisely, it is first shown that a deception attack in the case of combinational state-based event-triggered mechanism can result in a non-triggering misbe…
The ubiquitous interdependencies among higher-dimensional states of neighboring agents can be characterized by matrix-weighted networks. This paper examines event-triggered global consensus of matrix-weighted networks subject to actuator saturation. Specifically, a distributed dynamic event-triggered coordination strategy, whose design involves sampled state of agents, saturation constraint and auxiliary systems, is proposed for this category of generalized network to guarantee its global consensus. Under the proposed event-triggered coordination strategy, sufficient conditions are derived to …
We study the distributed average consensus problem in multi-agent systems with directed communication links that are subject to quantized information flow. The goal of distributed average consensus is for the nodes, each associated with some initial value, to obtain the average (or some value close to the average) of these initial values. In this paper, we present and analyze a distributed averaging algorithm which operates exclusively with quantized values (specifically, the information stored, processed and exchanged between neighboring agents is subject to deterministic uniform quantization…
This paper examines the event-triggered consensus of the multi-agent system on matrix-weighted networks, where the interdependencies among higher-dimensional states of neighboring agents are characterized by matrix-weighted edges in the network. Specifically, a novel distributed dynamic event-triggered coordination strategy is proposed for this category of generalized networks, in which an auxiliary system is employed for each agent to dynamically adjust the triggering threshold, which plays an essential role in guaranteeing that the triggering time sequence does not exhibit Zeno behavior. Dis…
We study the distributed average consensus problem in multi-agent systems with directed communication links that are subject to quantized information flow. The goal of distributed average consensus is for the nodes, each associated with some initial value, to obtain the average (or some value close to the average) of these initial values. In this paper, we present and analyze novel distributed averaging algorithms which operate exclusively on quantized values (specifically, the information stored, processed and exchanged between neighboring agents is subject to deterministic uniform quantizati…
Event-triggered consensus of multi-agent systems under directed topology based on periodic sampled-data
School of Mathematics and Statistics, Qingdao University（青岛大学数学与统计学院）；College of Automation and Electrical Engineering, Qingdao University（青岛大学自动化与电气工程学院）；School of Control Science and Engineering, Shandong University（山东大学控制科学与工程学院）
This paper investigates the distributed event-based consensus problem of switching networks satisfying the jointly connected condition. Both the state consensus of homogeneous linear networks and output consensus of heterogeneous networks are studied. Two kinds of event-based protocols based on local sampled information are designed, without the need to solve any matrix equation or inequality. Theoretical analysis indicates that the proposed event-based protocols guarantee the achievement of consensus and the exclusion of Zeno behaviors for jointly connected undirected switching graphs. These …
In this paper, we consider the problem of privacy preservation in the average consensus problem when communication among nodes is quantized. More specifically, we consider a setting where some nodes in the network are curious but not malicious and they try to identify the initial states of other nodes based on the data they receive during their operation (without interfering in the computation in any other way), while some nodes in the network want to ensure that their initial states cannot be inferred exactly by the curious nodes. We propose two privacy-preserving event-triggered quantized av…
Fully Distributed Event-Triggered Protocols for Linear Multi-Agent Networks
State Key Laboratory for Turbulence and Complex Systems, Department of Mechanics and Engineering Science, College of Engineering, Peking University（北京大学工学院力学与工程科学系湍流国家重点实验室）
In this paper, we study the robustness of the event-triggered consensus algorithms against frequency-domain uncertainties. It is revealed that the sampling errors resulted by event triggering are essentially images of linear finite-gain $\mathcal{L}_2$-stable operators acting on the consensus errors of the sampled states and the event-triggered mechanism is equivalent to a negative feedback loop introduced additionally to the feedback system. In virtue of this, the robust consensus problem of the event-triggered network systems subject to additive dynamic uncertainties and network multiplicati…
Tongji University（同济大学）；Shanghai Research Institute for Intelligent Autonomous Systems（上海智能自主系统研究院）；Beijing Institute of Technology（北京理工大学）；Yangtze Delta Region Academy of Beijing Institute of Technology（北京理工大学长三角研究院）；Peking University（北京大学）
This paper studies the consensus control problem faced with three essential demands, namely, discrete control updating for each agent, discrete-time communications among neighboring agents, and the fully distributed fashion of the controller implementation without requiring any global information of the whole network topology. Noting that the existing related results only meeting one or two demands at most are essentially not applicable, in this paper we establish a novel framework to solve the problem of fully distributed consensus with discrete communication and control. The first key point …
Networked microgrids with high penetration of distributed generators have ubiquitous remote information exchange, which may be exposed to various cyber security threats. This paper, for the first time, addresses a consensus problem in terms of frequency synchronisation in networked microgrids subject to multi-layer denial of service (DoS) attacks, which could simultaneously affect communication, measurement and control actuation channels. A unified notion of Persistency-of-Data-Flow (PoDF) is proposed to characterise the data unavailability in different information network links, and further q…
Distributed Model Predictive Control for Optimal Consensus of Constrained Heterogeneous Multi-agent Systems
The Hong Kong University of Science and Technology（香港科技大学）；The University of Hong Kong（香港大学）；HKU Shenzhen Institute of Research and Innovation（香港大学深圳研究院创新）；Beihang University（北京航空航天大学）；Peking University（北京大学）
This note considers the constrained H-infinity consensus of multi-agent networks with nonidentical constraint sets. An improved distributed algorithm is adopted and a nonlinear controlled output function is defined to evaluate the effect of disturbances. Then, it is shown that the constrained H-infinity consensus can be achieved if some linear matrix inequality has positive solution.
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 feasibility redundancy and set regularity for reaching a desired consensus exponentially fast in the presence of Byzantine agents is derived, which can be directly applied to polyhedral sets. A necessary condition on feasibility redundancy for the resilient constrained consensus problem to be solvable is also provided.
This paper deals with solving distributed optimization problems with equality constraints by a class of uncertain nonlinear heterogeneous dynamic multi-agent systems. It is assumed that each agent with an uncertain dynamic model has limited information about the main problem and limited access to the information of the state variables of the other agents. A distributed algorithm that guarantees cooperative solving of the constrained optimization problem by the agents is proposed. Via this algorithm, the agents do not need to continuously broadcast their data. It is shown that the proposed algo…
This work shows an approach to achieve output consensus among heterogeneous agents in a multi-agent environment where each agent is subject to input constraints. The communication among agents is described by a time-varying directed/undirected graph. The approach is based on the well-known Internal Model Principle which uses an unstable reference system. One main contribution of this work is the characterization of the maximal constraint admissible invariant set (MCAI) for the combined agent-reference system. Typically, MCAI sets do not exist for unstable system. This work shows that for an im…
Distributed Kalman Filters with State Equality Constraints: Time-based and Event-triggered Communications
KTH Royal Institute of Technology（皇家理工学院）；Key Laboratory of Systems and Control, Academy of Mathematics and Systems Science, Chinese Academy of Sciences（中国科学院数学与系统科学研究院系统与控制重点实验室）；Rocket Force University of Engineering（火箭军工程大学）；Department of Electronic and Computer Engineering, Hong Kong University of Science and Technology（香港科技大学电子及计算机工程系）
