Algorithms for Leader Selection in Stochastically Forced Consensus Networks

We are interested in assigning a pre-specified number of nodes as leaders in order to minimize the mean-square deviation from consensus in stochastically forced networks. This problem arises in several applications including control of vehicular formations and localization in sensor networks. For networks with leaders subject to noise, we show that the Boolean constraints (which indicate whether a node is a leader) are the only source of nonconvexity. By relaxing these constraints to their convex hull we obtain a lower bound on the global optimal value. We also use a simple but efficient greedy algorithm to identify leaders and to compute an upper bound. For networks with leaders that perfectly follow their desired trajectories, we identify an additional source of nonconvexity in the form of a rank constraint. Removal of the rank constraint and relaxation of the Boolean constraints yields a semidefinite program for which we develop a customized algorithm well-suited for large networks. Several examples ranging from regular lattices to random graphs are provided to illustrate the effectiveness of the developed algorithms.

[1]  Radha Poovendran,et al.  On leader selection for performance and controllability in multi-agent systems , 2012, 2012 IEEE 51st IEEE Conference on Decision and Control (CDC).

[2]  J. Hespanha,et al.  Estimation on Graphs from Relative Measurements Distributed algorithms and fundamental limits , 2022 .

[3]  D. Spielman.  Algorithms, Graph Theory, and Linear Equations in Laplacian Matrices , 2011 .

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

[5]  Karl Henrik Johansson,et al.  A graph-theoretic approach on optimizing informed-node selection in multi-agent tracking control , 2014 .

[6]  Basel Alomair,et al.  Leader selection in multi-agent systems for smooth convergence via fast mixing , 2012, 2012 IEEE 51st IEEE Conference on Decision and Control (CDC).

[7]  L. Ghaoui,et al.  A cone complementarity linearization algorithm for static output-feedback and related problems , 1997, IEEE Trans. Autom. Control..

[8]  Radha Poovendran,et al.  A submodular optimization framework for leader selection in linear multi-agent systems , 2011, IEEE Conference on Decision and Control and European Control Conference.

[9]  Brian W. Kernighan,et al.  An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..

[10]  Fu Lin,et al.  On new characterizations of social influence in social networks , 2013, 2013 American Control Conference.

[11]  Ruggero Carli,et al.  Communication constraints in the average consensus problem , 2008, Autom..

[12]  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.

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

[14]  Zhi-Quan Luo,et al.  Distributed sensor network localization using SOCP relaxation , 2008, IEEE Transactions on Wireless Communications.

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

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

[17]  Naomi Ehrich Leonard,et al.  Information centrality and optimal leader selection in noisy networks , 2013, 52nd IEEE Conference on Decision and Control.

[18]  Zhi-Quan Luo,et al.  Efficient Implementation of Quasi- Maximum-Likelihood Detection Based on Semidefinite Relaxation , 2009, IEEE Transactions on Signal Processing.

[19]  Jacques E. Boillat,et al.  Load Balancing and Poisson Equation in a Graph , 1990, Concurr. Pract. Exp..

[20]  Stephen P. Boyd,et al.  Proximal Algorithms , 2013, Found. Trends Optim..

[21]  Stephen P. Boyd,et al.  Sensor Selection via Convex Optimization , 2009, IEEE Transactions on Signal Processing.

[22]  Naomi Ehrich Leonard,et al.  Node Classification in Networks of Stochastic Evidence Accumulators , 2012, ArXiv.

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

[24]  Radha Poovendran,et al.  A Supermodular Optimization Framework for Leader Selection Under Link Noise in Linear Multi-Agent Systems , 2012, IEEE Transactions on Automatic Control.

[25]  George Cybenko,et al.  Dynamic Load Balancing for Distributed Memory Multiprocessors , 1989, J. Parallel Distributed Comput..

[26]  Stephen P. Boyd,et al.  Minimizing Effective Resistance of a Graph , 2008, SIAM Rev..

[27]  E. Candès,et al.  Stable signal recovery from incomplete and inaccurate measurements , 2005, math/0503066.

[28]  Luc Moreau,et al.  Stability of multiagent systems with time-dependent communication links , 2005, IEEE Transactions on Automatic Control.

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

[30]  Guangming Xie,et al.  Controllability of a Leader–Follower Dynamic Network With Switching Topology , 2008, IEEE Transactions on Automatic Control.

[31]  J. Hespanha,et al.  Estimation on graphs from relative measurements , 2007, IEEE Control Systems.

[32]  Frank Allgöwer,et al.  Cycles and sparse design of consensus networks , 2012, 2012 IEEE 51st IEEE Conference on Decision and Control (CDC).

[33]  Jie Lin,et al.  Coordination of groups of mobile autonomous agents using nearest neighbor rules , 2003, IEEE Trans. Autom. Control..

[34]  Stephen P. Boyd,et al.  Fastest Mixing Markov Chain on Graphs with Symmetries , 2007, SIAM J. Optim..

[35]  D. Luenberger.  Optimization by Vector Space Methods , 1968 .

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

[37]  Matthew O. Jackson,et al.  Naïve Learning in Social Networks and the Wisdom of Crowds , 2010 .

[38]  João Pedro Hespanha,et al.  Estimation From Relative Measurements: Electrical Analogy and Large Graphs , 2008, IEEE Transactions on Signal Processing.

[39]  M. Newman,et al.  Finding community structure in networks using the eigenvectors of matrices. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

[40]  Zhen Wang,et al.  Interconnection topologies for multi-agent coordination under leader-follower framework , 2009, Autom..

[41]  Francesco Bullo,et al.  Controllability Metrics and Algorithms for Complex Networks , 2013, ArXiv.

[42]  Yunmei Chen,et al.  Projection Onto A Simplex , 2011, 1101.6081.

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

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

[45]  Magnus Egerstedt,et al.  Leader selection via the manipulability of leader-follower networks , 2012, 2012 American Control Conference (ACC).

[46]  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.

[47]  Magnus Egerstedt,et al.  Controllability of Multi-Agent Systems from a Graph-Theoretic Perspective , 2009, SIAM J. Control. Optim..

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

[49]  D K Smith,et al.  Numerical Optimization , 2001, J. Oper. Res. Soc..

[50]  H.G. Tanner,et al.  On the controllability of nearest neighbor interconnections , 2004, 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601).

[51]  Zhi-Quan Luo,et al.  Semidefinite Relaxation of Quadratic Optimization Problems , 2010, IEEE Signal Processing Magazine.

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

[53]  M. Degroot.  Reaching a Consensus , 1974 .

[54]  Radha Poovendran,et al.  Joint leader and link weight selection for fast convergence in multi-agent systems , 2013, 2013 American Control Conference.

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

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

[57]  J. Meyer.  Generalized Inversion of Modified Matrices , 1973 .

[58]  Stephen P. Boyd,et al.  Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers , 2011, Found. Trends Mach. Learn..

[59]  Magnus Egerstedt,et al.  A tight lower bound on the controllability of networks with multiple leaders , 2012, 2012 IEEE 51st IEEE Conference on Decision and Control (CDC).