Quantum mechanics

Spectral radius

Algorithm

Network topology

Multi-agent system

Materials science

Containment (computer programming)

Eigenvalues and eigenvectors

Component (thermodynamics)

Computer science

Distributed computing

Computer network

Matrix (chemical analysis)

Thermodynamics

Physics

Mathematics

Asynchronous communication

Artificial intelligence

Geometry

Composite material

Combinatorics

Programming language

Convex hull

Topology (electrical circuits)

Regular polygon

State (computer science)

IEEE Transactions on Cybernetics

In this contribution, we propose and investigate the containment control issue for general linear multiagent systems (MASs) under the asynchronous setting, where the network topology is not subjected to any structural restrictions and the roles of the leaders and the followers are entirely determined by the network topology. It is assumed that the interaction time instants of each agent, at which this agent interacts with its neighbors, are independent of the other agents' and can be unevenly distributed. An asynchronous distributed algorithm is proposed to implement the control strategy of linear MASs. The non-negative matrix theory and the composition of binary relations are utilized to handle the asynchronous containment control issue. It is shown that the leaders in each closed and strongly connected component of the network topology will reach a common state and the followers will gradually enter the dynamic convex hull constructed by the leaders. Moreover, it is also proved that the system matrix can be strictly unstable, and the upper bound of the system matrix's spectral radius is explicitly stated. Finally, two simulation examples are also provided to verify the efficacy of our theoretical results.

Containment Control of Asynchronous Discrete-Time General Linear Multiagent Systems With Arbitrary Network Topology