TY - JOUR
T1 - Disturbance observer-based matrix-weighted consensus
AU - Trinh, Minh Hoang
AU - Van Tran, Quoc
AU - Sun, Zhiyong
AU - Ahn, Hyo-Sung
PY - 2024/10
Y1 - 2024/10
N2 - In this paper, we proposed several disturbance observer-based matrix-weighted consensus algorithms. A new disturbance observer is firstly designed for linear systems with unknown matched or mismatched disturbances representable as the multiplication of a known time-varying matrix with a unknown constant vector. Under some assumptions on the boundedness and persistent excitation of the regression matrix, the disturbances can be estimated at an exponential rate. Then, a suitable compensation input is provided to compensate the unknown disturbances. Second, disturbance-observer based consensus algorithms are proposed for matrix-weighted networks of single- and double-integrators with matched or mismatched disturbances. We show that both matched and mismatched disturbances can be estimated and actively compensated, and the consensus system uniformly globally asymptotically converges to a fixed point in the kernel of the matrix-weighted Laplacian. Depending on the network connectivity, the system can asymptotically achieve a consensus or a cluster configuration. The disturbance-observer based consensus design is further extended for a network of higher-order integrators subjected to disturbances. Finally, simulation results are provided to support the mathematical analysis.
AB - In this paper, we proposed several disturbance observer-based matrix-weighted consensus algorithms. A new disturbance observer is firstly designed for linear systems with unknown matched or mismatched disturbances representable as the multiplication of a known time-varying matrix with a unknown constant vector. Under some assumptions on the boundedness and persistent excitation of the regression matrix, the disturbances can be estimated at an exponential rate. Then, a suitable compensation input is provided to compensate the unknown disturbances. Second, disturbance-observer based consensus algorithms are proposed for matrix-weighted networks of single- and double-integrators with matched or mismatched disturbances. We show that both matched and mismatched disturbances can be estimated and actively compensated, and the consensus system uniformly globally asymptotically converges to a fixed point in the kernel of the matrix-weighted Laplacian. Depending on the network connectivity, the system can asymptotically achieve a consensus or a cluster configuration. The disturbance-observer based consensus design is further extended for a network of higher-order integrators subjected to disturbances. Finally, simulation results are provided to support the mathematical analysis.
KW - consensus algorithm
KW - disturbance observer
KW - matrix-weighted graphs
UR - http://www.scopus.com/inward/record.url?scp=85197802547&partnerID=8YFLogxK
U2 - 10.1002/rnc.7514
DO - 10.1002/rnc.7514
M3 - Article
AN - SCOPUS:85197802547
SN - 1049-8923
VL - 34
SP - 10194
EP - 10214
JO - International Journal of Robust and Nonlinear Control
JF - International Journal of Robust and Nonlinear Control
IS - 15
ER -