Introduction to Averaging Dynamics over Networks

 
 
Springer (Verlag)
  • erschienen am 25. August 2018
 
  • Buch
  • |
  • Softcover
  • |
  • XII, 135 Seiten
978-3-319-88532-2 (ISBN)
 

This book deals with averaging dynamics, a paradigmatic example of network based dynamics in multi-agent systems. The book presents all the fundamental results on linear averaging dynamics, proposing a unified and updated viewpoint of many models and convergence results scattered in the literature.

Starting from the classical evolution of the powers of a fixed stochastic matrix, the text then considers more general evolutions of products of a sequence of stochastic matrices, either deterministic or randomized. The theory needed for a full understanding of the models is constructed without assuming any knowledge of Markov chains or Perron-Frobenius theory. Jointly with their analysis of the convergence of averaging dynamics, the authors derive the properties of stochastic matrices. These properties are related to the topological structure of the associated graph, which, in the book's perspective, represents the communication between agents. Special attention is paid to how these properties scale as the network grows in size.

Finally, the understanding of stochastic matrices is applied to the study of other problems in multi-agent coordination: averaging with stubborn agents and estimation from relative measurements. The dynamics described in the book find application in the study of opinion dynamics in social networks, of information fusion in sensor networks, and of the collective motion of animal groups and teams of unmanned vehicles. Introduction to Averaging Dynamics over Networks will be of material interest to researchers in systems and control studying coordinated or distributed control, networked systems or multiagent systems and to graduate students pursuing courses in these areas.

Softcover reprint of the original 1st ed. 2018
  • Englisch
  • Cham
  • |
  • Schweiz
Springer International Publishing
  • Für Beruf und Forschung
  • 3
  • |
  • 5 farbige Tabellen, 19 s/w Abbildungen, 3 farbige Abbildungen
  • |
  • 5 Tables, color; 3 Illustrations, color; 19 Illustrations, black and white; XII, 135 p. 22 illus., 3 illus. in color.
  • Höhe: 23.5 cm
  • |
  • Breite: 15.5 cm
  • 321 gr
978-3-319-88532-2 (9783319885322)
10.1007/978-3-319-68022-4
weitere Ausgaben werden ermittelt
Fabio Fagnani got his Laurea degree in Mathematics from University of Pisa and from Scuola Normale Superiore of Pisa in 1986. He got the PhD in Mathematics from University of Groningen nel 1991. He has been Assistant professor of Mathematical Analysis at the Scuola Normale Superiore during 1991-1998 and in 1997 he has been visiting professor at MIT. Since 1998 he is with the Politecnico of Torino where he is currently (since 2002) full professor of Mathematical Analysis. He has acted as coordinator of the PhD program Mathematics for Engineering Sciences of Politecnico di Torino in the period 2006-2012. Since June 2012 he is the head of the Department of Mathematical Sciences'G. L. Lagrange' of Politecnico di Torino. His current research topics are on cooperative algorithms and dynamical systems over graphs, inferential distributed algorithms, and opinion dynamics. He has published over 50 refereed papers on international journals, he has delivered invited conferences in many international workshops and conferences and in many universities (including MIT, Yale, IMA, EPFL, UCSB, UCSD, CWI, University of Groningen, University of Kyoto). He is Associate Editor of IEEE Transactions on Network Systems and of the IEEE Transactions on Network Science and Engineering. He is member of the international program committee for the IFAC events NECSYS.

Paolo Frasca received the Ph.D. degree in Mathematics for Engineering Sciences from Politecnico di Torino, Torino, Italy, in 2009. Between 2008 and 2013, he held research and visiting positions at the University of California, Santa Barbara (USA), at the IAC-CNR (Rome, Italy), at the University of Salerno (Italy), and at the Politecnico di Torino. From 2013 to 2016, he was an Assistant Professor at the University of Twente in Enschede, the Netherlands. In October 2016 he joined the CNRS as a Researcher: he is currently affiliated with GIPSA-lab in Grenoble, France. His research interests are in the theory of network systems and cyber-physical systems, with applications to robotic, sensor, infrastructural, and social networks. On these topics, Dr. Frasca has (co)authored more than fifty journal and conference papers and has given invited talks at several international institutions and events, including the 2015 SICE International Symposium on Control Systems in Tokyo. He is a recipient of the 2013 SIAG/CST Best SICON Paper Prize. He has been a visiting professor at the LAAS, Toulouse, France, in 2016 and at the University of Cagliari, Italy, in 2017. Dr. Frasca has served in the Conference Editorial Boards of several events, including IEEE CDC, ACC, ECC, MTNS, IFAC NecSys, and is currently serving as Associate Editor for the International Journal of Robust and Nonlinear Control, the Asian Journal of Control, and the IEEE Control Systems Letters.
Graph Theory.- Averaging in Time-Invariant Networks.- Averaging in Time-Varying Networks.- Performance and Robustness of Averaging Algorithms.- Averaging with Exogenous Inputs and Electrical Networks.- Index.
"This book gives a nice, conscientious introduction to the theory of averaging dynamics over networks. ... The book is essentially self-contained. In particular, it does not assume any knowledge of Perron-Frobenius theory, or Markov chain convergence. Every chapter of the book is complemented by numerous exercises and bibliographical notes." ( Jiri Cerny, Mathematical Reviews, February, 2019)
 

"This book gives a nice, conscientious introduction to the theory of averaging dynamics over networks. ... The book is essentially self-contained. In particular, it does not assume any knowledge of Perron-Frobenius theory, or Markov chain convergence. Every chapter of the book is complemented by numerous exercises and bibliographical notes." ( Jiri Cerny, Mathematical Reviews, February, 2019)

This book deals with averaging dynamics, a paradigmatic example of network based dynamics in multi-agent systems. The book presents all the fundamental results on linear averaging dynamics, proposing a unified and updated viewpoint of many models and convergence results scattered in the literature.

Starting from the classical evolution of the powers of a fixed stochastic matrix, the text then considers more general evolutions of products of a sequence of stochastic matrices, either deterministic or randomized. The theory needed for a full understanding of the models is constructed without assuming any knowledge of Markov chains or Perron-Frobenius theory. Jointly with their analysis of the convergence of averaging dynamics, theauthors derive the properties of stochastic matrices. These properties are related to the topological structure of the associated graph, which, in the book's perspective, represents the communication between agents. Special attention is paid to how these properties scale as the network grows in size.

Finally, the understanding of stochastic matrices is applied to the study of other problems in multi-agent coordination: averaging with stubborn agents and estimation from relative measurements. The dynamics described in the book find application in the study of opinion dynamics in social networks, of information fusion in sensor networks, and of the collective motion of animal groups and teams of unmanned vehicles. Introduction to Averaging Dynamics over Networks will be of material interest to researchers in systems and control studying coordinated or distributed control, networked systems or multiagent systems and to graduate students pursuing courses in these areas.

Versand in 10-15 Tagen

117,69 €
inkl. 7% MwSt.
in den Warenkorb