skip to content
Graph theoretic methods in multiagent networks Preview this item
ClosePreview this item

Graph theoretic methods in multiagent networks

Author: Mehran Mesbahi; Magnus Egerstedt
Publisher: Princeton : Princeton University Press, ©2010.
Series: Princeton series in applied mathematics.
Edition/Format:   Print book : EnglishView all editions and formats
Database:WorldCat
Summary:
An introduction to the analysis & design of dynamic multiagent networks. These have a wide range of applications in science & engineering, including mobile sensor networks, distributed robotics, quantum networks, networked economics, biological synchronization & social networks.
Getting this item's online copy... Getting this item's online copy...

Find a copy in the library

Getting this item's location and availability... Getting this item's location and availability...

WorldCat

Find it in libraries globally
Worldwide libraries own this item

Details

Material Type: Internet resource
Document Type: Book, Internet Resource
All Authors / Contributors: Mehran Mesbahi; Magnus Egerstedt
ISBN: 9780691140612 0691140618
OCLC Number: 466341412
Description: xix, 403 pages : illustrations ; 25 cm.
Contents: Machine generated contents note: pt. 1 FOUNDATIONS --
ch. 1 Introduction --
1.1. Hello, Networked World --
1.2. Multiagent Systems --
1.3. Information Exchange via Local Interactions --
1.4. Graph-based Interaction Models --
1.5. Looking Ahead --
ch. 2 Graph Theory --
2.1. Graphs --
2.2. Variations on the Theme --
2.3. Graphs and Matrices --
2.4. Algebraic and Spectral Graph Theory --
2.5. Graph Symmetries --
ch. 3 Agreement Protocol: Part I-The Static Case --
3.1. Reaching Agreement: Undirected Networks --
3.2. Reaching Agreement: Directed Networks --
3.3. Agreement and Markov Chains --
3.4. Factorization Lemma --
ch. 4 Agreement Protocol: Part II-Lyapunov and LaSalle --
4.1. Agreement via Lyapunov Functions --
4.2. Agreement over Switching Digraphs --
4.3. Edge Agreement --
4.4. Beyond Linearity --
ch. 5 Probabilistic Analysis of Networks and Protocols --
5.1. Random Graphs --
5.2. Agreement over Random Networks --
5.3. Agreement in the Presence of Noise --
5.4. Other Probabilistic Models of Networks --
pt. 2 MULTIAGENT NETWORKS --
ch. 6 Formation Control --
6.1. Formation Specification: Shapes --
6.2. Formation Specification: Relative States --
6.3. Shape-based Control --
6.4. Relative State-based Control --
6.5. Dynamic Formation Selection --
6.6. Assigning Roles --
ch. 7 Mobile Robots --
7.1. Cooperative Robotics --
7.2. Weighted Graph-based Feedback --
7.3. Dynamic Graphs --
7.4. Formation Control Revisited --
7.5. Coverage Problem --
ch. 8 Distributed Estimation --
8.1. Distributed Linear Least Squares --
8.2. Pulsed Intercluster Communication --
8.3. Implementation over Wireless Networks --
8.4. Distributed Kalman Filtering --
ch. 9 Social Networks, Epidemics, and Games --
9.1. Diffusion on Social Networks-The Max Protocol --
9.2. Threshold Protocol --
9.3. Epidemics --
9.4. Chip Firing Game --
pt. 3 NETWORKS AS SYSTEMS --
ch. 10 Agreement with Inputs and Outputs --
10.1. Basic Input-Output Setup --
10.2. Graph Theoretic Controllability: The SISO Case --
10.3. Graph Theoretic Controllability: The MIMO Case --
10.4. Agreement Reachability --
10.5. Network Feedback --
10.6. Optimal Control --
ch. 11 Synthesis of Networks --
11.1. Network Formation --
11.2. Local Formation Games --
11.3. Potential Games and Best Response Dynamics --
11.4. Network Synthesis: A Global Perspective --
11.5. Discrete and Greedy --
11.6. Optimizing the Weighted Agreement --
ch. 12 Dynamic Graph Processes --
12.1. State-dependent Graphs --
12.2. Graphical Equations --
12.3. Dynamic Graph Controllability --
12.4. What Graphs Can Be Realized? --
12.5. Planning over Proximity Graphs --
ch. 13 Higher-order Networks --
13.1. Simplicial Complexes --
13.2. Combinatorial Laplacians --
13.3. Triangulations and the Rips Complex --
13.4. Nerve Complex --
Appendix A --
A.1. Analysis --
A.2. Matrix Theory --
A.3. Control Theory --
A.4. Probability --
A.5. Optimization and Games.
Series Title: Princeton series in applied mathematics.
Responsibility: Mehran Mesbahi and Magnus Egerstedt.

Abstract:

Focusing on graph theoretic methods for the analysis and synthesis of dynamic multiagent networks, this book presents a powerful formalism and set of tools for networked systems. It covers topics  Read more...
Retrieving notes about this item Retrieving notes about this item

Reviews

Editorial reviews

Publisher Synopsis

"Presently, there are few books on multiagent systems. Thus, this book can be a useful reference book for graduate students and researchers focusing on systems, controls, and robotics, and help them Read more...

 
User-contributed reviews

Tags

Be the first.
Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.