Search

This paper investigates the adaptive consensus with limited information for a class of uncertain nonlinear multi-agent systems (MASs). The limited information, meaning the incomplete information transmitted between agents, stems from nonzero-kernel weight matrices of communication networks, which deserves concerns owing to its practical interest such as in privacy preserving and information compression. Apart from the limited/incomplete information, the paper considers nonlinear MASs with large uncertainties (without known upper bounds). This is essentially different from the existing results of linear systems and poses challenges for the design and analysis of adaptive consensus. As for fully distributed protocol design, dynamic high gains are introduced to compensate for the system uncertainties and for the unavailable global graph information. In closed-loop consensus analysis, a new Lyapunov function is constructed by utilising weight and incidence matrices instead of Laplacian matrix. It turns out that the designed protocol can guarantee the boundedness of closed-loop MASs signals and the convergent consensus. Two numerical examples are given to demonstrate the effectiveness of the proposed control scheme. [ABSTRACT FROM AUTHOR]

Communication network could suffer uncertainties originating from link faults and network attacks. This situation, in multi-agent systems, can be featured by unknown weights of network topology. To impair the influence of the uncertain topology, typical compensation should be taken into account in distributed protocols to the workability of multi-agent systems. This paper, in the context of uncertain topology, addresses finite-time leader-following consensus for second-order uncertain nonlinear multi-agent systems. In addition to uncertainties in topology, the systems also allow unknown control coefficients, which together with the unknown weights renders the realisation of finite-time leader-following consensus nontrivial. Specifically, a fully distributed protocol based on distributed finite-time observer is designed via integrating the adaptive compensation scheme. Notably, in the designed protocol, dynamic high gains are introduced for the compensations of the network uncertainties and agents uncertainties. It turns out that the designed fully distributed protocol guarantees the global finite-time leader-following consensus. Simulation examples are provided to illustrate the validity of the proposed approach. [ABSTRACT FROM AUTHOR]