Distributed Average Consensus based on Structural Weight-Balanceability
This paper presents the concept of structural weight-balanceability of network systems as a useful method to examine the average consensus of the systems. We introduce the notion of structurally unobservable node based on structural observability concept to determine the structural weightbalanceabil...
Saved in:
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Article |
Language: | English |
Published: |
2016
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/82769 http://hdl.handle.net/10220/40326 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
id |
sg-ntu-dr.10356-82769 |
---|---|
record_format |
dspace |
spelling |
sg-ntu-dr.10356-827692020-03-07T13:57:23Z Distributed Average Consensus based on Structural Weight-Balanceability Haghighi, Reza Cheah, Chien Chern School of Electrical and Electronic Engineering Distributed average consensus Matrix algebra This paper presents the concept of structural weight-balanceability of network systems as a useful method to examine the average consensus of the systems. We introduce the notion of structurally unobservable node based on structural observability concept to determine the structural weightbalanceability of a network. We propose a simple technique to identify structurally unobservable nodes, and consequently infer on structural weight-balanceability of the network. A mathematical method based on principal minors of the associated Laplacian matrix of the network is developed to modify a structurally weight-balanceable network into a weight-balanced one. A distributed method is presented to compute normalized principal minors in a large-scale network system with directed communication topology. This is the first work that provides a rigorous mathematical formulation to check the structural weight-balanceability of network systems and make a structurally weight-balanceable network, weightbalanced. Finally, simulation results are presented to illustrate the performance of the proposed method in dealing with networks with a large number of nodes. ASTAR (Agency for Sci., Tech. and Research, S’pore) Accepted version 2016-03-24T07:35:00Z 2019-12-06T15:05:11Z 2016-03-24T07:35:00Z 2019-12-06T15:05:11Z 2015 Journal Article Haghighi, R. & Cheah, C. C. (2014). Distributed average consensus based on structural weight-balanceability. IET Control Theory & Applications, 9(2), 176-183. 1751-8644 https://hdl.handle.net/10356/82769 http://hdl.handle.net/10220/40326 10.1049/iet-cta.2014.0251 en IET Control Theory & Applications © 2015 Institution of Engineering and Technology. This is the author created version of a work that has been peer reviewed and accepted for publication by IET Control Theory and Applications, Institution of Engineering and Technology. It incorporates referee’s comments but changes resulting from the publishing process, such as copyediting, structural formatting, may not be reflected in this document. The published version is available at: [http://dx.doi.org/10.1049/iet-cta.2014.0251]. 18 p. application/pdf |
institution |
Nanyang Technological University |
building |
NTU Library |
country |
Singapore |
collection |
DR-NTU |
language |
English |
topic |
Distributed average consensus Matrix algebra |
spellingShingle |
Distributed average consensus Matrix algebra Haghighi, Reza Cheah, Chien Chern Distributed Average Consensus based on Structural Weight-Balanceability |
description |
This paper presents the concept of structural weight-balanceability of network systems as a useful method to examine the average consensus of the systems. We introduce the notion of structurally unobservable node based on structural observability concept to determine the structural weightbalanceability of a network. We propose a simple technique to identify structurally unobservable nodes, and consequently infer on structural weight-balanceability of the network. A mathematical method based on principal minors of the associated Laplacian matrix of the network is developed to modify a structurally weight-balanceable network into a weight-balanced one. A distributed method is presented to compute normalized principal minors in a large-scale network system with directed communication topology. This is the first work that provides a rigorous mathematical formulation to check the structural weight-balanceability of network systems and make a structurally weight-balanceable network, weightbalanced. Finally, simulation results are presented to illustrate the performance of the proposed method in dealing with networks with a large number of nodes. |
author2 |
School of Electrical and Electronic Engineering |
author_facet |
School of Electrical and Electronic Engineering Haghighi, Reza Cheah, Chien Chern |
format |
Article |
author |
Haghighi, Reza Cheah, Chien Chern |
author_sort |
Haghighi, Reza |
title |
Distributed Average Consensus based on Structural Weight-Balanceability |
title_short |
Distributed Average Consensus based on Structural Weight-Balanceability |
title_full |
Distributed Average Consensus based on Structural Weight-Balanceability |
title_fullStr |
Distributed Average Consensus based on Structural Weight-Balanceability |
title_full_unstemmed |
Distributed Average Consensus based on Structural Weight-Balanceability |
title_sort |
distributed average consensus based on structural weight-balanceability |
publishDate |
2016 |
url |
https://hdl.handle.net/10356/82769 http://hdl.handle.net/10220/40326 |
_version_ |
1681047069451616256 |