Search

In this paper, we study the consensus problem for second-order multi-agent systems with heterogeneous unknown inertias and control gains under a general directed graph. Unlike the existing consensus algorithms for second-order multi-agent systems in which all agents are assumed to have common unit inertias or share common control gains, we allow the inertias and the control gains to be heterogeneous and time-varying for each agent. We propose fully distributed consensus algorithms over a general directed graph when there exist, respectively, absolute velocity damping and relative velocity damping. Novel integral-type Lyapunov functions are proposed to study the consensus convergence. Moreover, the adaptive $\sigma$- modification schemes for the gain adaptation are proposed, which renders smaller control gains and thus requires smaller amplitude on the control input without sacrificing consensus convergence. Furthermore, we show that one proposed algorithm also works for consensus of agents with intrinsic Lipschitz nonlinear dynamics. The control gains are varying and updated by distributed adaptive laws. As a result, the proposed algorithms require no global information and thus can be implemented in a fully distributed manner. [ABSTRACT FROM AUTHOR]

This technical note 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 technical note, 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 in the presence of a leader with a zero input 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. [ABSTRACT FROM AUTHOR]