Deutsch
 
Datenschutzhinweis Impressum
  DetailsucheBrowse

Datensatz

DATENSATZ AKTIONENEXPORT

Freigegeben

Zeitschriftenartikel

Consensus seeking in multiagent systems with Markovian switching topology under aperiodic sampled data

Urheber*innen
/persons/resource/wang.xin

Wang,  Xin
Potsdam Institute for Climate Impact Research;

Wang,  Hui
External Organizations;

Li,  Chuandong
External Organizations;

Huang,  Tingwen
External Organizations;

/persons/resource/Juergen.Kurths

Kurths,  Jürgen
Potsdam Institute for Climate Impact Research;

Externe Ressourcen
Es sind keine externen Ressourcen hinterlegt
Volltexte (frei zugänglich)
Es sind keine frei zugänglichen Volltexte in PIKpublic verfügbar
Ergänzendes Material (frei zugänglich)
Es sind keine frei zugänglichen Ergänzenden Materialien verfügbar
Zitation

Wang, X., Wang, H., Li, C., Huang, T., Kurths, J. (2020): Consensus seeking in multiagent systems with Markovian switching topology under aperiodic sampled data. - IEEE Transactions on Systems, Man, and Cybernetics: Systems, 50, 12, 5189-5200.
https://doi.org/10.1109/TSMC.2018.2867900


Zitierlink: https://publications.pik-potsdam.de/pubman/item/item_25100
Zusammenfassung
This paper is concerned with the consensus issue for a class of multiagent systems with Markovian switching topology under aperiodic sampled data measurements. By constructing a novel piecewise stochastic Lyapunov-Krasovskii functional, some novel conditions with less conservative are established such that the consensus is achieved in the mean square sense. In contrast to some previous publications, the sample period is no longer fixed and the transition probability matrix of Markovian switching topology is uncertain. This issue which is of practical and theoretical significance is further investigated when the sampled data controller of each agent is suffered from distinct time-varying input delay. Quite different with the related studies, a maximally allowable input delay upper bound is replaced by the permissible input delay interval. Furthermore, the corresponding consensus is elegantly obtained in terms of linear matrix inequalities. Finally, the effectiveness and practicability of our consensus criteria are well illustrated by the numerical examples.