Global asymptotic stability of a general biased min‐consensus protocol
Abstract In this paper, a general biased min‐consensus protocol for continuous‐time multi‐agent systems is presented. In this protocol, agents considered as sources maintain static states, while the state of each non‐source agent evolves using a general min‐consensus‐like function, which takes the s...
Main Authors: | Yuanqiu Mo, Lanlin Yu, Changbin Yu |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2021-05-01
|
Series: | IET Control Theory & Applications |
Subjects: | |
Online Access: | https://doi.org/10.1049/cth2.12111 |
Similar Items
-
A parallel multi‐block alternating direction method of multipliers for tensor completion
by: Hu Zhu, et al.
Published: (2021-11-01) -
Convergence of an accelerated distributed optimisation algorithm over time‐varying directed networks
by: Jinhui Hu, et al.
Published: (2021-01-01) -
Iterative algorithm for designing asymptotically optimal uniform scalar quantisation of the one‐sided Rayleigh density
by: Aleksandra Jovanović, et al.
Published: (2021-03-01) -
Fast algorithms for constrained generalised predictive control with on‐line optimisation
by: Vinícius Berndsen Peccin, et al.
Published: (2021-03-01) -
Almost sure convergence of randomised‐difference descent algorithm for stochastic convex optimisation
by: Xiaoxue Geng, et al.
Published: (2021-11-01)