Consensus of discrete-time multi-agent systems with multiplicative uncertainties and delays
Bo Wang and
Yu-Ping Tian
International Journal of Systems Science, 2021, vol. 52, issue 11, 2311-2323
Abstract:
This paper studies the consensus problem of discrete-time single-integrator multi-agent systems with multiplicative uncertainties and bounded communication delays in switching networks. Some sufficient conditions for non-stochastic consensus are obtained by adopting the constant-gain protocol. For the case that the uncertainty is exponentially decaying (i.e. is $ O(\gamma ^k) $ O(γk) with $ \gamma \in (0,1) $ γ∈(0,1)), it is proved for any bounded delays, the consensus can be achieved if the switching topology is uniformly rooted. For the case that the uncertainty is polynomially decaying (i.e. is $ O( {\frac {1}{(1+k)^\mu }} ) $ O(1(1+k)μ) with $ \mu \gt 0 $ μ>0), under a precondition that the system state is bounded, a similar conclusion is also obtained. The convergence rate of the consensus protocol is quantified in terms of the decay rate of uncertainties. Simulation results are given to verify the correctness of the conclusion.
Date: 2021
References: Add references at CitEc
Citations:
Downloads: (external link)
http://hdl.handle.net/10.1080/00207721.2021.1883766 (text/html)
Access to full text is restricted to subscribers.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:taf:tsysxx:v:52:y:2021:i:11:p:2311-2323
Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/TSYS20
DOI: 10.1080/00207721.2021.1883766
Access Statistics for this article
International Journal of Systems Science is currently edited by Visakan Kadirkamanathan
More articles in International Journal of Systems Science from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().