Distributed algebraic connectivity estimation for adaptive event-triggered consensus
2012 (English)In: American Control Conference (ACC), 2012, IEEE , 2012, 32-37 p.Conference paper (Refereed)
In several multi agent control problems, the convergence properties and speed of the system depend on the algebraic connectivity of the graph. We discuss a particular event-triggered consensus scenario, and show that the availability of an estimate of the algebraic connectivity could be used for adapting the behavior of the average consensus algorithm. We present a novel distributed algorithm for estimating the algebraic connectivity, that relies on the distributed computation of the powers of matrices. We provide proofs of convergence, convergence rate, and upper and lower bounds at each iteration of the estimated algebraic connectivity.
Place, publisher, year, edition, pages
IEEE , 2012. 32-37 p.
, Proceedings of the American Control Conference, ISSN 0743-1619
Algebraic connectivity, Average consensus, Convergence properties, Convergence rates, Distributed computations, Event-triggered, Multiagent control, Upper and lower bounds, Algorithms, Estimation, Iterative methods, Algebra
IdentifiersURN: urn:nbn:se:kth:diva-108029ISI: 000310776200006ScopusID: 2-s2.0-84869426601ISBN: 978-145771095-7OAI: oai:DiVA.org:kth-108029DiVA: diva2:580174
2012 American Control Conference, ACC 2012, 27 June 2012 through 29 June 2012, Montreal, QC
FunderICT - The Next Generation
QC 201212212012-12-212012-12-192013-04-11Bibliographically approved