Distributed algebraic connectivity estimation for adaptive event-triggered consensus

• 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.

Ämnesord

TEKNIK OCH TEKNOLOGIER  -- Elektroteknik och elektronik -- Reglerteknik (hsv//swe)

ENGINEERING AND TECHNOLOGY  -- Electrical Engineering, Electronic Engineering, Information Engineering -- Control Engineering (hsv//eng)

Nyckelord

Algebraic connectivity

Average consensus

Convergence properties

Convergence rates

Distributed computations

Event-triggered

Multiagent control

Upper and lower bounds

Algorithms

Estimation

Iterative methods

Algebra

Publikations- och innehållstyp

ref (ämneskategori)

kon (ämneskategori)