Please use this identifier to cite or link to this item: http://localhost/handle/Hannan/526235
Title: Sarymsakov Matrices and Asynchronous Implementation of Distributed Coordination Algorithms
Authors: ACCESS Linnaeus Centre, R. Inst. of Technol., Stockholm, Sweden;Weiguo Xia ; Ming Cao
subject: distributed algorithms; matrix algebra; multi-agent systems; stochastic processes; Sarymsakov class; Sarymsakov matrices; asynchronous update events; coordination task; distributed coordination algorithms; multiagent systems; scrambling stochastic matrices; Algorithm design and analysis; Convergence; Indexes; Multi-agent systems; Stochastic processes; Synchronization; Vectors; Asynchronous events; Sarymsakov matrices; distributed coordination; multi-agent systems; scrambling matrices;
Year: 2014
Publisher: IEEE
Abstract: 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.
URI: http://localhost/handle/Hannan/239854
http://localhost/handle/Hannan/526235
ISSN: 0018-9286
volume: 59
issue: 8
Appears in Collections:2014

Files in This Item:
File SizeFormat 
6716991.pdf1.12 MBAdobe PDF
Title: Sarymsakov Matrices and Asynchronous Implementation of Distributed Coordination Algorithms
Authors: ACCESS Linnaeus Centre, R. Inst. of Technol., Stockholm, Sweden;Weiguo Xia ; Ming Cao
subject: distributed algorithms; matrix algebra; multi-agent systems; stochastic processes; Sarymsakov class; Sarymsakov matrices; asynchronous update events; coordination task; distributed coordination algorithms; multiagent systems; scrambling stochastic matrices; Algorithm design and analysis; Convergence; Indexes; Multi-agent systems; Stochastic processes; Synchronization; Vectors; Asynchronous events; Sarymsakov matrices; distributed coordination; multi-agent systems; scrambling matrices;
Year: 2014
Publisher: IEEE
Abstract: 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.
URI: http://localhost/handle/Hannan/239854
http://localhost/handle/Hannan/526235
ISSN: 0018-9286
volume: 59
issue: 8
Appears in Collections:2014

Files in This Item:
File SizeFormat 
6716991.pdf1.12 MBAdobe PDF
Title: Sarymsakov Matrices and Asynchronous Implementation of Distributed Coordination Algorithms
Authors: ACCESS Linnaeus Centre, R. Inst. of Technol., Stockholm, Sweden;Weiguo Xia ; Ming Cao
subject: distributed algorithms; matrix algebra; multi-agent systems; stochastic processes; Sarymsakov class; Sarymsakov matrices; asynchronous update events; coordination task; distributed coordination algorithms; multiagent systems; scrambling stochastic matrices; Algorithm design and analysis; Convergence; Indexes; Multi-agent systems; Stochastic processes; Synchronization; Vectors; Asynchronous events; Sarymsakov matrices; distributed coordination; multi-agent systems; scrambling matrices;
Year: 2014
Publisher: IEEE
Abstract: 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.
URI: http://localhost/handle/Hannan/239854
http://localhost/handle/Hannan/526235
ISSN: 0018-9286
volume: 59
issue: 8
Appears in Collections:2014

Files in This Item:
File SizeFormat 
6716991.pdf1.12 MBAdobe PDF