Contractions for Consensus Processes
Many distributed control algorithms of current interest can be modeled by linear recursion equations of the form x(t + 1) = M(t)x(t), t ≥ 1 where each M(t) is a real-valued "stochastic" or "doubly stochastic" matrix. Convergence of such recursions often
|Collections||ANU Research Publications|
|Source:||Proceedings of the IEEE Conference on Decision and Control and European Control Conference (CDC-ECC 2011)|
|01_Liu_Contractions_for_Consensus_2011.pdf||181.25 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.