TY - JOUR
T1 - Distributed average tracking for lipschitz-type of nonlinear dynamical systems
AU - Zhao, Yu
AU - Liu, Yongfang
AU - Wen, Guanghui
AU - Yu, Xinghuo
AU - Chen, Guanrong
N1 - Publisher Copyright:
© 2019 IEEE.
PY - 2019/12
Y1 - 2019/12
N2 - In this paper, a distributed average tracking (DAT) problem is studied for Lipschitz-type of nonlinear dynamical systems. The objective is to design DAT algorithms for locally interactive agents to track the average of multiple reference signals. Here, in both dynamics of agents and reference signals, there is a nonlinear term satisfying a Lipschitz-type condition. Three types of DAT algorithms are designed. First, based on state-dependent-gain design principles, a robust DAT algorithm is developed for solving DAT problems without requiring the same initial condition. Second, by using a gain adaption scheme, an adaptive DAT algorithm is designed to remove the requirement that global information, such as the eigenvalue of the Laplacian and the Lipschitz constant, is known to all agents. Third, to reduce chattering and make the algorithms easier to implement, a couple of continuous DAT algorithms based on time-varying or time-invariant boundary layers are designed, respectively, as a continuous approximation of the aforementioned discontinuous DAT algorithms. Finally, some simulation examples are presented to verify the proposed DAT algorithms.
AB - In this paper, a distributed average tracking (DAT) problem is studied for Lipschitz-type of nonlinear dynamical systems. The objective is to design DAT algorithms for locally interactive agents to track the average of multiple reference signals. Here, in both dynamics of agents and reference signals, there is a nonlinear term satisfying a Lipschitz-type condition. Three types of DAT algorithms are designed. First, based on state-dependent-gain design principles, a robust DAT algorithm is developed for solving DAT problems without requiring the same initial condition. Second, by using a gain adaption scheme, an adaptive DAT algorithm is designed to remove the requirement that global information, such as the eigenvalue of the Laplacian and the Lipschitz constant, is known to all agents. Third, to reduce chattering and make the algorithms easier to implement, a couple of continuous DAT algorithms based on time-varying or time-invariant boundary layers are designed, respectively, as a continuous approximation of the aforementioned discontinuous DAT algorithms. Finally, some simulation examples are presented to verify the proposed DAT algorithms.
KW - Adaptive algorithm
KW - continuous algorithm
KW - distributed average tracking (DAT)
KW - nonlinear dynamics
UR - http://www.scopus.com/inward/record.url?scp=85051652671&partnerID=8YFLogxK
U2 - 10.1109/TCYB.2018.2859352
DO - 10.1109/TCYB.2018.2859352
M3 - 文章
C2 - 30113904
AN - SCOPUS:85051652671
SN - 2168-2267
VL - 49
SP - 4140
EP - 4152
JO - IEEE Transactions on Cybernetics
JF - IEEE Transactions on Cybernetics
IS - 12
M1 - 8435960
ER -