Fault-tolerant properties of scale-free linear protocols for synchronization of homogeneous multi-agent systems

TL;DR

This article establishes that the network decomposes into a number of basic bicomponents that achieves synchronization among all nodes in this basic bicomponent.

Abstract

Originally, protocols were designed for multi-agent systems (MAS) using information about the network which might not be available. Recently, there has been a focus on scale-free synchronization where the protocol is designed without any prior information about the network. As long as the network contains a directed spanning tree, a scale-free protocol guarantees that the network achieves synchronization. If there is no directed spanning tree then synchronization cannot be achieved. But what happens when these scale-free protocols are applied to such a network where the directed spanning tree no longer exists? This paper establishes that the network decomposes into a number of basic bicomponents which achieves synchronization among all nodes in this basic bicomponent. On the other hand, nodes which are not part of any basic bicomponent converge to a weighted average of the synchronized trajectories of the basic bicomponents. The weights are independent of the initial conditions and are independent of the designed protocol.

Figures (9)

• Figure 1: A directed communication network and its bicomponents.
• Figure 2: The 60-nodes communication network with spanning tree.
• Figure 3: The communication network without spanning tree. The links are broken due to faults.
• Figure 4: 30-node basic bicomponent for continuous-time MAS: disagreement dynamic among the agents and synchronized output trajectories.
• Figure 5: 8-node basic bicomponent for continuous-time MAS: disagreement dynamic among the agents and synchronized output trajectories.

Theorems & Definitions (12)

• Definition 1
• Theorem 1
• Theorem 2
• Remark 1
• Theorem 3
• Theorem 4
• Theorem 5
• Theorem 6
• Remark 2
• Theorem 7