TY - GEN
T1 - Fully Distributed Minimal-order Attack-free Protocol for Nonlinear Multi-Agent Networks
AU - Lv, Yuezu
AU - Zhou, Jialing
AU - Chen, Lei
AU - Zhu, Chunli
AU - Qin, Tong
N1 - Publisher Copyright:
© 2023 IEEE.
PY - 2023
Y1 - 2023
N2 - Achieving fully distributed consensus in multi-Agent networks (MANs) based on relative output information is of significant importance in the field of distributed cooperative control. Despite the recent development of consensus theory, there is still lack of an efficient approach to constructing fully distributed consensus protocols for MANs using only relative output measurements, especially for the case with inherent nonlinear agent dynamics under directed communication graphs. This paper studies fully distributed minimal-order protocol design for consensus of MANs with Lipschitz-Type nonlinear agent dynamics under general directed communication graphs. It is revealed that the minimal order of the observer estimating consensus error equals the difference between the dimension of a single agent's state vector and the rank of the output matrix of the agent. Based on the designed distributed minimal-order observer, fully distributed consensus protocols are developed. The proposed protocols have the abilities of reducing communication burden and also can avoid network attacks on the internal states. Numerical simulations are presented to illustrate the analytical results.
AB - Achieving fully distributed consensus in multi-Agent networks (MANs) based on relative output information is of significant importance in the field of distributed cooperative control. Despite the recent development of consensus theory, there is still lack of an efficient approach to constructing fully distributed consensus protocols for MANs using only relative output measurements, especially for the case with inherent nonlinear agent dynamics under directed communication graphs. This paper studies fully distributed minimal-order protocol design for consensus of MANs with Lipschitz-Type nonlinear agent dynamics under general directed communication graphs. It is revealed that the minimal order of the observer estimating consensus error equals the difference between the dimension of a single agent's state vector and the rank of the output matrix of the agent. Based on the designed distributed minimal-order observer, fully distributed consensus protocols are developed. The proposed protocols have the abilities of reducing communication burden and also can avoid network attacks on the internal states. Numerical simulations are presented to illustrate the analytical results.
KW - Distributed minimal-order observer
KW - Lipschitz-Type nonlinearity
KW - consensus
KW - fully distributed attack-free protocol
KW - relative output feedback
UR - http://www.scopus.com/inward/record.url?scp=85175401359&partnerID=8YFLogxK
U2 - 10.1109/ICCSS58421.2023.10269888
DO - 10.1109/ICCSS58421.2023.10269888
M3 - Conference contribution
AN - SCOPUS:85175401359
T3 - 2023 9th International Conference on Information, Cybernetics, and Computational Social Systems, ICCSS 2023
SP - 97
EP - 104
BT - 2023 9th International Conference on Information, Cybernetics, and Computational Social Systems, ICCSS 2023
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 9th International Conference on Information, Cybernetics, and Computational Social Systems, ICCSS 2023
Y2 - 2 July 2023 through 4 July 2023
ER -