Bin Cheng

In this paper, we address the distributed consensus problem of multiple Lur’e systems over directed graphs with limited frequencies of communication and control updating. A distributed adaptive event-based protocol is proposed to guarantee that consensus is achieved, which is fully distributed and independent of any global information. Moreover, the designed scheme does not rely on continuous relative information among neighboring agents and each agent is not required to update the controller continuously. Finally, simulation examples are presented to show the effectiveness of the theoretical results.

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 protocols, relying on no global knowledge of the network topology and independent of switching rules, can be devised and utilized in a completely distributed manner. They are able to avoid continuous information exchanges for either controllers' updating or triggering functions' monitoring, which ensures the feasibility of the presented protocols.

This brief considers the distributed output regulation problem of multiple heterogeneous agents in the presence of an exosystem and constrained with limited communication bandwidth. To estimate the exosystem, we devise adaptive edge-based event-triggered dynamic observers for all followers. Then, we devise both distributed state feedback control inputs and output feedback inputs to guarantee that the regulated output asymptotically converges to zero. The presented protocols composed of distributed observers and local control inputs are completely distributed and can reduce the communication frequency.

This paper investigates the cooperative tracking control problem of multiagent systems where each agent is described as a Lur'e system. We first consider the case where the leader's control input is zero and design a distributed adaptive event-triggered protocol for the followers to track the leader. We then deal with the general case where the leader contains a bounded control input by proposing a novel event-based protocol, including a nonlinear term to restrain the effect of the leader's input. Both of the proposed event-triggered protocols can guarantee the uniform ultimate boundedness of the tracking error and the adaptive gains without the requirement of any global information of the network. The relationship between the upper bound of the tracking error and the controller parameters is explicitly derived.

This paper considers the formation control problem for general linear networked agents constrained with event-triggered communications. We propose four kinds of edge-based event-triggered protocols, each of which can be used to achieve given formation structures and eliminate the unexpected Zeno behavior. Since the whole protocols are designed according to sampled information at event instants rather than real-time information, these protocols efficiently avoid continuous communications, reduce the bandwidth need of communication, and decrease the energy consuming. The distributed static state feedback edge-based event-triggered protocol or the adaptive one is applicable for the occasions with available states. Different from the state feedback protocols, users can choose the distributed static output feedback edge-based event-triggered protocol or the adaptive one no matter whether agents' states are available or not. It is worth emphasizing that the adaptive state (or output) feedback event-triggered protocol requires no global information of the network topology and can be used in a fully distributed and scalable manner. Finally, numerical examples on formation control are offered to testify the feasibility of the proposed protocols.

This paper considers the distributed event-triggered consensus control problem for a network of linear systems subject to bounded uncertainties satisfying the matching condition. Due to the existence of nonidentical uncertainties, the multiagent system studied in this paper is essentially heterogeneous, and the event-triggered consensus problem of which is much more challenging than that of homogeneous linear networks in the existing works. We propose a static nonsmooth event-triggered protocol that includes a nonlinear term to ensure that consensus is achieved and the Zeno behavior is excluded. To avoid the undesirable chattering effect caused by the nonsmooth protocol, we design a static continuous event-based protocol, which can guarantee that the consensus error is ultimately bounded and the upper bound of the consensus error can be made satisfactorily small by choosing properly the design parameters. We also design a continuous adaptive event-triggered protocol that includes time-varying weights into both the control law and the triggering function. Contrary to the event-triggered protocols in the previous related works, the adaptive event-based protocol is fully distributed and scalable, whose design does not require any global information of the network graph. Besides, all the event-triggered protocols in this paper do not need continuous communications among neighboring agents in either control laws' updating or triggering conditions' monitoring.

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 networks scale. In these event-based protocols, continuous communications are not required for either control laws updating or triggering functions monitoring.