By Topic

Lyapunov analysis of quadratically symmetric neighborhood consensus algorithms

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Mardavij Roozbehani ; Laboratory for Information and Decision Systems (LIDS) at the Massachusetts Institute of Technology, Cambridge, USA ; Alexandre Megretski ; Emilio Frazzoli

We consider a class of neighborhood consensus algorithms for multi-agent systems. Within this class, the agents move along the gradients of a particular function, which can be represented as the sum of the minimums of several quadratically symmetric nonnegative functions. For these systems, we provide generic Lyapunov functions that are nonincreasing along the trajectories. Under some mild technical assumptions, the Lyapunov functions prove convergence of the algorithms when the number of agents is finite. We show that a well-known model of multi-agent systems, namely the opinion dynamics model, is a special case of this class. The opinion dynamics model was first introduced by Krause and consists of a distribution of agents on the real line, where the agents simultaneously update their positions by moving to the average of the positions of their neighbors including themselves. We show that a specific Lyapunov function that was previously proposed for the opinion dynamics model by Blondel et. al. can be recovered from our generic Lyapunov function. In addition to providing intuition about the dynamics of neighborhood consensus algorithms, our Lyapunov analysis is particularly useful for analysis of the infinite-dimensional case, where extensions of the combinatorial approaches may not be convenient or possible.

Published in:

Decision and Control, 2008. CDC 2008. 47th IEEE Conference on

Date of Conference:

9-11 Dec. 2008