Synchronization of discrete-time multi-agent systems on graphs using H2-Riccati design
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 requi...
Saved in:
| Main Authors: | , , , |
|---|---|
| Other Authors: | |
| Format: | Conference or Workshop Item |
| Language: | English |
| Published: |
2013
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/10356/98467 http://hdl.handle.net/10220/12485 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Nanyang Technological University |
| Language: | English |
| Summary: | 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. |
|---|