Performance Bounds and Optimal Design of Randomly Switching Linear Consensus Networks

被引:0
|
作者
Mousavi, Hossein K. [1 ]
Somarakis, Christoforos [1 ]
Bahavarnia, MirSaleh [1 ]
Motee, Nader [1 ]
机构
[1] Lehigh Univ, Dept Mech Engn & Mech, Bethlehem, PA 18015 USA
基金
美国国家科学基金会;
关键词
STABILITY; AGENTS; OSCILLATORS;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
We analyze the steady-state performance of randomly switching linear consensus networks subject to an additive noise. Our focus is on a class of discrete-time linear consensus networks whose dynamics evolve in time by switching between symmetric doubly-stochastic matrices that are drawn from a given finite set of realizations, which are dictated by a discrete random variable with a known probability mass function (pmf). The mean square deviation of the output from zero is utilized as a performance measure to quantify the noise propagation across the network. The direct computation of the performance measure, however, suffers from the curse of dimensionality. The first objective of this paper is to report a rather tight lower-bound for the performance measure that requires comparably less computations. Our second goal is to design a randomly switching network by minimizing the overall performance measure with respect to the vector of switching probabilities between consecutive realizations. Indeed, we prove that the performance measure is a convex function of the vector of switching probabilities, and furthermore, the optimal network design problem can be cast as a Semi-Definite Program (SDP). Moreover, we show that the performance measure is a convex function of the link weights of all underlying graphs, which implies that one can perform a reweighting procedure to minimize the performance measure using convenient convex programming tools. Different aspects of our theoretical results are illustrated via numerous examples and simulations.
引用
收藏
页码:4347 / 4352
页数:6
相关论文
共 50 条
  • [1] Optimal Switching Between Two Linear Consensus Protocols
    Ron, Orel
    Margaliot, Michael
    [J]. 2013 IEEE 52ND ANNUAL CONFERENCE ON DECISION AND CONTROL (CDC), 2013, : 1372 - 1377
  • [2] Distributed Consensus Design for a Class of Uncertain Linear Multiagent Systems under Unbalanced Randomly Switching Directed Topologies
    Dinh Hoa Nguyen
    [J]. MATHEMATICAL PROBLEMS IN ENGINEERING, 2018, 2018
  • [3] Distributed robust estimation over randomly switching networks using H∞ consensus
    Ugrinovskii, V.
    [J]. AUTOMATICA, 2013, 49 (01) : 160 - 168
  • [4] Performance bounds for optimal feedback control in networks
    Summers, Tyler
    Ruths, Justin
    [J]. 2018 ANNUAL AMERICAN CONTROL CONFERENCE (ACC), 2018, : 203 - 209
  • [5] Performance Analysis and Optimal Design of Time-Delay Directed Consensus Networks
    Dezfulian, Shima
    Ghaedsharaf, Yaser
    Motee, Nader
    [J]. IEEE TRANSACTIONS ON CONTROL OF NETWORK SYSTEMS, 2022, 9 (01): : 197 - 209
  • [6] Consensus condition for linear multi-agent systems over randomly switching topologies
    You, Keyou
    Li, Zhongkui
    Xie, Lihua
    [J]. AUTOMATICA, 2013, 49 (10) : 3125 - 3132
  • [7] Robust Consensus for Linear Multi-Agent Systems over Randomly Switching Topologies
    Lin, Chengrong
    Huang, Wenchao
    Huang, Yanwei
    Chen, Shaobin
    [J]. PROCEEDINGS OF THE 38TH CHINESE CONTROL CONFERENCE (CCC), 2019, : 197 - 201
  • [8] Performance and design of cycles in consensus networks
    Zelazo, Daniel
    Schuler, Simone
    Allgoewer, Frank
    [J]. SYSTEMS & CONTROL LETTERS, 2013, 62 (01) : 85 - 96
  • [9] OPTIMAL DESIGN OF SWITCHING NETWORKS - TOPOLOGICAL APPROACH
    FRY, RW
    AATRE, VK
    [J]. INTERNATIONAL JOURNAL OF ELECTRONICS, 1974, 36 (02) : 167 - 175
  • [10] DESIGN OF OPTIMAL SWITCHING NETWORKS BY INTEGER PROGRAMMING
    MUROGA, S
    IBARAKI, T
    [J]. IEEE TRANSACTIONS ON COMPUTERS, 1972, C 21 (06) : 573 - &