Finding the exact delay bound for consensus of linear multi-agent systems
Rudy Cepeda-Gomez
International Journal of Systems Science, 2016, vol. 47, issue 11, 2598-2606
Abstract:
This paper focuses on consensus problems for high-order, linear multi-agent systems. Undirected communication topologies along with a fixed and uniform communication time delay are taken into account. This class of problems has been widely studied in the literature, but there are still gaps concerning the exact stability bounds in the domain of the delays. The novelty of this paper lies in the determination of an exact and explicit delay bound for consensus. This is done in a very efficient manner by using the cluster treatment of characteristic roots (CTCR) paradigm. Before the stability analysis, a state transformation is performed to decouple the system and simplify the problem. CTCR is then deployed to the individual subsystems to obtain the stability margin in the domain of the delays without the conservatism introduced by other approaches more frequently found in the literature. Simulation results are presented to support the analytical claims.
Date: 2016
References: View references in EconPapers View complete reference list from CitEc
Citations:
Downloads: (external link)
http://hdl.handle.net/10.1080/00207721.2015.1005194 (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:47:y:2016:i:11:p:2598-2606
Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/TSYS20
DOI: 10.1080/00207721.2015.1005194
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 ().