Designing Fully Distributed Consensus Protocols for Linear Multi-agent Systems with Directed Graphs

This paper addresses the distributed consensus protocol design problem for multi-agent systems with general linear dynamics and directed communication graphs. Existing works usually design consensus protocols using the smallest real part of the nonzero eigenvalues of the Laplacian matrix associated with the communication graph, which however is global information. In this paper, based on only the agent dynamics and the relative states of neighboring agents, a distributed adaptive consensus protocol is designed to achieve leader-follower consensus for any communication graph containing a directed spanning tree with the leader as the root node. The proposed adaptive protocol is independent of any global information of the communication graph and thereby is fully distributed. Extensions to the case with multiple leaders are further studied.Comment: 16 page, 3 figures. To appear in IEEE Transactions on Automatic Contro

Fully distributed consensus for high-order strict-feedback nonlinear multiagent systems with switched topologies

summary:This paper studies the distributed consensus problem of high-order strict-feedback nonlinear multiagent systems. By employing the adaptive backstepping technique and switched system theory, a novel protocol is proposed for MASs with switched topologies. Global information such as the number of agents and communication topology is not used. In addition, the communication topology between agents can be switched between possible topologies at any time. Based on the Lyapunov function method, the proposed adaptive protocol guarantees the complete consensus of multiagent systems without restricting the dwell time of the switched signal. Finally, two numerical examples are provided to illustrate the effectiveness and advantages of the given protocol