Graph theoretic methods in multiagent networks:
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Princeton [u.a.]
Princeton Univ. Press
2010
|
| Schriftenreihe: | Princeton Series in Applied Mathematics
|
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | XIX, 403 S. graph. Darst. |
| ISBN: | 9780691140612 0691140618 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV035951776 | ||
| 003 | DE-604 | ||
| 005 | 20121009 | ||
| 007 | t | ||
| 008 | 100114s2010 d||| |||| 00||| eng d | ||
| 020 | |a 9780691140612 |9 978-0-691-14061-2 | ||
| 020 | |a 0691140618 |9 0-691-14061-8 | ||
| 035 | |a (OCoLC)466341412 | ||
| 035 | |a (DE-599)BVBBV035951776 | ||
| 040 | |a DE-604 |b ger |e rakwb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-20 |a DE-703 |a DE-473 |a DE-384 |a DE-11 |a DE-91 |a DE-706 |a DE-739 |a DE-91G | ||
| 050 | 0 | |a T57.85 | |
| 082 | 0 | |a 006.3 |2 22 | |
| 084 | |a SK 890 |0 (DE-625)143267: |2 rvk | ||
| 084 | |a ST 300 |0 (DE-625)143650: |2 rvk | ||
| 084 | |a MAT 057f |2 stub | ||
| 100 | 1 | |a Mesbahi, Mehran |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Graph theoretic methods in multiagent networks |c Mehran Mesbahi and Magnus Egerstedt |
| 264 | 1 | |a Princeton [u.a.] |b Princeton Univ. Press |c 2010 | |
| 300 | |a XIX, 403 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 0 | |a Princeton Series in Applied Mathematics | |
| 650 | 4 | |a Mathematisches Modell | |
| 650 | 4 | |a Multiagent systems |x Mathematical models | |
| 650 | 4 | |a Network analysis (Planning) |x Graphic methods | |
| 650 | 0 | 7 | |a Mehragentensystem |0 (DE-588)4389058-1 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Graphentheoretisches Modell |0 (DE-588)4158055-2 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Netzwerkanalyse |0 (DE-588)4075298-7 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Netzwerkanalyse |0 (DE-588)4075298-7 |D s |
| 689 | 0 | 1 | |a Mehragentensystem |0 (DE-588)4389058-1 |D s |
| 689 | 0 | 2 | |a Graphentheoretisches Modell |0 (DE-588)4158055-2 |D s |
| 689 | 0 | |5 DE-604 | |
| 700 | 1 | |a Egerstedt, Magnus |d 1971- |e Verfasser |0 (DE-588)135764955 |4 aut | |
| 856 | 4 | 2 | |m HBZ Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=018808819&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-018808819 | ||
Datensatz im Suchindex
| _version_ | 1804140945255432193 |
|---|---|
| adam_text | Titel: Graph theoretic methods in multiagent networks
Autor: Mesbahi, Mehran
Jahr: 2010
Contents
Preface xi
Notation xv
PART1. FOUNDATIONS 1
ChapteM. Introduction 3
1.1 Hello, Networked World 3
1.2 Multiagent Systems 4
1.3 Information Exchange via Local Interactions 8
1.4 Graph-based Interaction Models 10
1.5 Looking Ahead 12
Chapter2. GraphTheory 14
2.1 Graphs 14
2.2 Variations on the Theme 20
2.3 Graphs and Matrices 22
2.4 Algebraic and Spectral Graph Theory 27
2.5 Graph Symmetries 33
Chapter 3. The Agreement Protocol: Part I-The Static Case 42
3.1 Reaching Agreement: Undirected Networks 46
3.2 Reaching Agreement: Directed Networks 48
3.3 Agreement and Markov Chains 58
3.4 The Factorization Lemma 61
Chapter 4. The Agreement Protocol: Part ll-Lyapunov and LaSalle 72
4.1 Agreement via Lyapunov Functions 72
4.2 Agreement over Switching Digraphs 76
4.3 Edge Agreement 77
4.4 Beyond Linearity 81
Chapter 5. Probabilistic Analysis of Networks and Protocols 90
5.1 Random Graphs 90
5.2 Agreement over Random Networks 93
5.3 Agreement in the Presence of Noise 100
5.4 Other Probabilistic Models of Networks 108
vjjj CONTENTS
PART 2. MULTIAGENT NETWORKS 115
Chapter 6. Formation Control 117
6.1 Formation Specification: Shapes * °
6.2 Formation Specification: Relative States 23
6.3 Shape-based Control 127
6.4 Relative State-based Control 130
6.5 Dynamic Formation Selection ?3
6.6 Assigning Roles *
Chapter 7. Mobile Robots 159
7.1 Cooperative Robotics °0
7.2 Weighted Graph-based Feedback 162
7.3 Dynamic Graphs 167
7.4 Formation Control Revisited 169
7.5 The Coverage Problem 176
Chapter 8. Distributed Estimation 191
8.1 Distributed Linear Least Squares 191
8.2 Pulsed Intercluster Communication 199
8.3 Implementation over Wireless Networks 208
8.4 Distributed Kalman Filtering 212
Chapter 9. Social Networks, Epidemics, and Games 226
9.1 Diffusion on Social Networks-The Max Protocol 226
9.2 The Threshold Protocol 229
9.3 Epidemics 233
9.4 The Chip Firing Game 243
PART 3. NETWORKS AS SYSTEMS 251
Chapter 10. Agreement with Inputs and Outputs 253
10.1 The Basic Input-Output Setup 253
10.2 Graph Theoretic Controllability: The SISO Case 260
10.3 Graph Theoretic Controllability: The MIMO Case 269
10.4 Agreement Reachability 276
10.5 Network Feedback 280
10.6 Optimal Control 282
Chapter 11. Synthesis of Networks 293
11.1 Network Formation 293
11.2 Local Formation Games 294
11.3 Potential Games and Best Response Dynamics 299
11.4 Network Synthesis: A Global Perspective 305
11.5 Discrete and Greedy 309
11.6 Optimizing the Weighted Agreement 312
CONTENTS ix
Chapter 12. Dynamic Graph Processes 319
12.1 State-dependent Graphs 319
12.2 Graphical Equations 323
12.3 Dynamic Graph Controllability 326
12.4 What Graphs Can Be Realized? 336
12.5 Planning over Proximity Graphs 338
Chapter 13. Higher-order Networks 344
13.1 Simplicial Complexes 344
13.2 Combinatorial Laplacians 347
13.3 Triangulations and the Rips Complex 350
13.4 The Nerve Complex 354
Appendix A. 362
A. 1 Analysis 362
A.2 Matrix Theory 363
A.3 Control Theory 366
A.4 Probability 372
A.5 Optimization and Games 375
Bibliography 379
Index 399
|
| any_adam_object | 1 |
| author | Mesbahi, Mehran Egerstedt, Magnus 1971- |
| author_GND | (DE-588)135764955 |
| author_facet | Mesbahi, Mehran Egerstedt, Magnus 1971- |
| author_role | aut aut |
| author_sort | Mesbahi, Mehran |
| author_variant | m m mm m e me |
| building | Verbundindex |
| bvnumber | BV035951776 |
| callnumber-first | T - Technology |
| callnumber-label | T57 |
| callnumber-raw | T57.85 |
| callnumber-search | T57.85 |
| callnumber-sort | T 257.85 |
| callnumber-subject | T - General Technology |
| classification_rvk | SK 890 ST 300 |
| classification_tum | MAT 057f |
| ctrlnum | (OCoLC)466341412 (DE-599)BVBBV035951776 |
| dewey-full | 006.3 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 006 - Special computer methods |
| dewey-raw | 006.3 |
| dewey-search | 006.3 |
| dewey-sort | 16.3 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik Mathematik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01977nam a2200481 c 4500</leader><controlfield tag="001">BV035951776</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20121009 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">100114s2010 d||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780691140612</subfield><subfield code="9">978-0-691-14061-2</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0691140618</subfield><subfield code="9">0-691-14061-8</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)466341412</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV035951776</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-20</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-473</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-11</subfield><subfield code="a">DE-91</subfield><subfield code="a">DE-706</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-91G</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">T57.85</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">006.3</subfield><subfield code="2">22</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 890</subfield><subfield code="0">(DE-625)143267:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 300</subfield><subfield code="0">(DE-625)143650:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 057f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Mesbahi, Mehran</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Graph theoretic methods in multiagent networks</subfield><subfield code="c">Mehran Mesbahi and Magnus Egerstedt</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Princeton [u.a.]</subfield><subfield code="b">Princeton Univ. Press</subfield><subfield code="c">2010</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XIX, 403 S.</subfield><subfield code="b">graph. Darst.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">Princeton Series in Applied Mathematics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematisches Modell</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Multiagent systems</subfield><subfield code="x">Mathematical models</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Network analysis (Planning)</subfield><subfield code="x">Graphic methods</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Mehragentensystem</subfield><subfield code="0">(DE-588)4389058-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Graphentheoretisches Modell</subfield><subfield code="0">(DE-588)4158055-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Netzwerkanalyse</subfield><subfield code="0">(DE-588)4075298-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Netzwerkanalyse</subfield><subfield code="0">(DE-588)4075298-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Mehragentensystem</subfield><subfield code="0">(DE-588)4389058-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Graphentheoretisches Modell</subfield><subfield code="0">(DE-588)4158055-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Egerstedt, Magnus</subfield><subfield code="d">1971-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)135764955</subfield><subfield code="4">aut</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">HBZ Datenaustausch</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=018808819&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-018808819</subfield></datafield></record></collection> |
| id | DE-604.BV035951776 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T22:08:02Z |
| institution | BVB |
| isbn | 9780691140612 0691140618 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-018808819 |
| oclc_num | 466341412 |
| open_access_boolean | |
| owner | DE-20 DE-703 DE-473 DE-BY-UBG DE-384 DE-11 DE-91 DE-BY-TUM DE-706 DE-739 DE-91G DE-BY-TUM |
| owner_facet | DE-20 DE-703 DE-473 DE-BY-UBG DE-384 DE-11 DE-91 DE-BY-TUM DE-706 DE-739 DE-91G DE-BY-TUM |
| physical | XIX, 403 S. graph. Darst. |
| publishDate | 2010 |
| publishDateSearch | 2010 |
| publishDateSort | 2010 |
| publisher | Princeton Univ. Press |
| record_format | marc |
| series2 | Princeton Series in Applied Mathematics |
| spelling | Mesbahi, Mehran Verfasser aut Graph theoretic methods in multiagent networks Mehran Mesbahi and Magnus Egerstedt Princeton [u.a.] Princeton Univ. Press 2010 XIX, 403 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Princeton Series in Applied Mathematics Mathematisches Modell Multiagent systems Mathematical models Network analysis (Planning) Graphic methods Mehragentensystem (DE-588)4389058-1 gnd rswk-swf Graphentheoretisches Modell (DE-588)4158055-2 gnd rswk-swf Netzwerkanalyse (DE-588)4075298-7 gnd rswk-swf Netzwerkanalyse (DE-588)4075298-7 s Mehragentensystem (DE-588)4389058-1 s Graphentheoretisches Modell (DE-588)4158055-2 s DE-604 Egerstedt, Magnus 1971- Verfasser (DE-588)135764955 aut HBZ Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=018808819&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Mesbahi, Mehran Egerstedt, Magnus 1971- Graph theoretic methods in multiagent networks Mathematisches Modell Multiagent systems Mathematical models Network analysis (Planning) Graphic methods Mehragentensystem (DE-588)4389058-1 gnd Graphentheoretisches Modell (DE-588)4158055-2 gnd Netzwerkanalyse (DE-588)4075298-7 gnd |
| subject_GND | (DE-588)4389058-1 (DE-588)4158055-2 (DE-588)4075298-7 |
| title | Graph theoretic methods in multiagent networks |
| title_auth | Graph theoretic methods in multiagent networks |
| title_exact_search | Graph theoretic methods in multiagent networks |
| title_full | Graph theoretic methods in multiagent networks Mehran Mesbahi and Magnus Egerstedt |
| title_fullStr | Graph theoretic methods in multiagent networks Mehran Mesbahi and Magnus Egerstedt |
| title_full_unstemmed | Graph theoretic methods in multiagent networks Mehran Mesbahi and Magnus Egerstedt |
| title_short | Graph theoretic methods in multiagent networks |
| title_sort | graph theoretic methods in multiagent networks |
| topic | Mathematisches Modell Multiagent systems Mathematical models Network analysis (Planning) Graphic methods Mehragentensystem (DE-588)4389058-1 gnd Graphentheoretisches Modell (DE-588)4158055-2 gnd Netzwerkanalyse (DE-588)4075298-7 gnd |
| topic_facet | Mathematisches Modell Multiagent systems Mathematical models Network analysis (Planning) Graphic methods Mehragentensystem Graphentheoretisches Modell Netzwerkanalyse |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=018808819&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT mesbahimehran graphtheoreticmethodsinmultiagentnetworks AT egerstedtmagnus graphtheoreticmethodsinmultiagentnetworks |