Search

This study investigates the sampled-data containment control problem for linear multi-agent systems with multiple leaders under undirected or directed network topology. First, by means of the decomposition method, the containment control problem is transformed into the simultaneous stability analysis issue of certain subsystems. Then, the solution of a class of differential equations, which plays a key role for the addressed problem, is exploited by using the contradiction method. Together with a novel Lyapunov function, sufficient conditions are established to guarantee that all the followers move into the convex hull spanned by the leaders. The proposed results are dependent on the information of the system dynamics, the coupling strength as well as the eigenvalues of topology matrix. Furthermore, the established results are specialised to both the leader--following case and the traditional consensus case. Finally, simulations are given to illustrate the theoretical results derived in this study. [ABSTRACT FROM AUTHOR]

In this study, the stochastic sampled-data approach is developed to deal with the H∞ control problem for a class of linear multi-agent systems. For each agent, signals should be transmitted to the control input, including not only its own measurements, but also the output information received from the neighbour agents. The relationships of information communications between the whole multi-agents are totally reflected by a weighted directed graph with a fixed topology structure. To the addressed problem, the author's focus is to design an output feedback controller for each agent such that, for the external energy bounded disturbances, the exponential stability in the mean square sense and interference rejection ability under consideration can be guaranteed. By assuming that the sampling period of each agent switches between two values in a probabilistic way, the stochastic sampling phenomenon is well characterised in every sampling tasks. In virtue of Lyapunov theory and semi-definite programming method, sufficient conditions are derived to ensure the exponential stability as well as H∞ performance, and the feedback controllers are also designed by solving some certain matrix inequalities. Finally, a numerical simulation is given to demonstrate the validness of the proposed control strategy. [ABSTRACT FROM AUTHOR]

This paper is concernedwith the leader-following consensus probleminmean-square for a class of discrete-timemultiagent systems. The multiagent systems under consideration are the directed and contain arbitrary discrete time-delays. The communication links are assumed to be time-varying and stochastic. It is also assumed that some agents in the network are well informed and act as leaders, and the others are followers. By introducing novel Lyapunov functionals and employing some new analytical techniques, sufficient conditions are derived to guarantee the leader-following consensus inmean-square for the concernedmultiagent systems, so that all the agents are steered to an anticipated state target. A numerical example is presented to illustrate the main results. [ABSTRACT FROM AUTHOR]

An introduction is presented in which the editors discuss reports within the issue, including "Second-Order Consensus for Multi-Agent Systems Under Directed and Switching Topologies," "Energy-Aware Topology Evolution Model With Link and Node Deletion in Wireless Sensor Networks," and "Geometric Buildup Algorithms for Sensor Network Localization."