The Resource Graph theoretic methods in multiagent networks, Mehran Mesbahi and Magnus Egerstedt

Graph theoretic methods in multiagent networks, Mehran Mesbahi and Magnus Egerstedt

Label
Graph theoretic methods in multiagent networks
Title
Graph theoretic methods in multiagent networks
Statement of responsibility
Mehran Mesbahi and Magnus Egerstedt
Creator
Contributor
Subject
Language
eng
Member of
Cataloging source
DLC
http://library.link/vocab/creatorName
Mesbahi, Mehran
Dewey number
006.3
Illustrations
illustrations
Index
index present
LC call number
T57.85
LC item number
.M43 2010
Literary form
non fiction
Nature of contents
bibliography
http://library.link/vocab/relatedWorkOrContributorName
Egerstedt, Magnus
Series statement
Princeton series in applied mathematics
http://library.link/vocab/subjectName
  • Network analysis (Planning)
  • Multiagent systems
Label
Graph theoretic methods in multiagent networks, Mehran Mesbahi and Magnus Egerstedt
Instantiates
Publication
Bibliography note
Includes bibliographical references and index
Contents
  • 1.3.
  • 9.2.
  • Threshold Protocol
  • 9.3.
  • Epidemics
  • 9.4.
  • Chip Firing Game
  • PART 3.
  • NETWORKS AS SYSTEMS
  • Chapter 10.
  • Agreement with Inputs and Outputs
  • Information Exchange via Local Interactions
  • 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
  • 1.4.
  • 10.6.
  • Optimal Control
  • Chapter 11.
  • Synthesis of Networks
  • 11.1.
  • Network Formation
  • 11.2.
  • Local Formation Games
  • 11.3.
  • Potential Games and Best Response Dynamics
  • Graph-based Interaction Models
  • 11.4.
  • Network Synthesis: A Global Perspective
  • 11.5.
  • Discrete and Greedy
  • 11.6.
  • Optimizing the Weighted Agreement
  • Chapter 12.
  • Dynamic Graph Processes
  • 12.1.
  • State-dependent Graphs
  • 1.5.
  • 12.2.
  • Graphical Equations
  • 12.3.
  • Dynamic Graph Controllability
  • 12.4.
  • What Graphs Can Be Realized?
  • 12.5.
  • Planning over Proximity Graphs
  • Chapter 13.
  • Higher-order Networks
  • Looking Ahead
  • 13.1.
  • Simplicial Complexes
  • 13.2.
  • Combinatorial Laplacians
  • 13.3.
  • Triangulations and the Rips Complex
  • 13.4.
  • Nerve Complex
  • Appendix A
  • A.1.
  • Chapter 2.
  • Analysis
  • A.2.
  • Matrix Theory
  • A.3.
  • Control Theory
  • A.4.
  • Probability
  • A.5.
  • Optimization and Games
  • Graph Theory
  • 2.1.
  • Graphs
  • PART 1.
  • 2.2.
  • Variations on the Theme
  • 2.3.
  • Graphs and Matrices
  • 2.4.
  • Algebraic and Spectral Graph Theory
  • 2.5.
  • Graph Symmetries
  • Chapter 3.
  • Agreement Protocol: Part I-The Static Case
  • FOUNDATIONS
  • 3.1.
  • Reaching Agreement: Undirected Networks
  • 3.2.
  • Reaching Agreement: Directed Networks
  • 3.3.
  • Agreement and Markov Chains
  • 3.4.
  • Factorization Lemma
  • Chapter 4.
  • Agreement Protocol: Part II-Lyapunov and LaSalle
  • Chapter 1.
  • 4.1.
  • Agreement via Lyapunov Functions
  • 4.2.
  • Agreement over Switching Digraphs
  • 4.3.
  • Edge Agreement
  • 4.4.
  • Beyond Linearity
  • Chapter 5.
  • Probabilistic Analysis of Networks and Protocols
  • Introduction
  • 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
  • PART 2.
  • MULTIAGENT NETWORKS
  • 1.1.
  • Chapter 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
  • Hello, Networked World
  • 6.5.
  • Dynamic Formation Selection
  • 6.6.
  • Assigning Roles
  • Chapter 7.
  • Mobile Robots
  • 7.1.
  • Cooperative Robotics
  • 7.2.
  • Weighted Graph-based Feedback
  • 1.2.
  • 7.3.
  • Dynamic Graphs
  • 7.4.
  • Formation Control Revisited
  • 7.5.
  • Coverage Problem
  • Chapter 8.
  • Distributed Estimation
  • 8.1.
  • Distributed Linear Least Squares
  • Multiagent Systems
  • 8.2.
  • Pulsed Intercluster Communication
  • 8.3.
  • Implementation over Wireless Networks
  • 8.4.
  • Distributed Kalman Filtering
  • Chapter 9.
  • Social Networks, Epidemics, and Games
  • 9.1.
  • Diffusion on Social Networks-The Max Protocol
