Search

In this article, we investigate the distributed adaptive consensus problem of parabolic partial differential equation (PDE) agents by output feedback on undirected communication networks, in which two cases of no leader and leader–follower with a leader are taken into account. For the leaderless case, a novel distributed adaptive protocol, namely, the vertex-based protocol, is designed to achieve consensus by taking advantage of the relative output information of itself and its neighbors for any given undirected connected communication graph. For the case of leader–follower, a distributed continuous adaptive controller is put forward to converge the tracking error to a bounded domain by using the Lyapunov function, graph theory, and PDE theory. Furthermore, a corollary that the tracking error tends to zero by replacing the continuous controller with the discontinuous controller is given. Finally, the relevant simulation results are further demonstrated to demonstrate the theoretical results obtained. [ABSTRACT FROM AUTHOR]

This article mainly solves the consensus issue of parabolic partial differential equation (PDE) agents with switching topology by output feedback. A novel edge-based adaptive control protocol is designed to reach consensus under the condition that the switching graphs are always connected at any switching instants. Different from the existing adaptive protocol associated with partial differential dynamics, the proposed adaptive observer-type law relies on the relative output information rather than relative state information. A proper Lyapunov functional is constructed and some important lemmas are used, then a sufficient condition is obtained for the consensus of parabolic PDE agents on switching graphs. Besides, a corollary about the distributed adaptive consensus of parabolic PDE agents on fixed undirected communication networks is given. Finally, the theoretical results are demonstrated by two numerical simulations. [ABSTRACT FROM AUTHOR]

This article studies the consensus of hybrid second-order multiagent systems (MASs), where the hybrid MAS is constituted by the continuous-time second-order (CTSO) and discrete-time second-order (DTSO) dynamic agents. First, a hybrid consensus algorithm is proposed, where a sample-data control is considered in the CTSO subsystems. Under the proposed hybrid consensus algorithm, the convergence of the hybrid second-order MAS matrix is analyzed. Second, a sufficient and necessary condition is proposed, which indicates that the controller parameters, such as coupling gains and the sampling interval, and eigenvalues of network topology have a significant impact on the system consensus. Finally, several simulation examples are presented to prove the validity of the results. [ABSTRACT FROM AUTHOR]

This paper studies the consensus in fractional-order multiagent systems over directed graph via sampled-data control method. A distributed control protocol using the sampled position and velocity data is designed. By virtue of the Mittag-Leffler function, Laplace transform, and matrix theory, some necessary and sufficient conditions associated with the sampling period, the fractional order, the coupling strengths, and the network structure to obtain consensus of the systems are obtained. Then, some detailed discussions are presented about how to select the sampling period and how to design the coupling strengths to attain the consensus of the systems, respectively. Lastly, some numerical simulation results are illustrated to reflect the availability of the theoretical analysis. [ABSTRACT FROM AUTHOR]

In this article, the consensus problem for the delayed fractional-order multiagent system (FOMAS) under directed graph is addressed by intermittent sampled-data control. First, an intermittent sampled-data control protocol with input time delay is proposed. By virtue of Laplace transform and stability theory, some necessary and sufficient conditions depending on the order, input time delay, sampling period, communication width, coupling strengths, and network structure are presented for the delayed FOMASs to reach consensus. Moreover, due to the relationship about the input time delay, communication width, and sampling period, four cases are carefully discussed to find that the sampling period has bounds for a given network with known input time delay and communication width to obtain consensus. Finally, some simulation examples are shown to verify the theoretical results. [ABSTRACT FROM AUTHOR]