Algorithms for Leader Selection in Stochastically Forced Consensus Networks

DOI10.1109/TAC.2014.2314223MaRDI QIDQ2983109zbMATH OpenOpenAlexFDO

Authors F. Lin, Makan Fardad, Mihailo R. Jovanović

Publication date 16 May 2017

Published in IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1302.0450

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Boolean programming (90C09) Semidefinite programming (90C22) Control/observation systems governed by ordinary differential equations (93C15)

Abstract: 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 (a node is either a leader or it is not) 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.

Cited in

(19)

• Leader selection problem for stochastically forced consensus networks based on matrix differentiation
• Influence minimization in linear threshold networks
• Performance of leader-follower multi-agent systems in directed networks
• Leader selection in networks under switching topologies with antagonistic interactions
• Minimum cost input/output design for large-scale linear structural systems
• Topology selection for multi-agent systems with opposite leaders
• Controller architectures: tradeoffs between performance and structure
• Noisy consensus dynamics in windmill-type graphs
• Nodes selection strategy in cooperative tracking problem
• Key-nodes selection problem for minimum cost control of directed networks
• scientific article; zbMATH DE number 7561256 (Why is no real title available?)
• Distributed randomized algorithms for opinion formation, centrality computation and power systems estimation: a tutorial overview
• Leader-follower coherence of the weighted recursive tree networks
• Leader-follower coherence in noisy ring-trees networks
• Spectrum computation and optimization for controllability Gramian of networked Laplacian systems with limited control placement
• Fast leader selection for opinion maximization in signed graphs
• A distributed framework for the minimum cost problem based on graph decomposition
• Structural robustness and optimization of leader-follower coherence in star-coupled networks
• The topological characteristics and robustness analysis for a class of fractal weighted networks

This page was built for publication: Algorithms for Leader Selection in Stochastically Forced Consensus Networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2983109)