Robust consensus tracking of linear multiagent systems with input saturation and input-additive uncertainties

被引:16
|
作者
Wang, Qingling [1 ,3 ]
Sun, Changyin [1 ,3 ]
Xin, Xin [2 ]
机构
[1] Southeast Univ, Sch Automat, Nanjing 210096, Jiangsu, Peoples R China
[2] Okayama Prefectural Univ, Fac Comp Sci & Syst Engn, Okayama 7191197, Japan
[3] Minist Educ, Key Lab Measurement & Control Complex Syst Engn, Nanjing, Jiangsu, Peoples R China
基金
中国国家自然科学基金;
关键词
robust consensus; input saturation; gain scheduling; DOUBLE-INTEGRATOR DYNAMICS; LEADER-FOLLOWING CONSENSUS; GLOBAL STABILIZATION; NONLINEAR-SYSTEMS; OUTPUT REGULATION; SENSOR NETWORKS; WIRELESS SENSOR; CONSTRAINTS; ALGORITHMS; FEEDBACK;
D O I
10.1002/rnc.3690
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The problem of robust global consensus tracking of linear multiagent systems with input saturation and input-additive uncertainties is investigated in this paper. By using the parametric Lyapunov equation approach and an existing dynamic gain scheduling technique, a new distributed nonlinear-gain scheduling consensus-trackining algorithm is developed to solve this problem. Under the assumption that each agent is asymptotically null controllable with bounded control, it is shown that the robust global consensus tracking can be achieved under the undirected graph provided that its generated graph contains a directed spanning tree. Compared with the existing algebraic Riccati equation approach, which requires the online solution of a parameterized algebraic Riccati equation, all the parameters in the proposed nonlinear algorithm are offline determined a priori. Finally, numerical examples are provided to validate the theoretical results. Copyright (c) 2016 John Wiley & Sons, Ltd.
引用
收藏
页码:2393 / 2409
页数:17
相关论文
共 50 条
  • [1] On the Bipartite Consensus for Generic Linear Multiagent Systems With Input Saturation
    Qin, Jiahu
    Fu, Weiming
    Zheng, Wei Xing
    Gao, Huijun
    IEEE TRANSACTIONS ON CYBERNETICS, 2017, 47 (08) : 1948 - 1958
  • [2] Performance Improvement of Consensus Tracking for Linear Multiagent Systems With Input Saturation: A Gain Scheduled Approach
    Chu, Hongjun
    Yi, Bowen
    Zhang, Guoqing
    Zhang, Weidong
    IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS, 2020, 50 (03): : 734 - 746
  • [3] Gain scheduled control design for linear systems with saturating actuators and input-additive uncertainties
    Wu Wen-Juan
    Duan Guang-Ren
    Hou Ming-Zhe
    Tan Feng
    2015 34TH CHINESE CONTROL CONFERENCE (CCC), 2015, : 88 - 93
  • [4] Coordinated tracking of linear multiagent systems with input saturation and stochastic disturbances
    Wang, Qingling
    Sun, Changyin
    ISA TRANSACTIONS, 2017, 71 : 3 - 9
  • [5] Distributed Robust Semiglobal Consensus With Matched Uncertainties and Input Saturation
    Rong, Lina
    Zuo, Wenwen
    Gao, Hui
    Xu, Shengyuan
    IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-EXPRESS BRIEFS, 2022, 69 (02) : 484 - 488
  • [6] Secure consensus of multiagent systems with input saturation and DoS attacks
    Du, Shengli
    Yan, Qiushuo
    Gao, Yongfeng
    Wang, Caixia
    PROCEEDINGS OF THE 39TH CHINESE CONTROL CONFERENCE, 2020, : 4807 - 4812
  • [7] Consensus analysis for heterogeneous multiagent systems subject to input saturation
    Ma, Yuwan
    Yang, Qingsheng
    Zhan, Xisheng
    Wu, Jie
    ASIAN JOURNAL OF CONTROL, 2024,
  • [8] Semiglobal Robust Consensus of General Linear MASs Subject to Input Saturation and Additive Perturbations
    Yang, Yucheng
    Su, Housheng
    Zeng, Zhigang
    Wang, Xiaoling
    IEEE TRANSACTIONS ON CYBERNETICS, 2023, 53 (06) : 3806 - 3817
  • [9] Adaptive consensus tracking for linear multi-agent systems with input saturation
    Chu, Hongjun
    Zhang, Weidong
    TRANSACTIONS OF THE INSTITUTE OF MEASUREMENT AND CONTROL, 2016, 38 (12) : 1434 - 1441
  • [10] Fault-tolerant consensus for switched multiagent systems with input saturation
    Yin, Yanhui
    Wang, Fuyong
    Liu, Zhongxin
    Chen, Zengqiang
    INTERNATIONAL JOURNAL OF ROBUST AND NONLINEAR CONTROL, 2021, 31 (11) : 5047 - 5068