Reaching a consensus in a dynamically changing environment - convergence rates, measurement delays and asynchronous events
This paper uses recently established properties of compositions of directed graphs together with results from the theory of nonhomogeneous Markov chains to derive worst case convergence rates for the headings of a group of mobile autonomous agents which arise in connection with the widely studied Vicsek consensus problem. The paper also uses graph-theoretic constructions to solve modified versions of the Vicsek problem in which there are measurement delays, asynchronous events, or a group...[Show more]
|Collections||ANU Research Publications|
|Source:||Siam Journal on Control and Optimization|
|01_Cao_Reaching_a_consensus_in_a_2008.pdf||280.47 kB||Adobe PDF|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.