Dimensions
25 cm.
Extent
xix, 403 p.
Isbn
9780691140612
Isbn Type
(hardcover : alk. paper)
Lccn
2010012844
Other physical details
ill.
System control number
  • (CaMWU)u2132527-01umb_inst
  • 2193207
  • (Sirsi) i9780691140612
  • (OCoLC)466341412
Label
Graph theoretic methods in multiagent networks, Mehran Mesbahi and Magnus Egerstedt
Publication
Bibliography note
Includes bibliographical references and index
Contents
  • 1.3.
  • 9.2.
  • Threshold Protocol
  • 9.3.
  • Epidemics
  • 9.4.
  • Chip Firing Game
  • PART 3.
  • NETWORKS AS SYSTEMS
  • Chapter 10.
  • Agreement with Inputs and Outputs
  • Information Exchange via Local Interactions
  • 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
  • 1.4.
  • 10.6.
  • Optimal Control
  • Chapter 11.
  • Synthesis of Networks
  • 11.1.
  • Network Formation
  • 11.2.
  • Local Formation Games
  • 11.3.
  • Potential Games and Best Response Dynamics
  • Graph-based Interaction Models
  • 11.4.
  • Network Synthesis: A Global Perspective
  • 11.5.
  • Discrete and Greedy
  • 11.6.
  • Optimizing the Weighted Agreement
  • Chapter 12.
  • Dynamic Graph Processes
  • 12.1.
  • State-dependent Graphs
  • 1.5.
  • 12.2.
  • Graphical Equations
  • 12.3.
  • Dynamic Graph Controllability
  • 12.4.
  • What Graphs Can Be Realized?
  • 12.5.
  • Planning over Proximity Graphs
  • Chapter 13.
  • Higher-order Networks
  • Looking Ahead
  • 13.1.
  • Simplicial Complexes
  • 13.2.
  • Combinatorial Laplacians
  • 13.3.
  • Triangulations and the Rips Complex
  • 13.4.
  • Nerve Complex
  • Appendix A
  • A.1.
  • Chapter 2.
  • Analysis
  • A.2.
  • Matrix Theory
  • A.3.
  • Control Theory
  • A.4.
  • Probability
  • A.5.
  • Optimization and Games
  • Graph Theory
  • 2.1.
  • Graphs
  • PART 1.
  • 2.2.
  • Variations on the Theme
  • 2.3.
  • Graphs and Matrices
  • 2.4.
  • Algebraic and Spectral Graph Theory
  • 2.5.
  • Graph Symmetries
  • Chapter 3.
  • Agreement Protocol: Part I-The Static Case
  • FOUNDATIONS
  • 3.1.
  • Reaching Agreement: Undirected Networks
  • 3.2.
  • Reaching Agreement: Directed Networks
  • 3.3.
  • Agreement and Markov Chains
  • 3.4.
  • Factorization Lemma
  • Chapter 4.
  • Agreement Protocol: Part II-Lyapunov and LaSalle
  • Chapter 1.
  • 4.1.
  • Agreement via Lyapunov Functions
  • 4.2.
  • Agreement over Switching Digraphs
  • 4.3.
  • Edge Agreement
  • 4.4.
  • Beyond Linearity
  • Chapter 5.
  • Probabilistic Analysis of Networks and Protocols
  • Introduction
  • 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
  • PART 2.
  • MULTIAGENT NETWORKS
  • 1.1.
  • Chapter 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
  • Hello, Networked World
  • 6.5.
  • Dynamic Formation Selection
  • 6.6.
  • Assigning Roles
  • Chapter 7.
  • Mobile Robots
  • 7.1.
  • Cooperative Robotics
  • 7.2.
  • Weighted Graph-based Feedback
  • 1.2.
  • 7.3.
  • Dynamic Graphs
  • 7.4.
  • Formation Control Revisited
  • 7.5.
  • Coverage Problem
  • Chapter 8.
  • Distributed Estimation
  • 8.1.
  • Distributed Linear Least Squares
  • Multiagent Systems
  • 8.2.
  • Pulsed Intercluster Communication
  • 8.3.
  • Implementation over Wireless Networks
  • 8.4.
  • Distributed Kalman Filtering
  • Chapter 9.
  • Social Networks, Epidemics, and Games
  • 9.1.
  • Diffusion on Social Networks-The Max Protocol
