Graph theoretic methods in multiagent networks /:
"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, quant...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Weitere Verfasser: | |
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Princeton :
Princeton University Press,
©2010.
|
| Schriftenreihe: | Princeton series in applied mathematics.
|
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Zusammenfassung: | "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; Georgia Tech, USA; University of Washington, USA; Ohio University, USA"--EBL book details. 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. |
| Beschreibung: | 1 online resource (xix, 403 pages) : illustrations |
| Bibliographie: | Includes bibliographical references and index. |
| ISBN: | 9781400835355 1400835356 |
Internformat
MARC
| LEADER | 00000cam a2200000 a 4500 | ||
|---|---|---|---|
| 001 | ZDB-4-EBA-ocn701703574 | ||
| 003 | OCoLC | ||
| 005 | 20241004212047.0 | ||
| 006 | m o d | ||
| 007 | cr |n|---||||| | ||
| 008 | 110214s2010 njua ob 001 0 eng d | ||
| 010 | |a 2010012844 | ||
| 040 | |a EBLCP |b eng |e pn |c EBLCP |d OCLCQ |d MHW |d IDEBK |d WAU |d CDX |d OCLCQ |d N$T |d OCLCQ |d YDXCP |d DEBSZ |d JSTOR |d OCLCQ |d AGLDB |d UIU |d MOR |d Z5A |d ZCU |d OCLCQ |d MERUC |d OCLCQ |d IOG |d U3W |d EZ9 |d STF |d VTS |d CEF |d ICG |d INT |d VT2 |d OCLCQ |d WYU |d G3B |d LVT |d JBG |d TKN |d OCLCQ |d REC |d DKC |d OCLCQ |d UKAHL |d OCLCQ |d K6U |d OCLCQ |d AJS |d UWK |d OCLCO |d OCLCQ |d OCLCL |d NUI |d UEJ |d OCLCO |d OCLCQ |d HOPLA | ||
| 015 | |a GBB060391 |2 bnb | ||
| 016 | 7 | |a 015550784 |2 Uk | |
| 019 | |a 703209444 |a 1055367925 |a 1066645785 |a 1181907904 |a 1228565754 | ||
| 020 | |a 9781400835355 |q (electronic bk.) | ||
| 020 | |a 1400835356 |q (electronic bk.) | ||
| 020 | |z 9780691140612 |q (hardcover ; |q alk. paper) | ||
| 020 | |z 0691140618 |q (hardcover ; |q alk. paper) | ||
| 024 | 8 | |a 9786612979101 | |
| 035 | |a (OCoLC)701703574 |z (OCoLC)703209444 |z (OCoLC)1055367925 |z (OCoLC)1066645785 |z (OCoLC)1181907904 |z (OCoLC)1228565754 | ||
| 037 | |a 297910 |b MIL | ||
| 037 | |a 22573/ctt9v6s66 |b JSTOR | ||
| 050 | 4 | |a T57.85 |b .M43 2010eb | |
| 072 | 7 | |a COM |x 000000 |2 bisacsh | |
| 072 | 7 | |a MAT013000 |2 bisacsh | |
| 072 | 7 | |a MAT003000 |2 bisacsh | |
| 082 | 7 | |a 006.3 | |
| 084 | |a SK 890 |2 rvk | ||
| 049 | |a MAIN | ||
| 100 | 1 | |a Mesbahi, Mehran. |1 https://id.oclc.org/worldcat/entity/E39PCjG87QGmyxwGYPjgWHtvXm |0 http://id.loc.gov/authorities/names/n2010023805 | |
| 245 | 1 | 0 | |a Graph theoretic methods in multiagent networks / |c Mehran Mesbahi and Magnus Egerstedt. |
| 260 | |a Princeton : |b Princeton University Press, |c ©2010. | ||
| 300 | |a 1 online resource (xix, 403 pages) : |b illustrations | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 338 | |a online resource |b cr |2 rdacarrier | ||
| 490 | 1 | |a Princeton series in applied mathematics | |
| 504 | |a Includes bibliographical references and index. | ||
| 505 | 0 | |a Foundations -- Multiagent networks -- Networks as systems -- Appendix A. -- Bibliography -- Index. | |
| 520 | |a "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; Georgia Tech, USA; University of Washington, USA; Ohio University, USA"--EBL book details. | ||
| 520 | 8 | |a 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. | |
| 588 | 0 | |a Print version record. | |
| 650 | 0 | |a Network analysis (Planning) |x Graphic methods. | |
| 650 | 0 | |a Multiagent systems |x Mathematical models. | |
| 650 | 6 | |a Analyse de réseau (Planification) |x Méthodes graphiques. | |
| 650 | 6 | |a Systèmes multiagents (Intelligence artificielle) |x Modèles mathématiques. | |
| 650 | 7 | |a COMPUTERS |x General. |2 bisacsh | |
| 650 | 7 | |a MATHEMATICS |x Graphic Methods. |2 bisacsh | |
| 653 | |a Addition. | ||
| 653 | |a Adjacency matrix. | ||
| 653 | |a Algebraic graph theory. | ||
| 653 | |a Algorithm. | ||
| 653 | |a Automorphism. | ||
| 653 | |a Bipartite graph. | ||
| 653 | |a Cardinality. | ||
| 653 | |a Cartesian product. | ||
| 653 | |a Circulant graph. | ||
| 653 | |a Combinatorics. | ||
| 653 | |a Complete graph. | ||
| 653 | |a Computation. | ||
| 653 | |a Connectivity (graph theory). | ||
| 653 | |a Controllability. | ||
| 653 | |a Convex combination. | ||
| 653 | |a Corollary. | ||
| 653 | |a Cycle graph (algebra). | ||
| 653 | |a Cycle space. | ||
| 653 | |a Degree (graph theory). | ||
| 653 | |a Degree matrix. | ||
| 653 | |a Diagonal matrix. | ||
| 653 | |a Diameter. | ||
| 653 | |a Differentiable function. | ||
| 653 | |a Dimension. | ||
| 653 | |a Directed graph. | ||
| 653 | |a Division by zero. | ||
| 653 | |a Dynamical system. | ||
| 653 | |a Eigenvalues and eigenvectors. | ||
| 653 | |a Equilibrium point. | ||
| 653 | |a Estimation. | ||
| 653 | |a Estimator. | ||
| 653 | |a Existential quantification. | ||
| 653 | |a Extremal graph theory. | ||
| 653 | |a Graph (discrete mathematics). | ||
| 653 | |a Graph theory. | ||
| 653 | |a Identity matrix. | ||
| 653 | |a Incidence matrix. | ||
| 653 | |a Information exchange. | ||
| 653 | |a Initial condition. | ||
| 653 | |a Interconnection. | ||
| 653 | |a Iteration. | ||
| 653 | |a Kalman filter. | ||
| 653 | |a Kronecker product. | ||
| 653 | |a LTI system theory. | ||
| 653 | |a LaSalle's invariance principle. | ||
| 653 | |a Laplacian matrix. | ||
| 653 | |a Least squares. | ||
| 653 | |a Line graph. | ||
| 653 | |a Linear map. | ||
| 653 | |a Lipschitz continuity. | ||
| 653 | |a Lyapunov function. | ||
| 653 | |a Lyapunov stability. | ||
| 653 | |a Markov chain. | ||
| 653 | |a Mathematical optimization. | ||
| 653 | |a Matrix exponential. | ||
| 653 | |a Measurement. | ||
| 653 | |a Multi-agent system. | ||
| 653 | |a Nash equilibrium. | ||
| 653 | |a Natural number. | ||
| 653 | |a Network topology. | ||
| 653 | |a Nonnegative matrix. | ||
| 653 | |a Notation. | ||
| 653 | |a Observability. | ||
| 653 | |a Optimal control. | ||
| 653 | |a Optimization problem. | ||
| 653 | |a Pairwise. | ||
| 653 | |a Parameter. | ||
| 653 | |a Path graph. | ||
| 653 | |a Permutation matrix. | ||
| 653 | |a Permutation. | ||
| 653 | |a Positive semidefinite. | ||
| 653 | |a Positive-definite matrix. | ||
| 653 | |a Probability. | ||
| 653 | |a Quantity. | ||
| 653 | |a Random graph. | ||
| 653 | |a Random variable. | ||
| 653 | |a Rate of convergence. | ||
| 653 | |a Requirement. | ||
| 653 | |a Result. | ||
| 653 | |a Robotics. | ||
| 653 | |a Scientific notation. | ||
| 653 | |a Sensor. | ||
| 653 | |a Sign (mathematics). | ||
| 653 | |a Simplicial complex. | ||
| 653 | |a Special case. | ||
| 653 | |a Spectral graph theory. | ||
| 653 | |a Stochastic matrix. | ||
| 653 | |a Strongly connected component. | ||
| 653 | |a Subset. | ||
| 653 | |a Summation. | ||
| 653 | |a Supergraph. | ||
| 653 | |a Symmetric matrix. | ||
| 653 | |a Systems theory. | ||
| 653 | |a Theorem. | ||
| 653 | |a Theory. | ||
| 653 | |a Unit interval. | ||
| 653 | |a Upper and lower bounds. | ||
| 653 | |a Variable (mathematics). | ||
| 653 | |a Vector space. | ||
| 653 | |a Without loss of generality. | ||
| 700 | 1 | |a Egerstedt, Magnus. |1 https://id.oclc.org/worldcat/entity/E39PBJjMx6F6DcgXY8f4PfBHG3 |0 http://id.loc.gov/authorities/names/nb2008008634 | |
| 758 | |i has work: |a Graph theoretic methods in multiagent networks (Text) |1 https://id.oclc.org/worldcat/entity/E39PCGMfRyRvJQHWyhM3gKC38K |4 https://id.oclc.org/worldcat/ontology/hasWork | ||
| 776 | 0 | 8 | |i Print version: |a Mesbahi, Mehran. |t Graph theoretic methods in multiagent networks. |d Princeton : Princeton University Press, ©2010 |z 9780691140612 |w (DLC) 2010012844 |w (OCoLC)466341412 |
| 830 | 0 | |a Princeton series in applied mathematics. |0 http://id.loc.gov/authorities/names/no2002046464 | |
| 856 | 4 | 0 | |l FWS01 |p ZDB-4-EBA |q FWS_PDA_EBA |u https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=816475 |3 Volltext |
| 938 | |a hoopla Digital |b HOPL |n MWT16341735 | ||
| 938 | |a Askews and Holts Library Services |b ASKH |n AH26387726 | ||
| 938 | |a Coutts Information Services |b COUT |n 17276252 | ||
| 938 | |a EBL - Ebook Library |b EBLB |n EBL548754 | ||
| 938 | |a EBSCOhost |b EBSC |n 816475 | ||
| 938 | |a ProQuest MyiLibrary Digital eBook Collection |b IDEB |n 297910 | ||
| 938 | |a YBP Library Services |b YANK |n 3620372 | ||
| 994 | |a 92 |b GEBAY | ||
| 912 | |a ZDB-4-EBA | ||
| 049 | |a DE-863 | ||
Datensatz im Suchindex
| DE-BY-FWS_katkey | ZDB-4-EBA-ocn701703574 |
|---|---|
| _version_ | 1816881751222386688 |
| adam_text | |
| any_adam_object | |
| author | Mesbahi, Mehran |
| author2 | Egerstedt, Magnus |
| author2_role | |
| author2_variant | m e me |
| author_GND | http://id.loc.gov/authorities/names/n2010023805 http://id.loc.gov/authorities/names/nb2008008634 |
| author_facet | Mesbahi, Mehran Egerstedt, Magnus |
| author_role | |
| author_sort | Mesbahi, Mehran |
| author_variant | m m mm |
| building | Verbundindex |
| bvnumber | localFWS |
| callnumber-first | T - Technology |
| callnumber-label | T57 |
| callnumber-raw | T57.85 .M43 2010eb |
| callnumber-search | T57.85 .M43 2010eb |
| callnumber-sort | T 257.85 M43 42010EB |
| callnumber-subject | T - General Technology |
| classification_rvk | SK 890 |
| collection | ZDB-4-EBA |
| contents | Foundations -- Multiagent networks -- Networks as systems -- Appendix A. -- Bibliography -- Index. |
| ctrlnum | (OCoLC)701703574 |
| 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 | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>09184cam a2201921 a 4500</leader><controlfield tag="001">ZDB-4-EBA-ocn701703574</controlfield><controlfield tag="003">OCoLC</controlfield><controlfield tag="005">20241004212047.0</controlfield><controlfield tag="006">m o d </controlfield><controlfield tag="007">cr |n|---|||||</controlfield><controlfield tag="008">110214s2010 njua ob 001 0 eng d</controlfield><datafield tag="010" ind1=" " ind2=" "><subfield code="a"> 2010012844</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">EBLCP</subfield><subfield code="b">eng</subfield><subfield code="e">pn</subfield><subfield code="c">EBLCP</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">MHW</subfield><subfield code="d">IDEBK</subfield><subfield code="d">WAU</subfield><subfield code="d">CDX</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">N$T</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">YDXCP</subfield><subfield code="d">DEBSZ</subfield><subfield code="d">JSTOR</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">AGLDB</subfield><subfield code="d">UIU</subfield><subfield code="d">MOR</subfield><subfield code="d">Z5A</subfield><subfield code="d">ZCU</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">MERUC</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">IOG</subfield><subfield code="d">U3W</subfield><subfield code="d">EZ9</subfield><subfield code="d">STF</subfield><subfield code="d">VTS</subfield><subfield code="d">CEF</subfield><subfield code="d">ICG</subfield><subfield code="d">INT</subfield><subfield code="d">VT2</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">WYU</subfield><subfield code="d">G3B</subfield><subfield code="d">LVT</subfield><subfield code="d">JBG</subfield><subfield code="d">TKN</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">REC</subfield><subfield code="d">DKC</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">UKAHL</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">K6U</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">AJS</subfield><subfield code="d">UWK</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCL</subfield><subfield code="d">NUI</subfield><subfield code="d">UEJ</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">HOPLA</subfield></datafield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">GBB060391</subfield><subfield code="2">bnb</subfield></datafield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">015550784</subfield><subfield code="2">Uk</subfield></datafield><datafield tag="019" ind1=" " ind2=" "><subfield code="a">703209444</subfield><subfield code="a">1055367925</subfield><subfield code="a">1066645785</subfield><subfield code="a">1181907904</subfield><subfield code="a">1228565754</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781400835355</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1400835356</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">9780691140612</subfield><subfield code="q">(hardcover ;</subfield><subfield code="q">alk. paper)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">0691140618</subfield><subfield code="q">(hardcover ;</subfield><subfield code="q">alk. paper)</subfield></datafield><datafield tag="024" ind1="8" ind2=" "><subfield code="a">9786612979101</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)701703574</subfield><subfield code="z">(OCoLC)703209444</subfield><subfield code="z">(OCoLC)1055367925</subfield><subfield code="z">(OCoLC)1066645785</subfield><subfield code="z">(OCoLC)1181907904</subfield><subfield code="z">(OCoLC)1228565754</subfield></datafield><datafield tag="037" ind1=" " ind2=" "><subfield code="a">297910</subfield><subfield code="b">MIL</subfield></datafield><datafield tag="037" ind1=" " ind2=" "><subfield code="a">22573/ctt9v6s66</subfield><subfield code="b">JSTOR</subfield></datafield><datafield tag="050" ind1=" " ind2="4"><subfield code="a">T57.85</subfield><subfield code="b">.M43 2010eb</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">COM</subfield><subfield code="x">000000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">MAT013000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">MAT003000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="082" ind1="7" ind2=" "><subfield code="a">006.3</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 890</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">MAIN</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Mesbahi, Mehran.</subfield><subfield code="1">https://id.oclc.org/worldcat/entity/E39PCjG87QGmyxwGYPjgWHtvXm</subfield><subfield code="0">http://id.loc.gov/authorities/names/n2010023805</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="260" ind1=" " ind2=" "><subfield code="a">Princeton :</subfield><subfield code="b">Princeton University Press,</subfield><subfield code="c">©2010.</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (xix, 403 pages) :</subfield><subfield code="b">illustrations</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">computer</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">online resource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Princeton series in applied mathematics</subfield></datafield><datafield tag="504" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references and index.</subfield></datafield><datafield tag="505" ind1="0" ind2=" "><subfield code="a">Foundations -- Multiagent networks -- Networks as systems -- Appendix A. -- Bibliography -- Index.</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">"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; Georgia Tech, USA; University of Washington, USA; Ohio University, USA"--EBL book details.</subfield></datafield><datafield tag="520" ind1="8" ind2=" "><subfield code="a">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.</subfield></datafield><datafield tag="588" ind1="0" ind2=" "><subfield code="a">Print version record.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Network analysis (Planning)</subfield><subfield code="x">Graphic methods.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Multiagent systems</subfield><subfield code="x">Mathematical models.</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Analyse de réseau (Planification)</subfield><subfield code="x">Méthodes graphiques.</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Systèmes multiagents (Intelligence artificielle)</subfield><subfield code="x">Modèles mathématiques.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">COMPUTERS</subfield><subfield code="x">General.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">MATHEMATICS</subfield><subfield code="x">Graphic Methods.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Addition.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Adjacency matrix.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Algebraic graph theory.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Algorithm.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Automorphism.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Bipartite graph.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Cardinality.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Cartesian product.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Circulant graph.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Combinatorics.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Complete graph.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Computation.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Connectivity (graph theory).</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Controllability.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Convex combination.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Corollary.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Cycle graph (algebra).</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Cycle space.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Degree (graph theory).</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Degree matrix.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Diagonal matrix.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Diameter.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Differentiable function.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Dimension.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Directed graph.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Division by zero.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Dynamical system.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Eigenvalues and eigenvectors.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Equilibrium point.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Estimation.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Estimator.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Existential quantification.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Extremal graph theory.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Graph (discrete mathematics).</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Graph theory.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Identity matrix.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Incidence matrix.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Information exchange.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Initial condition.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Interconnection.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Iteration.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Kalman filter.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Kronecker product.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">LTI system theory.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">LaSalle's invariance principle.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Laplacian matrix.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Least squares.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Line graph.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Linear map.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Lipschitz continuity.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Lyapunov function.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Lyapunov stability.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Markov chain.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Mathematical optimization.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Matrix exponential.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Measurement.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Multi-agent system.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Nash equilibrium.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Natural number.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Network topology.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Nonnegative matrix.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Notation.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Observability.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Optimal control.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Optimization problem.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Pairwise.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Parameter.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Path graph.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Permutation matrix.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Permutation.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Positive semidefinite.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Positive-definite matrix.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Probability.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Quantity.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Random graph.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Random variable.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Rate of convergence.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Requirement.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Result.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Robotics.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Scientific notation.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Sensor.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Sign (mathematics).</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Simplicial complex.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Special case.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Spectral graph theory.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Stochastic matrix.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Strongly connected component.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Subset.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Summation.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Supergraph.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Symmetric matrix.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Systems theory.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Theorem.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Theory.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Unit interval.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Upper and lower bounds.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Variable (mathematics).</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Vector space.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Without loss of generality.</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Egerstedt, Magnus.</subfield><subfield code="1">https://id.oclc.org/worldcat/entity/E39PBJjMx6F6DcgXY8f4PfBHG3</subfield><subfield code="0">http://id.loc.gov/authorities/names/nb2008008634</subfield></datafield><datafield tag="758" ind1=" " ind2=" "><subfield code="i">has work:</subfield><subfield code="a">Graph theoretic methods in multiagent networks (Text)</subfield><subfield code="1">https://id.oclc.org/worldcat/entity/E39PCGMfRyRvJQHWyhM3gKC38K</subfield><subfield code="4">https://id.oclc.org/worldcat/ontology/hasWork</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Print version:</subfield><subfield code="a">Mesbahi, Mehran.</subfield><subfield code="t">Graph theoretic methods in multiagent networks.</subfield><subfield code="d">Princeton : Princeton University Press, ©2010</subfield><subfield code="z">9780691140612</subfield><subfield code="w">(DLC) 2010012844</subfield><subfield code="w">(OCoLC)466341412</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Princeton series in applied mathematics.</subfield><subfield code="0">http://id.loc.gov/authorities/names/no2002046464</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="l">FWS01</subfield><subfield code="p">ZDB-4-EBA</subfield><subfield code="q">FWS_PDA_EBA</subfield><subfield code="u">https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=816475</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">hoopla Digital</subfield><subfield code="b">HOPL</subfield><subfield code="n">MWT16341735</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">Askews and Holts Library Services</subfield><subfield code="b">ASKH</subfield><subfield code="n">AH26387726</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">Coutts Information Services</subfield><subfield code="b">COUT</subfield><subfield code="n">17276252</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">EBL - Ebook Library</subfield><subfield code="b">EBLB</subfield><subfield code="n">EBL548754</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">EBSCOhost</subfield><subfield code="b">EBSC</subfield><subfield code="n">816475</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">ProQuest MyiLibrary Digital eBook Collection</subfield><subfield code="b">IDEB</subfield><subfield code="n">297910</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">YBP Library Services</subfield><subfield code="b">YANK</subfield><subfield code="n">3620372</subfield></datafield><datafield tag="994" ind1=" " ind2=" "><subfield code="a">92</subfield><subfield code="b">GEBAY</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-4-EBA</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-863</subfield></datafield></record></collection> |
| id | ZDB-4-EBA-ocn701703574 |
| illustrated | Illustrated |
| indexdate | 2024-11-27T13:17:41Z |
| institution | BVB |
| isbn | 9781400835355 1400835356 |
| language | English |
| lccn | 2010012844 |
| oclc_num | 701703574 |
| open_access_boolean | |
| owner | MAIN DE-863 DE-BY-FWS |
| owner_facet | MAIN DE-863 DE-BY-FWS |
| physical | 1 online resource (xix, 403 pages) : illustrations |
| psigel | ZDB-4-EBA |
| publishDate | 2010 |
| publishDateSearch | 2010 |
| publishDateSort | 2010 |
| publisher | Princeton University Press, |
| record_format | marc |
| series | Princeton series in applied mathematics. |
| series2 | Princeton series in applied mathematics |
| spelling | Mesbahi, Mehran. https://id.oclc.org/worldcat/entity/E39PCjG87QGmyxwGYPjgWHtvXm http://id.loc.gov/authorities/names/n2010023805 Graph theoretic methods in multiagent networks / Mehran Mesbahi and Magnus Egerstedt. Princeton : Princeton University Press, ©2010. 1 online resource (xix, 403 pages) : illustrations text txt rdacontent computer c rdamedia online resource cr rdacarrier Princeton series in applied mathematics Includes bibliographical references and index. Foundations -- Multiagent networks -- Networks as systems -- Appendix A. -- Bibliography -- Index. "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; Georgia Tech, USA; University of Washington, USA; Ohio University, USA"--EBL book details. 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. Print version record. Network analysis (Planning) Graphic methods. Multiagent systems Mathematical models. Analyse de réseau (Planification) Méthodes graphiques. Systèmes multiagents (Intelligence artificielle) Modèles mathématiques. COMPUTERS General. bisacsh MATHEMATICS Graphic Methods. bisacsh Addition. Adjacency matrix. Algebraic graph theory. Algorithm. Automorphism. Bipartite graph. Cardinality. Cartesian product. Circulant graph. Combinatorics. Complete graph. Computation. Connectivity (graph theory). Controllability. Convex combination. Corollary. Cycle graph (algebra). Cycle space. Degree (graph theory). Degree matrix. Diagonal matrix. Diameter. Differentiable function. Dimension. Directed graph. Division by zero. Dynamical system. Eigenvalues and eigenvectors. Equilibrium point. Estimation. Estimator. Existential quantification. Extremal graph theory. Graph (discrete mathematics). Graph theory. Identity matrix. Incidence matrix. Information exchange. Initial condition. Interconnection. Iteration. Kalman filter. Kronecker product. LTI system theory. LaSalle's invariance principle. Laplacian matrix. Least squares. Line graph. Linear map. Lipschitz continuity. Lyapunov function. Lyapunov stability. Markov chain. Mathematical optimization. Matrix exponential. Measurement. Multi-agent system. Nash equilibrium. Natural number. Network topology. Nonnegative matrix. Notation. Observability. Optimal control. Optimization problem. Pairwise. Parameter. Path graph. Permutation matrix. Permutation. Positive semidefinite. Positive-definite matrix. Probability. Quantity. Random graph. Random variable. Rate of convergence. Requirement. Result. Robotics. Scientific notation. Sensor. Sign (mathematics). Simplicial complex. Special case. Spectral graph theory. Stochastic matrix. Strongly connected component. Subset. Summation. Supergraph. Symmetric matrix. Systems theory. Theorem. Theory. Unit interval. Upper and lower bounds. Variable (mathematics). Vector space. Without loss of generality. Egerstedt, Magnus. https://id.oclc.org/worldcat/entity/E39PBJjMx6F6DcgXY8f4PfBHG3 http://id.loc.gov/authorities/names/nb2008008634 has work: Graph theoretic methods in multiagent networks (Text) https://id.oclc.org/worldcat/entity/E39PCGMfRyRvJQHWyhM3gKC38K https://id.oclc.org/worldcat/ontology/hasWork Print version: Mesbahi, Mehran. Graph theoretic methods in multiagent networks. Princeton : Princeton University Press, ©2010 9780691140612 (DLC) 2010012844 (OCoLC)466341412 Princeton series in applied mathematics. http://id.loc.gov/authorities/names/no2002046464 FWS01 ZDB-4-EBA FWS_PDA_EBA https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=816475 Volltext |
| spellingShingle | Mesbahi, Mehran Graph theoretic methods in multiagent networks / Princeton series in applied mathematics. Foundations -- Multiagent networks -- Networks as systems -- Appendix A. -- Bibliography -- Index. Network analysis (Planning) Graphic methods. Multiagent systems Mathematical models. Analyse de réseau (Planification) Méthodes graphiques. Systèmes multiagents (Intelligence artificielle) Modèles mathématiques. COMPUTERS General. bisacsh MATHEMATICS Graphic Methods. bisacsh |
| 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 | Network analysis (Planning) Graphic methods. Multiagent systems Mathematical models. Analyse de réseau (Planification) Méthodes graphiques. Systèmes multiagents (Intelligence artificielle) Modèles mathématiques. COMPUTERS General. bisacsh MATHEMATICS Graphic Methods. bisacsh |
| topic_facet | Network analysis (Planning) Graphic methods. Multiagent systems Mathematical models. Analyse de réseau (Planification) Méthodes graphiques. Systèmes multiagents (Intelligence artificielle) Modèles mathématiques. COMPUTERS General. MATHEMATICS Graphic Methods. |
| url | https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=816475 |
| work_keys_str_mv | AT mesbahimehran graphtheoreticmethodsinmultiagentnetworks AT egerstedtmagnus graphtheoreticmethodsinmultiagentnetworks |