Journal
AUTOMATICA
Volume 50, Issue 6, Pages 1626-1631Publisher
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.automatica.2014.04.002
Keywords
Information theory; Switching networks; Distributed control; Connectivity; Cooperative control
Funding
- US National Science Foundation [ECCS-1308928, CCF-0956501, CMMI-0825505]
- US Department of Energy [DE-EE0006340]
- US Department of Energy's Solar Energy Grid Integration Systems program
- L-3 Communications
- Directorate For Engineering
- Div Of Electrical, Commun & Cyber Sys [1308928] Funding Source: National Science Foundation
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available