State Synchronization Of Multi-agent Systems Research Articles

Scale-free collaborative protocol design for state synchronization of multi-agent systems in presence of unknown nonuniform and arbitrarily large communication delays

In this paper, we study state synchronization problem for homogeneous networks of multi-agent systems subject to unknown, nonuniform and arbitrarily large communication delays. A scale-free design framework utilizing localized information exchange has been adopted. The protocol design is solely based on agent models such that we do not need any information about the communication networks and the number of agents. Moreover, the necessary and sufficient solvability conditions are established.

Scale-free collaborative protocol design for state and regulated state synchronization of multi-agent systems with arbitrary fast convergence

In this paper, we design scale-free collaborative protocols for state and regulated state synchronization of homogeneous multi-agent systems (MAS) with arbitrary fast convergence. The protocol design solely depends on the knowledge of the agents’ model and does not require any information about the communication network and the number of agents. Moreover, our protocols can achieve synchronization with any desired convergence rate by simply tuning a design parameter.

Regulated State Synchronization of Homogeneous Discrete-Time Multi-Agent Systems via Partial State Coupling in Presence of Unknown Communication Delays

This paper studies regulated state synchronization for homogeneous discrete-time multi-agent systems (MAS) in the presence of unknown nonuniform communication delays. We consider partial state coupling, i.e., agents are coupled through part of their states. A low gain-based protocol is designed which only requires rough knowledge of the communication network, such that the state synchronization for MAS is achieved where the required synchronized trajectory is only given to some of the agents.

State synchronization of multi-agent systems via static or adaptive nonlinear dynamic protocols

This paper studies state synchronization of homogeneous multi-agent systems (MAS) with partial-state coupling. We identify four classes of agents, for which static linear protocol can be designed. They are agents which are squared-down passive, squared-down passifiable via output feedback, squared-down passifiable via input feedforward and squared-down minimum-phase with relative degree 1. We find that, for agents which are squared-down passive, the static protocol does not need any network information, as long as the network graph contains a directed spanning tree. For the other three classes of agents, the static protocol needs rough information on the network graph, that is either a lower bound for the real part or an upper bound for the modulus of the non-zero eigenvalues of the Laplacian matrix associated with the network graph. However, when adaptive nonlinear dynamic protocols are utilized, even this rough information about the network can be dispensed with.

Solvability conditions and design for state synchronization of multi-agent systems

This paper derives conditions on the agents for the existence of a protocol which achieves synchronization of homogeneous multi-agent systems (MAS) with partial-state coupling, where the communication network is directed and weighted. These solvability conditions are necessary and sufficient for single-input agents and sufficient for multi-input agents. The solvability conditions reveal that the synchronization problem is primarily solvable for two classes of agents. This first class consists of at most weakly unstable agents (i.e. agents have all eigenvalues in the closed left half plane) and the second class consists of at most weakly non-minimum-phase agents (i.e. agents have all zeros in the closed left half plane). Under our solvability condition, we provide in this paper a design, utilizing H∞ optimal control.

Distributed static output-feedback control for state synchronization in networks of identical LTI systems

This paper studies state synchronization of multi-agent systems with disturbances using distributed static output-feedback (OPFB) control. The bounded L2 gain synchronization problem using distributed static OPFB is defined and solved. The availability of only output measurements restricts the local controls design, while the communication graph topology restricts global information flow among the agents. It is shown here that these two types of restriction can be dealt with in a symmetric manner and lead to two similar conditions guaranteeing the existence of bounded L2 gain static OPFB. One condition is on the output measurement matrix on a local scale, and the other on the graph Laplacian matrix on a global scale. Under additional conditions a distributed two-player zero-sum game using static OPFB is also solved and leads to distributed Nash equilibrium on the communication graph. As a special case the static OPFB globally optimal control is given. A new class of digraphs satisfying the above condition on the graph Laplacian is studied. The synchronizing region for distributed static OPFB control is exposed and found to be conical, different than the infinite right-half plane synchronizing region for distributed state feedback.