* Affiliatelinks/Werbelinks
Links auf reinlesen.de sind sogenannte Affiliate-Links. Wenn du auf so einen Affiliate-Link klickst und über diesen Link einkaufst, bekommt reinlesen.de von dem betreffenden Online-Shop oder Anbieter eine Provision. Für dich verändert sich der Preis nicht.
Graph Theoretic Methods in Multiagent Networks
Magnus Egerstedt, Mehran Mesbahi
* Affiliatelinks/Werbelinks
Links auf reinlesen.de sind sogenannte Affiliate-Links. Wenn du auf so einen Affiliate-Link klickst und über diesen Link einkaufst, bekommt reinlesen.de von dem betreffenden Online-Shop oder Anbieter eine Provision. Für dich verändert sich der Preis nicht.
Naturwissenschaften, Medizin, Informatik, Technik / Mathematik
Beschreibung
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
Kundenbewertungen
Instance (computer science), Vertex (graph theory), Symmetric graph, Kalman filter, Permutation matrix, Lloyd's algorithm, Planar graph, Directed graph, Cycle graph, Combinatorial topology, Computational resource, Graph (discrete mathematics), Variable (computer science), Expander graph, Connectivity (graph theory), Abstraction (software engineering), Automorphism, Path graph, Circulant graph, Bipartite graph, Combinatorial optimization, Extremal graph theory, Eigenvalues and eigenvectors, Hypercube graph, Network model, Line graph, Random geometric graph, Theorem, Intersection (set theory), Lyapunov function, Algebraic connectivity, Combinatorics, Optimization problem, Proportionality (mathematics), Adjacency matrix, Complete graph, Network topology, Algebraic graph theory, Markov chain, Random graph, Incidence matrix, Gabriel graph, Asymmetric graph, Estimation, Norm (mathematics), Cartesian product, Controllability, Topological graph theory, Extremal combinatorics, Cycle graph (algebra), Distance-vector routing protocol, Characterization (mathematics), Degree (graph theory), Graph product, Graph embedding, Graph theory, Identity matrix, Simplicial complex, Recursion (computer science), Graph property, Stochastic matrix, Diagonalizable matrix, Petersen graph, Degree matrix, LTI system theory, Algorithm, Arborescence (graph theory), Optimal control, Johnson graph, Mathematical optimization