Distributed finite-time consensus of nonlinear systems under switching topologies

Authors

    Authors

    Automatica

    Comments

    Authors: contact us about adding a copy of your work at STARS@ucf.edu

    Abbreviated Journal Title

    IEEE Trans. Smart Grid

    Keywords

    Information theory; Switching networks; Distributed control; Connectivity; Cooperative control; MULTIAGENT SYSTEMS; DYNAMICS; GRAPH; Automation & Control Systems; Engineering, Electrical & Electronic

    Abstract

    In this paper, the finite time consensus problem of distributed nonlinear systems is studied under the general setting of directed and switching topologies. Specifically, a contraction mapping argument is used to investigate performance of networked control systems, two classes of varying topologies are considered, and distributive control designs are presented to guarantee finite time consensus. The proposed control scheme employs a distributed observer to estimate the first left eigenvector of graph Laplacian and, by exploiting this knowledge of network connectivity, it can handle switching topologies. The proposed methodology ensures finite time convergence to consensus under varying topologies of either having a globally reachable node or being jointly strongly connected, and the topological requirements are less restrictive than those in the existing results. Numerical examples are provided to illustrate the effectiveness of the proposed scheme. (C) 2014 Elsevier Ltd. All rights reserved.

    Subjects

    C. Y. Li;Z. H. Qu

    Volume

    50

    Issue/Number

    6

    Publication Date

    1-1-2014

    Document Type

    Article

    Language

    English

    First Page

    1626

    Last Page

    1631

    WOS Identifier

    WOS:000338600900008

    ISSN

    0005-1098

    Share

    COinS