Distributed event-triggered control for global consensus of multi-agent systems with input saturation

Abstract

We consider the global consensus problem for multi-agent systems with input saturation over digraphs. Under a mild connectivity condition that the underlying digraph has a directed spanning tree, we use Lyapunov methods to show that the widely used distributed consensus protocol, which solves the consensus problem for the case without input saturation constraints, also solves the global consensus problem for the case with input saturation constraints. In order to reduce the overall need of communication and system updates, we then propose a distributed event-triggered control law. Global consensus is still realized and Zeno behavior is excluded. Numerical simulations are provided to illustrate the effectiveness of the theoretical results.

Event-triggered output consensus for linear multi-agent systems via adaptive distributed observer

“…Therefore, Zeno behavior is excluded. The exclusion of Zeno behavior can also be proved by contradiction (see [39] for an example). This completes the proof.…”

Secure and transparent audit logs with BlockAudit

“…An illustration of the blockchain data structure is provided in Figure 2. Transaction ordering using blockchain is enabled by multi-party consensus schemes [41,42]. Popular among these schemes are the proof-of-work, proof-of-stake, and practical Byzantine Fault Tolerance [39,43].…”

Event-Triggered Control for Consensus of Multi-Agent Systems with Nonlinear Output and Directed Topologies

“…The following mathematical methods are inspired by [23,24]. By proper permutation, we rewrite L as the following Perron-Frobenius form:…”