Spectral radius minimization for optimal average consensus and output feedback stabilization

Kim, Yoonsoo, Gu, Da-Wei and Postlethwaite, Ian (2009) Spectral radius minimization for optimal average consensus and output feedback stabilization. Automatica, 45 (6). pp. 1379-1386. ISSN 0005-1098

Full text not available from this repository. (Request a copy)
Official URL: http://dx.doi.org/10.1016/j.automatica.2009.02.001


In this paper, we consider two problems which can be posed as spectral radius minimization problems. Firstly, we consider the fastest average agreement problem on multi-agent networks adopting a linear information exchange protocol. Mathematically, this problem can be cast as finding an optimal such that x(k+1)=Wx(k), , and . Here, is the value possessed by the agents at the kth time step, is an all-one vector and is the set of real matrices in with zeros at the same positions specified by a network graph , where is the set of agents and is the set of communication links between agents. The optimal W is such that the spectral radius is minimized. To this end, we consider two numerical solution schemes: one using the qth-order spectral norm (2-norm) minimization (q-SNM) and the other gradient sampling (GS), inspired by the methods proposed in [Burke, J., Lewis, A., & Overton, M. (2002). Two numerical methods for optimizing matrix stability. Linear Algebra and its Applications, 351–352, 117–145; Xiao, L., & Boyd, S. (2004). Fast linear iterations for distributed averaging. Systems & Control Letters, 53(1), 65–78]. In this context, we theoretically show that when is symmetric, i.e. no information flow from the ith to the jth agent implies no information flow from the jth to the ith agent, the solution from the 1-SNM method can be chosen to be symmetric and is a local minimum of the function . Numerically, we show that the q-SNM method performs much better than the GS method when is not symmetric. Secondly, we consider the famous static output feedback stabilization problem, which is considered to be a hard problem (some think NP-hard): for a given linear system (A,B,C), find a stabilizing control gain K such that all the real parts of the eigenvalues of A+BKC are strictly negative. In spite of its computational complexity, we show numerically that q-SNM successfully yields stabilizing controllers for several benchmark problems with little effort.

Item Type: Article
Uncontrolled Keywords: distributed control, communication networks
Subjects: H300 Mechanical Engineering
Department: Faculties > Engineering and Environment > Mathematics, Physics and Electrical Engineering
Depositing User: EPrint Services
Date Deposited: 10 May 2010 14:26
Last Modified: 31 Jul 2021 08:38
URI: http://nrl.northumbria.ac.uk/id/eprint/46

Actions (login required)

View Item View Item


Downloads per month over past year

View more statistics