Abstract
Smooth convergence ensures that the networked nodes converge to their desired states with minimal delay and error in their intermediate states. A submodular optimization approach to smooth convergence in networked systems is presented in this chapter. The approach is based on identifying connections between the system dynamics and the statistics of a random walk on the network, and is developed for static and dynamic networks. The problem of minimizing convergence error when the topology dynamics are unknown is discussed, including bounds on the worst-case error and online optimization algorithms with provable guarantees.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Bettstetter, C., Resta, G., Santi, P.: The node distribution of the random waypoint mobility model for wireless ad hoc networks. IEEE Trans. Mob. Comput. 2(3), 257–269 (2003)
Boyd, S., Ghosh, A., Prabhakar, B., Shah, D.: Randomized gossip algorithms. IEEE Trans. Inf. Theory 52(6), 2508–2530 (2006)
Clark, A., Alomair, B., Bushnell, L., Poovendran, R.: Minimizing convergence error in multi-agent systems via leader selection: a supermodular optimization approach. IEEE Trans. Autom. Control 59(6), 1480–1494 (2014)
Clark, A., Bushnell, L., Poovendran, R.: Leader selection for minimizing convergence error in leader-follower systems: a supermodular optimization approach. In: 10th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks (WiOpt), pp. 111–115 (2012)
Clark, A., Bushnell, L., Poovendran, R.: Joint leader and weight selection for fast convergence in multi-agent systems. In: Proceedings of the American Control Conference (ACC), pp. 3751–3757 (2013)
Freund, Y., E. Schapire, R.: A desicion-theoretic generalization of on-line learning and an application to boosting. Computational Learning Theory, pp. 23–37. Springer, Berlin (1995)
Ghosh, A., Boyd, S.: Growing well-connected graphs. In: 45th IEEE Conference on Decision and Control, pp. 6605–6611 (2006)
Hatano, Y., Mesbahi, M.: Agreement over random networks. IEEE Trans. Autom. Control 50(11), 1867–1872 (2005)
Kar, S., Moura, J.M.: Consensus+ innovations distributed inference over networks: cooperation and sensing in networked systems. IEEE Signal Process. Mag. 30(3), 99–109 (2013)
Notarstefano, G., Egerstedt, M., Haque, M.: Containment in leader-follower networks with switching communication topologies. Automatica 47(5), 1035–1040 (2011)
Olfati-Saber, R., Murray, R.: Consensus problems in networks of agents with switching topology and time-delays. IEEE Trans. Autom. Control 49(9), 1520–1533 (2004)
Olshevsky, A., Tsitsiklis, J.N.: Convergence speed in distributed consensus and averaging. SIAM J. Control Optim. 48(1), 33–55 (2009)
Pasqualetti, F., Martini, S., Bicchi, A.: Steering a leader-follower team via linear consensus. In: Egerstedt, M., Mishra, B. (eds.) HSCC 2008. LNCS, vol. 4981, pp. 642–645. Springer, Heidelberg (2008)
Pirani, M., Sundaram, S.: Spectral properties of the grounded laplacian matrix with applications to consensus in the presence of stubborn agents. American Control Conference (ACC), pp. 2160–2165 (2014)
Rahmani, A., Ji, M., Mesbahi, M., Egerstedt, M.: Controllability of multi-agent systems from a graph-theoretic perspective. SIAM J. Control Optim. 48(1), 162–186 (2009)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Clark, A., Alomair, B., Bushnell, L., Poovendran, R. (2016). Submodular Optimization for Smooth Convergence. In: Submodularity in Dynamics and Control of Networked Systems. Communications and Control Engineering. Springer, Cham. https://doi.org/10.1007/978-3-319-26977-1_5
Download citation
DOI: https://doi.org/10.1007/978-3-319-26977-1_5
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-26975-7
Online ISBN: 978-3-319-26977-1
eBook Packages: EngineeringEngineering (R0)