Riccati Design for Synchronization of Discrete-Time Systems
- 3.9k Downloads
In this chapter, design methods are given for synchronization control of discrete-time multi-agent systems on directed communication graphs. The graph is assumed to have fixed topology and contain a spanning tree. 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 that decouples the design of the synchronizing feedback gains from the detailed graph properties. It is based on computation of the agent feedback gains using a local Riccati equation design. Conditions are given for synchronization 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. The notion of ‘synchronization region’ is used. Convergence to consensus and robustness properties are investigated. This chapter also investigates the design of distributed observers for identical agents using a local Riccati design. A cooperative observer design guaranteeing convergence of the estimates of all agents to their actual states is proposed. The notion of a convergence region for distributed observers on graphs is introduced.
KeywordsTracking Error Riccati Equation Feedback Gain Communication Graph Control Node
- 4.Hengster-Movric K, You K, Lewis FL, Xie L (2013) Synchronization of discrete-time multi-agent systems on graphs using riccati design. Automatica, vol. 49(2):414–423Google Scholar
- 6.Li Z, Duan Z, Chen G, Huang L (2010) Consensus of multiagent systems and synchronization of complex networks: a unified viewpoint. IEEE Trans Circuits Syst I, Reg papers, 57(1):213–224Google Scholar
- 7.Li Z, Duan Z, Chen G (2011) Consensus of discrete-time linear multi-agent systems with observer-type protocols. Discrete and Continuous Dynamical Systems, Series B 16(2):489–505Google Scholar