2022
DOI: 10.1002/rnc.6400
|View full text |Cite
|
Sign up to set email alerts
|

Observer‐based prescribed‐time consensus control for heterogeneous multi‐agent systems under directed graphs

Abstract: This work studies the prescribed‐time robust consensus tracking problem of heterogeneous multi‐agent systems over directed graphs. Aiming at multi‐agent systems with a static leader and only matched disturbances, a distributed observer‐based consensus algorithm is developed, to ensure that the tracking errors converge to zero accurately in prescribed time. For the case of multi‐agent systems with a dynamic leader and mismatched/matched disturbances, an adaptive strategy based on a distributed observer and a di… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

0
14
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 8 publications
(14 citation statements)
references
References 44 publications
0
14
0
Order By: Relevance
“…However, some bottlenecks 14 still cannot be broken by finite-time/fixed-time distributed observers: (1) there exists a complex relationship between the upper bound of the settling time and observer design parameters; (2) the actual settling time heavily depends on the observer design parameters and the initial system conditions, and cannot be predefined in advance according to the task requirements. To overcome the bottlenecks, some efforts have been put into predefined-time distributed observers, [15][16][17][18][19][20][21] where the upper bound of the settling time is preset by only one parameter irrelevant to the initial conditions and other system parameters. For example, a predefined-time distributed observer 21 was proposed for a class of strict-feedback nonlinear systems.…”
Section: Introductionmentioning
confidence: 99%
See 4 more Smart Citations
“…However, some bottlenecks 14 still cannot be broken by finite-time/fixed-time distributed observers: (1) there exists a complex relationship between the upper bound of the settling time and observer design parameters; (2) the actual settling time heavily depends on the observer design parameters and the initial system conditions, and cannot be predefined in advance according to the task requirements. To overcome the bottlenecks, some efforts have been put into predefined-time distributed observers, [15][16][17][18][19][20][21] where the upper bound of the settling time is preset by only one parameter irrelevant to the initial conditions and other system parameters. For example, a predefined-time distributed observer 21 was proposed for a class of strict-feedback nonlinear systems.…”
Section: Introductionmentioning
confidence: 99%
“…It should be noted that the communication topology is global information (which is reflected as the Laplacian matrix) that is not easily accessible in multi-agent systems. Nevertheless, the designs of most existing distributed observers including predefined-time distributed observers [15][16][17][18][19][20][21] require the information of the communication graph, hindering the practical applications. Recently, a few fully distributed observers [22][23][24] to avoid using the Laplacian matrix information have been developed, which are mainly inspired by early works [25][26][27] of adaptive distributed consensus protocol design.…”
Section: Introductionmentioning
confidence: 99%
See 3 more Smart Citations