Please use this identifier to cite or link to this item:
|Title:||Synchronization of discrete-time multi-agent systems on graphs using H2-Riccati design||Authors:||Lewis, Frank L.
|Keywords:||DRNTU::Engineering::Electrical and electronic engineering||Issue Date:||2012||Source:||Hengster-Movric, K., You, K., Lewis, F. L., & Xie, L. (2012). Synchronization of discrete-time multi-agent systems on graphs using H2-Riccati design. 2012 IEEE International Conference on Control Applications.||Abstract:||In this paper design methods are given for synchronization control of discrete-time multi-agent systems on directed communication graphs. The graph properties complicate the design of synchronization controllers due to the interplay between the eigenvalues of the graph Laplacian matrix and the required stabilizing gains. A method is given herein, based on an H2 type Riccati equation, that decouples the design of the synchronizing gains from the detailed graph properties. A condition for synchronization is given based on the relation of the graph eigenvalues to a bounded circular region in the complex plane that depends on the agent dynamics and the Riccati solution. This condition relates the Mahler measure of the node dynamics system matrix to the connectivity properties of the communication graph. The notion of `synchronizing region' is used. An example shows the effectiveness of these design methods for achieving synchronization in cooperative discrete-time systems.||URI:||https://hdl.handle.net/10356/98467
|DOI:||10.1109/CCA.2012.6402351||Rights:||© 2012 IEEE.||Fulltext Permission:||none||Fulltext Availability:||No Fulltext|
|Appears in Collections:||EEE Conference Papers|
checked on Aug 31, 2020
Page view(s) 50413
checked on Oct 21, 2020
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.