Dimensions
25 cm.
Extent
xix, 403 p.
Isbn
9780691140612
Isbn Type
(hardcover : alk. paper)
Lccn
2010012844
Other physical details
ill.
System control number
  • (CaMWU)u2132527-01umb_inst
  • 2193207
  • (Sirsi) i9780691140612
  • (OCoLC)466341412

Library Locations

  • Albert D. Cohen Management LibraryBorrow it
    181 Freedman Crescent, Winnipeg, MB, R3T 5V4, CA
    49.807878 -97.129961
  • Architecture/Fine Arts LibraryBorrow it
    84 Curry Place, Winnipeg, MB, CA
    49.807716 -97.136226
  • Archives and Special CollectionsBorrow it
    25 Chancellors Circle (Elizabeth Dafoe Library), Room 330, Winnipeg, MB, R3T 2N2, CA
    49.809961 -97.131878
  • Bibliothèque Alfred-Monnin (Université de Saint-Boniface)Borrow it
    200, avenue de la Cathédrale, Local 2110, Winnipeg, MB, R2H 0H7, CA
    49.888861 -97.119735
  • Bill Larson Library (Grace Hospital)Borrow it
    300 Booth Drive, G-227, Winnipeg, MB, R3J 3M7, CA
    49.882400 -97.276436
  • Carolyn Sifton - Helene Fuld Library (St. Boniface General Hospital)Borrow it
    409 Tache Avenue, Winnipeg, MB, R2H 2A6, CA
    49.883388 -97.126050
  • Concordia Hospital LibraryBorrow it
    1095 Concordia Avenue, Winnipeg, MB, R2K 3S8, CA
    49.913252 -97.064683
  • Donald W. Craik Engineering LibraryBorrow it
    75B Chancellors Circle (Engineering Building E3), Room 361, Winnipeg, MB, R3T 2N2, CA
    49.809053 -97.133292
  • E.K. Williams Law LibraryBorrow it
    224 Dysart Road, Winnipeg, MB, R3T 5V4, CA
    49.811829 -97.131017
  • Eckhardt-Gramatté Music LibraryBorrow it
    136 Dafoe Road (Taché Arts Complex), Room 257, Winnipeg, MB, R3T 2N2, CA
    49.807964 -97.132222
  • Elizabeth Dafoe LibraryBorrow it
    25 Chancellors Circle, Winnipeg, MB, R3T 2N2, CA
    49.809961 -97.131878
  • Fr. H. Drake Library (St. Paul's College)Borrow it
    70 Dysart Road, Winnipeg, MB, R3T 2M6, CA
    49.810605 -97.138184
  • J.W. Crane Memorial Library (Deer Lodge Centre)Borrow it
    2109 Portage Avenue, Winnipeg, MB, R3J 0L3, CA
    49.878000 -97.235520
  • Libraries Annex (not open to the public; please see web page for details)Borrow it
    25 Chancellors Circle (in the Elizabeth Dafoe Library), Winnipeg, MB, R3T 2N2, CA
    49.809961 -97.131878
  • Neil John Maclean Health Sciences LibraryBorrow it
    727 McDermot Avenue (Brodie Centre), 200 Level, Winnipeg, MB, R3E 3P5, CA
    49.903563 -97.160554
  • Sciences and Technology LibraryBorrow it
    186 Dysart Road, Winnipeg, MB, R3T 2M8, CA
    49.811526 -97.133257
  • Seven Oaks General Hospital LibraryBorrow it
    2300 McPhillips Street, Winnipeg, MB, R2V 3M3, CA
    49.955177 -97.148865
  • Sister St. Odilon Library (Misericordia Health Centre)Borrow it
    99 Cornish Avenue, Winnipeg, MB, R3C 1A2, CA
    49.879592 -97.160425
  • St. John's College LibraryBorrow it
    92 Dysart Road, Winnipeg, MB, R3T 2M5, CA
    49.811242 -97.137156
  • Victoria General Hospital LibraryBorrow it
    2340 Pembina Highway, Winnipeg, MB, R3T 2E8, CA
    49.806755 -97.152739
  • William R Newman Library (Agriculture)Borrow it
    66 Dafoe Road, Winnipeg, MB, R3T 2R3, CA
    49.806936 -97.135525
Processing Feedback ...