Fully Distributed Event-Triggered Protocols for Linear Multi-Agent Networks
It solves the consensus problem for multi-agent systems with a fully distributed, scalable approach that removes reliance on global graph information, benefiting networked control applications.
This paper designs fully distributed adaptive event-triggered protocols for leaderless and leader-follower consensus in linear multi-agent networks, ensuring consensus without Zeno behavior and eliminating the need for global network information or continuous communication.
This paper considers the distributed event-triggered consensus problem for general linear multi-agent networks. Both the leaderless and leader-follower consensus problems are considered. Based on the local sampled state or local output information, distributed adaptive event-triggered protocols are designed, which can ensure that consensus of the agents is achieved and the Zeno behavior is excluded by showing that the interval between any two triggering events is lower bounded by a strictly positive value. Compared to the previous related works, our main contribution is that the proposed adaptive event-based protocols are fully distributed and scalable, which do not rely on any global information of the network graph and are independent of the network's scale. In these event-based protocols, continuous communications are not required for either control laws updating or triggering functions monitoring.