Identification of sparse communication graphs in consensus networks

We consider the design of distributed controller architectures for undirected networks of single-integrators. In the presence of stochastic disturbances, we identify communication topologies that balance the variance amplification of the network with the number of communication links. This is achieved by solving a parameterized family of sparsity-promoting optimal control problems whose solution traces the optimal tradeoff curve that starts at the centralized controller and ends at the controller with sparse communication links. We show that the optimal control problem can be formulated as a semidefinite program whose global solution can be computed efficiently. An example is provided to illustrate the utility of the developed approach.

[1]  Magnus Egerstedt,et al.  Graph Theoretic Methods in Multiagent Networks , 2010, Princeton Series in Applied Mathematics.

[2]  Fu Lin,et al.  On the optimal localized feedback design for multi-vehicle systems , 2010, 49th IEEE Conference on Decision and Control (CDC).

[3]  Fu Lin,et al.  Algorithms for leader selection in large dynamical networks: Noise-free leaders , 2011, IEEE Conference on Decision and Control and European Control Conference.

[4]  Frank Allgöwer,et al.  Performance and design of cycles in consensus networks , 2013, Syst. Control. Lett..

[5]  Richard M. Murray,et al.  Consensus problems in networks of agents with switching topology and time-delays , 2004, IEEE Transactions on Automatic Control.

[6]  Fu Lin,et al.  Sparse feedback synthesis via the alternating direction method of multipliers , 2012, 2012 American Control Conference (ACC).

[7]  Naomi Ehrich Leonard,et al.  Robustness of noisy consensus dynamics with directed communication , 2010, Proceedings of the 2010 American Control Conference.

[8]  Fu Lin,et al.  Algorithms for leader selection in large dynamical networks: Noise-corrupted leaders , 2011, IEEE Conference on Decision and Control and European Control Conference.

[9]  Fu Lin,et al.  Performance of leader-follower networks in directed trees and lattices , 2012, 2012 IEEE 51st IEEE Conference on Decision and Control (CDC).

[10]  Bassam Bamieh,et al.  Leader selection for optimal network coherence , 2010, 49th IEEE Conference on Decision and Control (CDC).

[11]  Bassam Bamieh,et al.  Network coherence in fractal graphs , 2011, IEEE Conference on Decision and Control and European Control Conference.

[12]  Stephen P. Boyd,et al.  Growing Well-connected Graphs , 2006, Proceedings of the 45th IEEE Conference on Decision and Control.

[13]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[14]  Stephen P. Boyd,et al.  Distributed average consensus with least-mean-square deviation , 2007, J. Parallel Distributed Comput..

[15]  Fu Lin,et al.  On the optimal synchronization of oscillator networks via sparse interconnection graphs , 2012, 2012 American Control Conference (ACC).

[16]  Stephen P. Boyd,et al.  Enhancing Sparsity by Reweighted ℓ1 Minimization , 2007, 0711.1612.

[17]  Fu Lin,et al.  On the optimal dissemination of information in social networks , 2012, 2012 IEEE 51st IEEE Conference on Decision and Control (CDC).

[18]  Bassam Bamieh,et al.  Coherence in Large-Scale Networks: Dimension-Dependent Limitations of Local Feedback , 2011, IEEE Transactions on Automatic Control.

[19]  Mehran Mesbahi,et al.  Edge Agreement: Graph-Theoretic Performance Bounds and Passivity Analysis , 2011, IEEE Transactions on Automatic Control.

[20]  M. Fardad,et al.  Sparsity-promoting optimal control for a class of distributed systems , 2011, Proceedings of the 2011 American Control Conference.

[21]  Fu Lin,et al.  Optimal Control of Vehicular Formations With Nearest Neighbor Interactions , 2011, IEEE Transactions on Automatic Control.