Convex conditions on decentralized control for graph topology preservation - SYSCO Accéder directement au contenu
Article Dans Une Revue IEEE Transactions on Automatic Control Année : 2014

Convex conditions on decentralized control for graph topology preservation

Résumé

The paper focuses on the preservation of a given graph topology which is usually chosen to ensure its connectivity. This is an essential ingredient allowing interconnected systems to accomplish tasks by using decentralized control strategies. We consider a networked system with discrete-time dynamics in which the subsystems are able to communicate if an algebraic relation between their states is satisfied. Each subsystem is called agent and the connected subsystems are called neighbors. The agents update their state in a decentralized manner by taking into account the neighbors' states. The characterization of the local control feedback gains ensuring topology preservation is provided. The results are based on invariance and set-theory and yield to conditions in Linear Matrix Inequality (LMI) form. The conditions for topology preservation are applied to an illustrative example concerning partial state consensus of agents with double integrator dynamics.
Fichier principal
Vignette du fichier
SetTheoryControl_FINAL.pdf (99.14 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00920914 , version 1 (19-12-2013)

Identifiants

Citer

Mirko Fiacchini, Irinel-Constantin Morarescu. Convex conditions on decentralized control for graph topology preservation. IEEE Transactions on Automatic Control, 2014, 59 (6), pp.1640-1645. ⟨10.1109/TAC.2013.2292719⟩. ⟨hal-00920914⟩
349 Consultations
180 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More