Submodular Optimization for Consensus Networks With Noise-Corrupted Leaders

DOI10.1109/TAC.2018.2874306MaRDI QIDQ5223823zbMATH OpenOpenAlexWikidataFDO

Authors Erika MacKin, Stacy Patterson

Publication date 18 July 2019

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

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

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Design techniques (robust design, computer-aided design, etc.) (93B51) Stochastic systems in control theory (general) (93E03)

Abstract: We consider the leader selection problem in a network with consensus dynamics where both leader and follower agents are subject to stochastic external disturbances. The performance of the system is quantified by the total steady-state variance of the node states, and the goal is to identify the set of leaders that minimizes this variance. We first show that this performance measure can be expressed as a submodular set function over the nodes in the network. We then use this result to analyze the performance of two greedy, polynomial-time algorithms for leader selection, showing that the leader sets produced by the greedy algorithms are within provable bounds of optimal.

Cited in

(2)

• Leader selection in networks under switching topologies with antagonistic interactions
• Fast leader selection for opinion maximization in signed graphs

This page was built for publication: Submodular Optimization for Consensus Networks With Noise-Corrupted Leaders

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