Sarymsakov Matrices and Asynchronous Implementation of Distributed Coordination Algorithms
2014 (English)In: IEEE Transactions on Automatic Control, ISSN 0018-9286, E-ISSN 1558-2523, Vol. 59, no 8, 2228-2233 p.Article in journal (Refereed) Published
We provide new insight into the somewhat obscure definition of the Sarymsakov class of stochastic matrices and use it to construct a new necessary and sufficient condition for the convergence of products of stochastic matrices. Such convergence result is critical in establishing the effectiveness of distributed coordination algorithms for multi-agent systems and enables us to investigate a specific coordination task with asynchronous update events. The set of scrambling stochastic matrices, a subclass of the Sarymsakov class, is utilized to establish the convergence of the agents' states even when there is no common clock for the agents to synchronize their update actions.
Place, publisher, year, edition, pages
2014. Vol. 59, no 8, 2228-2233 p.
Asynchronous events, distributed coordination, multi-agent systems, Sarymsakov matrices, scrambling matrices
Control Engineering Electrical Engineering, Electronic Engineering, Information Engineering
IdentifiersURN: urn:nbn:se:kth:diva-155810DOI: 10.1109/TAC.2014.2301571ISI: 000342923700024ScopusID: 2-s2.0-84905168733OAI: oai:DiVA.org:kth-155810DiVA: diva2:763036
FunderEU, European Research Council, ERC-StG-2012-307207EU, FP7, Seventh Framework Programme, 257462
QC 201506232014-11-132014-11-132015-06-23Bibliographically approved