Back to Search Start Over

Fixed-time nonlinear-filter-based consensus control for nonlinear multiagent systems.

Authors :
Liu, Xinxiao
Wang, Lijie
Liu, Yang
Source :
Chaos, Solitons & Fractals. Dec2023, Vol. 177, pN.PAG-N.PAG. 1p.
Publication Year :
2023

Abstract

This paper investigates the fixed-time consensus control problem for a class of nonlinear multiagent systems (MASs) based on dynamic event-triggered mechanism. In contrast to the already-existing fixed-time control schemes, which cannot address the singularity problem, by constructing a virtual signal and using inequality technology, a new processing method is provided to solve such a problem. In addition, a novel fixed-time nonlinear filter that converges in a fixed time is introduced, which effectively solves the "explosion of complexity" problem existed in backstepping. Moreover, to improve the utilization of resources, an event-triggered mechanism with internal dynamic variables is proposed. It is worth noting that some existing static event-triggered mechanisms are special cases of the dynamic ones. On this basis, an effective fixed-time event-triggered control scheme is developed for MASs, which minimizes the data transmission as much as possible while ensuring the system performance. More importantly, the scheme can ensure the convergence of the system in a fixed time. Finally, simulation results are shown to support the validity of the developed approach. • Compared with the early results that may lead to the singularity problem, a practical fixed-time stability theory is introduced in this paper, which not only guarantees the convergence of MASs in fixed time, but also avoids the above problems in early results. • A novel fixed-time nonlinear filter is presented in this paper, which can not only solve the problem of "explosion of complexity", but also ensure that the designed nonlinear filter converges in a fixed time. • The controller developed herein is updated if only if the dynamic event-triggered condition is satisfied, which reduces the computational and communication burden, that is, the lower bound on inter-execution time in previous results is no greater than that in this paper. [ABSTRACT FROM AUTHOR]

Details

Language :
English
ISSN :
09600779
Volume :
177
Database :
Academic Search Index
Journal :
Chaos, Solitons & Fractals
Publication Type :
Periodical
Accession number :
173970817
Full Text :
https://doi.org/10.1016/j.chaos.2023.114244