Fast Convergence in Consensus Control of Leader-Follower Multi-Agent Systems

In this thesis, different distributed consensus control strategies are introduced for a multi-agent network with a leader-follower structure. The proposed strategies are based on the nearest neighbor rule, and are shown to reach consensus faster than conventional methods. Matrix equations are given to obtain equilibrium state of the network based on which the average-based control input is defined accordingly. Two network control rules are subsequently developed, where in one of them the control input is only applied to the leader, and in the other one it is applied to the leader and its neighbors. The results are then extended to the case of a time-varying network with switching topology and a relatively large number of agents. The convergence performance under the proposed strategies in the case of a time-invariant network with fixed topology is evaluated based on the location of the dominant eigenvalue of the closed-loop system. For the case of a time-varying network with switching topology, on the other hand, the state transition matrix of the system is investigated to analyze the stability of the proposed strategies. Finally, the input saturation in agents' dynamics is considered and the stability of the network under the proposed methods in the presence of saturation is studied

Similarity Decomposition Approach to Oscillatory Synchronization for Multiple Mechanical Systems With a Virtual Leader

This paper addresses the oscillatory synchronization problem for multiple uncertain mechanical systems with a virtual leader, and the interaction topology among them is assumed to contain a directed spanning tree. We propose an adaptive control scheme to achieve the goal of oscillatory synchronization. Using the similarity decomposition approach, we show that the position and velocity synchronization errors between each mechanical system (or follower) and the virtual leader converge to zero. The performance of the proposed adaptive scheme is shown by numerical simulation results.Comment: 15 pages, 3 figures, published in 2014 Chinese Control Conferenc

Ultrafast Consensus in Small-World Networks

In this paper, we demonstrate a phase transition phenomenon in algebraic connectivity of small-world networks. Algebraic connectivity of a graph is the second smallest eigenvalue of its Laplacian matrix and a measure of speed of solving consensus problems in networks. We demonstrate that it is possible to dramatically increase the algebraic connectivity of a regular complex network by 1000 times or more without adding new links or nodes to the network. This implies that a consensus problem can be solved incredibly fast on certain small-world networks giving rise to a network design algorithm for ultra fast information networks. Our study relies on a procedure called "random rewiring" due to Watts & Strogatz (Nature, 1998). Extensive numerical results are provided to support our claims and conjectures. We prove that the mean of the bulk Laplacian spectrum of a complex network remains invariant under random rewiring. The same property only asymptotically holds for scale-free networks. A relationship between increasing the algebraic connectivity of complex networks and robustness to link and node failures is also shown. This is an alternative approach to the use of percolation theory for analysis of network robustness. We also show some connections between our conjectures and certain open problems in the theory of random matrices