Consensus seeking over Markovian switching networks with time-varying delays and uncertain topologies

Yilun Shang

Applied Mathematics and Computation, 2016, vol. 273, issue C, 1234-1245

Abstract: Stochastic consensus problems for linear time-invariant multi-agent systems over Markovian switching networks with time-varying delays and topology uncertainties are dealt with. By using the linear matrix inequality method and the stability theory of Markovian jump linear system, we show that consensus can be achieved for appropriate time delays and topology uncertainties which are not caused by the Markov process, provided the union of topologies associated with the positive recurrent states of the Markov process admits a spanning tree and the agent dynamics is stabilizable. Feasible linear matrix inequalities are established to determine the maximal allowable upper bound of time-varying delays. Numerical examples are given to show the feasibility of theoretical results.

Keywords: Consensus; Multi-agent system; Markov process; Time delay; Uncertainty (search for similar items in EconPapers)
Date: 2016
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (7)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300315011960
Full text for ScienceDirect subscribers only

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:eee:apmaco:v:273:y:2016:i:c:p:1234-1245

DOI: 10.1016/j.amc.2015.08.115

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().