Fully Distributed Event-Driven Adaptive Consensus of Unknown Linear Systems

This article considers the consensus problem of unknown linear multiagent systems (MASs) through adaptive event-driven control in leader-follower and leaderless networks. The proposed event-driven algorithms do not involve any global information related to the network communication structure and rely only on local information exchange to achieve consensus on MASs and are therefore fully distributed. Furthermore, the constraint of continuous communication among the agents is eliminated in terms of control law updates and triggering state monitoring. Another desirable aspect of this article is that the design process of the control algorithms is independent of the parameters of each agent's dynamics and thus does not require precise information about the dynamics of MASs. We further exclude the Zeno behavior of each agent by proving the existence of a strict positive lower bound between any two adjacent events. Finally, the effectiveness of the proposed adaptive event-driven algorithms is verified by a simulation example.

Automated summary

This article considers the consensus problem of unknown linear multiagent systems (MASs) through adaptive event-driven control in both leader-follower and leaderless networks. The proposed event-driven algorithms are fully distributed and do not require any global information related to the network structure. They achieve consensus by only relying on local information exchange. Unlike other algorithms, the control algorithms in this article are not dependent on the dynamics parameters of each agent and therefore do not require precise information about the MAS dynamics. The article also proves the existence of a strict positive lower bound between any two adjacent events, effectively excluding the possibility of Zeno behavior for each agent. The effectiveness of the proposed algorithms is further demonstrated through a simulation example.