Please use this identifier to cite or link to this item: https://hdl.handle.net/10419/323284 
Year of Publication: 
2025
Citation: 
[Journal:] Central European Journal of Operations Research [ISSN:] 1613-9178 [Volume:] 33 [Issue:] 2 [Publisher:] Springer Berlin Heidelberg [Place:] Berlin/Heidelberg [Year:] 2025 [Pages:] 585-607
Publisher: 
Springer Berlin Heidelberg, Berlin/Heidelberg
Abstract: 
Abstract We consider the problem of obtaining linear state feedback controllers to achieve consensus in a homogeneous network of general second-order discrete-time systems whose graph is directed. Consensus is achieved if certain polynomials associated with the closed-loop network are Schur stable. The coefficients of these polynomials depend on the eigenvalues of the network Laplacian matrix and can therefore be complex. This paper provides a new and simple proof and condition for a second-order polynomial with complex coefficients to be Schur. This condition was applied to obtain controllers which achieve consensus with a guaranteed rate of convergence. We show that consensus can always be achieved for marginally stable systems and discretized systems. Simple conditions for consensus achieving controllers are obtained when the Laplacian eigenvalues are all real. We also demonstrate how these results can be applied to some robust control problems.
Subjects: 
Consensus
Discrete-time systems
Schur polynomials
Robust control
Persistent Identifier of the first edition: 
Creative Commons License: 
cc-by Logo
Document Type: 
Article
Document Version: 
Published Version
Appears in Collections:

Files in This Item:
File
Size





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.