Graph Theoretic Methods in Multiagent Networks
Regular price
€90.99
A01=Magnus Egerstedt
A01=Mehran Mesbahi
Abstraction (software engineering)
Adjacency matrix
Algebraic connectivity
Algebraic graph theory
Algorithm
Arborescence (graph theory)
Asymmetric graph
Author_Magnus Egerstedt
Author_Mehran Mesbahi
Automorphism
Bipartite graph
Cartesian product
Category=PBV
Characterization (mathematics)
Circulant graph
Combinatorial optimization
Combinatorial topology
Combinatorics
Complete graph
Computational resource
Connectivity (graph theory)
Controllability
Cycle graph
Cycle graph (algebra)
Degree (graph theory)
Degree matrix
Diagonalizable matrix
Directed graph
Distance-vector routing protocol
Eigenvalues and eigenvectors
eq_isMigrated=1
eq_isMigrated=2
eq_nobargain
Estimation
Expander graph
Extremal combinatorics
Extremal graph theory
Gabriel graph
Graph (discrete mathematics)
Graph embedding
Graph product
Graph property
Graph theory
Hypercube graph
Identity matrix
Incidence matrix
Instance (computer science)
Intersection (set theory)
Johnson graph
Kalman filter
Line graph
Lloyd's algorithm
LTI system theory
Lyapunov function
Markov chain
Mathematical optimization
Network model
Network topology
Norm (mathematics)
Optimal control
Optimization problem
Path graph
Permutation matrix
Petersen graph
Planar graph
Proportionality (mathematics)
Random geometric graph
Random graph
Recursion (computer science)
Simplicial complex
Stochastic matrix
Symmetric graph
Theorem
Topological graph theory
Variable (computer science)
Vertex (graph theory)
Product details
- ISBN 9780691140612
- Weight: 794g
- Dimensions: 152 x 235mm
- Publication Date: 21 Jul 2010
- Publisher: Princeton University Press
- Publication City/Country: US
- Product Form: Hardback
Secure
checkout
Fast Shipping
Easy returns
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
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.
