Graph Theoretic Methods in Multiagent Networks / / Mehran Mesbahi, Magnus Egerstedt.

This accessible book provides an introduction to the analysis and design of dynamic multiagent networks. Such networks are of great interest in a wide range of areas in science and engineering, including: mobile sensor networks, distributed robotics such as formation flying and swarming, quantum net...

Full description

Saved in:
Bibliographic Details
Superior document:Title is part of eBook package: De Gruyter Princeton Series in Applied Mathematics eBook-Package
VerfasserIn:
Place / Publishing House:Princeton, NJ : : Princeton University Press, , [2010]
©2010
Year of Publication:2010
Edition:Course Book
Language:English
Series:Princeton Series in Applied Mathematics ; 33
Online Access:
Physical Description:1 online resource (424 p.) :; 137 line illus.
Tags: Add Tag
No Tags, Be the first to tag this record!
LEADER 08854nam a22019575i 4500
001 9781400835355
003 DE-B1597
005 20220131112047.0
006 m|||||o||d||||||||
007 cr || ||||||||
008 220131t20102010nju fo d z eng d
020 |a 9781400835355 
024 7 |a 10.1515/9781400835355  |2 doi 
035 |a (DE-B1597)446776 
035 |a (OCoLC)979968498 
040 |a DE-B1597  |b eng  |c DE-B1597  |e rda 
041 0 |a eng 
044 |a nju  |c US-NJ 
050 4 |a T57.85  |b .M43 2010eb 
072 7 |a MAT003000  |2 bisacsh 
082 0 4 |a 006.3 
100 1 |a Mesbahi, Mehran,   |e author.  |4 aut  |4 http://id.loc.gov/vocabulary/relators/aut 
245 1 0 |a Graph Theoretic Methods in Multiagent Networks /  |c Mehran Mesbahi, Magnus Egerstedt. 
250 |a Course Book 
264 1 |a Princeton, NJ :   |b Princeton University Press,   |c [2010] 
264 4 |c ©2010 
300 |a 1 online resource (424 p.) :  |b 137 line illus. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 0 |a Princeton Series in Applied Mathematics ;  |v 33 
505 0 0 |t Frontmatter --   |t Contents --   |t Preface --   |t Notation --   |t PART 1. FOUNDATIONS --   |t Chapter 1. Introduction --   |t Chapter 2. Graph Theory --   |t Chapter 3. The Agreement Protocol: Part I-The Static Case --   |t Chapter 4. The Agreement Protocol: Part II-Lyapunov and LaSalle --   |t Chapter 5. Probabilistic Analysis of Networks and Protocols --   |t PART 2. MULTIAGENT NETWORKS --   |t Chapter 6. Formation Control --   |t Chapter 7. Mobile Robots --   |t Chapter 8. Distributed Estimation --   |t Chapter 9. Social Networks, Epidemics, and Games --   |t PART 3. NETWORKS AS SYSTEMS --   |t Chapter 10. Agreement with Inputs and Outputs --   |t Chapter 11. Synthesis of Networks --   |t Chapter 12. Dynamic Graph Processes --   |t Chapter 13. Higher-order Networks --   |t Appendix A. --   |t Bibliography --   |t Index 
506 0 |a restricted access  |u http://purl.org/coar/access_right/c_16ec  |f online access with authorization  |2 star 
520 |a This accessible book provides an introduction to the analysis and design of dynamic multiagent networks. Such networks are of great interest in a wide range of areas in science and engineering, including: mobile sensor networks, distributed robotics such as formation flying and swarming, quantum networks, networked economics, biological synchronization, and social networks. Focusing on graph theoretic methods for the analysis and synthesis of dynamic multiagent networks, the book presents a powerful new formalism and set of tools for networked systems. The book's three sections look at foundations, multiagent networks, and networks as systems. The authors give an overview of important ideas from graph theory, followed by a detailed account of the agreement protocol and its various extensions, including the behavior of the protocol over undirected, directed, switching, and random networks. They cover topics such as formation control, coverage, distributed estimation, social networks, and games over networks. And they explore intriguing aspects of viewing networks as systems, by making these networks amenable to control-theoretic analysis and automatic synthesis, by monitoring their dynamic evolution, and by examining higher-order interaction models in terms of simplicial complexes and their applications. The book will interest graduate students working in systems and control, as well as in computer science and robotics. It will be a standard reference for researchers seeking a self-contained account of system-theoretic aspects of multiagent networks and their wide-ranging applications. This book has been adopted as a textbook at the following universities: ? University of Stuttgart, Germany Royal Institute of Technology, Sweden Johannes Kepler University, Austria Georgia Tech, USA University of Washington, USA Ohio University, USA 
530 |a Issued also in print. 
538 |a Mode of access: Internet via World Wide Web. 
546 |a In English. 
588 0 |a Description based on online resource; title from PDF title page (publisher's Web site, viewed 31. Jan 2022) 
650 0 |a Multiagent systems  |x Mathematical models. 
650 0 |a Network analysis (Planning)  |v Graphic methods. 
650 0 |a Network analysis (Planning)  |x Graphic methods. 
650 7 |a MATHEMATICS / Applied.  |2 bisacsh 
653 |a Addition. 
653 |a Adjacency matrix. 
653 |a Algebraic graph theory. 
653 |a Algorithm. 
653 |a Automorphism. 
653 |a Bipartite graph. 
653 |a Cardinality. 
653 |a Cartesian product. 
653 |a Circulant graph. 
653 |a Combinatorics. 
653 |a Complete graph. 
653 |a Computation. 
653 |a Connectivity (graph theory). 
653 |a Controllability. 
653 |a Convex combination. 
653 |a Corollary. 
653 |a Cycle graph (algebra). 
653 |a Cycle space. 
653 |a Degree (graph theory). 
653 |a Degree matrix. 
653 |a Diagonal matrix. 
653 |a Diameter. 
653 |a Differentiable function. 
653 |a Dimension. 
653 |a Directed graph. 
653 |a Division by zero. 
653 |a Dynamical system. 
653 |a Eigenvalues and eigenvectors. 
653 |a Equilibrium point. 
653 |a Estimation. 
653 |a Estimator. 
653 |a Existential quantification. 
653 |a Extremal graph theory. 
653 |a Graph (discrete mathematics). 
653 |a Graph theory. 
653 |a Identity matrix. 
653 |a Incidence matrix. 
653 |a Information exchange. 
653 |a Initial condition. 
653 |a Interconnection. 
653 |a Iteration. 
653 |a Kalman filter. 
653 |a Kronecker product. 
653 |a LTI system theory. 
653 |a LaSalle's invariance principle. 
653 |a Laplacian matrix. 
653 |a Least squares. 
653 |a Line graph. 
653 |a Linear map. 
653 |a Lipschitz continuity. 
653 |a Lyapunov function. 
653 |a Lyapunov stability. 
653 |a Markov chain. 
653 |a Mathematical optimization. 
653 |a Matrix exponential. 
653 |a Measurement. 
653 |a Multi-agent system. 
653 |a Nash equilibrium. 
653 |a Natural number. 
653 |a Network topology. 
653 |a Nonnegative matrix. 
653 |a Notation. 
653 |a Observability. 
653 |a Optimal control. 
653 |a Optimization problem. 
653 |a Pairwise. 
653 |a Parameter. 
653 |a Path graph. 
653 |a Permutation matrix. 
653 |a Permutation. 
653 |a Positive semidefinite. 
653 |a Positive-definite matrix. 
653 |a Probability. 
653 |a Quantity. 
653 |a Random graph. 
653 |a Random variable. 
653 |a Rate of convergence. 
653 |a Requirement. 
653 |a Result. 
653 |a Robotics. 
653 |a Scientific notation. 
653 |a Sensor. 
653 |a Sign (mathematics). 
653 |a Simplicial complex. 
653 |a Special case. 
653 |a Spectral graph theory. 
653 |a Stochastic matrix. 
653 |a Strongly connected component. 
653 |a Subset. 
653 |a Summation. 
653 |a Supergraph. 
653 |a Symmetric matrix. 
653 |a Systems theory. 
653 |a Theorem. 
653 |a Theory. 
653 |a Unit interval. 
653 |a Upper and lower bounds. 
653 |a Variable (mathematics). 
653 |a Vector space. 
653 |a Without loss of generality. 
700 1 |a Egerstedt, Magnus,   |e author.  |4 aut  |4 http://id.loc.gov/vocabulary/relators/aut 
773 0 8 |i Title is part of eBook package:  |d De Gruyter  |t Princeton Series in Applied Mathematics eBook-Package  |z 9783110515831  |o ZDB-23-PAM 
773 0 8 |i Title is part of eBook package:  |d De Gruyter  |t Princeton University Press eBook-Package Backlist 2000-2013  |z 9783110442502 
776 0 |c print  |z 9780691140612 
856 4 0 |u https://doi.org/10.1515/9781400835355 
856 4 0 |u https://www.degruyter.com/isbn/9781400835355 
856 4 2 |3 Cover  |u https://www.degruyter.com/document/cover/isbn/9781400835355/original 
912 |a 978-3-11-044250-2 Princeton University Press eBook-Package Backlist 2000-2013  |c 2000  |d 2013 
912 |a EBA_BACKALL 
912 |a EBA_CL_MTPY 
912 |a EBA_EBACKALL 
912 |a EBA_EBKALL 
912 |a EBA_ECL_MTPY 
912 |a EBA_EEBKALL 
912 |a EBA_ESTMALL 
912 |a EBA_PPALL 
912 |a EBA_STMALL 
912 |a GBV-deGruyter-alles 
912 |a PDA12STME 
912 |a PDA13ENGE 
912 |a PDA18STMEE 
912 |a PDA5EBK 
912 |a ZDB-23-PAM