A data-driven approach for influencing consensus networks

In this paper, we examine data-driven aspects of consensus networks influenced by a stubborn agent. In particular we show that the judicious placement of the stubborn agent can be achieved based on snapshots of the data generated by the network through estimating the appropriate eigenvector of the perturbed Laplacian matrix. The exact dynamic mode decomposition algorithm is employed for estimating the spectral properties of the network and we show that the dominant eigenvector can be determined if the rank of data snapshots is equal to the number of eigenvalue clusters of the perturbed Laplacian. Lastly, for large-scale networks, we provide a simple data-driven algorithm for approximating the spectral properties of the network.

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

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

[3]  Peter J. Schmid,et al.  Sparsity-promoting dynamic mode decomposition , 2012, 1309.4165.

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

[5]  E.M. Atkins,et al.  A survey of consensus problems in multi-agent coordination , 2005, Proceedings of the 2005, American Control Conference, 2005..

[6]  Britta Ruhnau,et al.  Eigenvector-centrality - a node-centrality? , 2000, Soc. Networks.

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

[8]  Steven L. Brunton,et al.  Compressive sampling and dynamic mode decomposition , 2013, 1312.5186.

[9]  P. Barooah,et al.  Graph Effective Resistance and Distributed Control: Spectral Properties and Applications , 2006, Proceedings of the 45th IEEE Conference on Decision and Control.

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

[11]  W. Zachary,et al.  An Information Flow Model for Conflict and Fission in Small Groups , 1977, Journal of Anthropological Research.

[12]  Mehran Mesbahi,et al.  Degree of relative influence for consensus-type networks , 2014, 2014 American Control Conference.

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

[14]  P. Schmid,et al.  Dynamic mode decomposition of numerical and experimental data , 2008, Journal of Fluid Mechanics.

[15]  Kamesh Munagala,et al.  Data-Driven Processing in Sensor Networks , 2007, CIDR.

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

[17]  Shreyas Sundaram,et al.  Spectral properties of the grounded Laplacian matrix with applications to consensus in the presence of stubborn agents , 2014, 2014 American Control Conference.

[18]  Steven L. Brunton,et al.  On dynamic mode decomposition: Theory and applications , 2013, 1312.0041.

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

[20]  Mehran Mesbahi,et al.  Semi-Autonomous Consensus: Network Measures and Adaptive Trees , 2013, IEEE Transactions on Automatic Control.