Coordination of multi‐agent systems with arbitrary convergence time

This paper proposes fixed‐time solutions to several problems in multi‐agent systems. First, a fixed‐time consensus protocol is investigated and under the assumption that the lower bound of smallest positive eigenvalue of the Laplacian matrix is known in advance, the consensus time of the protocol ca...

Full description

Saved in:
Bibliographic Details
Published inIET control theory & applications Vol. 15; no. 6; pp. 900 - 909
Main Authors Nguyen, Thanh Truong, Trinh, Minh Hoang, Nguyen, Chuong Van, Nguyen, Nam Hoai, Ðặng, Mỹ Văn
Format Journal Article
LanguageEnglish
Published Wiley 01.04.2021
Subjects
Linear algebra (numerical analysis)
Multivariable control systems
Stability in control theory
Online AccessGet full text

Cover

More Information
Summary:This paper proposes fixed‐time solutions to several problems in multi‐agent systems. First, a fixed‐time consensus protocol is investigated and under the assumption that the lower bound of smallest positive eigenvalue of the Laplacian matrix is known in advance, the consensus time of the protocol can be arbitrarily selected. Second, the consensus law to attenuate bounded disturbances acting on the system is modified. Third, the fixed‐time design method is applied to the orientation alignment and network localization problems. Finally, several simulations are provided to support the mathematical analysis.
ISSN:1751-8644
1751-8652
DOI:10.1049/cth2.12086