Algorithms for leader selection in large dynamical networks: Noise-free leaders
- 1 December 2011
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 01912216,p. 7188-7193
Abstract
We consider networks of single-integrator systems, where it is desired to optimally assign a predetermined number of systems to act as leaders. Performance is measured in terms of the ℋ 2 norm of the overall network, and the leaders are assumed to always follow their desired state trajectories. We demonstrate that, after applying a sequence of relaxations, the problem can be formulated as a semidefinite program and thus solved efficiently. We compare the results of our algorithms against others reported in the literature. Finally, we interpret the leader selection problem in terms of electrical networks and Kron reduction theory.Keywords
This publication has 12 references indexed in Scilit:
- Algorithms for leader selection in large dynamical networks: Noise-corrupted leaders2011
- Leader selection for optimal network coherence2010
- Sensor Selection via Convex OptimizationIEEE Transactions on Signal Processing, 2008
- Enhancing Sparsity by Reweighted ℓ 1 MinimizationJournal of Fourier Analysis and Applications, 2008
- Minimizing Effective Resistance of a GraphSIAM Review, 2008
- Stable signal recovery from incomplete and inaccurate measurementsCommunications on Pure and Applied Mathematics, 2006
- Growing Well-connected Graphs2006
- A cone complementarity linearization algorithm for static output-feedback and related problemsIEEE Transactions on Automatic Control, 1997
- Semidefinite ProgrammingSIAM Review, 1996
- Linear Matrix Inequalities in System and Control Theory1994