Disturbance attenuation of a network of nonlinear systems

被引:6
|
作者
Zhai, Shidong [1 ,2 ]
机构
[1] Chongqing Univ Posts & Telecommun, Minist Educ, Res Ctr Anal & Control Complex Syst, Chongqing 400065, Peoples R China
[2] Chongqing Univ Posts & Telecommun, Minist Educ, Key Lab Ind Internet Things & Networked Control, Chongqing 400065, Peoples R China
基金
中国国家自然科学基金;
关键词
Disturbance attenuation; Nonlinear systems; Incremental output-feedback passivity property; H-INFINITY CONSENSUS; MULTIAGENT SYSTEMS; SWITCHING TOPOLOGY; LINEAR-SYSTEMS; SYNCHRONIZATION; AGENTS; COORDINATION; AGREEMENT; DESIGN;
D O I
10.1007/s11071-015-2003-7
中图分类号
TH [机械、仪表工业];
学科分类号
0802 ;
摘要
This paper considers two problems related to disturbance attenuation in a network of nonlinear systems, in which each agent satisfies some suitable passivity properties and is subject to admissible disturbance in input: the interaction graph design and design of distributed controllers. We define a controlled output to measure the output disagreements among agents, and the two problems related to disturbance attenuation are converted to H-infinity suboptimal control problems. Under the assumption that the communication graph is connected and the edge weights are variables belonging to a convex set, we show that the disturbance attenuation performance can be enhanced by maximizing the second smallest eigenvalue of the graph Laplacian (when feedback gain is positive) or by minimizing the largest eigenvalue of the graph Laplacian (when feedback gain is negative). We provide some steps to obtain distributed controllers which achieve a prescribed performance under the assumption that the interaction graph is fixed. When there exist communication time-delays between the agents, we also consider two problems related to disturbance attenuation similar to the delay-free case. A numerical example about grounded capacitor RC circuit is presented to illustrate the effectiveness of the obtained results.
引用
收藏
页码:437 / 451
页数:15
相关论文
共 50 条
  • [1] Disturbance attenuation of a network of nonlinear systems
    Shidong Zhai
    Nonlinear Dynamics, 2015, 81 : 437 - 451
  • [2] Disturbance attenuation for nonlinear switched descriptor systems based on neural network
    Fei Long
    Yang Xiao
    Xin Chen
    Zhuhong Zhang
    Neural Computing and Applications, 2013, 23 : 2211 - 2219
  • [3] Disturbance attenuation for nonlinear switched descriptor systems based on neural network
    Long, Fei
    Xiao, Yang
    Chen, Xin
    Zhang, Zhuhong
    NEURAL COMPUTING & APPLICATIONS, 2013, 23 (7-8): : 2211 - 2219
  • [4] DISTURBANCE ATTENUATION FOR UNCERTAIN NONLINEAR CASCADED SYSTEMS
    BI Weiping(Department of Mathematics
    JournalofSystemsScienceandComplexity, 2004, (03) : 318 - 324
  • [5] Tracking control of nonlinear systems with disturbance attenuation
    AhmedAli, T
    LamnabhiLagarrigue, F
    COMPTES RENDUS DE L ACADEMIE DES SCIENCES SERIE I-MATHEMATIQUE, 1997, 325 (03): : 329 - 338
  • [6] Finite-time disturbance attenuation of nonlinear systems
    MO LiPo JIA YingMin ZHENG ZhiMing Key Laboratory of Mathematics Informatics and Behavioral Semantics Ministry of Education Beihang University Beijing China The Seventh Research Division Beihang University Beijing China
    Science in China(Series F:Information Sciences), 2009, 52 (11) : 2163 - 2171
  • [7] Disturbance attenuation by output feedback for a class of nonlinear systems
    Wei, Chunling
    Wang, Qiangde
    TRANSACTIONS OF THE INSTITUTE OF MEASUREMENT AND CONTROL, 2016, 38 (07) : 884 - 892
  • [8] Finite-time disturbance attenuation of nonlinear systems
    Mo LiPo
    Jia YingMin
    Zheng ZhiMing
    SCIENCE IN CHINA SERIES F-INFORMATION SCIENCES, 2009, 52 (11): : 2163 - 2171
  • [9] Disturbance attenuation for nonlinear systems with input matching uncertainty
    Guo, Tiantian
    Xie, Xuejun
    2018 37TH CHINESE CONTROL CONFERENCE (CCC), 2018, : 381 - 385
  • [10] Finite-time disturbance attenuation of nonlinear systems
    MO LiPo1
    2 The Seventh Research Division
    Science China(Information Sciences), 2009, (11) : 2163 - 2171