Abstract
In this chapter, we examine a networked multi-agent system running consensus susceptible to mis-information from its environment. The influenced dynamics are modeled with leader–follower dynamics and the impact of the foreign input is measures through the open loop \(\mathcal{H}_{2}\) norm of the network dynamics. To dampen the external disturbances a novel decentralized edge reweighting method is proposed. The method is composed of a decentralized conjugate gradient method coupled with a decentralized online optimization algorithm. The uncertainties of the effect of local rewiring and unknown environmental influences are demonstrated to be well-suited to the online regret framework. A simulation of the reweighting method is discussed and shown to have small regret.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
B. Bollobás, Modern Graph Theory. New York: Springer, 1998.
M. Mesbahi and M. Egerstedt, Graph Theoretic Methods in Multiagent Networks. Princeton: Princeton University Press, 2010.
R. A. Horn and C. R. Johnson, Matrix Analysis. New York: Cambridge University Press, 1990.
P. Barooah and J. P. Hespanha, “Graph effective resistance and distributed control: spectral properties and applications,” in Proc. 45th IEEE Conference on Decision and Control, 2006, pp. 3479–3485.
M. R. Hestenes and E. Stiefel, “Methods of conjugate gradients for solving linear systems,” Journal of Research of the National Bureau of Standards, vol. 49, pp. 409–436, 1952.
E. Hazan, A. Agarwal, and S. Kale, “Logarithmic regret algorithms for online convex optimization,” Machine Learning, vol. 69, no. 2–3, pp. 169–192, Aug. 2007.
D. Bertsekas, “Incremental gradient, subgradient, and proximal methods for convex optimization: A survey,” Optimization for Machine Learning, vol. 2010, no. December 2010, pp. 1–38, 2011.
F. Yan and S. Sundaram, “Distributed autonomous online learning: regrets and intrinsic privacy-preserving properties,” arXiv:1006.4039v3, pp. 1–24, 2010.
S. Sundhar Ram, A. Nedić, and V. V. Veeravalli, “Distributed Stochastic Subgradient Projection Algorithms for Convex Optimization,” Journal of Optimization Theory and Applications, vol. 147, no. 3, pp. 516–545, Jul. 2010.
M. Raginsky, N. Kiarashi, and R. Willett, “Decentralized online convex programming with local information,” in Proc. American Control Conference, 2011, pp. 5363–5369.
J. Nocedal and S. J. Wright, Numerical Optimization. New York: Springer, 2006.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Chapman, A. (2015). Distributed Online Topology Design for Disturbance Rejection. In: Semi-Autonomous Networks. Springer Theses. Springer, Cham. https://doi.org/10.1007/978-3-319-15010-9_4
Download citation
DOI: https://doi.org/10.1007/978-3-319-15010-9_4
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-15009-3
Online ISBN: 978-3-319-15010-9
eBook Packages: Physics and AstronomyPhysics and Astronomy (R0)