Strict Lyapunov functions for consensus under directed connected graphs - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2020

Strict Lyapunov functions for consensus under directed connected graphs

Résumé

It is known that for consensus of systems interconnected under a general directed graph topology a necessary and sufficient condition for consensus is that there exist at least one rooted spanning tree. In this paper we present an original statement of linear algebra that serves to characterise the spanning-tree condition for directed graphs in terms of a Lyapunov equation involving the graph's Laplacian. Our results apply to the case of systems described by simple first and second order integrators. As a result, we provide strict Lyapunov functions that ensure, via direct constructive proof, global exponential stability of the consensus manifold.

Domaines

Automatique
Fichier principal
Vignette du fichier
v1_ecc2020_lena.pdf (103.1 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03101555 , version 1 (07-01-2021)

Identifiants

Citer

Elena Panteley, Antonio Loria, Srikant Sukumar. Strict Lyapunov functions for consensus under directed connected graphs. ECC 2020 - European Control Conference, May 2020, St. Petersbourg, Russia. ⟨10.23919/ecc51009.2020.9143719⟩. ⟨hal-03101555⟩
24 Consultations
399 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More