Graph Theoretic Methods in Multiagent Networks (eBook)

Magnus Egerstedt, Mehran Mesbahi (Autoren)

eBook Download: PDF | EPUB

2010
424 Seiten
Princeton University Press (Verlag)
978-1-4008-3535-5 (ISBN)

Infos

Mehran Mesbahi is associate professor of aeronautics and astronautics at the University of Washington. Magnus Egerstedt is associate professor of electrical and computer engineering at Georgia Institute of Technology.

---

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

Produkt-Details

• Erscheint lt. Verlag: 1.7.2010
• Reihe/Serie: Princeton Series in Applied Mathematics
• Reihe/Serie: Princeton Series in Applied Mathematics
• Zusatzinfo: 137 line illus.
• Verlagsort: Princeton
• Sprache: englisch
• Themenwelt: Mathematik / Informatik ► Mathematik ► Algebra
• Themenwelt: Mathematik / Informatik ► Mathematik ► Angewandte Mathematik
• Themenwelt: Mathematik / Informatik ► Mathematik ► Graphentheorie
• Themenwelt: Technik
• Schlagworte: Abstraction (software engineering) • Addition • Adjacency Matrix • Algebraic connectivity • algebraic graph theory • algorithm • Arborescence (graph theory) • Array data structure • Asymmetric graph • automorphism • bipartite graph • Cardinality • Cartesian Product • Characteristic Polynomial • Characterization (mathematics) • Circulant graph • cluster analysis • clustering coefficient • combinatorial optimization • combinatorial topology • combinatorics • complete graph • Computation • Computational resource • Computer Program • Connectivity (graph theory) • Consensus (computer science) • Controllability • Control Network • convex combination • Convex Optimization • corollary • Cycle graph • Cycle graph (algebra) • Cycle Space • Degree (graph theory) • Degree matrix • Diagonalizable matrix • Diagonal matrix • DIAMETER • Differentiable function • Dimension • directed graph • Distance-vector routing protocol • Division by zero • Dynamical system • Eigenvalues and Eigenvectors • Equation solving • Equilibrium Point • estimation • Estimator • existential quantification • expander graph • Expression (computer science) • extremal combinatorics • Extremal graph theory • Gabriel graph • Graph (discrete mathematics) • graph embedding • graph product • Graph property • graph theory • Hungarian algorithm • hypercube graph • Identity matrix • Incidence matrix • Information exchange • Initial Condition • Instance (computer science) • Interconnection • Intersection (set theory) • Invertible matrix • Iteration • johnson graph • Kalman Filter • Kronecker Product • Laplacian matrix • LaSalle's invariance principle • Least Squares • Linear least squares (mathematics) • Linear map • Linear Matrix Inequality • line graph • Lipschitz continuity • Lloyd's algorithm • LTI system theory • Lyapunov function • Lyapunov stability • Markov Chain • Mathematical Optimization • matrix exponential • Measurement • multi-agent system • Nash Equilibrium • Natural number • network architecture • network model • Network partition • network topology • Nonnegative Matrix • Norm (mathematics) • Notation • observability • optimal control • optimization problem • pairwise • Parameter • Parameter (computer programming) • Parity (mathematics) • Path graph • Permutation • Permutation Matrix • Petersen graph • planar graph • Positive-definite matrix • Positive semidefinite • Probability • product measure • Projection (linear algebra) • Proportionality (mathematics) • Quantity • Random geometric graph • random graph • Random Variable • Rate of Convergence • Recursion (computer science) • Requirement • result • Robotics • scientific notation • Sensor • Sign (mathematics) • simplicial complex • Special case • Spectral Graph theory • Stochastic matrix • Strongly connected component • Subset • Summation • Supergraph • Symmetric graph • Symmetric matrix • Systems Theory • Theorem • theory • topological graph theory • Topology • Unit interval • Upper and lower bounds • Variable (computer science) • Variable (mathematics) • Vector Space • Vertex (graph theory) • Without loss of generality
• ISBN-10: 1-4008-3535-6 / 1400835356
• ISBN-13: 978-1-4008-3535-5 / 9781400835355